q-Pochhammer symbol
DefinitionRaw infinite q-Pochhammer product#✓fully proved
For complex numbers \(a\) and \(q\), the raw infinite q-Pochhammer product is the unconditional infinite product \(\prod_{n=0}^{\infty} (1 - a q^n)\), defined for every \(q\): when this product does not converge unconditionally (in particular for most \(q\) with \(|q| \ge 1\)), its value is \(1\) by convention.
noncomputable def qPochhammerInfRaw (a q : ℂ) : ℂ :=
tprod (fun n : ℕ => (1 - a * q ^ n))
Used by 40
DefinitionInfinite q-Pochhammer symbol#✓fully proved
For complex numbers \(a\) and \(q\) with \(|q| < 1\), the infinite q-Pochhammer symbol is \((a;q)_\infty = \prod_{n=0}^{\infty} (1 - a q^n)\), the unconditional infinite product of the factors \(1 - a q^n\).
The hypothesis \(|q| < 1\) is an argument of the definition, so the symbol cannot be applied to \(q\) outside the open unit disk.
noncomputable def qPochhammerInf (a q : ℂ) (_hq : ‖q‖ < 1) : ℂ :=
qPochhammerInfRaw a q
noncomputable def qPochhammerInfRaw (a q : ℂ) : ℂ :=
tprod (fun n : ℕ => (1 - a * q ^ n))
MathlibExt/Analysis/SpecialFunctions/QPochhammer.lean:47
Sources
2607.10576:D01/2608.13818:D02jointly define(a;q)_∞ := ∏_{j=0}^{∞} (1 - a·q^j)for complexa, qwith‖q‖ < 1.
Uses 1 · Used by 17
TheoremThe q-Pochhammer symbol with a = 0#✓fully proved
For every complex number \(q\) with \(|q| < 1\), \((0;q)_\infty = 1\), since every factor \(1 - 0 \cdot q^n\) equals \(1\).
@[simp]
theorem qPochhammerInf_zero_left (q : ℂ) (hq : ‖q‖ < 1) :
qPochhammerInf 0 q hq = 1
noncomputable def qPochhammerInf (a q : ℂ) (_hq : ‖q‖ < 1) : ℂ :=
qPochhammerInfRaw a q
MathlibExt/Analysis/SpecialFunctions/QPochhammer.lean:57
Uses 1 · Used by 2
TheoremConvergence of the infinite q-Pochhammer product#✓fully proved
For all complex numbers \(a\) and \(q\) with \(|q| < 1\), the infinite product \(\prod_{n=0}^{\infty} (1 - a q^n)\) converges unconditionally to the infinite q-Pochhammer symbol \((a;q)_\infty\): the products of the factors \(1 - a q^n\) over finite sets of indices \(n\) tend to \((a;q)_\infty\).
No nonvanishing hypothesis is imposed, so the cases where some factor is zero (and the product is \(0\)) are included.
theorem hasProd_qPochhammerInf (a q : ℂ) (hq : ‖q‖ < 1) :
HasProd (fun n : ℕ => (1 - a * q ^ n)) (qPochhammerInf a q hq)
noncomputable def qPochhammerInf (a q : ℂ) (_hq : ‖q‖ < 1) : ℂ :=
qPochhammerInfRaw a q
MathlibExt/Analysis/SpecialFunctions/QPochhammer.lean:57
Sources
2607.10576:D01, where the infinite product \((a;q)_\infty\) is used under \(|q| < 1\).
Uses 1 · Used by 1
TheoremThe q-Pochhammer symbol vanishes at a = 1 and q = 0#✓fully proved
The infinite q-Pochhammer symbol satisfies \((1;0)_\infty = 0\), because its factor for \(n = 0\) is \(1 - 1 \cdot 0^0 = 0\) (with the convention \(0^0 = 1\)).
@[simp]
theorem qPochhammerInf_one_zero : qPochhammerInf 1 0 (by simp) = 0
noncomputable def qPochhammerInf (a q : ℂ) (_hq : ‖q‖ < 1) : ℂ :=
qPochhammerInfRaw a q
MathlibExt/Analysis/SpecialFunctions/QPochhammer.lean:57
Uses 2
TheoremThe raw q-Pochhammer product at a = 2 and q = 1 equals 1#✓fully proved
The raw infinite q-Pochhammer product at \(a = 2\) and \(q = 1\) equals \(1\).
Every factor \(1 - 2 \cdot 1^n\) equals \(-1\), so the finite partial products alternate between \(-1\) and \(1\) and the product does not converge; the value \(1\) is the default that the unconditional product takes in that case, not a limit of partial products. The q-Pochhammer symbol \((a;q)_\infty\), which requires \(|q| < 1\), excludes such arguments.
theorem qPochhammerInfRaw_two_one : qPochhammerInfRaw 2 1 = 1
noncomputable def qPochhammerInfRaw (a q : ℂ) : ℂ :=
tprod (fun n : ℕ => (1 - a * q ^ n))
MathlibExt/Analysis/SpecialFunctions/QPochhammer.lean:47
Uses 1
DefinitionThe Euler products of partition theory#✓fully proved
For a natural number \(k\), the Euler product \(f_k = (q^k; q^k)_\infty = \prod_{m \ge 1} (1 - q^{km})\) is this infinite product in the ring of integer power series in \(q\), taken in the coefficientwise topology. It is used for \(k \ge 1\).
noncomputable def qEulerProduct (k : ℕ) : ℤ⟦X⟧ :=
∏' m : ℕ, (1 - X ^ (k * (m + 1)))
Sources
- James A. Sellers, Elementary Proofs of Congruences for POND and PEND Partitions, Journal of Integer Sequences 27 (2024), Article 24.4.7, Section 2.
Used by 97
TheoremPentagonal series expansion of the first Euler product#✓fully proved
The Euler product \(f_1 = \prod_{m \ge 1} (1 - q^m)\) equals the pentagonal series \(\sum_{j \in \mathbb{Z}} (-1)^j q^{j(3j-1)/2}\) as an integer power series.
theorem qEulerProduct_one : qEulerProduct 1 = pentagonalSeries ℤ
noncomputable def qEulerProduct (k : ℕ) : ℤ⟦X⟧ :=
∏' m : ℕ, (1 - X ^ (k * (m + 1)))
MathlibExt/Combinatorics/Enumerative/Partition/QEulerProduct.lean:35
Sources
- James A. Sellers, Elementary Proofs of Congruences for POND and PEND Partitions, Journal of Integer Sequences 27 (2024), Article 24.4.7, Section 2.
Uses 1
TheoremConstant term of the Euler products#✓fully proved
For every natural number \(k \ge 1\), the integer power series \(f_k = \prod_{m \ge 1} (1 - q^{km})\) has constant coefficient \(1\).
theorem constantCoeff_qEulerProduct {k : ℕ} (hk : 1 ≤ k) :
constantCoeff (qEulerProduct k) = 1
noncomputable def qEulerProduct (k : ℕ) : ℤ⟦X⟧ :=
∏' m : ℕ, (1 - X ^ (k * (m + 1)))
MathlibExt/Combinatorics/Enumerative/Partition/QEulerProduct.lean:35
Sources
- S. Shivaprasada Nayaka, B. N. Dharmendra, and M. C. Mahesh Kumar, Divisibility Properties for Overcubic Partition Triples, INTEGERS 24 (2024), Article A80, Section 1 (notation
E_k); James A. Sellers, Elementary Proofs of Congruences for POND and PEND Partitions, Journal of Integer Sequences 27 (2024), Article 24.4.7, Section 2.
Uses 1 · Used by 13
Loading dependency explorer…
The dependency explorer needs JavaScript and its graph data.