Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

ZF209: a sentence represents halting in every ZF model

Open
PalomarZF209.represents209_exists

by LG · Nov 21, 2026 · Mathlib 0df444a (Lean v4.33.1)

busy-beaverpalomar-zf209turing-machinezf-independence

There is a closed sentence HHH of the language of set theory whose meaning in every nonempty model (V,E)(V,E)(V,E) of ZF\mathrm{ZF}ZF is exactly the model-internal blank-tape halting of the 209209209-state machine: under every assignment, HHH holds if and only if InternalLinkedHalts E holds.

∃H:Formula, Represents209(H).\exists H:\mathrm{Formula},\ \mathrm{Represents209}(H).∃H:Formula, Represents209(H).

This is the representation (machine-meaning) clause of the main theorem. The halting history is internally finite and may have nonstandard length, so the sentence must be correct in every model, including those with nonstandard natural numbers. It is the conclusion that the compiled halting sentence correctly expresses halting, rather than an assumption supplying an unspecified machine predicate.

Formalization Note Represents209 H requires Closed H and the equivalence eval E H s ↔ InternalLinkedHalts E for every nonempty Model E and assignment s.

Preamble
import Definitions.Def_PalomarZF209_History
import Definitions.Def_PalomarZF209_SetTheory
import Definitions.Def_PalomarZF209_Arithmetic
Formal statement
namespace PalomarZF209
theorem represents209_exists : ∃ H : Formula, Represents209 H := by sorry
end PalomarZF209
Source
https://github.com/jamesyc/BusyBeaver/blob/37861b991bb70dbaee7dbd91120ab533cba658e2/ZF209/paper/zf209.tex (Theorem 1.2, thm:main, representation clause); proof: https://github.com/jamesyc/BusyBeaver/blob/37861b991bb70dbaee7dbd91120ab533cba658e2/ZF209/ProofSources/Independence/Top.lean (haltSentence_represents)

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