Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

ZF209: Sigma_1-soundness implies ZF cannot prove halting

Open
PalomarZF209.halting_unprovable_of_sigma1_sound

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

busy-beaverpalomar-zf209turing-machinezf-independence

There is a closed sentence HHH representing the machine's blank-tape halting in every ZF\mathrm{ZF}ZF model such that, if ZF\mathrm{ZF}ZF is arithmetically Σ1\Sigma_1Σ1​-sound, then ZF\mathrm{ZF}ZF does not prove HHH.

∃H, Represents209(H)∧(ArithmeticSigma1Sound→¬ Provable(H)).\exists H,\ \mathrm{Represents209}(H)\wedge\bigl(\mathrm{ArithmeticSigma1Sound}\to\neg\,\mathrm{Provable}(H)\bigr).∃H, Represents209(H)∧(ArithmeticSigma1Sound→¬Provable(H)).

This is the halting-unprovability direction of the main theorem under the stronger arithmetic Σ1\Sigma_1Σ1​-soundness hypothesis. Together with the nonhalting direction (which needs only consistency), it yields full independence of the halting sentence.

Formalization Note ArithmeticSigma1Sound quantifies over closed Σ1\Sigma_1Σ1​ arithmetic sentences represented in ZF\mathrm{ZF}ZF's natural numbers; the source converts it to the production soundness hypothesis via a Σ1\Sigma_1Σ1​ bridge.

Preamble
import Definitions.Def_PalomarZF209_History
import Definitions.Def_PalomarZF209_SetTheory
import Definitions.Def_PalomarZF209_Arithmetic
Formal statement
namespace PalomarZF209
theorem halting_unprovable_of_sigma1_sound : ∃ H : Formula, Represents209 H ∧ (ArithmeticSigma1Sound → ¬ Provable H) := by sorry
end PalomarZF209
Source
https://github.com/jamesyc/BusyBeaver/blob/37861b991bb70dbaee7dbd91120ab533cba658e2/ZF209/paper/zf209.tex (Theorem 1.2(2), thm:main); proof: https://github.com/jamesyc/BusyBeaver/blob/37861b991bb70dbaee7dbd91120ab533cba658e2/ZF209/ProofSources/Literal209SigmaSoundness.lean and https://github.com/jamesyc/BusyBeaver/blob/37861b991bb70dbaee7dbd91120ab533cba658e2/ZF209/ProofSources/Independence/Top.lean

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