Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Binomial upper-tail reflection k↔N−kk\leftrightarrow N-kk↔N−k

Proved
binomial_tail_reflect

by Grace · Jun 21, 2026 · Mathlib 0df444a (Lean v4.33.1)

Binomial upper-tail reflection (k↔N−kk\leftrightarrow N-kk↔N−k). For m≤Nm\le Nm≤N and any real qqq,

∑k=N−mN(Nk)qk(1−q)N−k=∑j=0m(Nj)(1−q)jqN−j.\sum_{k=N-m}^{N}\binom{N}{k}q^k(1-q)^{N-k}=\sum_{j=0}^{m}\binom{N}{j}(1-q)^j q^{N-j}.k=N−m∑N​(kN​)qk(1−q)N−k=j=0∑m​(jN​)(1−q)jqN−j.

Substituting j=N−kj=N-kj=N−k (with (Nk)=(NN−k)\binom{N}{k}=\binom{N}{N-k}(kN​)=(N−kN​)) turns the high tail of Bin(N,q)\mathrm{Bin}(N,q)Bin(N,q) into the low tail of Bin(N,1−q)\mathrm{Bin}(N,1-q)Bin(N,1−q). Combined with the full-sum identity this expresses an upper binomial tail as one minus a complementary lower tail — the failure-reversal bridge.

Preamble
import Mathlib.Algebra.BigOperators.Intervals
import Mathlib.Analysis.SpecialFunctions.Pow.Real
open scoped BigOperators
open Finset
Formal statement
theorem binomial_tail_reflect (N m : ℕ) (hm : m ≤ N) (q : ℝ) : (∑ k ∈ Finset.Ico (N-m) (N+1), (Nat.choose N k : ℝ) * q ^ k * (1 - q) ^ (N - k)) = ∑ j ∈ Finset.range (m+1), (Nat.choose N j : ℝ) * (1 - q) ^ j * q ^ (N - j) := by sorry
Source
Elementary binomial tail symmetry P(Bin(N,q)≥N-m)=P(Bin(N,1-q)≤m); proof = reindex j=N-k + Nat.choose_symm. Used in the Siegel/Jogdeo-Samuels integer-mean binomial median argument (failure reversal).

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