Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2, p. 3, proof of Theorem 1, displayed chain — the corrected general power inequality

Proved
ToddKK14.Diameter.general_step

by mikedeng1 · Oct 9, 2026 · Mathlib 0df444a (Lean v4.33.1)

diameterhirsch-conjecturep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1real-analysis

Let ddd and nnn be natural numbers with d≥4d\ge 4d≥4, n−d≥8n-d\ge 8n−d≥8 and n≥2dn\ge 2dn≥2d, and let log⁡\loglog be the logarithm to base 2. Then

(d−1)log⁡(n−d)+2⋅(n/2−d)log⁡d+2  ≤  dlog⁡(n−d).(d-1)^{\log(n-d)} + 2\cdot (n/2-d)^{\log d} + 2 \;\le\; d^{\log(n-d)} .(d−1)log(n−d)+2⋅(n/2−d)logd+2≤dlog(n−d).

This is the analytic content of the displayed chain in the general inductive step of the proof of Theorem 1, from its second line to its last. In the proof, the first line of the chain is Lemma 1, Δ(d,n)≤Δ(d−1,n−1)+2Δ(d,⌊n/2⌋)+2\Delta(d,n)\le\Delta(d-1,n-1)+2\Delta(d,\lfloor n/2\rfloor)+2Δ(d,n)≤Δ(d−1,n−1)+2Δ(d,⌊n/2⌋)+2, and the passage to the second line inserts the induction hypotheses Δ(d−1,n−1)≤(d−1)log⁡(n−d)\Delta(d-1,n-1)\le (d-1)^{\log(n-d)}Δ(d−1,n−1)≤(d−1)log(n−d) and Δ(d,⌊n/2⌋)≤(⌊n/2⌋−d)log⁡d\Delta(d,\lfloor n/2\rfloor)\le (\lfloor n/2\rfloor-d)^{\log d}Δ(d,⌊n/2⌋)≤(⌊n/2⌋−d)logd; those steps belong to the proof of the goal theorem, not to this statement.

Formalization Note Powers are real powers and logarithms are Real.logb 2; n/2n/2n/2 is real division. The hypothesis n≥2dn\ge 2dn≥2d is a disclosed addition: in the paper it holds because the case n<2dn<2dn<2d was dispatched earlier, and it is needed for Lemma 1 (d≤⌊n/2⌋d\le\lfloor n/2\rfloord≤⌊n/2⌋). For n>2dn>2dn>2d, the second power equals the paper's dlog⁡(n/2−d)d^{\log(n/2-d)}dlog(n/2−d) by the log-swap identity. At n=2dn=2dn=2d, the printed logarithm is undefined; (n/2−d)log⁡d=0(n/2-d)^{\log d}=0(n/2−d)logd=0 states the zero contribution from Δ(d,d)=0\Delta(d,d)=0Δ(d,d)=0 and avoids Lean's junk value dlogb⁡20=1d^{\operatorname{logb}_2 0}=1dlogb2​0=1.

Preamble
import Mathlib
Formal statement
namespace ToddKK14.Diameter

/-- Todd (2014), p. 3, proof of Theorem 1, the displayed chain for `d ≥ 4`, `n − d ≥ 8` (with
`2d ≤ n`, the case `n < 2d` having been dispatched before). The second summand uses
`(n/2-d)^{log d}`, equal to the printed `d^{log(n/2-d)}` when `n > 2d` and equal to zero when
`n = 2d`, where the printed logarithm is undefined. All logarithms are to base 2. -/
theorem general_step (d n : ℕ) (hd : 4 ≤ d) (hnd : d + 8 ≤ n) (h2d : 2 * d ≤ n) :
    ((d : ℝ) - 1) ^ Real.logb 2 ((n : ℝ) - d) + 2 * (((n : ℝ) / 2 - d) ^ Real.logb 2 d) + 2
      ≤ (d : ℝ) ^ Real.logb 2 ((n : ℝ) - d) := by sorry

end ToddKK14.Diameter
Source
Todd, An improved Kalai-Kleitman bound for the diameter of a polyhedron, arXiv:1402.3579v2, p. 3, §2, proof of Theorem 1, displayed chain for the case d ≥ 4, n − d ≥ 8
Human review
  • Endorsed by Shuze Chen · Oct 9, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 9, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me