Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 4.3 (used in the proof of Theorem 3.4) — ordinary-space framework conversion

Open
CatalyticTreeEval.Main.Supplement.corollary_4_3

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

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

In the binary framework of Section 4, let m>1m>1m>1, ℓ≥1\ell\ge1ℓ≥1, 0∈S0\in S0∈S, let SSS be 2-noncancelling, let U,VU,VU,V be an SSS-matching family of exact size 2ℓ2^\ell2ℓ and dimension ddd, and let the decoder for S+SS+SS+S have sparsity kkk. Assume the uniform vector and term access procedures use common space s≥log⁡2(dm)s\ge\log_2(dm)s≥log2​(dm). There is an ordinary binary machine with no catalytic storage that outputs every root bit and, for every h≥1h\ge1h≥1, uses

Sord≤Cs(dlog⁡2m+ℓ+h(L(k)+log⁡2m)+s),T≤Ct(Bk)h(2ℓ+k+d+2s)q.S_{\mathrm{ord}}\le C_s\bigl(d\log_2m+\ell+h(L(k)+\log_2m)+s\bigr),\qquad T\le C_t(Bk)^h(2^\ell+k+d+2^s)^q.Sord​≤Cs​(dlog2​m+ℓ+h(L(k)+log2​m)+s),T≤Ct​(Bk)h(2ℓ+k+d+2s)q.

The positive constants and fixed integer degree qqq are uniform over the input frames and trees for the fixed access procedures. All three ring registers, address state and emulation storage count as ordinary workspace. This result supports both Corollaries 4.9 and 4.10.

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: uniform access algorithms and common space s in the section setting → a parameterized frame, two fixed binary printers, a common bound A, and auxiliary-parameter length at most 2^(A s); reason: makes Remark 3.8 access and input-size conventions explicit; constants depend on the fixed access procedures, never on their inputs
  • encoding: log k in bookkeeping → L(k)=1+log₂(k+1); reason: equivalent for k≥2; at k=1 the extra constant is absorbed by log m since m>1
Preamble
import Definitions.Def_CatalyticTreeEval_Main_Framework

set_option autoImplicit false
Formal statement
namespace CatalyticTreeEval.Main.Supplement

theorem corollary_4_3 (F : List Bool → CatalyticTreeEval.Main.Frame) (domain : Set (List Bool))
    (MV MD : Machine) (A : ℕ) (hA : 0 < A)
    (h : ∀ a ∈ domain, (F a).valid ∧ a.length ≤ 2 ^ (A * (F a).s) ∧ (F a).access a MV MD A) :
    ∃ (M : Machine) (Cs Ct B : ℝ) (q : ℕ),
      0 < Cs ∧ 0 < Ct ∧ 0 < B ∧ 0 < q ∧
      ∀ a ∈ domain, ∀ h : ℕ, 0 < h → ∀ I : Tree (F a).l h,
      PrintsIn M (listCode ((F a).params a) ++ I.encode) (bits (F a).l I.value.val)
        (Cs * ((F a).d * log₂ (F a).m + (F a).l +
          h * (lg (F a).k + log₂ (F a).m) + (F a).s))
        (Ct * (B * (F a).k) ^ h *
          ((2 : ℝ) ^ (F a).l + (F a).k + (F a).d + (2 : ℝ) ^ (F a).s) ^ 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.3, printed p. 22 (PDF p. 24)

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