Reciprocal summability and an explicit bound from sublinear counting
ProvedXiCountedQPublished.reciprocal_summability_from_countcomplex-analysisleanriemann-xispectral-counting
Let , let , and let . Suppose every finite set of indices with has cardinality at most , for every . Then
The counting condition counts indices, including repetitions. Applied to squared zero heights, this supplies the inverse-square summability needed for canonical products and Laplace representations. The condition must be established separately for the sequence of interest.
Preamble
import Mathlib open MeasureTheory Set Filter Topology open scoped BigOperators
Formal statement
theorem XiCountedQPublished.reciprocal_summability_from_count (a : ℕ → ℝ) (ha : ∀ j, 1 ≤ a j)
(C r : ℝ) (hr : r < 1)
(hcount : ∀ y ≥ (1 : ℝ), ∀ F : Finset ℕ,
(∀ j ∈ F, a j ≤ y) → (F.card : ℝ) ≤ C*y^r) :
Summable (fun j => (a j)⁻¹) ∧ (∑' j, (a j)⁻¹) ≤ C/(1-r) := by sorrySource
Desenvolvimento RH, Ricardo Marangoni Brandao Bueno. PF28 and corrected Branches 2/3. Formalization of classical analytic tools and conditional logarithmic-Q positivity, 2026-11-16. No novelty or RH proof claimed. https://app.notion.com/p/41a98395ac6e8160a225d82e667ec8e4