Lawvere's Fixed-point Theorem
   HOME

TheInfoList



OR:

In
mathematics Mathematics is a field of study that discovers and organizes methods, Mathematical theory, theories and theorems that are developed and Mathematical proof, proved for the needs of empirical sciences and mathematics itself. There are many ar ...
, Lawvere's fixed-point theorem is an important result in
category theory Category theory is a general theory of mathematical structures and their relations. It was introduced by Samuel Eilenberg and Saunders Mac Lane in the middle of the 20th century in their foundational work on algebraic topology. Category theory ...
. It is a broad abstract generalization of many diagonal arguments in mathematics and logic, such as
Cantor's diagonal argument Cantor's diagonal argument (among various similar namesthe diagonalisation argument, the diagonal slash argument, the anti-diagonal argument, the diagonal method, and Cantor's diagonalization proof) is a mathematical proof that there are infin ...
,
Cantor's theorem In mathematical set theory, Cantor's theorem is a fundamental result which states that, for any Set (mathematics), set A, the set of all subsets of A, known as the power set of A, has a strictly greater cardinality than A itself. For finite s ...
,
Russell's paradox In mathematical logic, Russell's paradox (also known as Russell's antinomy) is a set-theoretic paradox published by the British philosopher and mathematician, Bertrand Russell, in 1901. Russell's paradox shows that every set theory that contains ...
, Gödel's first incompleteness theorem, Turing's solution to the Entscheidungsproblem, and
Tarski's undefinability theorem Tarski's undefinability theorem, stated and proved by Alfred Tarski in 1933, is an important limitative result in mathematical logic, the foundations of mathematics, and in formal semantics. Informally, the theorem states that "arithmetical truth ...
. It was first proven by
William Lawvere Francis William Lawvere (; February 9, 1937 – January 23, 2023) was an American mathematician known for his work in category theory, topos theory and the philosophy of mathematics. Biography Born in Muncie, Indiana, and raised on a farm outsi ...
in 1969.


Statement

Lawvere's theorem states that, for any
Cartesian closed category In category theory, a Category (mathematics), category is Cartesian closed if, roughly speaking, any morphism defined on a product (category theory), product of two Object (category theory), objects can be naturally identified with a morphism defin ...
\mathbf and given an object B in it, if there is a weakly point-surjective
morphism In mathematics, a morphism is a concept of category theory that generalizes structure-preserving maps such as homomorphism between algebraic structures, functions from a set to another set, and continuous functions between topological spaces. Al ...
f from some object A to the
exponential object In mathematics, specifically in category theory, an exponential object or map object is the category theory, categorical generalization of a function space in set theory. Category (mathematics), Categories with all Product (category theory), fini ...
B^A, then every endomorphism g: B \rightarrow B has a fixed point. That is, there exists a morphism b : 1 \rightarrow B (where 1 is a terminal object in \mathbf ) such that g \circ b = b.


Applications

The theorem's
contrapositive In logic and mathematics, contraposition, or ''transposition'', refers to the inference of going from a Conditional sentence, conditional statement into its logically equivalent contrapositive, and an associated proof method known as . The contrap ...
is particularly useful in proving many results. It states that if there is an object B in the category such that there is an endomorphism g: B \rightarrow B which has no fixed points, then there is no object A with a weakly point-surjective map f : A \rightarrow B^A . Some important corollaries of this are: *
Cantor's theorem In mathematical set theory, Cantor's theorem is a fundamental result which states that, for any Set (mathematics), set A, the set of all subsets of A, known as the power set of A, has a strictly greater cardinality than A itself. For finite s ...
*
Cantor's diagonal argument Cantor's diagonal argument (among various similar namesthe diagonalisation argument, the diagonal slash argument, the anti-diagonal argument, the diagonal method, and Cantor's diagonalization proof) is a mathematical proof that there are infin ...
*
Diagonal lemma In mathematical logic, the diagonal lemma (also known as diagonalization lemma, self-reference lemma or fixed point theorem) establishes the existence of self-referential sentences in certain formal theories. A particular instance of the diagonal ...
*
Russell's paradox In mathematical logic, Russell's paradox (also known as Russell's antinomy) is a set-theoretic paradox published by the British philosopher and mathematician, Bertrand Russell, in 1901. Russell's paradox shows that every set theory that contains ...
* Gödel's first incompleteness theorem *
Tarski's undefinability theorem Tarski's undefinability theorem, stated and proved by Alfred Tarski in 1933, is an important limitative result in mathematical logic, the foundations of mathematics, and in formal semantics. Informally, the theorem states that "arithmetical truth ...
*
Turing's proof Turing's proof is a proof by Alan Turing, first published in November 1936 with the title "On Computable Numbers, with an Application to the ". It was the second proof (after Church's theorem) of the negation of Hilbert's ; that is, the conjectu ...
* Löb's paradox * Roger's fixed-point theorem *
Rice's theorem In computability theory, Rice's theorem states that all non-trivial semantic properties of programs are undecidable problem, undecidable. A ''semantic'' property is one about the program's behavior (for instance, "does the program halting problem, ...


References

Category theory Mathematical theorems {{Category theory