Even-centered Bailey theta transform
OpenRamanujanLostNotebook.PartII.equation_5_2_3Write (x;b)n=∏{k=0}^{n−1}(1−x b^k), (x;b)∞=∏{k≥0}(1−x b^k), f(u,v)=∑{j∈ℤ}u^(j(j+1)/2)v^(j(j−1)/2), ψ(z)=∑{n≥0}z^(n(n+1)/2), and E(z)=(z;z)∞. For base B, D(q,B) consists of complex pairs (r,s) with r,s≠0, |q²/(rs)|<1, and (q²/r)B^k≠1, (q²/s)B^k≠1 for all integers k≥0. Let U_n=(r;q²)n(s;q²)n(−aq;q²)n(−q/a;q²)n(q²/(rs))^n/(q²;q²)(2n). For complex |q|<1, a≠0 and (r,s)∈D(q,q²), ∑{n≥0}U_n converges absolutely to [(q²/r;q²)∞(q²/s;q²)∞/((q²;q²)∞(q²/(rs);q²)∞)]·[1+∑{N≥1}(r;q²)_N(s;q²)_N(a^N+a^(−N))q^(N²+2N)/((rs)^N(q²/r;q²)_N(q²/s;q²)_N)]. The N≥1 row is also absolutely summable. Differs from the printed source: we spell out the ordinary convergence range |q²/(rho₁ rho₂)|<1 and exclude reciprocal-product poles; pp.98–99 leave these parameter restrictions implicit. These domain conditions are ours, not an assumed identity.
Discrepancy from the printed source. Differs from the printed source: we spell out the ordinary convergence range |q²/(rho₁ rho₂)|<1 and exclude reciprocal-product poles; pp.98–99 leave these parameter restrictions implicit. These domain conditions are ours, not an assumed identity.
import Mathlib import Definitions.Def_RamanujanLostNotebook_PartII_ch05_ch05EvenTerm import Definitions.Def_RamanujanLostNotebook_PartII_ch05_ch05ParameterDomain import Definitions.Def_RamanujanLostNotebook_PartII_shared_qPoch import Definitions.Def_RamanujanLostNotebook_PartII_shared_qPochInf
namespace RamanujanLostNotebook.PartII
theorem equation_5_2_3 (q a rho₁ rho₂ : ℂ) (hq : ‖q‖ < 1) (ha : a ≠ 0)
(hrho : (rho₁, rho₂) ∈ ch05ParameterDomain q (q ^ 2)) :
HasSum (fun n : ℕ => ch05EvenTerm q a rho₁ rho₂ n)
(qPochInf (q ^ 2 / rho₁) (q ^ 2) * qPochInf (q ^ 2 / rho₂) (q ^ 2) /
(qPochInf (q ^ 2) (q ^ 2) * qPochInf (q ^ 2 / (rho₁ * rho₂)) (q ^ 2)) *
(1 + ∑' k : ℕ,
qPoch rho₁ (q ^ 2) (k + 1) * qPoch rho₂ (q ^ 2) (k + 1) *
(a ^ (k + 1) + (a⁻¹) ^ (k + 1)) * q ^ ((k + 1) ^ 2 + 2 * (k + 1)) /
((rho₁ * rho₂) ^ (k + 1) * qPoch (q ^ 2 / rho₁) (q ^ 2) (k + 1) *
qPoch (q ^ 2 / rho₂) (q ^ 2) (k + 1)))) ∧
Summable (fun k : ℕ => qPoch rho₁ (q ^ 2) (k + 1) * qPoch rho₂ (q ^ 2) (k + 1) *
(a ^ (k + 1) + (a⁻¹) ^ (k + 1)) * q ^ ((k + 1) ^ 2 + 2 * (k + 1)) /
((rho₁ * rho₂) ^ (k + 1) * qPoch (q ^ 2 / rho₁) (q ^ 2) (k + 1) *
qPoch (q ^ 2 / rho₂) (q ^ 2) (k + 1))) := by sorry
end RamanujanLostNotebook.PartII