Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Chan Theorem 8.1, case a=0a=0a=0: finite sum side equals alternating Gaussian side

Proved
QseriesFormalization.PartII.Ch08.chan_theorem_8_1_a0

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

chan-invitation-qseriesq-binomialrogers-ramanujan

Let RRR be a field, q∈Rq\in Rq∈R and N∈NN\in\mathbb{N}N∈N. Then EFinite q 0 N=q\,0\,N=q0N= DFinite q 0 Nq\,0\,Nq0N, i.e.

∑j=0Nqj2+0j(N−jj)q=∑j∈Z(−1)jqj(5j+1)/2−0j(N+0⌊(N+0−5j)/2⌋)q.\sum_{j=0}^{N}q^{j^2+0j}\binom{N-j}{j}_q=\sum_{j\in\mathbb{Z}}(-1)^jq^{j(5j+1)/2-0j}\binom{N+0}{\lfloor(N+0-5j)/2\rfloor}_q.j=0∑N​qj2+0j(jN−j​)q​=j∈Z∑​(−1)jqj(5j+1)/2−0j(⌊(N+0−5j)/2⌋N+0​)q​.

This is the finite Rogers-Ramanujan identity of Theorem 8.1 (Chapter 8) for a=0a=0a=0, as a statement about finite polynomial sums; the infinite Rogers-Ramanujan identities are not asserted here.

Preamble
import Definitions.Def_QseriesFormalization_Pending_Chapter08_FiniteRR
import Mathlib.Analysis.Normed.Group.Tannery
import Mathlib
import Mathlib.Analysis.SpecialFunctions.Log.Summable

/-!
# Chapter 8 Gaussian-polynomial side

This file records the closed Rogers-Ramanujan cases of Chan Theorem 8.1.
The Gaussian-polynomial side `DFinite` is defined in the imported finite-RR
development; here we expose that definition and prove only the `a = 0, 1`
identity cases.
-/

open QseriesFormalization
open QseriesFormalization.PartII
open QseriesFormalization.PartII.Ch08

variable {R : Type*} [Field R]
Formal statement
theorem QseriesFormalization.PartII.Ch08.chan_theorem_8_1_a0 (q : R) (N : Nat) :
    EFinite q 0 N = DFinite q 0 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 8. Lean source: https://github.com/xiangyazi24/invitation-to-qseries-lean/blob/5df34b280b6a9c4a68ab09105b4e5d3c7bbe88d1/QseriesFormalization/Pending/Chapter08_Gaussian.lean#L24-L27

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