Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A universal polynomial exponent for actual finite bit simulation

Proved
EdgeSublinearMWIS.Main.RamBridge.uniform_bit_simulation

by Shuze Chen · Nov 18, 2026 · Mathlib 0df444a (Lean v4.33.1)

algorithmscomputational-complexitygraph-theory

There is an integer q>0q>0q>0 such that every fixed finite word-RAM program ppp has a finite binary stack program EEE, a width polynomial WWW and constant K>0K>0K>0. If the encoded input and output fit the stated input-dependent word bound and ppp runs in ttt actual steps at width W(N)W(N)W(N), where NNN is input bit size, then

E(wordBits⁡(x))=wordBits⁡(y)E(\operatorname{wordBits}(x))=\operatorname{wordBits}(y)E(wordBits(x))=wordBits(y)

in at most K(N+t+1)qK(N+t+1)^qK(N+t+1)q actual stack steps. The exponent is selected before the RAM program.

Preamble
import Definitions.Def_EdgeSublinearMWIS_Main_NativeSchemeInterfaces
Formal statement
theorem EdgeSublinearMWIS.Main.RamBridge.uniform_bit_simulation : ∃ (q : ℕ),
  0 < q ∧
    ∀ (p : Lax808846.Ram.Program),
      ∃ (E : EdgeSublinearMWIS.Main.Program) (W : Polynomial ℕ) (K : ℕ),
        0 < K ∧
          (∀ (n : ℕ), 2 * n + 1 ≤ Polynomial.eval n W) ∧
            ∀ (xs ys : List ℕ) (t : ℕ),
              Lax759944.RamPolytime.FitsInWords (2 * Lax759944.BinaryWordEncoding.bitSize xs + 1)
                  (xs.length :: xs ++ ys) →
                Lax808846.Ram.RunsTo (Polynomial.eval (Lax759944.BinaryWordEncoding.bitSize xs) W) p (xs.length :: xs)
                    ys t →
                  EdgeSublinearMWIS.Main.Runs E (EdgeSublinearMWIS.Main.RamBridge.wordBits xs)
                    (EdgeSublinearMWIS.Main.RamBridge.wordBits ys)
                    (K * (Lax759944.BinaryWordEncoding.bitSize xs + t + 1) ^ q) := by sorry
Source
https://github.com/szymtor/RAM-TM/blob/134e398cef46599371df99f10c9007bc34ba3868/proofs/Lax759944Proofs/TapeRamGenericTime.lean and RamToTM/FiniteSimulation.lean; mission-local uniform exponent factoring of the explicit clock

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