Product form of the Gaussian binomial coefficient:
ProvedQseriesFormalization.PartI.Ch03.gaussianBinom_mul_qPochhammer_eqchan-invitation-qseriesq-binomialq-pochhammer
Let be a commutative ring and . For all natural numbers ,
where is the Gaussian (q-binomial) coefficient, defined by the Pascal-type recursion , and . This is the usual closed form of the q-binomial coefficient, stated without division, and is a basic fact from Chapter 3.
Preamble
import Definitions.Def_QseriesFormalization_DefCoreQSeries
import Mathlib.Analysis.Normed.Group.Tannery
import Mathlib
import Mathlib.Analysis.SpecialFunctions.Log.Summable
/-!
# Chapter 3 — Part I: Second proof (Gaussian polynomials and the q-binomial theorem)
(Hei-Chi Chan, *An Invitation to q-Series*, Ch 3, pp. 11–20.)
Gaussian (q-binomial) coefficients are defined in `Basic.lean`. This file
states and proves the finite q-binomial theorem
`∏_{k=0}^{n-1} (1 + x q^k) = ∑_{k=0}^n [n choose k]_q q^{k(k-1)/2} x^k`.
The main theorem is proved by induction from the defining q-Pascal recursion
for Gaussian binomial coefficients.
-/
open QseriesFormalization
variable {R : Type*} [CommRing R]
variable {R : Type*} [CommSemiring R]
variable {R : Type*} [CommRing R]Formal statement
theorem QseriesFormalization.PartI.Ch03.gaussianBinom_mul_qPochhammer_eq (q : R) :
∀ n m, m ≤ n →
gaussianBinom q n m * qPochhammer q m * qPochhammer q (n - m) =
qPochhammer 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 3. Lean source: https://github.com/xiangyazi24/invitation-to-qseries-lean/blob/5df34b280b6a9c4a68ab09105b4e5d3c7bbe88d1/QseriesFormalization/Chapter03.lean#L340-L397