Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Uniform sparse printing of the explicit prime-power weight detector

Open
CatalyticTreeEval.Main.weight_detector_print

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

One finite binary machine prints a sparse presentation of the specified prime-power weight detector for every prime, exponent, target weight and positive variable count. Its work prefix is bounded by a uniform constant times p^e log2(H+1) plus log2 p. The printer must output the explicit detector used by the algebraic correctness theorem. This is the computational component of Lemma B.5.

Preamble
import Definitions.Def_CatalyticTreeEval_WeightDetector

set_option autoImplicit false
Formal statement
namespace CatalyticTreeEval.Main

/-- Uniform sparse printing is separate from the verified detector's algebraic properties. -/
theorem weight_detector_print :
    ∃ (M : Machine) (C : ℝ), 0 < C ∧
      ∀ (p e w H : ℕ), Nat.Prime p → 1 ≤ H →
        PolyPrint M (natsCode [p,e,w,H]) (weightDetector p e w H)
          (C * ((p ^ e : ℕ) * log₂ (H + 1) + log₂ p)) := by sorry

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

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