Variance of the number of ones in binary words
ProvedAnalyticCombinatorics.Ch1.ParamClass.variance_binaryWordsanalytic-combinatoricsbivariatelean4symbolic-method
Let be all functions . Write for the number of true entries and use the uniform counting measure on its elements. For every , including zero,
The identity is in and uses the source variance operation.
Preamble
import Definitions.Def_AnalyticCombinatorics_Ch3_BGF_BinaryWords import Definitions.Def_AnalyticCombinatorics_Ch3_BGF_Variance import Mathlib.Algebra.BigOperators.Ring.Finset import Mathlib.Algebra.Polynomial.Derivative import Mathlib.Data.Fintype.Powerset import Mathlib.Data.Nat.Choose.Sum import Mathlib.Tactic import Mathlib.Algebra.Polynomial.Coeff import Mathlib.Algebra.Polynomial.Eval.Defs import Mathlib.Combinatorics.Enumerative.Composition import Mathlib.Algebra.BigOperators.NatAntidiagonal import Mathlib.RingTheory.PowerSeries.Basic import Mathlib.Data.Fintype.Card set_option autoImplicit true set_option relaxedAutoImplicit false set_option maxSynthPendingDepth 3 /-! # Ch3 -- Mean and variance for ones in binary words For length-`n` binary words, the number of ones has the binomial distribution `Bin(n, 1/2)`. -/ open scoped Polynomial open AnalyticCombinatorics AnalyticCombinatorics.Ch1 open PowerSeries Finset
Formal statement
theorem AnalyticCombinatorics.Ch1.ParamClass.variance_binaryWords {n : ℕ} :
ParamClass.binaryWords.variance n = (n : ℚ) / 4 := by sorrySource
Human review
Confirmed by the mission captain (proposal self-audit).