The converse binomial inequality for alpha>2
Let , , and . Converse binomial inequality. One has
This is proposed as an appropriate inequality comparing the generalized binomial sum with in the range , where the preceding lower bound without the factor is stated not to hold. The source leaves this statement for future research and provides no resolution.
References
- Stefan Gerhold and Thomas Simon, “A converse to the neo-classical inequality with an application to the Mittag-Leffler function”, arXiv:2111.02747 (2021).
Progress summary
A reader-submitted argument claims to prove the conjecture, but no independent assessment has confirmed it.
Gerhold and Simon proposed this inequality as Conjecture 3.2 for , after noting that the analogous lower bound without the factor appears to fail. Their paper leaves the conjecture open.
Known results
Gerhold and Simon (2023) proved the opposite-direction inequality for . They also observed that the proposed coefficient is sharp when .
Community submission (unverified), October 28, 2026
A submitted proof argues that log-convexity of a finite sum of Gamma-quotients proves the conjecture, a biased refinement, and optimality of the coefficient. This claim has not received independent mathematical assessment.
Current status (as of October 2026): The conjecture remains unverified; a reader-submitted proof claims progress, while the published literature still records it as open.
Sources
Solutions 1
We prove the converse fractional-binomial inequality posed by Gerhold and Simon as Conjecture 3.2, together with a biased refinement and optimality of the coefficient. Log-convexity of a finite sum of scaled Gamma quotients and its values at parameters one and two give the comparison. The Gamma-convexity ingredient is classical and explicitly credited. The Lean certificate covers the precise source statement, refinement and sharpness.See full solution
AI-assisted preprint by Myeongjin Kang, with no affiliation. Internal AI review is not external journal peer review. The accompanying Lean certificate covers the precise scoped main statement; inspect the formal endpoint, assumptions and provenance in the supporting package. Prior-art investigations are documented bounded searches, not worldwide-priority certification. Original prose is offered under CC BY 4.0 and original code/Lean under MIT; third-party rights and existing notices are preserved. The public supporting ZIP contains original proof sources and verification evidence, with bibliographic links and hashes instead of redistributed third-party source manuscripts.
Recorded prior-art/source-access limits: No prior full sharp finite-sum resolution located. Alzer full article inaccessible; exact classical summand theorem and corollary types checked in two accessible primary successors. Absolute worldwide priority not certified.
Full paper: A sharp converse fractional-binomial inequality through log-convexity.
Lean proof sources and pinned verification evidence: Zenodo supporting package. MathDB has not automatically verified the attached Lean certificate.