Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

PR #6453: the three tail ratios of the strictification

Proved
Pr6453.tail_ratios

by gustasmickus · Nov 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

complexity-theoryinteger-multiplication

The three tail ratios of the PR #6453 strictification satisfy the bounds the certificate asks for: α<1−10−29\alpha < 1 - 10^{-29}α<1−10−29, γ<3132\gamma < \tfrac{31}{32}γ<3231​ and δ<3132\delta < \tfrac{31}{32}δ<3231​.

With the shifted moments enclosed (T(1−t)≥183876.163374T(1-t) \ge 183876.163374T(1−t)≥183876.163374, P(1−t)≤183876.163305P(1-t) \le 183876.163305P(1−t)≤183876.163305, P(1−t+17)≤242327.543574P(1-t+\tfrac17) \le 242327.543574P(1−t+71​)≤242327.543574) and the split bounded from below by 121/7≥1.4112^{1/7} \ge 1.41121/7≥1.41 and 12t≥112^t \ge 112t≥1, the three ratios come out at α≤0.99999999963\alpha \le 0.99999999963α≤0.99999999963, γ≤0.92408\gamma \le 0.92408γ≤0.92408 and δ≤0.95735\delta \le 0.95735δ≤0.95735, clearing their thresholds by factors 3.7×10193.7\times10^{19}3.7×1019, 1.051.051.05 and 1.011.011.01. The α\alphaα bound is the tight one in absolute terms: its margin above one is 6.9×10−106.9\times10^{-10}6.9×10−10, which is why the moments had to be enclosed at the tested saving rather than at the claimed one.

Preamble
import Definitions.Def_Pr6453_RankMoments
import Definitions.Def_Pr6453_Strictification
import Definitions.Def_Pr6453_TailRatiosFixed
import Theorems.Thm_Pr6453_shifted_lower
import Theorems.Thm_Pr6453_shifted_upper

set_option autoImplicit false
Formal statement
namespace Pr6453

theorem tail_ratios :
    alpha2 < 1 - (reserve : ℝ) ∧ gammaTail2 < (decay : ℝ) ∧ deltaTail2 < (decay : ℝ) := by
  sorry

end Pr6453
Source
CrocSwap/integer-mult-bounds, PR #6453, head b1a3e525793eca35c56324aa7ffd0b714cf606d4, research/p104-third-anchor-clean-mixed-root/pricing.py: need(alpha[1] < 1-reserve and gamma[1] < decay and delta[1] < decay, 'All charged tail ratios').

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