Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Uniform native access using computable balanced parameters

Open
CatalyticTreeEval.Main.balanced_coordinate_access

by sragavan · Nov 14, 2026 · Mathlib 0df444a (Lean v4.33.1)

A single native binary machine, fixed before the prime list, obtains the balanced exponents from the encoded primes, www and HHH and provides access to the explicit canonical coordinate vectors. For 1≤w≤H1\le w\le H1≤w≤H its addressed workspace is bounded by

C(1+log⁡2(Hw)+(mw)1/tlog⁡2(H+1)+log⁡2m).C\left(1+\log_2\binom Hw+(mw)^{1/t}\log_2(H+1)+\log_2m\right).C(1+log2​(wH​)+(mw)1/tlog2​(H+1)+log2​m).

The chosen coordinate indexings are actual enumerations satisfying the canonical indexing interface. This is the remaining uniform computational construction for Theorem 3.10.

Preamble
import Definitions.Def_CatalyticTreeEval_BalancedParameters
import Definitions.Def_CatalyticTreeEval_CanonicalCoordinates

set_option autoImplicit false
Formal statement
namespace CatalyticTreeEval.Main

theorem balanced_coordinate_access :
    ∃ (M : Machine) (C : ℝ), 0 < C ∧
      ∀ (t : ℕ) (p : Fin t → ℕ) (w H : ℕ) (hp : PrimeData p),
      1 ≤ w → w ≤ H →
      ∃ I : CanonicalIndexing H w (delta p (balancedExponents p w)),
        VectorAccess M (primeCode p ++ natsCode [w,H])
          (canonicalCoefficientVectors p (balancedExponents p w) hp w H I)
          (canonicalEvaluationVectors p (balancedExponents p w) w H I)
          (C * (1 + log₂ (H.choose w) +
            ((modulus p * w : ℕ) : ℝ) ^ (1 / (t : ℝ)) * log₂ (H + 1) + log₂ (modulus p))) := by sorry

end CatalyticTreeEval.Main
Source
Henzinger, Pyne and Ragavan, Catalytic Tree Evaluation from Matching Vectors, https://arxiv.org/html/2602.14320v3, Theorem 3.10.

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