Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 4.9 (used in the proof of Theorem 3.4) — parameterized and input-length ordinary bounds

Open
CatalyticTreeEval.Main.Supplement.corollary_4_9

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

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

One ordinary deterministic binary machine outputs the whole root label of every unrestricted binary TreeEval instance, for all positive h,ℓh,\ellh,ℓ. With fixed positive constants, its parameterized bounds are

S≤Cs(ℓ+hlog⁡2(ℓ+2)),T≤2Ct(ℓ+hlog⁡2(ℓ+2)).S\le C_s(\ell+h\log_2(\ell+2)),\qquad T\le2^{C_t(\ell+h\log_2(\ell+2))}.S≤Cs​(ℓ+hlog2​(ℓ+2)),T≤2Ct​(ℓ+hlog2​(ℓ+2)).

For the same machine, writing nnn for the serialized input length, the input-length bounds also hold:

S≤CsL(n)L2(n),T≤(n+1)CtL2(n).S\le C_s L(n)L_2(n),\qquad T\le(n+1)^{C_tL_2(n)}.S≤Cs​L(n)L2​(n),T≤(n+1)Ct​L2​(n).

There is no catalytic tape. Both clauses are retained; the ordinary-space clause supplies the proof of recalled Theorem 3.4.

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
Preamble
import Definitions.Def_CatalyticTreeEval_Main_Supplement_UniformConstructions

set_option autoImplicit false
Formal statement
namespace CatalyticTreeEval.Main.Supplement

theorem corollary_4_9 :
    ∃ (M : Machine) (Cs Ct : ℝ), 0 < Cs ∧ 0 < Ct ∧
      ∀ h l : ℕ, 0 < h → 0 < l → ∀ I : Tree l h,
      PrintsIn M I.encode (bits l I.value.val)
        (Cs * (l + h * log₂ (l + 2)))
        (exp₂ (Ct * (l + h * log₂ (l + 2)))) ∧
      PrintsIn M I.encode (bits l I.value.val)
        (Cs * lg I.encode.length * loglog I.encode.length)
        (((I.encode.length : ℝ) + 1) ^ (Ct * loglog I.encode.length)) := 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.9, printed p. 27 (PDF p. 29)

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