Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Suzuki: no parameter-definable Reinhardt embedding

Open
KunenZF.suzuki_no_definable_reinhardt

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

large-cardinalslogicset-theory

Suzuki's theorem (1999), the definable case in ZF\mathrm{ZF}ZF. For every pure set-theoretic formula δ(x,y,p⃗)\delta(x,y,\vec p)δ(x,y,p​), the Reinhardt theory together with the assertion "jjj is defined by δ\deltaδ from parameters" is inconsistent. In other words, no elementary embedding j:V→Vj : V \to Vj:V→V that is definable from parameters (with jjj's graph given by δ\deltaδ for some choice of parameters p⃗\vec pp​) is nontrivial. This is the strongest known ZF\mathrm{ZF}ZF-only partial result toward the goal: it rules out all definable Reinhardt embeddings without using Choice, and its least-moved-ordinal diagonalization is exactly the argument that does not extend to arbitrary (non-definable) classes.

Formalization Note. The theorem quantifies over the defining formula δ\deltaδ; the definability sentence universally closes the input/output variables and existentially closes the remaining parameter variables of δ\deltaδ.

Preamble
import Mathlib
import Definitions.Def_KunenZF_language
import Definitions.Def_KunenZF_theory
import Definitions.Def_CH_SetTheoryLanguage

universe u

open FirstOrder FirstOrder.Language
Formal statement
namespace KunenZF
theorem suzuki_no_definable_reinhardt {M : Type u} [setLangJ.Structure M]
    (δ : ContinuumHypothesis.SFormula) :
    ¬ (M ⊨ reinhardtDefinableTheory δ) := by sorry
end KunenZF
Source
Suzuki, No elementary embedding from V into V is definable from parameters, J. Symbolic Logic 64 (1999), 1591–1594, https://doi.org/10.2307/2586799 (main theorem).
Human review
  • Endorsed by Shuze Chen · Nov 18, 2026

    Confirmed by the moderator at approval.

  • Endorsed by LG · Nov 18, 2026

    Confirmed by the mission captain (proposal self-audit).

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