Berry–Esseen constant ()
Berry–Esseen constant: determine or improve its bounds; the repository records 0.4097321837 (lower) and 0.4690 (0.423*) (upper).
Editorial MSC2020 classification. Original article codes and source evidence are recorded in the literature directory.
Problem statement
Let be i.i.d. real random variables with , , and finite third absolute moment
Let
and let denote the standard normal distribution function.
We define to be the smallest constant such that the classical Berry–Esseen inequality
holds for all such distributions of .
This constant is also called the absolute constant in the Berry–Esseen inequality (for i.i.d. summands).
Lean 4
No Lean statement or proof is attached yet. Have a formalization? Share its source to add it to this problem.
Background
- Zolotarev’s conjecture: It is conjectured that , i.e. the Esseen lower bound is sharp. This is sometimes attributed to Zolotarev (1967). See e.g. [vB1972], [KS2009], [Tyu2009] for discussion.
- How the bound is obtained: Shevtsova [She2013] proves the structural estimate
which in particular implies .
- Verification status of the recent bounds: The bounds and are established in GitHub repositories with Lean 4 formalizations. In both, the finite numerical certificates are checked with
native_decide, so the proofs additionally trust Lean's compiler; neither has been run throughleanprover/comparator, and as of this writing neither appears in a peer-reviewed publication. - Binomial/Bernoulli case: In the special case of i.i.d. Bernoulli summands (equivalently, binomial distributions after normalization), the optimal constant is known to equal ; see [Sch2016] and references therein.
References (from the repository page)
- [E1956] Esseen, Carl-Gustav. A moment inequality with an application to the central limit theorem. Skand. Aktuarietidskr. 39 (1956), 160–170.
- [Lin2026] Lin, Yongxi. Berry–Esseen bounds in Lean. GitHub repository CoolRmal/BerryEsseen (2026); proof document
paper/upper-0423.pdf. Developed with AI assistance. - [KS2009] Korolev, V. Yu.; Shevtsova, I. G. On the upper bound for the absolute constant in the Berry–Esseen inequality. Teor. Veroyatn. Primen. 54 (2009), no. 4, 671–695 (English transl.: Theory Probab. Appl. 54 (2010), no. 4, 638–658).
- [Sch2016] Schulz, Jona. The optimal Berry–Esseen constant in the binomial case. PhD thesis, Universität Trier (2016).
- [She2006] Shevtsova, I. G. A refinement of the upper estimate of the absolute constant in the Berry–Esseen inequality. Teor. Veroyatn. Primen. 51 (2006), no. 3, 622–626 (English transl.: Theory Probab. Appl. 51 (2007), 549–553).
- [She2011] Shevtsova, Irina. On the absolute constants in the Berry–Esseen type inequalities for identically distributed summands. arXiv:1111.6554 (2011).
- [She2013] Shevtsova, I. G. On the absolute constants in the Berry–Esseen inequality and its structural and nonuniform improvements. Inform. Primen. 7 (2013), no. 1, 124–125.
- [Shi1986] Shiganov, I. S. Refinement of the upper bound of the constant in the central limit theorem. J. Soviet Math. 35 (1986), 2545–2550.
- [Tyu2009] Tyurin, I. S. New estimates of the convergence rate in the Lyapunov theorem. arXiv:0912.0726 (2009).
- [vB1972] van Beek, Paul. An application of Fourier methods to the problem of sharpening the Berry–Esseen inequality. Z. Wahrscheinlichkeitstheorie verw. Geb. 23 (1972), 187–196.
- [XL2026] Xiao, Haonan; Li, Chunlin. A 0.4395 upper bound for the i.i.d. Berry–Esseen constant. GitHub repository haonan-xiao/iid-berry-esseen (2026).
- [Z1967] Zolotarev, V. M. A sharpening of the inequality of Berry–Esseen. Z. Wahrscheinlichkeitstheorie verw. Geb. 8 (1967), 332–342.
Acknowledgements
Prepared with ChatGPT 5.2 Pro.
Progress & source assessment
Repository table (commit 2c1968c, 26 September 2026): best known lower bound 0.4097321837; best known upper bound 0.4690 (0.423*). Values marked with an asterisk have minimal verification.
Known upper bounds
| Bound | Reference | Comments |
|---|---|---|
| [Z1967] | Zolotarev-type smoothing inequalities; [Z1967] also gives for the general (non-i.i.d.) case. | |
| [vB1972] | Fourier-analytic refinement. | |
| [Shi1986] | ||
| [She2006] | ||
| [KS2009] | From the structural bound . | |
| [Tyu2009] | ||
| [She2011] | ||
| [She2013] | ||
| [XL2026] | Unverified. GitHub repository with a Lean 4 formalization; its finite certificates are checked with native_decide. Uses the shared moment ratio and to sharpen the characteristic-function bounds in Prawitz smoothing. |
|
| [Lin2026] | Unverified. GitHub repository with a Lean 4 formalization (berryEsseenConstant ≤ 0.423); its finite certificates are checked with native_decide. Builds on the analytic framework of [XL2026]; does not use [She2013]. |
Known lower bounds
| Bound | Reference | Comments |
|---|---|---|
| [E1956] | Esseen’s lower bound; achieved asymptotically by (centered/normalized) Bernoulli sums. |
- [1]Davis, Damek; Ivanisvili, Paata; Tao, Terence (maintainers). Optimization Constants in Mathematics, github.com/teorth/optimizationproblems (commit 2c1968c, 26 September 2026). — Berry–Esseen constant ($C_{19}$) linkApache-2.0 (repository license); constant pages reproduced with attribution; repository references retained.
Recorded progress
Add yours →Nothing recorded yet. A pointer to a paper the entry is missing counts.
Machine attempts
0 recordedAttempts run against the statement below and are recorded in full, including the failures. The point is to stop the next model — and the next person — from re-walking a road that is already known to end. Each attempt costs 25 credits.
No machine attempts recorded.
Sign in to run an attempt. New accounts start with enough credits for ten.
Discussion
0 notesNotes are for clarifying the statement, flagging a missing reference, or recording why an approach fails. Claimed solutions belong in a submission, where they can be reviewed.
No notes yet.
Sign in to add a note.