Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Explicit-bound amplification-depth ternary scheduler

Proved
SipserGacsLautemann.ternary_amplification_scheduler_reports_base_accepts_with_explicit_bound

by Henry Yuen · Jul 24, 2026 · Mathlib c5ea003 (Lean v4.30.0)

complexity-theoryproof-engineeringturing-machines

Fix a two-tape verifier machine and explicit natural constants coefficient and degree. This theorem asserts the existence of a two-tape scheduler for the fixed amplification-depth ternary majority construction.

On input tapes (x, R), set

d=mathrmamplificationDepthConstruction(∣x∣),qquadL=3d,qquadr=∣R∣/L.d = mathrm{amplificationDepthConstruction}(|x|),qquad L = 3^d,qquad r = |R|/L.d=mathrmamplificationDepthConstruction(∣x∣),qquadL=3d,qquadr=∣R∣/L.

The scheduler returns the ternary majority over the L length-r leaves decoded from R, where each leaf vote is whether the base machine accepts the corresponding two-tape query within the explicit time

mathrmcoefficientcdot(mathrmtotalInputLength(x,R)+1)mathrmdegree.mathrm{coefficient}cdot(mathrm{totalInputLength}(x,R)+1)^{mathrm{degree}}.mathrmcoefficientcdot(mathrmtotalInputLength(x,R)+1)mathrmdegree.

This is the concrete computable-step scheduler obligation for the SGL majority-amplification construction.

Preamble
import Definitions.Def_sgl_ternary_machine_vote_data
import Definitions.Def_sgl_machine_infrastructure
Formal statement

namespace SipserGacsLautemann

theorem ternary_amplification_scheduler_reports_base_accepts_with_explicit_bound
    (states : Nat)
    (machine : Machine 2 states)
    (coefficient degree : Nat) :
    ∃ (State : Type) (_ : Fintype State)
      (scheduler : TypedMachine 2 State)
      (schedulerTime : Nat → Nat),
      PolynomiallyBounded schedulerTime ∧
        ∀ input : Fin 2 → List Bool,
          scheduler.result
              (scheduler.run input
                (schedulerTime (totalInputLength input))).state =
            some
              (let d := amplificationDepthConstruction (input 0).length
               let leafCount := 3 ^ d
               let randomBits := (input 1).length / leafCount
               ternaryVoteConstruction
                 (fun random : List Bool =>
                   @decide
                    (machine.acceptsWithin
                      (ternaryTwoTapeInput input random)
                      (coefficient *
                        (totalInputLength input + 1) ^ degree))
                    (Classical.propDecidable _))
                 d
                 (ternaryListTreeConstruction
                   randomBits d (input 1))) := by
  sorry

end SipserGacsLautemann
Source
Proof-engineering lemma for the Sipser--Gacs--Lautemann Prove2me mission; isolates the explicit-time finite scheduler construction needed for ternary majority amplification.

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