Finite J-fraction coefficients stabilize above their degree
ProvedAnalyticCombinatorics.Ch5.ContinuedFractions.coeff_JFraction_height_indepanalytic-combinatoricscf-stabilitylean4symbolic-method
Let be any commutative ring and let be arbitrary weights. Write , and similarly for . Define finite formal J-fractions by and , where reciprocals are formal inverses of series with constant term one. For with ,
There are no positivity assumptions on the weights. This is coefficientwise stability of finite-height series; it neither defines an infinite continued fraction nor asserts analytic convergence.
Preamble
import Definitions.Def_AnalyticCombinatorics_Ch5_ContinuedFractions_Flajolet import Mathlib namespace AnalyticCombinatorics.Ch5.ContinuedFractions.PathSum end AnalyticCombinatorics.Ch5.ContinuedFractions.PathSum set_option autoImplicit true set_option relaxedAutoImplicit false set_option maxSynthPendingDepth 3 /-! # Ch5 §V — Flajolet's continued fraction theorem: removing the height bound `Flajolet.lean` / `FlajoletPathSum.lean` prove the **bounded-height** form `flajolet_cf` / `coeff_JFraction_eq_pathSum`: for every height bound `h`, the height-`h` J-fraction's coefficients are the height-`h` Motzkin path sums. The bound is immaterial for the coefficient of `z^n`: a Motzkin path of length `n` (which returns to level 0) can never reach relative height above `n`, so the length-`n` coefficient stabilizes once `h ≥ n`. This file proves that stabilization, lifting the theorem off the height restriction: * `Wcoeff_height_indep` — `Wcoeff h a b c n = Wcoeff k a b c n` whenever `n ≤ h` and `n ≤ k` (the coefficient is independent of the height bound above the length). * `coeff_JFraction_height_indep` — the height-`h` J-fraction's `z^n` coefficient equals the height-`n` one for any `h ≥ n`; i.e. the bounded J-fraction agrees with the full (unbounded) continued fraction in every coefficient. -/ open scoped BigOperators PowerSeries open AnalyticCombinatorics AnalyticCombinatorics.Ch5 AnalyticCombinatorics.Ch5.ContinuedFractions open AnalyticCombinatorics.Ch5.ContinuedFractions.PathSum
Formal statement
theorem AnalyticCombinatorics.Ch5.ContinuedFractions.coeff_JFraction_height_indep {R : Type*} [CommRing R]
(h n : ℕ) (a b c : ℕ → R) (hn : n ≤ h) :
PowerSeries.coeff (R := R) n (JFraction h a b c)
= PowerSeries.coeff (R := R) n (JFraction n a b c) := by sorrySource
Human review
Confirmed by the mission captain (proposal self-audit).