Theorem 9.2: two-step Bailey lemma,
ProvedQseriesFormalization.PartII.Ch09.theorem92bailey-pairschan-invitation-qseriesidentitiesq-series
Under the same hypotheses as Theorem 9.1 ( a field, and for all , and a Bailey pair relative to ), applying the operator twice to gives, for every ,
where , so . Thus the Bailey chain can be iterated twice. This is Theorem 9.2 of Chapter 9.
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]Formal statement
theorem QseriesFormalization.PartII.Ch09.theorem92 (x q : R) {α β : Nat → R}
(hxq : ∀ k, (1 : R) - x * q ^ (k + 1) ≠ 0)
(hQ : ∀ k, qPochhammer q k ≠ 0)
(hpair : IsBaileyPairByM x q α β) :
∀ n : Nat, L2 x q β n = M x q (D2 x 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 9. Lean source: https://github.com/xiangyazi24/invitation-to-qseries-lean/blob/5df34b280b6a9c4a68ab09105b4e5d3c7bbe88d1/QseriesFormalization/Chapter09_BaileyLemma.lean#L305 (header match only; ported to Lean v4.33.1 / Mathlib 0df444a; proof adapted for this upload)