Misplaced Pages

In category theory, a point-surjective morphism is a morphism ${\displaystyle f:X\rightarrow Y}$ that "behaves" like surjections on the category of sets.

The notion of point-surjectivity is an important one in Lawvere's fixed-point theorem, and it first was introduced by William Lawvere in his original article.

Definition

Point-surjectivity

In a category ${\displaystyle \mathbf {C} }$ with a terminal object ${\displaystyle 1}$, a morphism ${\displaystyle f:X\rightarrow Y}$ is said to be point-surjective if for every morphism ${\displaystyle y:1\rightarrow Y}$, there exists a morphism ${\displaystyle x:1\rightarrow X}$ such that ${\displaystyle f\circ x=y}$.

Weak point-surjectivity

If ${\displaystyle Y}$ is an exponential object of the form ${\displaystyle B^{A}}$ for some objects ${\displaystyle A,B}$ in ${\displaystyle \mathbf {C} }$, a weaker (but technically more cumbersome) notion of point-surjectivity can be defined.

A morphism ${\displaystyle f:X\rightarrow B^{A}}$ is said to be weakly point-surjective if for every morphism ${\displaystyle g:A\rightarrow B}$ there exists a morphism ${\displaystyle x:1\rightarrow X}$ such that, for every morphism ${\displaystyle a:1\rightarrow A}$, we have

${\displaystyle \epsilon \circ \langle f\circ x,a\rangle =g\circ a}$

where ${\displaystyle \langle -,-\rangle :A\rightarrow B\times C}$ denotes the product of two morphisms (${\displaystyle A\rightarrow B}$ and ${\displaystyle A\rightarrow C}$) and ${\displaystyle \epsilon :B^{A}\times A\rightarrow B}$ is the evaluation map in the category of morphisms of ${\displaystyle \mathbf {C} }$.

Equivalently, one could think of the morphism ${\displaystyle f:X\rightarrow B^{A}}$ as the transpose of some other morphism ${\displaystyle {\tilde {f}}:X\times A\rightarrow B}$. Then the isomorphism between the hom-sets ${\displaystyle \mathrm {Hom} (X\times A,B)\cong \mathrm {Hom} (X,B^{A})}$ allow us to say that ${\displaystyle f}$ is weakly point-surjective if and only if ${\displaystyle {\tilde {f}}}$ is weakly point-surjective.

Relation to surjective functions in Set

Set elements as morphisms from terminal objects

In the category of sets, morphisms are functions and the terminal objects are singletons. Therefore, a morphism ${\displaystyle a:1\rightarrow A}$ is a function from a singleton ${\displaystyle \{x\}}$ to the set ${\displaystyle A}$: since a function must specify a unique element in the codomain for every element in the domain, we have that ${\displaystyle a(x)\in A}$ is one specific element of ${\displaystyle A}$. Therefore, each morphism ${\displaystyle a:1\rightarrow A}$ can be thought of as a specific element of ${\displaystyle A}$ itself.

For this reason, morphisms ${\displaystyle a:1\rightarrow A}$ can serve as a "generalization" of elements of a set, and are sometimes called global elements.

Surjective functions and point-surjectivity

With that correspondence, the definition of point-surjective morphisms closely resembles that of surjective functions. A function (morphism) ${\displaystyle f:X\rightarrow Y}$ is said to be surjective (point-surjective) if, for every element ${\displaystyle y\in Y}$ (for every morphism ${\displaystyle y:1\rightarrow Y}$), there exists an element ${\displaystyle x\in X}$ (there exists a morphism ${\displaystyle x:1\rightarrow X}$) such that ${\displaystyle f(x)=y}$ ( ${\displaystyle f\circ x=y}$).

The notion of weak point-surjectivity also resembles this correspondence, if only one notices that the exponential object ${\displaystyle B^{A}}$ in the category of sets is nothing but the set of all functions ${\displaystyle f:A\rightarrow B}$.

References

1. Lawvere, Francis William (1969). "Diagonal arguments and Cartesian closed categories". Category Theory, Homology Theory and their Applications II (Lecture Notes in Mathematics, vol 92). Berlin: Springer.
2. Lawvere, William (2006). "Diagonal arguments and cartesian closed categories with author commentary". Reprints in Theory and Applications of Categories (15): 1–13.
3. Abramsky, Samso (2015). "From Lawvere to Brandenburger–Keisler: Interactive forms of diagonalization and self-reference". Journal of Computer and System Sciences. 81 (5): 799–812. arXiv:1006.0992. doi:10.1016/j.jcss.2014.12.001.
4. Reinhart, Tobias; Stengle, Sebastian. "Lawvere's Theorem" (PDF). Universität Innsbruck.
5. Frumin, Dan; Massas, Guillaume. "Diagonal Arguments and Lawvere's Theorem" (PDF). Retrieved 9 February 2024.

v t e Category theory
Key concepts Key concepts Category Abelian Additive Concrete Pre-abelian Preadditive Bicategory Adjoint functors CCC Commutative diagram End Exponential Functor Kan extension Morphism Natural transformation Universal property Yoneda lemma Universal constructions Limits Terminal objects Products Equalizers Kernels Pullbacks Inverse limit Colimits Initial objects Coproducts Coequalizers Cokernels and quotients Pushout Direct limit Algebraic categories Sets Relations Magmas Groups Abelian groups Rings (Fields) Modules (Vector spaces) Constructions on categories Free category Functor category Kleisli category Opposite category Quotient category Product category Comma category Subcategory
Higher category theory Key concepts Categorification Enriched category Higher-dimensional algebra Homotopy hypothesis Model category Simplex category String diagram Topos n-categories Weak n-categories Bicategory (pseudofunctor) Tricategory Tetracategory Kan complex ∞-groupoid ∞-topos Strict n-categories 2-category (2-functor) 3-category Categorified concepts 2-group 2-ring En-ring (Traced)(Symmetric) monoidal category n-group n-monoid
Category Outline Glossary

• Category theory
• Morphisms