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 ...
, a span, roof or correspondence is a generalization of the notion of
relation between two
objects of a
category. When the category has all
pullbacks (and satisfies a small number of other conditions), spans can be considered as
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 ...
s in a
category of fractions.
The notion of a span is due to
Nobuo Yoneda (1954) and
Jean Bénabou (1967).
Formal definition
A span is a
diagram
A diagram is a symbolic Depiction, representation of information using Visualization (graphics), visualization techniques. Diagrams have been used since prehistoric times on Cave painting, walls of caves, but became more prevalent during the Age o ...
of type
i.e., a diagram of the form
.
That is, let Λ be the category (-1 ← 0 → +1). Then a span in a category ''C'' is a
functor
In mathematics, specifically category theory, a functor is a Map (mathematics), mapping between Category (mathematics), categories. Functors were first considered in algebraic topology, where algebraic objects (such as the fundamental group) ar ...
''S'' : Λ → ''C''. This means that a span consists of three objects ''X'', ''Y'' and ''Z'' of ''C'' and morphisms ''f'' : ''X'' → ''Y'' and ''g'' : ''X'' → ''Z'': it is two maps with common ''domain''.
The
colimit of a span is a
pushout.
Examples
* If ''R'' is a relation between
sets ''X'' and ''Y'' (i.e. a
subset
In mathematics, a Set (mathematics), set ''A'' is a subset of a set ''B'' if all Element (mathematics), elements of ''A'' are also elements of ''B''; ''B'' is then a superset of ''A''. It is possible for ''A'' and ''B'' to be equal; if they a ...
of ''X'' × ''Y''), then ''X'' ← ''R'' → ''Y'' is a span, where the maps are the projection maps
and
.
* Any object yields the trivial span ''A'' ← ''A'' → ''A,'' where the maps are the identity.
* More generally, let
be a morphism in some category. There is a trivial span ''A'' ← ''A'' → ''B'', where the left map is the identity on ''A,'' and the right map is the given map ''φ''.
* If ''M'' is a
model category, with ''W'' the set of
weak equivalences, then the spans of the form
where the left morphism is in ''W,'' can be considered a generalised morphism (i.e., where one "inverts the weak equivalences"). Note that this is not the usual point of view taken when dealing with model categories.
Cospans
A cospan ''K'' in a category C is a functor K : Λ
op → C; equivalently, a ''contravariant'' functor from Λ to C. That is, a diagram of type
i.e., a diagram of the form
.
Thus it consists of three objects ''X'', ''Y'' and ''Z'' of C and morphisms ''f'' : ''Y'' → ''X'' and ''g'' : ''Z'' → ''X'': it is two maps with common ''codomain.''
The
limit of a cospan is a
pullback.
An example of a cospan is a
cobordism ''W'' between two
manifold
In mathematics, a manifold is a topological space that locally resembles Euclidean space near each point. More precisely, an n-dimensional manifold, or ''n-manifold'' for short, is a topological space with the property that each point has a N ...
s ''M'' and ''N'', where the two maps are the inclusions into ''W''. Note that while cobordisms are cospans, the category of cobordisms is not a "cospan category": it is not the category of all cospans in "the category of manifolds with inclusions on the boundary", but rather a
subcategory thereof, as the requirement that ''M'' and ''N'' form a partition of the boundary of ''W'' is a global constraint.
The category nCob of finite-dimensional cobordisms is a
dagger compact category. More generally, the category Span(''C'') of spans on any category ''C'' with finite limits is also dagger compact.
See also
*
Binary relation
In mathematics, a binary relation associates some elements of one Set (mathematics), set called the ''domain'' with some elements of another set called the ''codomain''. Precisely, a binary relation over sets X and Y is a set of ordered pairs ...
*
Pullback (category theory)
*
Pushout (category theory)
*
Cobordism
References
*
*
*
{{refend
Functors