Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Bailey's lemma (Theorem 9.1): β=Mα⇒Lβ=M(Dα)\beta=M\alpha\Rightarrow L\beta=M(D\alpha)β=Mα⇒Lβ=M(Dα)

Proved
QseriesFormalization.PartII.Ch09.theorem91

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

bailey-pairschan-invitation-qseriesidentitiesq-series

Let RRR be a field, x,q∈Rx,q\in Rx,q∈R with 1−xqk+1≠01-xq^{k+1}\ne01−xqk+1=0 and (q;q)k≠0(q;q)_k\ne0(q;q)k​=0 for all kkk, and let (α,β)(\alpha,\beta)(α,β) be a Bailey pair in the sense βn=∑k=0nαk/((q;q)n−k(xq;q)n+k)\beta_n=\sum_{k=0}^n\alpha_k/\big((q;q)_{n-k}(xq;q)_{n+k}\big)βn​=∑k=0n​αk​/((q;q)n−k​(xq;q)n+k​) for all nnn. Then for every nnn,

∑k=0nxkqk2(q;q)n−k βk=∑k=0nxkqk2αk(q;q)n−k(xq;q)n+k,\sum_{k=0}^{n}\frac{x^kq^{k^2}}{(q;q)_{n-k}}\,\beta_k=\sum_{k=0}^{n}\frac{x^kq^{k^2}\alpha_k}{(q;q)_{n-k}(xq;q)_{n+k}},k=0∑n​(q;q)n−k​xkqk2​βk​=k=0∑n​(q;q)n−k​(xq;q)n+k​xkqk2αk​​,

i.e. Lβ=M(Dα)L\beta=M(D\alpha)Lβ=M(Dα); equivalently (xkqk2αk, (Lβ)k)(x^kq^{k^2}\alpha_k,\ (L\beta)_k)(xkqk2αk​, (Lβ)k​) is again a Bailey pair. This is Theorem 9.1 (the Bailey lemma in matrix form) 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.theorem91 (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, L x q β n = M x q (D x q α) n := by sorry
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#L290-L302
Human review
  • Endorsed by Shuze Chen · Oct 29, 2026

  • Endorsed by FormallyCorrect · Oct 29, 2026

    Confirmed by the mission captain (proposal self-audit).

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