Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 4.10 (companion theorem; not used in the proof of the goal) — optimal-vector conditional consequence

Open
CatalyticTreeEval.Main.Supplement.corollary_4_10

by mikedeng1 · Nov 15, 2026 · Mathlib 0df444a (Lean v4.33.1)

complexity-theoryp2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-v1tree-evaluation

Fix t≥2t\ge2t≥2 distinct odd primes p1,…,ptp_1,\ldots,p_tp1​,…,pt​ and their product mmm. Suppose there is a sequence of canonical-score matching families in (Zm)d(ℓ)(\mathbb Z_m)^{d(\ell)}(Zm​)d(ℓ), of exact size 2ℓ2^\ell2ℓ, such that d(ℓ)≤Cdℓlog⁡2(ℓ+2)d(\ell)\le C_d\ell\log_2(\ell+2)d(ℓ)≤Cd​ℓlog2​(ℓ+2) for all ℓ≥1\ell\ge1ℓ≥1, and one fixed printer uses at most CsℓC_s\ellCs​ℓ workspace. The sequence, printer and constants are fixed before varying ℓ\ellℓ. Then an ordinary deterministic machine evaluates every binary TreeEval instance of input length nnn with

S≤CL(n)L2(n),T≤Ct(n+1)q,S\le C L(n)L_2(n),\qquad T\le C_t(n+1)^q,S≤CL(n)L2​(n),T≤Ct​(n+1)q,

where qqq is a fixed positive integer. It prints the entire root label and has no catalytic tape. This is the conditional companion theorem corresponding to informal Theorem 1.4; it does not assert existence of the hypothesized sequence.

Differences from the source:

  • encoding: asymptotic algorithmic resource bounds → a finite binary machine and positive uniform constants, with fixed polynomial degrees where needed; reason: expands O/poly using actual transitions and visited work cells; constants precede varying inputs and tapes
  • encoding: log n, log log n and log log log n in asymptotic bounds → L(n)=1+log₂(n+1), L₂(n)=1+log₂ L(n), L₃(n)=1+log₂ L₂(n), with n the full serialized input length; reason: positive-log conventions preserve the stated asymptotics and include every small valid input
  • encoding: binary parameters and one-based finite indices → self-delimiting binary headers, zero-based Fin indices and the published printer requests; reason: encodes the same finite data with linear bit-length overhead and no change to the space class
Preamble
import Definitions.Def_CatalyticTreeEval_Main_Supplement_UniformConstructions

set_option autoImplicit false
Formal statement
namespace CatalyticTreeEval.Main.Supplement

theorem corollary_4_10 (t : ℕ) (p : Fin t → ℕ) (ht : 2 ≤ t) (hp : OddPrimeData p)
    (hQ : ∃ (Q : VectorSequence (modulus p)) (MV : Machine) (Cd Cs : ℝ),
      0 < Cd ∧ 0 < Cs ∧ OptimalSequence p Q MV Cd Cs) :
    ∃ (M : Machine) (Cs Ct : ℝ) (q : ℕ), 0 < Cs ∧ 0 < Ct ∧ 0 < q ∧
      ∀ h l : ℕ, 0 < h → 0 < l → ∀ I : Tree l h,
      PrintsIn M I.encode (bits l I.value.val)
        (Cs * lg I.encode.length * loglog I.encode.length)
        (Ct * ((I.encode.length : ℝ) + 1) ^ q) := by sorry

end CatalyticTreeEval.Main.Supplement
Source
Alexandra Henzinger, Edward Pyne, Seyoon Ragavan, Catalytic Tree Evaluation from Matching Vectors, STOC 2027 submission #533 (October 2026), canonical source.pdf SHA-256 17c3a71f0fb5afe2456558477e16fbac4200191e6e68f0facf212e24cb4ef238, Corollary 4.10, printed p. 28 (PDF p. 30)

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