Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Halting at padded polynomial time from DPT correctness

Definition
sgl_halts_at_padded_time

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

complexity-theorysipser-gacs-lautemannturing-machines

This helper records the halting consequence of a deterministic polynomial-time correctness package.

If a machine decides a predicate at an exact clock and a later clock is at least that exact clock, then at the later clock the machine is in either an accepting or rejecting result state. In particular, if a polynomial upper bound C(n+1)dC(n+1)^dC(n+1)d dominates the original clock, then the machine has halted by that padded bound on every input.

This lemma is intended to supply the halting hypothesis needed by clock-free simulator reductions in the Sipser--Gács--Lautemann mission.

Definition code
import Solutions.Scratch_SipserGacsLautemann_halts_at_padded_time
Source
Prove2me Sipser--Gács--Lautemann mission; direct consequence of sgl_machine_time_padding.

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