Documentation

Mathlib.NumberTheory.LSeries.SumCoeff

Partial sums of coefficients of L-series #

We prove several results involving partial sums of coefficients (or norm of coefficients) of L-series.

Main results #

theorem LSeriesSummable_of_sum_norm_bigO {f : } {r : } {s : } (hO : (fun (n : ) => kFinset.Icc 1 n, f k) =O[Filter.atTop] fun (n : ) => n ^ r) (hr : 0 r) (hs : r < s.re) :

If the partial sums ∑ k ∈ Icc 1 n, ‖f k‖ are O(n ^ r) for some real 0 ≤ r, then the L-series LSeries f converges at s : ℂ for all s such that r < s.re.

theorem LSeriesSummable_of_sum_norm_bigO_and_nonneg {r : } {s : } {f : } (hO : (fun (n : ) => kFinset.Icc 1 n, f k) =O[Filter.atTop] fun (n : ) => n ^ r) (hf : ∀ (n : ), 0 f n) (hr : 0 r) (hs : r < s.re) :
LSeriesSummable (fun (n : ) => (f n)) s

If f takes nonnegative real values and the partial sums ∑ k ∈ Icc 1 n, f k are O(n ^ r) for some real 0 ≤ r, then the L-series LSeries f converges at s : ℂ for all s such that r < s.re.

theorem LSeries_eq_mul_integral (f : ) {r : } (hr : 0 r) {s : } (hs : r < s.re) (hS : LSeriesSummable f s) (hO : (fun (n : ) => kFinset.Icc 1 n, f k) =O[Filter.atTop] fun (n : ) => n ^ r) :
LSeries f s = s * (t : ) in Set.Ioi 1, (∑ kFinset.Icc 1 t⌋₊, f k) * t ^ (-(s + 1))

If the partial sums ∑ k ∈ Icc 1 n, f k are O(n ^ r) for some real 0 ≤ r and the L-series LSeries f converges at s : ℂ with r < s.re, then LSeries f s = s * ∫ t in Set.Ioi 1, (∑ k ∈ Icc 1 ⌊t⌋₊, f k) * t ^ (-(s + 1)).

theorem LSeries_eq_mul_integral' (f : ) {r : } (hr : 0 r) {s : } (hs : r < s.re) (hO : (fun (n : ) => kFinset.Icc 1 n, f k) =O[Filter.atTop] fun (n : ) => n ^ r) :
LSeries f s = s * (t : ) in Set.Ioi 1, (∑ kFinset.Icc 1 t⌋₊, f k) * t ^ (-(s + 1))

A version of LSeries_eq_mul_integral where we use the stronger condition that the partial sums ∑ k ∈ Icc 1 n, ‖f k‖ are O(n ^ r) to deduce the integral representation.

theorem LSeries_eq_mul_integral_of_nonneg (f : ) {r : } (hr : 0 r) {s : } (hs : r < s.re) (hO : (fun (n : ) => kFinset.Icc 1 n, f k) =O[Filter.atTop] fun (n : ) => n ^ r) (hf : ∀ (n : ), 0 f n) :
LSeries (fun (n : ) => (f n)) s = s * (t : ) in Set.Ioi 1, (∑ kFinset.Icc 1 t⌋₊, (f k)) * t ^ (-(s + 1))

If f takes nonnegative real values and the partial sums ∑ k ∈ Icc 1 n, f k are O(n ^ r) for some real 0 ≤ r, then for s : ℂ with r < s.re, we have LSeries f s = s * ∫ t in Set.Ioi 1, (∑ k ∈ Icc 1 ⌊t⌋₊, f k) * t ^ (-(s + 1)).

theorem LSeries_tendsto_sub_mul_nhds_one_of_tendsto_sum_div {f : } {l : } (hlim : Filter.Tendsto (fun (n : ) => (∑ kFinset.Icc 1 n, f k) / n) Filter.atTop (nhds l)) (hfS : ∀ (s : ), 1 < sLSeriesSummable f s) :
Filter.Tendsto (fun (s : ) => (s - 1) * LSeries f s) (nhdsWithin 1 (Set.Ioi 1)) (nhds l)
theorem LSeries_tendsto_sub_mul_nhds_one_of_tendsto_sum_div_and_nonneg (f : ) {l : } (hf : Filter.Tendsto (fun (n : ) => (∑ kFinset.Icc 1 n, f k) / n) Filter.atTop (nhds l)) (hf' : ∀ (n : ), 0 f n) :
Filter.Tendsto (fun (s : ) => (s - 1) * LSeries (fun (n : ) => (f n)) s) (nhdsWithin 1 (Set.Ioi 1)) (nhds l)