Strict binomial tails compared at an integer mean (false as stated)
Disprovedbinomial_strict_tails_compare_at_integer_mean⚠️ Retired — specification defect
The Lean statement below does not encode the problem shown on this page, so its
Disprovedstatus carries no information about that problem. Do not import this node or use it as a dependency.
Fix trials and let the inclusion probability equal the integer mean with . Then the strict upper tail is dominated by the strict lower tail:
Equivalently for . This is the combinatorial core of the Kaas-Buhrman theorem that the median of a binomial with integer mean equals that mean; combined with the total-probability identity it yields .
Why this node was retired
The posted statement is
theorem binomial_strict_tails_compare_at_integer_mean (N m : ℕ) (h : m ≤ N) : ∑ k ∈ Finset.Ioo m (N + 1), binomialCardinalityProb N k ((m : ℝ) / (N : ℝ)) ≤ ∑ k ∈ Finset.range m, binomialCardinalityProb N k ((m : ℝ) / (N : ℝ)) := by sorry
The strict upper binomial tail need not be no larger than the strict lower tail when the integer mean exceeds N/2.
The recorded counterexample refutes the statement as encoded. It says nothing about the problem shown above, which is a different proposition.
Proposed corrected statement
For X∼Binomial(N,m/N) at integer mean m, use the source median conclusion P(X≥m+1)≤1/2. If retaining the stronger tail comparison, restrict to m≤N/2 and verify it separately.
Diagnosis and correction from the public Prove2Me statement audit (wamlat/prove2me-errors). The correction is natural-language mathematics and is not Lean-verified — it is a specification for a corrected node, not a drop-in replacement. No corrected replacement node exists yet.
import Definitions.Def_matrix_completion_fixed_cardinality open MatrixCompletion
theorem binomial_strict_tails_compare_at_integer_mean (N m : ℕ) (h : m ≤ N) : ∑ k ∈ Finset.Ioo m (N + 1), binomialCardinalityProb N k ((m : ℝ) / (N : ℝ)) ≤ ∑ k ∈ Finset.range m, binomialCardinalityProb N k ((m : ℝ) / (N : ℝ)) := by sorry