Lawvere's Fixed-Point Theorem as the Unified Source of Diagonal Arguments — E8 Intelligence Research
Year: 2026
Type: preprint
Abstract: FINDING: Lawvere's fixed-point theorem is the single categorical schema from which Cantor, Gödel, Tarski, and Turing diagonal arguments all descend as instances | MATH: Core statement — in a Cartesian closed category, if there exists a point-surjective morphism f: A → Y^A, then every endomorphism g: Y → Y has a fixed point. Contrapositive (the diagonal argument): if some g: Y → Y has no fixed point, then no such f exists. Cantor: Y = {0,1}, g = ¬ (no fixed point), A = set, Y^A = power set → no surjection A ↠ 2^A. Gödel: Y = propositions, g = negation, yields unprovable sentence. Tarski: Y = truth values, g = "not true" → no truth predicate. Turing: Y = {halt, loop}, g = flip, A = programs → no total decision function. | CONNECTION: The theorem is a *universal diagram* — the diagonal morphism Δ: A → A×A composed with evaluation is the categorical abstraction of the geometric diagonal of a square. Cantor's original 1891 argument literally uses the diagonal of an infinite matrix; Lawvere 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: W7225001449