Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Sum of tails of the distinct-part product

Open
RamanujanLostNotebook.PartII.entry_7_3_2

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

number-theoryramanujan-lost-notebook

For |q|<1 let S=(-q;q)_∞. All three series converge absolutely, and sum q^(n(n+1)/2)/(-q;q)_n = 2(S/2 + sum(S−(-q;q)n) − S sum{n≥1}q^n/(1−q^n)). Define the following summands, with indices in L: nonnegative integers, A: nonnegative integers, B: nonnegative integers: L(n)=(q)(n)((n+1))2(−(q);q)nL(n)=\frac{(q)^{\frac{(n)((n+1))}{2}}}{(-(q);q)_{n}}L(n)=(−(q);q)n​(q)2(n)((n+1))​​; A(n)=((−(q);q)∞−(−(q);q)n)A(n)=((-(q);q)_{\infty}-(-(q);q)_{n})A(n)=((−(q);q)∞​−(−(q);q)n​); B(n)=(q)(n+1)(1−(q)(n+1))B(n)=\frac{(q)^{(n+1)}}{(1-(q)^{(n+1)})}B(n)=(1−(q)(n+1))(q)(n+1)​. Then ∑n≥0L(n)=(2)((((−(q);q)∞2+∑n≥0A(n))−((−(q);q)∞)(∑n≥0B(n))))\sum_{n\ge0} L(n)=(2)(((\frac{(-(q);q)_{\infty}}{2}+\sum_{n\ge0} A(n))-((-(q);q)_{\infty})(\sum_{n\ge0} B(n))))∑n≥0​L(n)=(2)(((2(−(q);q)∞​​+∑n≥0​A(n))−((−(q);q)∞​)(∑n≥0​B(n)))). Here (u;q)n=∏j=0n−1(1−uqj)(u;q)_n=\prod_{j=0}^{n-1}(1-uq^j)(u;q)n​=∏j=0n−1​(1−uqj) and (u;q)∞=∏j≥0(1−uqj)(u;q)_\infty=\prod_{j\ge0}(1-uq^j)(u;q)∞​=∏j≥0​(1−uqj); φ(u)=∑k∈Zuk2\varphi(u)=\sum_{k\in\mathbb Z}u^{k^2}φ(u)=∑k∈Z​uk2 when it occurs. Differs from the printed source: we make the analytic domain |q|<1 explicit; on this domain all displayed denominators are nonzero, and absolute convergence is asserted in the conclusion. This clarification is ours; the formula is unchanged.

Discrepancy from the printed source. Differs from the printed source: we make the analytic domain |q|<1 explicit; on this domain all displayed denominators are nonzero, and absolute convergence is asserted in the conclusion. This clarification is ours; the formula is unchanged.

Preamble
import Mathlib
import Definitions.Def_RamanujanLostNotebook_PartII_shared_qPoch
import Definitions.Def_RamanujanLostNotebook_PartII_shared_qPochInf
Formal statement
namespace RamanujanLostNotebook.PartII
theorem entry_7_3_2 (q : ℂ) (hq : ‖q‖ < 1) :
    let L : ℕ → ℂ := fun n => q ^ (n * (n + 1) / 2) / qPoch (-q) q n;
    let A : ℕ → ℂ := fun n => qPochInf (-q) q - qPoch (-q) q n;
    let B : ℕ → ℂ := fun n => q ^ (n + 1) / (1 - q ^ (n + 1));
    Summable L ∧ Summable A ∧ Summable B ∧
    (∑' n : ℕ, L n) = 2 * (qPochInf (-q) q / 2 + (∑' n : ℕ, A n) - qPochInf (-q) q * (∑' n : ℕ, B n)) := by sorry
end RamanujanLostNotebook.PartII
Source
G. E. Andrews and B. C. Berndt, Ramanujan's Lost Notebook, Part II, Springer 2009, Chapter 7, Entry 7.3.2, p. 163.

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