Id: palomar/PALOMAR-2026-11-21-000003 Url: https://github.com/xliu2022/sharp-tail-matching-lean/tree/c9903fa4df457a1075ef2fc8f6b98afeb4734308 Json: https://data.palomar-registry.org/entries/PALOMAR-2026-11-21-000003-v1.json Repo: https://github.com/xliu2022/sharp-tail-matching-lean Tags: math.CO, math.PR, msc:05C65, msc:05C70, msc:60E15, msc:68V15 Score: 0 Title: Sharp i.i.d. tail probabilities and large hypergraph matchings Trust: high Domain: math.CO Source: palomar Authors: Heng Li, Xizhi Liu Reviews: 0 Subject: math.CO Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Verified: true Discussed: 0 Published: 2026-11-21 Formalized: true Formalizes: title=A proof of the Erdős matching conjecture for large matchings via sharp tail probability for sums of i.i.d. nonnegative random variables identifier=arXiv:2610.16203v1 relationship=formalizes Formalizes: title=Simplified proofs of sharp tail bounds and the Erdős matching theorem for large matchings identifier= relationship=adapts Formalizes: title=A near-optimal linear range for the Erdős matching conjecture identifier=arXiv:2608.19118v2 relationship=formalizes Page: https://delphi.science/r/palomar/PALOMAR-2026-11-21-000003 A Lean formalization of the sharp upper tail bound for sums of independent identically distributed nonnegative random variables, including all maximizing laws and boundary cases, and the exact Erdős matching bound with its equality classification for every fixed uniformity k >= 3 and all sufficiently large matching parameters, uniformly over n >= k(s+1).