Binomial upper-tail reflection
Provedbinomial_tail_reflectBinomial upper-tail reflection (). For and any real ,
Substituting (with ) turns the high tail of into the low tail of . 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).