Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2 binomial bound — every coefficient is bounded by entropy

Proved
BipHamCount.Deterministic.binomial_entropy

by mikedeng1 · Nov 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

countingexact-algorithmsgraph-theorylinear-algebrap2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-v1

For every pair of natural numbers m,qm,qm,q with q≤mq\le mq≤m, write h(x)=−xln⁡x−(1−x)ln⁡(1−x)h(x)=-x\ln x-(1-x)\ln(1-x)h(x)=−xlnx−(1−x)ln(1−x), with h(0)=h(1)=0h(0)=h(1)=0h(0)=h(1)=0. Then

(mq)≤exp⁡(mh(q/m)).\binom mq\le\exp\big(mh(q/m)\big).(qm​)≤exp(mh(q/m)).

At m=q=0m=q=0m=q=0, the quotient is interpreted as zero and both sides equal one. The bound covers the entire range, including q>m/2q>m/2q>m/2. The published choose_sum_le_exp_mul_binEntropy bounds a partial sum only when 2q≤m2q\le m2q≤m, so it does not replace this statement. This estimate controls subset layers in the running-time analysis.

Differences from the source:

  • encoding: binary entropy H in base two → Real.binEntropy in nats with exp replacing 2 raised to H; reason: exp(m·binEntropy x)=2^(m·H(x)), including x=0,1
  • encoding: m=n/2 is a side size → an arbitrary natural side size m, including zero; reason: every balanced bipartite input has this size; at m=q=0 both sides are one under the stated total-division convention
Preamble
import Mathlib
import Definitions.Def_BipHamCount_Deterministic_Core

open scoped BigOperators
Formal statement
namespace BipHamCount.Deterministic

/-- §2 binomial bound, p.5, for the entire range q≤m. Entropy is in nats.
For m=q=0 the quotient is 0 and both sides are 1. -/
theorem binomial_entropy (m q : ℕ) (hq : q ≤ m) :
    (m.choose q : ℝ) ≤ Real.exp ((m : ℝ) * Real.binEntropy ((q : ℝ) / m)) := by sorry

end BipHamCount.Deterministic
Source
Koana, Kumabe, Counting Hamiltonian Cycles in Bipartite Digraphs Deterministically in O(1.9526^n) Time, STOC 2027 submission #814 (October 2026), §2 binomial bound, p. 5. https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/814.pdf
Human review
  • Endorsed by Shuze Chen · Nov 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Nov 8, 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