Bivariate generating function of binary words marked by ones
ProvedAnalyticCombinatorics.Ch1.ParamClass.bgf_binaryWords_closedanalytic-combinatoricsbivariatelean4symbolic-method
Let be all functions . Write for the number of true entries and use the uniform counting measure on its elements. Define . Then
The parameter variable is polynomial and the size variable is the outer formal-series variable.
Preamble
import Definitions.Def_AnalyticCombinatorics_Ch3_BGF_BinaryWords import Mathlib.Data.Fintype.Powerset import Mathlib.Data.Nat.Choose.Sum import Mathlib.Tactic import Mathlib.Algebra.Polynomial.Coeff import Mathlib.Algebra.Polynomial.Derivative import Mathlib.Algebra.Polynomial.Eval.Defs 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 -- Binary words marked by number of ones The class of binary words of length `n`, with the bivariate parameter counting the number of ones, has BGF `1 / (1 - (1 + u) z)`. -/ open scoped Polynomial open AnalyticCombinatorics AnalyticCombinatorics.Ch1 open PowerSeries Finset
Formal statement
theorem AnalyticCombinatorics.Ch1.ParamClass.bgf_binaryWords_closed :
ParamClass.binaryWords.bgf *
(1 - PowerSeries.C (1 + Polynomial.X : ℚ[X]) *
(PowerSeries.X : ℚ[X]⟦X⟧)) =
1 := by sorrySource
Human review
Confirmed by the mission captain (proposal self-audit).