Bailey's lemma at , component
ProvedQseriesFormalization.PartII.Ch09.theorem91_x_one_twobailey-pairschan-invitation-qseries
Let be a field and with all nonzero. For any Bailey pair relative to (i.e. for all , where with is ), the component of Theorem 9.1 holds:
This is a finite special case of Theorem 9.1, not the general statement.
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.theorem91_x_one_two (q : R) {α β : Nat → R}
(hpair : IsBaileyPairByM 1 q α β)
(hq1 : (1 : R) - q ≠ 0) (hq2 : (1 : R) - q ^ 2 ≠ 0)
(hq3 : (1 : R) - q ^ 3 ≠ 0) (hq4 : (1 : R) - q ^ 4 ≠ 0) :
L 1 q β 2 = M 1 q (D 1 q α) 2 := 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#L336-L346