Lawvere's Fixed-Point Theorem as the Universal Diagonal Argument — E8 Intelligence Research
Year: 2026
Type: preprint
Abstract: FINDING: Lawvere's fixed-point theorem is the universal categorical abstraction of all diagonal arguments — Cantor, Russell, Gödel, Tarski, Turing, and the halting problem are all instances of one construction in a Cartesian closed category. MATH: - Setup: A Cartesian closed category **C** with a morphism f: A → B^A (a "point-surjective" map onto the exponential object). - Theorem: If f: A → B^A is point-surjective (i.e., every g: A → B factors as g = eval ∘ ⟨f(a), −⟩ for some a ∈ A), then every endomorphism e: B → B has a fixed point. - Contrapositive (the useful form): If B has an endomorphism with no fixed point, then no such point-surjective f exists. - Diagonal morphism: d = eval ∘ ⟨f, id_A⟩ : A → B, then compose with e: B → B to get e ∘ d, which must equal eval ∘ ⟨f(a*), −⟩ for some a*, yielding e(d(a*)) = d(a*) — a fixed point. - Instances: - Cantor: B = {0,1}, e = ¬ (no fixed point) ⇒ no surjection A → 2^A. - Russell: B = Ω (subobject classifier), e = ¬. - Gödel: B = t Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
Author: Caldin, Andrew Stewart
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7225196537