Composition written as a double sum
ProvedQseriesFormalization.PartII.Ch09.L_comp_M_double_sumbailey-pairschan-invitation-qseriesq-series
Let be a field, , and . Let be the Bailey transform, , and . Then
This exchange of summation is a preparatory step for Lemma 9.1 (the identity ) in Chapter 9; no non-vanishing hypotheses are needed since division in a field is total.
Preamble
import Definitions.Def_QseriesFormalization_Chapter09_BaileyLemma
import Mathlib.Analysis.Normed.Group.Tannery
import Mathlib
import Mathlib.Analysis.SpecialFunctions.Log.Summable
/-!
# Chapter 9 — Bailey lemma operator form
This file isolates the operator statement of Bailey's lemma from the larger
Chapter 9 development. The underlying finite Bailey-transform identity is
already proved in `Chapter09` modulo the q-Pfaff--Saalschutz kernel evaluation;
here we package it as Chan's matrix equation `LM = MD` and its two immediate
consequences.
-/
open QseriesFormalization
open QseriesFormalization.PartII
open QseriesFormalization.PartII.Ch09
variable {R : Type*} [Field R]
open FinsetFormal statement
theorem QseriesFormalization.PartII.Ch09.L_comp_M_double_sum (x q : R) (α : Nat → R) (n : Nat) :
L x q (M x q α) n =
∑ j ∈ range (n + 1),
α j * ∑ k ∈ (range (n + 1)).filter (fun k => j ≤ k),
x ^ k * q ^ (k * k) /
(qPochhammer q (n - k) * qPochhammer q (k - j) *
qPoch (x * q) q (k + j)) := 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 9. Lean source: https://github.com/xiangyazi24/invitation-to-qseries-lean/blob/5df34b280b6a9c4a68ab09105b4e5d3c7bbe88d1/QseriesFormalization/Chapter09_BaileyLemma.lean#L146-L198