Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Stable precision parameters exist below unit noise

Proved
Couret.STROBO2TORS.recoh_stable_precision_parameters_exist

by alexcour · Nov 8, 2026 · Mathlib c5ea003 (Lean v4.30.0)

couret-programmecouret-unification-20261108

For rational xxx, define ex(n)=x(x2)n/(1−x2)e_x(n)=x(x^2)^n/(1-x^2)ex​(n)=x(x2)n/(1−x2). Put ax(n)=∑k<n(−1)kx2k+1/(2k+1)a_x(n)=\sum_{k<n}(-1)^kx^{2k+1}/(2k+1)ax​(n)=∑k<n​(−1)kx2k+1/(2k+1), πn=16a1/5(n)−4a1/239(n)\pi_n=16a_{1/5}(n)-4a_{1/239}(n)πn​=16a1/5​(n)−4a1/239​(n), pn=16e1/5(n)+4e1/239(n)p_n=16e_{1/5}(n)+4e_{1/239}(n)pn​=16e1/5​(n)+4e1/239​(n), tn=2⋅8n/n!t_n=2\cdot8^n/n!tn​=2⋅8n/n!, and Em,n=2pm+tnE_{m,n}=2p_m+t_nEm,n​=2pm​+tn​. All are rational and are interpreted as real where limits are stated. For every rational ε<1\varepsilon<1ε<1, there exist m,n∈Nm,n\in\mathbb Nm,n∈N with

m≥1,∣πm∣≤4,n≥15,3Em,n≤(1−ε)/4.m\ge1,\quad|\pi_m|\le4,\quad n\ge15,\quad3E_{m,n}\le(1-\varepsilon)/4.m≥1,∣πm​∣≤4,n≥15,3Em,n​≤(1−ε)/4.
Preamble
import Definitions.Def_Couret_RecohRationalRoots_2e1442988636
import Mathlib.Analysis.Complex.Norm
import Mathlib.Analysis.Real.Pi.Bounds
import Mathlib.Analysis.SpecialFunctions.Complex.Arctan
import Mathlib.Analysis.SpecialFunctions.Trigonometric.Bounds
import Mathlib.Analysis.SpecificLimits.Normed
import Mathlib.Tactic
import Mathlib.Tactic.Linarith
import Mathlib.Tactic.NormNum
import Mathlib.Tactic.Positivity
import Mathlib.Tactic.Ring
import Mathlib.Topology.Algebra.Order.Floor
import Theorems.Thm_Couret_STROBO2TORS_recoh_pi_partial_eventually_abs_le_four
import Definitions.Def_Couret_RecohRationalRoots_2e1442988636
import Mathlib.Topology.Algebra.Order.Floor

set_option autoImplicit false

/-!
Existence of finite rational precision certificates for every positive error
budget.  These theorems concern the explicit error expressions checked by
the decoder.  They do not assert refinement of the Python precision-search
loop or of its JSON interface.
-/

namespace Couret.STROBO2TORS

open Filter Topology















Formal statement

theorem recoh_stable_precision_parameters_exist (epsilon : ℚ) (hepsilon : epsilon < 1) :
    ∃ m n : ℕ, 1 ≤ m ∧ |recohPiPartial m| ≤ 4 ∧ 15 ≤ n ∧
      3 * recohRationalPhaseError m n ≤ (1 - epsilon) / 4 := by sorry


end Couret.STROBO2TORS

Source
Alexandre Couret, https://github.com/alexcour/couret-finite-verifications/blob/eb7323762a9fa64f54f95ea7aa2981dee0ba54af/research/strobo-2tors-2026-10-12/lean/RecohStablePrecision.lean#L90-L97, lines 90–97; source file SHA-256 75737fd29409c44da0d31022f86d5e77f03903b260a104075e16bef2fff8543d; theorem Couret.STROBO2TORS.recoh_stable_precision_parameters_exist

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