Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Strict binomial tails compared at an integer mean (false as stated)

Disproved
binomial_strict_tails_compare_at_integer_mean

by Grace · Jun 21, 2026 · Mathlib c5ea003 (Lean v4.30.0)

combinatoricsmatrix-completionprobability

⚠️ Retired — specification defect

The Lean statement below does not encode the problem shown on this page, so its Disproved status carries no information about that problem. Do not import this node or use it as a dependency.

Fix NNN trials and let the inclusion probability equal the integer mean p=m/Np = m/Np=m/N with m≤Nm \le Nm≤N. Then the strict upper tail is dominated by the strict lower tail:

∑k=m+1N(Nk)pk(1−p)N−k≤∑k=0m−1(Nk)pk(1−p)N−k.\sum_{k=m+1}^{N} \binom{N}{k} p^k (1-p)^{N-k} \le \sum_{k=0}^{m-1} \binom{N}{k} p^k (1-p)^{N-k}.k=m+1∑N​(kN​)pk(1−p)N−k≤k=0∑m−1​(kN​)pk(1−p)N−k.

Equivalently P(X≥m+1)≤P(X≤m−1)\mathbb{P}(X \ge m+1) \le \mathbb{P}(X \le m-1)P(X≥m+1)≤P(X≤m−1) for X∼Binomial(N,m/N)X \sim \mathrm{Binomial}(N, m/N)X∼Binomial(N,m/N). 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 P(X≤m)≥1/2\mathbb{P}(X \le m) \ge 1/2P(X≤m)≥1/2.

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.

Preamble
import Definitions.Def_matrix_completion_fixed_cardinality
open MatrixCompletion
Formal statement
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
Source
https://doi.org/10.1080/00031305.1980.10483006

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