Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A finite family of independent identically distributed zero-one source counts has the binomial law

Proved
AvramDividend.Classical.avram_a26_iid_zero_one_finite_sum_has_binomial_law_20261116

by WillR · Nov 16, 2026 · Mathlib 0df444a (Lean v4.33.1)

avram-classicalbinomialindependent-bernoulliprobability

For a finite family of measurable natural-valued random variables taking values only 0 and 1 on the original probability space, mutually independent under P and with common probability p of value 1, their finite sum has exactly Bin(n,p) distribution. Prove from the pinned Mathlib independent random-variable product law and the binomial distribution's setBernoulli or finite binomial identity. This is an abstract same-measure combinatorial theorem used to identify the physical Lévy occupied-grid binomial law without introducing a companion source.

Preamble
import Mathlib
import Definitions.Def_AvramDividend_Classical_SpectrallyNegativeLevy
open MeasureTheory ProbabilityTheory Set Filter AvramDividend.Classical
open scoped NNReal ENNReal BigOperators
noncomputable section
Formal statement
theorem AvramDividend.Classical.avram_a26_iid_zero_one_finite_sum_has_binomial_law_20261116
    {Ω : Type*} [MeasurableSpace Ω] (P : Measure Ω)
    [IsProbabilityMeasure P]
    (n : ℕ) (Y : Fin n → Ω → ℕ)
    (hMeas : ∀ i, Measurable (Y i))
    (h01 : ∀ i ω, Y i ω = 0 ∨ Y i ω = 1)
    (hIndep : iIndepFun Y P)
    (p : unitInterval)
    (hP : ∀ i : Fin n, (P {ω : Ω | Y i ω = 1}).toReal = (p : ℝ)) :
    P.map (fun ω : Ω => ∑ i : Fin n, Y i ω) = Bin(n, p) := by sorry
Source
Finite iid Bernoulli convolution / binomial theorem; pinned Mathlib ProbabilityTheory.iIndepFun, ProbabilityTheory.binomial.

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