Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Computable balanced prime-power parameters

Definition
CatalyticTreeEval_BalancedParameters

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

Choose the integer root of m times w, where m is the product of t distinct primes, and select each exponent by an integer logarithm in its prime base. The construction is fully computable. Product, degree and dimension bounds are separate theorems establishing the parameters required for Theorem 3.10.

Definition code
import Definitions.Def_CatalyticTreeEval_Main_Polynomials
import Mathlib.Analysis.SpecialFunctions.Pow.NthRootLemmas

set_option autoImplicit false

namespace CatalyticTreeEval.Main

/-- The integer root used by the uniform prime-power parameter algorithm. -/
def balancedRoot {t : ℕ} (p : Fin t → ℕ) (w : ℕ) : ℕ :=
  Nat.nthRoot t (modulus p * w)

/-- Largest powers of the individual primes below the common integer root. -/
def balancedExponents {t : ℕ} (p : Fin t → ℕ) (w : ℕ) : Fin t → ℕ :=
  fun i => Nat.log (p i) (balancedRoot p w)

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

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