Exponential peeling, Airy convolution and compactness
The one-sided curvature v is strictly positive and satisfies v(x) ≥ 4x. Factorization gives κ(x) = v(x)+v(−x) > 4|x|. Continuity controls the remaining compact interval, yielding a uniform positive lower bound.
The proof does not report an optimal numerical constant. Authors’ checks and a manuscript argument are separate from proof-assistant execution.
Proved:Strong log-concavity proved in the selected preprint ↗ · source dated Jul 21, 2026 · observed Oct 14, 2026. Standard two-sided Brownian motion with unit quadratic drift; no explicit optimal uniform constant is asserted.
Independent mathematical assessment of this argument remains separate from the statement’s attributed status.
For the standard Chernoff density f, κ(x)=−(logf)′′(x) satisfies κ(x)≥κ(0) for every real x.
Two-sided standard Brownian motion and quadratic drift t².
The proposed optimal constant is the curvature at the origin; κ(0) ≈ 3.4052 is a numerical value reported in the 2014 source.
Scope: This is stronger than inf κ > 0. The selected 2026 theorem does not prove that the origin minimizes curvature, and this curation does not assert a comprehensive current-status assessment.
The Chernoff density factors as f(x) = C_f g(x)g(−x), where the normalized one-sided factor has reciprocal-Airy bilateral Laplace transform. The curvature is v(x)+v(−x).
paraphrase · Linked proof prose is not republished. Any copied graph data is CC0, as specified by its archive.
Xianyang Zhang · Quan Zhou · Preprint · Publication date Jul 21, 2026
Source-reported results and external checks are separate from independent OpenMath assessment.
Revision & attribution
Source revision: v1. Observed Oct 14, 2026.
The authors attribute the proof to GPT-5.6 Sol, describe an initial algebraic failure and later corrected approaches, and report carefully checking the argument and revising the exposition.
The sharper original conjecture requires κ(x) ≥ κ(0) for every x. Its reported numerical value κ(0) ≈ 3.4052 is not established as a uniform lower bound by the selected 2026 theorem.
paraphrase · Linked proof prose is not republished. Any copied graph data is CC0, as specified by its archive.
Fadoua Balabdaoui · Jon A. Wellner · Published · Publication date Feb 5, 2014
Source-reported results and external checks are separate from independent OpenMath assessment.
Revision & attribution
Source revision: v2. Observed Oct 14, 2026.
No AI contribution is reported in this selected source.
History
Statement versions
Statement versions and problem publication versions are separate. A new publication can update context or sources while retaining the same statement.
Assessment history · 1
Assessments retained in these publication records. Earlier statement versions retain their own source histories.