Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

PR #6453: the remaining twenty shifted rank bounds

Proved
Pr6453.shifted_upper

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

complexity-theoryinteger-multiplication

The other half of the rank bounds: the paid ranks 666 to 565656 at exponent 1−t1-t1−t, and all twelve paid ranks at exponent 1−t+171-t+\tfrac171−t+71​, each bounded above. The second group has c=17−t≈0.1396c = \tfrac17 - t \approx 0.1396c=71​−t≈0.1396, so ∣clog⁡r∣≤0.7|c\log r| \le 0.7∣clogr∣≤0.7 and fourteen terms of the exponential series are used; the first group is the same as in the companion node with six terms.

Preamble
import Definitions.Def_Pr6453_RankMoments
import Definitions.Def_Pr6453_Strictification

set_option autoImplicit false
Formal statement
namespace Pr6453

theorem shifted_upper :
    (6:ℝ)^(1 - (tested:ℝ)) ≤ (5.964766572000 : ℝ) ∧
      (7:ℝ)^(1 - (tested:ℝ)) ≤ (6.955369182000 : ℝ) ∧
      (8:ℝ)^(1 - (tested:ℝ)) ≤ (7.945505142000 : ℝ) ∧
      (16:ℝ)^(1 - (tested:ℝ)) ≤ (15.854845612000 : ℝ) ∧
      (24:ℝ)^(1 - (tested:ℝ)) ≤ (23.750593201000 : ℝ) ∧
      (32:ℝ)^(1 - (tested:ℝ)) ≤ (31.637526487000 : ℝ) ∧
      (56:ℝ)^(1 - (tested:ℝ)) ≤ (55.263921597000 : ℝ) ∧
      (1:ℝ)^(1 - (tested:ℝ) + 1/7) ≤ (1.000000001000 : ℝ) ∧
      (2:ℝ)^(1 - (tested:ℝ) + 1/7) ≤ (2.203153666000 : ℝ) ∧
      (3:ℝ)^(1 - (tested:ℝ) + 1/7) ≤ (3.497140876000 : ℝ) ∧
      (4:ℝ)^(1 - (tested:ℝ) + 1/7) ≤ (4.853886076000 : ℝ) ∧
      (5:ℝ)^(1 - (tested:ℝ) + 1/7) ≤ (6.259293763000 : ℝ) ∧
      (6:ℝ)^(1 - (tested:ℝ) + 1/7) ≤ (7.704738741000 : ℝ) ∧
      (7:ℝ)^(1 - (tested:ℝ) + 1/7) ≤ (9.184351112000 : ℝ) ∧
      (8:ℝ)^(1 - (tested:ℝ) + 1/7) ≤ (10.693856903000 : ℝ) ∧
      (16:ℝ)^(1 - (tested:ℝ) + 1/7) ≤ (23.560210038000 : ℝ) ∧
      (24:ℝ)^(1 - (tested:ℝ) + 1/7) ≤ (37.397924090000 : ℝ) ∧
      (32:ℝ)^(1 - (tested:ℝ) + 1/7) ≤ (51.906763115000 : ℝ) ∧
      (56:ℝ)^(1 - (tested:ℝ) + 1/7) ≤ (98.216136531000 : ℝ) := 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