Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

PR #6453: the first nineteen shifted rank bounds

Proved
Pr6453.shifted_lower

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

complexity-theoryinteger-multiplication

Nineteen of the thirty-nine rank bounds that enclose the PR #6453 moments at the tested saving t=3287019/109t = 3287019/10^9t=3287019/109. The productive ranks are bounded below at exponent 1−t1-t1−t, and the paid ranks 111 to 555 above at the same exponent. Each power is written r1+c=r eclog⁡rr^{1+c} = r\,e^{c\log r}r1+c=reclogr with c=−tc = -tc=−t, so ∣clog⁡r∣≤0.0165|c\log r| \le 0.0165∣clogr∣≤0.0165 and six terms of the exponential series enclose it to 10−1210^{-12}10−12 at the endpoints of the logarithm interval of that rank.

Preamble
import Definitions.Def_Pr6453_RankMoments
import Definitions.Def_Pr6453_Strictification

set_option autoImplicit false
Formal statement
namespace Pr6453

theorem shifted_lower :
    (1.995448411000 : ℝ) ≤ (2:ℝ)^(1 - (tested:ℝ)) ∧
      (2.989186058000 : ℝ) ≤ (3:ℝ)^(1 - (tested:ℝ)) ∧
      (3.981814361000 : ℝ) ≤ (4:ℝ)^(1 - (tested:ℝ)) ∧
      (4.973618578000 : ℝ) ≤ (5:ℝ)^(1 - (tested:ℝ)) ∧
      (5.964766571000 : ℝ) ≤ (6:ℝ)^(1 - (tested:ℝ)) ∧
      (6.955369181000 : ℝ) ≤ (7:ℝ)^(1 - (tested:ℝ)) ∧
      (7.945505141000 : ℝ) ≤ (8:ℝ)^(1 - (tested:ℝ)) ∧
      (8.935233294000 : ℝ) ≤ (9:ℝ)^(1 - (tested:ℝ)) ∧
      (16.842416867000 : ℝ) ≤ (17:ℝ)^(1 - (tested:ℝ)) ∧
      (24.736881766000 : ℝ) ≤ (25:ℝ)^(1 - (tested:ℝ)) ∧
      (32.622899312000 : ℝ) ≤ (33:ℝ)^(1 - (tested:ℝ)) ∧
      (56.247504828000 : ℝ) ≤ (57:ℝ)^(1 - (tested:ℝ)) ∧
      (71.977719478000 : ℝ) ≤ (73:ℝ)^(1 - (tested:ℝ)) ∧
      (142.647296292000 : ℝ) ≤ (145:ℝ)^(1 - (tested:ℝ)) ∧
      (1:ℝ)^(1 - (tested:ℝ)) ≤ (1.000000001000 : ℝ) ∧
      (2:ℝ)^(1 - (tested:ℝ)) ≤ (1.995448412000 : ℝ) ∧
      (3:ℝ)^(1 - (tested:ℝ)) ≤ (2.989186059000 : ℝ) ∧
      (4:ℝ)^(1 - (tested:ℝ)) ≤ (3.981814362000 : ℝ) ∧
      (5:ℝ)^(1 - (tested:ℝ)) ≤ (4.973618579000 : ℝ) := by
  sorry

end Pr6453
Source
CrocSwap/integer-mult-bounds, PR #6453, head b1a3e525793eca35c56324aa7ffd0b714cf606d4, research/p104-third-anchor-clean-mixed-root/pricing.py (moments at 1-TESTED and 1-TESTED+1/7).

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