Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

StripReprR1 certificate definitions

Definition
ArdaRH65K_Turing121_StripReprR1

by Johan Mercedes · Oct 28, 2026 · Mathlib 0df444a (Lean v4.33.1)

arda-rh65k-transfernumber-theoryriemann-zeta

This bundle provides the auxiliary coefficients and complex powers for that strip representation. Let D\mathcal DD be the set of declarations it provides. Among its named definitions are

D⊇{ZeroFreeBridge.cOne,  ZeroFreeBridge.fPow}.\mathcal D\supseteq\{\mathtt{ZeroFreeBridge.cOne},\;\mathtt{ZeroFreeBridge.fPow}\}.D⊇{ZeroFreeBridge.cOne,ZeroFreeBridge.fPow}.

The accompanying theorems establish the mathematical properties of these definitions.

Definition code
import Definitions.Def_ArdaRH65K_Turing121_StripRepr
import Mathlib
/- (R1) DISCHARGE for `zeta_fract_repr_of` -- THE HARD ONE, WORK IN PROGRESS.

   The fractional-part representation on `Re s > 1`:

       riemannZeta s = s/(s-1) - s · ∫_{x>1} {x} x^{-(s+1)} dx  =  stripRHS s.

   Mathlib v4.32.0 has NO such representation (confirmed), so it is built by Abel
   summation (`tendsto_sum_mul_atTop_nhds_one_sub_integral₀`) applied to
   `f x = x^{-s}`, `c 0 = 0`, `c (n+1) = 1`:

     ∑_{k≤n} k^{-s}  →  0 - ∫_{t>1} (-s·t^{-s-1})·⌊t⌋ dt  =  s∫_{t>1} ⌊t⌋ t^{-s-1} dt,
     ⌊t⌋ = t - {t},  s∫_{t>1} t^{-s} dt = s/(s-1)   ⟹   ζ(s) = s/(s-1) - s∫_{t>1}{t}t^{-s-1}.

   STATUS: FULLY ASSEMBLED, CI-green -- no `sorry`. The five analytic Abel-summation
   hypotheses (hf_diff, hf_int, h_lim, hg_dom, hg_int) are discharged on `Re s > 1`
   via a shared derivative helper `hasDerivAt_fPow` and the partial-sum `sum_cOne`;
   part (A) `tendsto_partialSum_zeta` identifies the LHS limit as `riemannZeta s`
   (Complex.summable_one_div_nat_cpow + zeta_eq_tsum... + hasSum_nat_add_iff reindex);
   part (B) evaluates the RHS limit value = `stripRHS s` (⌊t⌋ = t - {t} split,
   `∫_{Ioi 1}(↑t)^{-s} = 1/(s-1)` via integral_Ioi_cpow_of_lt). This discharges the
   R1 input of `zeta_fract_repr_of`. conjecture1_proved = False.
-/


open MeasureTheory Filter Topology Set

namespace ZeroFreeBridge

/-- Coefficients `c 0 = 0`, `c n = 1` for `n ≥ 1`. -/
 noncomputable def cOne : ℕ → ℂ := fun n => if n = 0 then 0 else 1

/-- The summand base `f x = x^{-s}`. -/
 noncomputable def fPow (s : ℂ) : ℝ → ℂ := fun x => (x : ℂ) ^ (-s)











end ZeroFreeBridge


def ArdaRH65K_Turing121_StripReprR1 : Nat := 0
Source
https://github.com/DrMurphyIsIn/Arda/blob/af4fde8972eb6d4e78c7d9a95933b18b81adf52d/telperion/examples/zero_free_bridge/lean/StripReprR1.lean

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me