Stride series for zeta and eta values
DefinitionAlternating stride sum#✓fully proved
For natural numbers \(q\), \(t\) and \(n\), let \(K = \lfloor (n + q - 1)/q \rfloor\) if \(q \ge 1\) and \(K = 0\) if \(q = 0\). The alternating stride sum is the real number
For \(q \ge 1\) this is the alternating sum of \(m^{-t}\) over \(m = n, n - q, n - 2q, \dots\) with \(m \ge 1\); with \(j = i + 1\) it reads \(\sum_{j=1}^{K} (-1)^{j+1}/(n + q - qj)^t\).
public noncomputable def strideAlternatingSum (q t n : ℕ) : ℝ :=
∑ i ∈ Finset.range ((n + q - 1) / q), (-1 : ℝ) ^ i / ((n - q * i : ℕ) : ℝ) ^ t
Sources
- Anthony Sofo and Junesang Choi, New Series Representations for the Riemann Zeta Function and Its Associated Functions, INTEGERS 24 (2024), Article A45, Theorem 1, equation (9).
Used by 7
DefinitionSigned stride sum#✓fully proved
For natural numbers \(q\), \(t\) and \(n\), let \(K = \lfloor (n + q - 1)/q \rfloor\) if \(q \ge 1\) and \(K = 0\) if \(q = 0\). The signed stride sum is the real number
With \(j = i + 1\) it reads \(\sum_{j=1}^{K} (-1)^{(q+1)(j+1)}/(n + q - qj)^t\). For odd \(q\) every sign is \(+\), and for even \(q\) the signs alternate.
public noncomputable def strideSignedSum (q t n : ℕ) : ℝ :=
∑ i ∈ Finset.range ((n + q - 1) / q), (-1 : ℝ) ^ ((q + 1) * i) / ((n - q * i : ℕ) : ℝ) ^ t
Sources
- Anthony Sofo and Junesang Choi, New Series Representations for the Riemann Zeta Function and Its Associated Functions, INTEGERS 24 (2024), Article A45, Theorem 2, equation (25).
Used by 7
TheoremAlternating stride sum with a single term#✓fully proved
For natural numbers \(q\), \(t\) and \(n\) with \(1 \le n \le q\), the alternating stride sum satisfies \(S_{q,t}(n) = 1/n^t\).
public theorem strideAlternatingSum_of_le {q t n : ℕ} (hn : 0 < n) (hnq : n ≤ q) :
strideAlternatingSum q t n = 1 / (n : ℝ) ^ t
public noncomputable def strideAlternatingSum (q t n : ℕ) : ℝ :=
∑ i ∈ Finset.range ((n + q - 1) / q), (-1 : ℝ) ^ i / ((n - q * i : ℕ) : ℝ) ^ t
WantedExt/NumberTheory/ZetaStrideSeriesWanted.lean:28
Sources
- Anthony Sofo and Junesang Choi, New Series Representations for the Riemann Zeta Function and Its Associated Functions, INTEGERS 24 (2024), Article A45, equation (9).
Uses 1
TheoremSigned stride sum with a single term#✓fully proved
For natural numbers \(q\), \(t\) and \(n\) with \(1 \le n \le q\), the signed stride sum satisfies \(T_{q,t}(n) = 1/n^t\).
public theorem strideSignedSum_of_le {q t n : ℕ} (hn : 0 < n) (hnq : n ≤ q) :
strideSignedSum q t n = 1 / (n : ℝ) ^ t
public noncomputable def strideSignedSum (q t n : ℕ) : ℝ :=
∑ i ∈ Finset.range ((n + q - 1) / q), (-1 : ℝ) ^ ((q + 1) * i) / ((n - q * i : ℕ) : ℝ) ^ t
WantedExt/NumberTheory/ZetaStrideSeriesWanted.lean:37
Sources
- Anthony Sofo and Junesang Choi, New Series Representations for the Riemann Zeta Function and Its Associated Functions, INTEGERS 24 (2024), Article A45, equation (25).
Uses 1
TheoremRecurrence for the alternating stride sum#✓fully proved
Let \(q \ge 1\), \(n \ge 1\) and \(t \ge 0\) be integers and let \(S_{q,t}\) denote the alternating stride sum. Then \(S_{q,t}(n + q) = 1/(n + q)^t - S_{q,t}(n)\).
public theorem strideAlternatingSum_add {q t n : ℕ} (hq : 0 < q) (hn : 0 < n) :
strideAlternatingSum q t (n + q) = 1 / ((n + q : ℕ) : ℝ) ^ t - strideAlternatingSum q t n
public noncomputable def strideAlternatingSum (q t n : ℕ) : ℝ :=
∑ i ∈ Finset.range ((n + q - 1) / q), (-1 : ℝ) ^ i / ((n - q * i : ℕ) : ℝ) ^ t
WantedExt/NumberTheory/ZetaStrideSeriesWanted.lean:28
Sources
- Anthony Sofo and Junesang Choi, New Series Representations for the Riemann Zeta Function and Its Associated Functions, INTEGERS 24 (2024), Article A45, equation (9).
Uses 1
TheoremRecurrence for the signed stride sum#✓fully proved
Let \(q \ge 1\), \(n \ge 1\) and \(t \ge 0\) be integers and let \(T_{q,t}\) denote the signed stride sum. Then \(T_{q,t}(n + q) = 1/(n + q)^t + (-1)^{q+1} T_{q,t}(n)\).
public theorem strideSignedSum_add {q t n : ℕ} (hq : 0 < q) (hn : 0 < n) :
strideSignedSum q t (n + q) =
1 / ((n + q : ℕ) : ℝ) ^ t + (-1 : ℝ) ^ (q + 1) * strideSignedSum q t n
public noncomputable def strideSignedSum (q t n : ℕ) : ℝ :=
∑ i ∈ Finset.range ((n + q - 1) / q), (-1 : ℝ) ^ ((q + 1) * i) / ((n - q * i : ℕ) : ℝ) ^ t
WantedExt/NumberTheory/ZetaStrideSeriesWanted.lean:37
Sources
- Anthony Sofo and Junesang Choi, New Series Representations for the Riemann Zeta Function and Its Associated Functions, INTEGERS 24 (2024), Article A45, equation (25).
Uses 1
TheoremAlternating stride sum series for \(\zeta(t + 1)\)#●ready to prove
Let \(q \ge 1\) and \(t \ge 1\) be integers and let \(S_{q,t}\) denote the alternating stride sum. Then the partial sums
converge to \(\zeta(t + 1)\) as \(N \to \infty\), where \(\zeta\) is the Riemann zeta function.
The series converges only conditionally, since \(S_{q,t}(n)\) does not tend to \(0\), which is why it is stated through its partial sums. The second expression in equation (9) and the general identity (8) use a quantity \(A^{(t)}\) that the record does not define and are not stated here.
public theorem_wanted tendsto_strideAlternatingSum_riemannZeta (q t : ℕ) (hq : 0 < q)
(ht : 0 < t) :
Tendsto (fun N : ℕ => ((∑ n ∈ Finset.range N,
(2 * ((n : ℝ) + 1) + q) / (((n : ℝ) + 1) * ((n : ℝ) + 1 + q)) *
strideAlternatingSum q t (n + 1) : ℝ) : ℂ))
atTop (𝓝 (riemannZeta ((t : ℂ) + 1)))
public noncomputable def strideAlternatingSum (q t n : ℕ) : ℝ :=
∑ i ∈ Finset.range ((n + q - 1) / q), (-1 : ℝ) ^ i / ((n - q * i : ℕ) : ℝ) ^ t
WantedExt/NumberTheory/ZetaStrideSeriesWanted.lean:28
Sources
- Anthony Sofo and Junesang Choi, New Series Representations for the Riemann Zeta Function and Its Associated Functions, INTEGERS 24 (2024), Article A45, Theorem 1, equation (9).
Uses 1
TheoremDigamma series for the signed stride sum#●ready to prove
Let \(q \ge 1\) and \(t \ge 1\) be integers, let \(a\) be a real number with \(-1 \le a < 1\), let \(T_{q,t}\) denote the signed stride sum and \(\psi\) the digamma function. As \(N \to \infty\), the partial sums
converge to
The first series converges only conditionally, while the two digamma series converge absolutely.
public theorem_wanted tendsto_strideSignedSum_digamma (q t : ℕ) (hq : 0 < q) (ht : 0 < t)
(a : ℝ) (ha : -1 ≤ a) (ha' : a < 1) :
Tendsto (fun N : ℕ => ((∑ n ∈ Finset.range N,
(-1 : ℝ) ^ n * (2 * ((n : ℝ) + 1) + q) /
(((n : ℝ) + 1 + a + 1) * ((n : ℝ) + 1 - a - 1 + q)) *
strideSignedSum q t (n + 1) : ℝ) : ℂ))
atTop (𝓝 ((∑' n : ℕ, (-1 : ℂ) ^ n / ((n : ℂ) + 1) ^ t *
(Complex.digamma (((n : ℂ) + 1 + a + 1 + q) / (2 * q)) -
Complex.digamma (((n : ℂ) + 1 + a + 1) / (2 * q)))) / (2 * q) +
(∑' n : ℕ, (-1 : ℂ) ^ n / ((n : ℂ) + 1) ^ t *
(Complex.digamma (((n : ℂ) + 1 - a - 1 + 2 * q) / (2 * q)) -
Complex.digamma (((n : ℂ) + 1 - a - 1 + q) / (2 * q)))) / (2 * q)))
public noncomputable def strideSignedSum (q t n : ℕ) : ℝ :=
∑ i ∈ Finset.range ((n + q - 1) / q), (-1 : ℝ) ^ ((q + 1) * i) / ((n - q * i : ℕ) : ℝ) ^ t
WantedExt/NumberTheory/ZetaStrideSeriesWanted.lean:37
Sources
- Anthony Sofo and Junesang Choi, New Series Representations for the Riemann Zeta Function and Its Associated Functions, INTEGERS 24 (2024), Article A45, Theorem 2, equation (24).
Uses 1
TheoremStride series for the Dirichlet eta function#●ready to prove
Let \(q, t \ge 1\) be integers and let \(T_{q,t}(n)\) denote the signed stride sum. Then the partial sums
converge, as \(N \to \infty\), to \(\eta(t+1)\), where \(\eta(s) = \sum_{n \ge 1} (-1)^{n+1} n^{-s}\) is the Dirichlet eta function.
public theorem_wanted tendsto_strideSignedSum_dirichletEta (q t : ℕ) (hq : 0 < q)
(ht : 0 < t) :
Tendsto (fun N : ℕ => ∑ n ∈ Finset.range N,
(-1 : ℝ) ^ n * (2 * ((n : ℝ) + 1) + q) / (((n : ℝ) + 1) * ((n : ℝ) + 1 + q)) *
strideSignedSum q t (n + 1))
atTop (𝓝 (∑' n : ℕ, (-1 : ℝ) ^ n / ((n : ℝ) + 1) ^ (t + 1)))
public noncomputable def strideSignedSum (q t n : ℕ) : ℝ :=
∑ i ∈ Finset.range ((n + q - 1) / q), (-1 : ℝ) ^ ((q + 1) * i) / ((n - q * i : ℕ) : ℝ) ^ t
WantedExt/NumberTheory/ZetaStrideSeriesWanted.lean:37
Sources
- Anthony Sofo and Junesang Choi, New Series Representations for the Riemann Zeta Function and Its Associated Functions, INTEGERS 24 (2024), Article A45, Theorem 2, equation (25).
Uses 1
TheoremDigamma identity for stride sums over odd indices#●ready to prove
Let \(q, t \ge 1\) be integers, let \(a\) be a real number with \(-1 \le a < 1\), let \(S_{q,t}(n)\) denote the alternating stride sum and \(T_{q,t}(n)\) the signed stride sum, and let \(\psi\) be the digamma function. Then the partial sums
converge, as \(N \to \infty\), to
Deviation: the paper prints the factor \(2\) where this statement has \(1/2\); as printed the series sums to four times this limit (for \(q = t = 1\) and \(a = -1\): \(4\lambda(2) \approx 4.935\) against \(\lambda(2) = \pi^2/8 \approx 1.234\), where \(\lambda(s) = \sum_{n \ge 0} (2n+1)^{-s}\) is the Dirichlet lambda function). With \(1/2\) the identity checks numerically for several \((a, q, t)\), and at \(a = -1\) it is the stride series for \(\lambda(t+1)\), half the sum of the paper's series (9) for \(\zeta(t+1)\) and (25) for \(\eta(t+1)\).
public theorem_wanted tendsto_strideSums_digamma_odd (q t : ℕ) (hq : 0 < q) (ht : 0 < t)
(a : ℝ) (ha : -1 ≤ a) (ha' : a < 1) :
Tendsto (fun N : ℕ => ((∑ n ∈ Finset.range N,
(2 * ((n : ℝ) + 1) + q) /
(2 * (((n : ℝ) + 1 + a + 1) * ((n : ℝ) + 1 - a - 1 + q))) *
(strideAlternatingSum q t (n + 1) + (-1 : ℝ) ^ n * strideSignedSum q t (n + 1)) :
ℝ) : ℂ))
atTop (𝓝 ((∑' n : ℕ, 1 / (2 * ((n : ℂ) + 1) - 1) ^ t *
(Complex.digamma ((2 * ((n : ℂ) + 1) + a + q) / (2 * q)) -
Complex.digamma ((2 * ((n : ℂ) + 1) + a) / (2 * q)))) / (2 * q) +
(∑' n : ℕ, 1 / (2 * ((n : ℂ) + 1) - 1) ^ t *
(Complex.digamma ((2 * ((n : ℂ) + 1) - a - 2 + 2 * q) / (2 * q)) -
Complex.digamma ((2 * ((n : ℂ) + 1) - a - 2 + q) / (2 * q)))) / (2 * q)))
public noncomputable def strideAlternatingSum (q t n : ℕ) : ℝ :=
∑ i ∈ Finset.range ((n + q - 1) / q), (-1 : ℝ) ^ i / ((n - q * i : ℕ) : ℝ) ^ t
WantedExt/NumberTheory/ZetaStrideSeriesWanted.lean:28
public noncomputable def strideSignedSum (q t n : ℕ) : ℝ :=
∑ i ∈ Finset.range ((n + q - 1) / q), (-1 : ℝ) ^ ((q + 1) * i) / ((n - q * i : ℕ) : ℝ) ^ t
WantedExt/NumberTheory/ZetaStrideSeriesWanted.lean:37
Sources
- Anthony Sofo and Junesang Choi, New Series Representations for the Riemann Zeta Function and Its Associated Functions, INTEGERS 24 (2024), Article A45, Theorem 3, equation (27).
Uses 2
TheoremStride series for the Dirichlet lambda function#●ready to prove
Let \(q, t \ge 1\) be integers, and let \(S_{q,t}(n)\) denote the alternating stride sum and \(T_{q,t}(n)\) the signed stride sum. Then the partial sums
converge, as \(N \to \infty\), to \(\lambda(t+1)\), where \(\lambda(s) = \sum_{n \ge 0} (2n+1)^{-s}\) is the Dirichlet lambda function. The series is half the sum of the paper's series (9) for \(\zeta(t+1)\) and (25) for \(\eta(t+1)\).
Deviation: the paper prints the factor \(2\) where this statement has \(1/2\); as printed the series sums to \(4\lambda(t+1)\) (for \(q = t = 1\): about \(4.935\) against \(\lambda(2) = \pi^2/8 \approx 1.234\)).
public theorem_wanted tendsto_strideSums_dirichletLambda (q t : ℕ) (hq : 0 < q)
(ht : 0 < t) :
Tendsto (fun N : ℕ => ∑ n ∈ Finset.range N,
(2 * ((n : ℝ) + 1) + q) / (2 * (((n : ℝ) + 1) * ((n : ℝ) + 1 + q))) *
(strideAlternatingSum q t (n + 1) + (-1 : ℝ) ^ n * strideSignedSum q t (n + 1)))
atTop (𝓝 (∑' n : ℕ, 1 / (2 * (n : ℝ) + 1) ^ (t + 1)))
public noncomputable def strideAlternatingSum (q t n : ℕ) : ℝ :=
∑ i ∈ Finset.range ((n + q - 1) / q), (-1 : ℝ) ^ i / ((n - q * i : ℕ) : ℝ) ^ t
WantedExt/NumberTheory/ZetaStrideSeriesWanted.lean:28
public noncomputable def strideSignedSum (q t n : ℕ) : ℝ :=
∑ i ∈ Finset.range ((n + q - 1) / q), (-1 : ℝ) ^ ((q + 1) * i) / ((n - q * i : ℕ) : ℝ) ^ t
WantedExt/NumberTheory/ZetaStrideSeriesWanted.lean:37
Sources
- Anthony Sofo and Junesang Choi, New Series Representations for the Riemann Zeta Function and Its Associated Functions, INTEGERS 24 (2024), Article A45, Theorem 3, equation (28).
Uses 2
TheoremAlternating stride sum series for \(\zeta(p + t + 1)\)#●ready to prove
Let \(q \ge 1\) and \(t \ge 1\) be integers, let \(p \ge 0\) be an even integer and let \(S_{q,t}\) denote the alternating stride sum. Then the partial sums
converge to \(\zeta(p + t + 1)\) as \(N \to \infty\), where \(\zeta\) is the Riemann zeta function.
Only the first equality of equation (32) is stated; its second expression uses a quantity \(A^{(t)}\) that the record does not define.
public theorem_wanted tendsto_strideAlternatingSum_riemannZeta_add (q t p : ℕ) (hq : 0 < q)
(ht : 0 < t) (hp : Even p) :
Tendsto (fun N : ℕ => ((∑ n ∈ Finset.range N,
(((n : ℝ) + 1) ^ (p + 1) + ((n : ℝ) + 1 + q) ^ (p + 1)) /
(((n : ℝ) + 1) * ((n : ℝ) + 1 + q)) ^ (p + 1) *
strideAlternatingSum q t (n + 1) : ℝ) : ℂ))
atTop (𝓝 (riemannZeta ((p : ℂ) + t + 1)))
public noncomputable def strideAlternatingSum (q t n : ℕ) : ℝ :=
∑ i ∈ Finset.range ((n + q - 1) / q), (-1 : ℝ) ^ i / ((n - q * i : ℕ) : ℝ) ^ t
WantedExt/NumberTheory/ZetaStrideSeriesWanted.lean:28
Sources
- Anthony Sofo and Junesang Choi, New Series Representations for the Riemann Zeta Function and Its Associated Functions, INTEGERS 24 (2024), Article A45, Theorem 4, equation (32).
Uses 1
TheoremHigher-power stride series for the Dirichlet eta function#●ready to prove
Let \(q, t \ge 1\) be integers, let \(p \ge 0\) be an even integer, and let \(T_{q,t}(n)\) denote the signed stride sum. Then the partial sums
converge, as \(N \to \infty\), to \(\eta(p+t+1)\), where \(\eta(s) = \sum_{n \ge 1} (-1)^{n+1} n^{-s}\) is the Dirichlet eta function.
public theorem_wanted tendsto_strideSignedSum_dirichletEta_add (q t p : ℕ) (hq : 0 < q)
(ht : 0 < t) (hp : Even p) :
Tendsto (fun N : ℕ => ∑ n ∈ Finset.range N,
(-1 : ℝ) ^ n * (((n : ℝ) + 1) ^ (p + 1) + ((n : ℝ) + 1 + q) ^ (p + 1)) /
(((n : ℝ) + 1) * ((n : ℝ) + 1 + q)) ^ (p + 1) * strideSignedSum q t (n + 1))
atTop (𝓝 (∑' n : ℕ, (-1 : ℝ) ^ n / ((n : ℝ) + 1) ^ (p + t + 1)))
public noncomputable def strideSignedSum (q t n : ℕ) : ℝ :=
∑ i ∈ Finset.range ((n + q - 1) / q), (-1 : ℝ) ^ ((q + 1) * i) / ((n - q * i : ℕ) : ℝ) ^ t
WantedExt/NumberTheory/ZetaStrideSeriesWanted.lean:37
Sources
- Anthony Sofo and Junesang Choi, New Series Representations for the Riemann Zeta Function and Its Associated Functions, INTEGERS 24 (2024), Article A45, Theorem 5, equation (40).
Uses 1
TheoremDigamma series for the alternating stride sum#●ready to prove
Let \(q \ge 1\) and \(t \ge 1\) be integers, let \(S_{q,t}\) denote the alternating stride sum and \(\psi\) the digamma function. As \(N \to \infty\), the partial sums
converge to
public theorem_wanted tendsto_strideAlternatingSum_digamma_half (q t : ℕ) (hq : 0 < q)
(ht : 0 < t) :
Tendsto (fun N : ℕ => ((∑ n ∈ Finset.range N,
(2 * ((n : ℝ) + 1) + q) / (((n : ℝ) + 1 + 1 / 2) * ((n : ℝ) + 1 - 1 / 2 + q)) *
strideAlternatingSum q t (n + 1) : ℝ) : ℂ))
atTop (𝓝 ((∑' n : ℕ, 1 / ((n : ℂ) + 1) ^ t *
(Complex.digamma (((n : ℂ) + 1 + 1 / 2 + q) / (2 * q)) -
Complex.digamma (((n : ℂ) + 1 + 1 / 2) / (2 * q)))) / (2 * q) +
(∑' n : ℕ, 1 / ((n : ℂ) + 1) ^ t *
(Complex.digamma (((n : ℂ) + 1 - 1 / 2 + 2 * q) / (2 * q)) -
Complex.digamma (((n : ℂ) + 1 - 1 / 2 + q) / (2 * q)))) / (2 * q)))
public noncomputable def strideAlternatingSum (q t n : ℕ) : ℝ :=
∑ i ∈ Finset.range ((n + q - 1) / q), (-1 : ℝ) ^ i / ((n - q * i : ℕ) : ℝ) ^ t
WantedExt/NumberTheory/ZetaStrideSeriesWanted.lean:28
Sources
- Anthony Sofo and Junesang Choi, New Series Representations for the Riemann Zeta Function and Its Associated Functions, INTEGERS 24 (2024), Article A45, Corollary 1, equation (20).
Uses 1
TheoremClosed form of \(\sum_{n \ge 1} 1/(n^t(2n-1))\)#●ready to prove
For every integer \(t \ge 1\),
where \(\zeta\) is the Riemann zeta function.
public theorem_wanted tsum_inv_pow_mul_two_mul_sub_one (t : ℕ) (ht : 0 < t) :
((∑' n : ℕ, 1 / (((n : ℝ) + 1) ^ t * (2 * ((n : ℝ) + 1) - 1)) : ℝ) : ℂ) =
2 ^ t * Real.log 2 -
∑ j ∈ Finset.Icc 1 (t - 1), (2 : ℂ) ^ (t - 1 - j) * riemannZeta ((j : ℂ) + 1)
Sources
- Anthony Sofo and Junesang Choi, New Series Representations for the Riemann Zeta Function and Its Associated Functions, INTEGERS 24 (2024), Article A45, Corollary 1, equation (22).
Loading dependency explorer…
The dependency explorer needs JavaScript and its graph data.