Uniform bound
ProvedQseriesFormalization.PartII.Ch07.gaussianBinom_norm_lechan-invitation-qseriesq-binomialrogers-ramanujan
For with and natural numbers with ,
The bound is uniform in ; combined with the Gaussian decay of it gives the dominating sequence for Tannery's theorem in the Chapter 7 proof of the Rogers-Ramanujan identities.
Preamble
import Definitions.Def_QseriesFormalization_DefCoreQSeries import Mathlib import Mathlib.Analysis.SpecialFunctions.Log.Summable import Mathlib.Analysis.Normed.Group.Tannery /-! # Chapter 7 — Rogers-Ramanujan Step 5 (Tannery limit, LHS) Takes the unconditional finite Schur identity `schurSum q N = schurRHS q N` (proved in `Chapter07_RRStep1`) to the limit `N → ∞`. LHS pointwise limit (this file, complete, no analytic gap): `q^(n²)·[N-n choose n]_q → rrJTerm 1 q n` as `N → ∞`, from the proven `tendsto_gaussianBinom_sub`. The full Tannery step (dominated convergence: `schurSum q N → rrJInf 1 q`) needs a uniform `q`-binomial bound; that analytic core is tracked in `docs/RR_step1_schur.md` (RR Step 5 dispatch) and added once complete. -/ open QseriesFormalization open Filter Topology /-! ### Uniform `q`-binomial bound (ChatGPT crude-bound strategy) `‖gaussianBinom q (N-n) n‖ ≤ (2/(1-‖q‖))^n` for `2n ≤ N`, `‖q‖<1`, via the `q`-Pochhammer ratio identity + per-factor norm bounds. -/
Formal statement
theorem QseriesFormalization.PartII.Ch07.gaussianBinom_norm_le (q : ℂ) (hq : ‖q‖ < 1) (n N : ℕ)
(hN : 2 * n ≤ N) :
‖gaussianBinom q (N - n) n‖ ≤ (2 / (1 - ‖q‖)) ^ n := by sorrySource
Lean formalization (Xiang Huang) of Hei-Chi Chan, An Invitation to q-Series: From Jacobi's Triple Product Identity to Ramanujan's "Most Beautiful Identity" (World Scientific, 2011), Chapter 7. Lean source: https://github.com/xiangyazi24/invitation-to-qseries-lean/blob/5df34b280b6a9c4a68ab09105b4e5d3c7bbe88d1/QseriesFormalization/Chapter07_RRStep5.lean#L94-L134