Chapter 9 Bailey lemma definitions: operators , , and Bailey pairs by
DefinitionQseriesFormalization_Chapter09_BaileyLemmabailey-pairschan-invitation-qseriesq-pochhammer
This bundle defines Chan's operators on sequences: with , given by the Bailey transform , and the diagonal operator with . It defines a Bailey pair relative to as a pair with , and the second iterates and .
Division uses Lean’s totalized field convention . The statement or definition does not impose nonvanishing of its displayed denominators.
Definition code
-- Generated by qseries-p2m/p2m/generate.py from QseriesFormalization.Chapter09_BaileyLemma: skeleton subtraction
-- keeps 6 declaration(s); proofs kept; project imports -> Definitions bundles.
import Definitions.Def_QseriesFormalization_Chapter09
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.
-/
namespace QseriesFormalization
namespace PartII
namespace Ch09
section Field
variable {R : Type*} [Field R]
/-- Chan's matrix `L(x)`, Eq. (9.6):
`L_{n,k} = x^k q^{k^2} / (q;q)_{n-k}` for `k ≤ n`. -/
noncomputable def L (x q : R) (β : Nat → R) (n : Nat) : R :=
∑ k ∈ Finset.range (n + 1),
x ^ k * q ^ (k * k) / qPochhammer q (n - k) * β k
/-- Chan's Bailey matrix `M(x)`, Eq. (9.7):
`M_{n,k} = 1 / ((q;q)_{n-k} (xq;q)_{n+k})` for `k ≤ n`. -/
noncomputable def M (x q : R) (α : Nat → R) (n : Nat) : R :=
BaileyBeta x q α n
/-- Chan's diagonal matrix `D(x)`, Eq. (9.8):
`D_{n,n} = x^n q^{n^2}`. -/
noncomputable def D (x q : R) (α : Nat → R) (n : Nat) : R :=
x ^ n * q ^ (n * n) * α n
/-- Bailey pairs, stated in the operator language `b = M a`. -/
def IsBaileyPairByM (a q : R) (α β : Nat → R) : Prop :=
∀ n : Nat, β n = M a q α n
/-- The second iterate of Chan's `L(x)`. -/
noncomputable def L2 (x q : R) (β : Nat → R) (n : Nat) : R :=
L x q (L x q β) n
/-- The second iterate of Chan's `D(x)`. -/
noncomputable def D2 (x q : R) (α : Nat → R) (n : Nat) : R :=
D x q (D x q α) n
end Field
end Ch09
end PartII
end QseriesFormalization
Source
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 (definitions of this module that the uploaded theorems need; ported to Lean v4.33.1 / Mathlib 0df444a).