Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Chapter 9 Bailey lemma definitions: operators L(x)L(x)L(x), M(x)M(x)M(x), D(x)D(x)D(x) and Bailey pairs by MMM

Definition
QseriesFormalization_Chapter09_BaileyLemma

by FormallyCorrect · Oct 23, 2026 · Mathlib 0df444a (Lean v4.33.1)

bailey-pairschan-invitation-qseriesq-pochhammer

This bundle defines Chan's operators on sequences: L(x)L(x)L(x) with Lβ(n)=∑k≤nxkqk2βk/(q;q)n−kL\beta(n)=\sum_{k\le n}x^kq^{k^2}\beta_k/(q;q)_{n-k}Lβ(n)=∑k≤n​xkqk2βk​/(q;q)n−k​, M(x)M(x)M(x) given by the Bailey transform ∑k≤nαk/((q;q)n−k(xq;q)n+k)\sum_{k\le n}\alpha_k/\big((q;q)_{n-k}(xq;q)_{n+k}\big)∑k≤n​αk​/((q;q)n−k​(xq;q)n+k​), and the diagonal operator D(x)D(x)D(x) with Dα(n)=xnqn2αnD\alpha(n)=x^nq^{n^2}\alpha_nDα(n)=xnqn2αn​. It defines a Bailey pair relative to aaa as a pair (α,β)(\alpha,\beta)(α,β) with β=M(a)α\beta=M(a)\alphaβ=M(a)α, and the second iterates L2L^2L2 and D2D^2D2.

Division uses Lean’s totalized field convention a/0=0a/0=0a/0=0. 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).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me