Lawvere
NOT A NOVELTY CLAIM. This is a machine-checked formalisation, checked by the Lean 4 kernel and depending on no axiom. It is dated and citable. Prior art, where it exists, is cited below. No discovery is claimed.
LAWVERE'S FIXED-POINT THEOREM. If every map A → B is described by some state, every g : B → B has a fixed point: diagonalise, find the state that describes the diagonal, and evaluate it on itself.
Proposition
{A B : Type} (f : A → A → B) (complete : ∀ h : A → B, ∃ a, f a = h) (g : B → B) : ∃ b, g b = bProof
By obtain ⟨a, ha⟩ := complete (fun x => g (f x x)) in consciousness.lean. Checked by the Lean kernel.
- Debit
lawvere— this theorem- Credit
of_decide_eq_true:∀ {p : Prop} [inst : Decidable p], decide p = true → p— the kernel itself: the statement reduces to true by computation, and the rule that turns that reduction into a proof rests on no axiom
Sources and identifiers
- Lean source · src/pair/lean/proofs/consciousness.lean
- Typeset paper · src/research/lean-theorems.tex
- Repository deposit · doi:10.5281/zenodo.21787144
- Author · ORCID 0009-0000-7312-9778