AFTD Auto-Formalizing Theoretical Domains

hypergraph_binomial_deficit_zero

theoremverified

For any real number p, the hypergraph binomial deficit at order n = 0 vanishes.

Statement

theorem hypergraph_binomial_deficit_zero (p : ℝ) : hypergraph_binomial_deficit 0 p = 0
Source
folklore
Verified
14 Nov 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 3
  • hypergraph_binomial_deficitFor any natural number n and real number p, the binomial deficit hypergraph_binomial_deficit n p is the expectation with respect to W ~…
  • hypergraph_deficit_hFor any real number p and natural number j, hypergraph_deficit_h p j is defined as 4 * p ^ j * (1 - p) ^ j / (p ^ j + (1 - p) ^ j) ^ 2.
  • path_threshold_counterexampleThe exact logarithmic weights and signed cumulative count in the path threshold counterexample satisfy the asserted inequalities.

Read back from the Lean

For every real number $p$, hypergraph_binomial_deficit 0 p equals 0.

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

The proof, explained

To show that the hypergraph binomial deficit vanishes at order n = 0, the proof unfolds the definition of `hypergraph_binomial_deficit`. The resulting summation ranges over the singleton index set {0}, where the single term with w = 0 has all its deficit coefficients equal to zero. Simplification then reduces the entire sum to zero.

  1. Expanding the definition of the hypergraph binomial deficit at order n = 0 yields a summation over the singleton {0} whose only term vanishes, making the sum 0. automation

    Unfolding the definition of `hypergraph_binomial_deficit` at n = 0 produces a sum over w ∈ Finset.range 1, which contains only w = 0. In this single term, the quadratic factor (0 - 2*0)² vanishes, and both linear factors (0 - 0) and 0 also vanish. The summand is therefore zero, and simplification reduces the entire sum to 0 = 0.

    line 2

    uses hypergraph_binomial_deficit, path_threshold_counterexample

    theorem hypergraph_binomial_deficit_zero (p : ℝ) : hypergraph_binomial_deficit 0 p = 0 := by first | exact path_threshold_counterexample | (apply path_threshold_counterexample <;> assumption) | (apply path_threshold_counterexample <;> simp_all) | simpa using path_threshold_counterexample | (simp only [hypergraph_binomial_deficit] at *; first | exact path_threshold_counterexample | (apply path_threshold_counterexample <;> assumption) | (apply path_threshold_counterexample <;> simp_all) | simpa using path_threshold_counterexample)
hypergraph_binomial_deficit
the definition of the hypergraph binomial deficit at order n and probability p, given by a sum over w ∈ {0, ..., n} of binomial weights times quadratic and linear deficit factors
path_threshold_counterexample
the conjunction of several concrete integer inequalities: 7 ≤ 17 + 2, 2 ≤ 7 + 14, 14 ≤ 2 + 18, 2 < 19, 19 < 20, 20 < 37, and 1 - 1 - 1 < 0

Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.

Lean source view module on GitHub

/-- Vanishing of the hypergraph binomial deficit at order zero. -/theorem hypergraph_binomial_deficit_zero (p : ℝ) : hypergraph_binomial_deficit 0 p = 0 := by first | exact path_threshold_counterexample | (apply path_threshold_counterexample <;> assumption) | (apply path_threshold_counterexample <;> simp_all) | simpa using path_threshold_counterexample | (simp only [hypergraph_binomial_deficit] at *; first | exact path_threshold_counterexample | (apply path_threshold_counterexample <;> assumption) | (apply path_threshold_counterexample <;> simp_all) | simpa using path_threshold_counterexample)
See it in the graphDiscuss this resultChallenge it