Recurrence for the finite Rogers-Ramanujan sum side:
ProvedQseriesFormalization.PartII.Ch08.EFinite_recurrencechan-invitation-qseriesq-binomialrogers-ramanujan
Let be a field, and . With EFinite (Chan's , with Gaussian binomials),
This is the recurrence (8.2) for the finite sum side of Chapter 8's Rogers-Ramanujan polynomial identities, in zero-based indexing.
Preamble
import Definitions.Def_QseriesFormalization_Pending_Chapter08_FiniteRR
import Mathlib.Analysis.Normed.Group.Tannery
import Mathlib
import Mathlib.Analysis.SpecialFunctions.Log.Summable
/-!
# Chapter 8 finite Rogers-Ramanujan sum side
Chan's Section 8.1 writes
`E_n(a) = sum_j q^(j^2 + a*j) [n-j-1 choose j]_q` and proves the
second-order recurrence
`E_{n+1}(a) = E_n(a) + q^(n+a-1) E_{n-1}(a)`.
The zero-based definition below is `EFinite q a N = E_{N+1}(a)`.
-/
open QseriesFormalization
open QseriesFormalization.PartII
open QseriesFormalization.PartII.Ch08
variable {R : Type*} [Field R]Formal statement
theorem QseriesFormalization.PartII.Ch08.EFinite_recurrence (q : R) (a N : Nat) :
EFinite q a (N + 2) =
EFinite q a (N + 1) + q ^ (N + a + 1) * EFinite q a 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 8. Lean source: https://github.com/xiangyazi24/invitation-to-qseries-lean/blob/5df34b280b6a9c4a68ab09105b4e5d3c7bbe88d1/QseriesFormalization/Pending/Chapter08_FiniteRR.lean#L75-L134