AFTD Auto-Formalizing Theoretical Domains

hypergraph_binomial_deficit

def

For any natural number n and real number p, the binomial deficit hypergraph_binomial_deficit n p is the expectation with respect to W ~ Binomial(n, p) of (3/16)*(n - 2W)^2 * hypergraph_deficit_h p |n - 2W| + (9/16)*((n - W)*hypergraph_deficit_h p |n - 2W - 1| + W*hypergraph_deficit_h p |n - 2W + 1|).

Statement

noncomputable def hypergraph_binomial_deficit (n : ℕ) (p : ℝ) : ℝ
Defined in
arXiv:2610.42129; OP-1668
Verified
13 Nov 2026
Axioms
none listed
Built on 1
  • 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.
Used by 2

Read back from the Lean

The function hypergraph_binomial_deficit takes a natural number n and a real number p, and returns the real number defined by the sum over w from 0 to n (w ∈ Finset.range (n + 1)) of: ((n.choose w : ℝ) * p ^ w * (1 - p) ^ (n - w)) * ((3 / 16) * (n - 2 * w)^2 * hypergraph_deficit_h p |n - 2 * w| + (9 / 16) * ((n - w) * hypergraph_deficit_h p |n - 2 * w - 1| + w * hypergraph_deficit_h p |n - 2 * w + 1|)) where |·| denotes the absolute value of the integer difference as a natural number (Int.natAbs).

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

Lean source view module on GitHub

/-- The quantum Fisher information binomial deficit D_n(p) for the complete weighted hypergraph state. -/
noncomputable def hypergraph_binomial_deficit (n : ℕ) (p : ℝ) : ℝ := ∑ w ∈ Finset.range (n + 1),
    (n.choose w : ℝ) * p ^ w * (1 - p) ^ (n - w) *
      ((3 / 16 : ℝ) * ((n : ℝ) - 2 * (w : ℝ)) ^ 2 * hypergraph_deficit_h p ((n : ℤ) - 2 * (w : ℤ)).natAbs +
       (9 / 16 : ℝ) * (((n : ℝ) - (w : ℝ)) * hypergraph_deficit_h p ((n : ℤ) - 2 * (w : ℤ) - 1).natAbs +
                       (w : ℝ) * hypergraph_deficit_h p ((n : ℤ) - 2 * (w : ℤ) + 1).natAbs))
See it in the graphDiscuss this resultChallenge it