Movatterモバイル変換


[0]ホーム

URL:


nLab span

Skip the Navigation Links |Home Page |All Pages |Latest Revisions |Discuss this page |
Contents

This entry is about the notion of spans/correspondences which generalizes that ofrelations. For spans invector spaces ormodules, seelinear span.

Context

Relations

Set theory

set theory

Type theory

natural deductionmetalanguage,practical foundations

  1. type formation rule
  2. term introduction rule
  3. term elimination rule
  4. computation rule

type theory (dependent,intensional,observational type theory,homotopy type theory)

syntaxobject language

computational trinitarianism =
propositions as types +programs as proofs +relation type theory/category theory

logicset theory (internal logic of)category theorytype theory
propositionsetobjecttype
predicatefamily of setsdisplay morphismdependent type
proofelementgeneralized elementterm/program
cut rulecomposition ofclassifying morphisms /pullback ofdisplay mapssubstitution
introduction rule forimplicationcounit for hom-tensor adjunctionlambda
elimination rule forimplicationunit for hom-tensor adjunctionapplication
cut elimination forimplicationone of thezigzag identities for hom-tensor adjunctionbeta reduction
identity elimination forimplicationthe otherzigzag identity for hom-tensor adjunctioneta conversion
truesingletonterminal object/(-2)-truncated objecth-level 0-type/unit type
falseempty setinitial objectempty type
proposition,truth valuesubsingletonsubterminal object/(-1)-truncated objecth-proposition,mere proposition
logical conjunctioncartesian productproductproduct type
disjunctiondisjoint union (support of)coproduct ((-1)-truncation of)sum type (bracket type of)
implicationfunction set (intosubsingleton)internal hom (intosubterminal object)function type (intoh-proposition)
negationfunction set intoempty setinternal hom intoinitial objectfunction type intoempty type
universal quantificationindexedcartesian product (of family ofsubsingletons)dependent product (of family ofsubterminal objects)dependent product type (of family ofh-propositions)
existential quantificationindexeddisjoint union (support of)dependent sum ((-1)-truncation of)dependent sum type (bracket type of)
logical equivalencebijection setobject of isomorphismsequivalence type
support setsupport object/(-1)-truncationpropositional truncation/bracket type
n-image ofmorphism intoterminal object/n-truncationn-truncation modality
equalitydiagonal function/diagonal subset/diagonal relationpath space objectidentity type/path type
completely presented setsetdiscrete object/0-truncated objecth-level 2-type/set/h-set
setset withequivalence relationinternal 0-groupoidBishop set/setoid with itspseudo-equivalence relation an actualequivalence relation
equivalence class/quotient setquotientquotient type
inductioncolimitinductive type,W-type,M-type
higherinductionhigher colimithigher inductive type
-0-truncatedhigher colimitquotient inductive type
coinductionlimitcoinductive type
presettype withoutidentity types
set oftruth valuessubobject classifiertype of propositions
domain of discourseuniverseobject classifiertype universe
modalityclosure operator, (idempotent)monadmodal type theory,monad (in computer science)
linear logic(symmetric,closed)monoidal categorylinear type theory/quantum computation
proof netstring diagramquantum circuit
(absence of)contraction rule(absence of)diagonalno-cloning theorem
synthetic mathematicsdomain specific embedded programming language

homotopy levels

semantics

Category theory

2-Category theory

Contents

Definition

In set theory

Inset theory, aspan orcorrespondence betweensetsAA andBB is a setCC with afunctionR:CA×BR:C \to A \times B to theproduct setA×BA \times B. A span between a setAA andAA itself is adirected pseudograph, which is used to definecategories in set theory.

In dependent type theory

Independent type theory, there is a distinction between aspan, amultivalued partial function, and acorrespondence:

However, from any one of the above structures, one could get the other two structures, provided one hasidentity types anddependent pair types in the dependent type theory. Given a type familyx:AP(x)x:A \vdash P(x), letz:x:AP(x)π1(z):Az:\sum_{x:A} P(x) \vdash \pi_1(z):A andz:x:AP(x)π2(z):P(π1(z))z:\sum_{x:A} P(x) \vdash \pi_2(z):P(\pi_1(z)) be the dependent pair projections for thedependent pair typex:AP(x)\sum_{x:A} P(x).

Given typesAA,BB, andCC and spans(D,x:DgD(x):A,x:DhD(x):B)(D, x:D \vdash g_D(x):A, x:D \vdash h_D(x):B) betweenAA andBB and(E,y:EgE(y):B,y:EhE(y):C)(E, y:E \vdash g_E(y):B, y:E \vdash h_E(y):C) betweenBB andCC, there is a span

(ED,z:EDgED(z):A,z:EDhED(z):C)(E \circ D, z:E \circ D \vdash g_{E \circ D}(z):A, z:E \circ D \vdash h_{E \circ D}(z):C)

defined by

EDx:Dy:EhD(x)=BgE(y)E \circ D \coloneqq \sum_{x:D} \sum_{y:E} h_D(x) =_B g_E(y)
z:EDgED(z)gD(π1(z))z:E \circ D \vdash g_{E \circ D}(z) \coloneqq g_D(\pi_1(z))
z:EDhED(z)hE(π1(π2(π1(z))(z)))z:E \circ D \vdash h_{E \circ D}(z) \coloneqq h_E(\pi_1(\pi_2(\pi_1(z))(z)))

Given typesAA,BB, andCC and correspondencesx:A,y:BR(x,y)x:A, y:B \vdash R(x, y) andy:B,z:CS(y,z)y:B, z:C \vdash S(y, z), there is a correspondencex:A,z:C(SR)(x,z)x:A, z:C \vdash (S \circ R)(x, z) defined by

(SR)(x,z)y:BR(x,y)×S(y,z)(S \circ R)(x, z) \coloneqq \sum_{y:B} R(x, y) \times S(y, z)

In category theory

In anycategoryCC, aspan, orroof, orcorrespondence, from anobjectxx to an objectyy is adiagram of the form

sfgxy \array{ && s \\ & {}^{f}\swarrow && \searrow^{g} \\ x &&&& y }

wheress is some other object of the category. (The word “correspondence” is also sometimes used for aprofunctor.)

Thisdiagram is also called a ‘span’ because it looks like a little bridge; ‘roof’ is similar. The term ‘correspondence’ is prevalent in geometry and related areas; it comes about because a correspondence is a generalisation of a binaryrelation.

Note that a span withf=1f = 1 is just a morphism fromxx toyy, while a span withg=1g = 1 is a morphism fromyy toxx. So, a span can be thought of as a generalization of a morphism in which there is no longer any asymmetry between source and target.

A span in theopposite categoryCopC^op is called aco-span inCC.

A span that has acocone is called acoquadrable span.

Categories of spans

If the categoryCC haspullbacks, we can compose spans. Namely, given a span fromxx toyy and a span fromyy tozz:

stfghixyz \array{ && s &&&& t \\ & {}^{f}\swarrow && \searrow^{g} & & {}^{h}\swarrow && \searrow^{i} \\ x &&&& y &&&& z }

we can take a pullback in the middle:

s×ytpsptstfghixyz \array{ &&&& s \times_y t \\& && {}^{p_s}\swarrow && \searrow^{p_t} \\ && s &&&& t \\ & {}^{f}\swarrow && \searrow^{g} & & {}^{h}\swarrow && \searrow^{i} \\ x &&&& y &&&& z }

and obtain a span fromxx tozz:

s×ytfpsiptxz \array{ && s \times_y t \\ & {}^{f p_s}\swarrow && \searrow^{i p_t} \\ x &&&& z }

This way of composing spans lets us define abicategorySpan(C)(C) with:

  • objects ofCC as objects
  • spans as morphisms
  • maps between spans as 2-morphisms

This is a weak 2-category: it has a nontrivialassociator: composition of spans is not strictly associative, because pullbacks are defined only up to canonical isomorphism. Anaturally definedstrict 2-category which is equivalent toSpan(C)Span(C) is the strict 2-category oflinear polynomial functors betweenslice categories ofCC.

(Note that we must choose a specific pullback when defining the composite of a pair of morphisms inSpan(C)Span(C), if we want to obtain abicategory as traditionally defined; this requires theaxiom of choice. Otherwise we obtain a bicategory with ‘composites of morphisms defined only up to canonical iso-2-morphism’; such a structure can be modeled by ananabicategory or anopetopic bicategory?.)

We can also obtain apseudo-double category?, whoseloose structure is as above, whosetight morphisms are functions, and whose cells are commuting diagrams,

Moreover, whenCC is an arbitrary category, not necessarily having pullbacks, one can still obtain acovirtual double category. More details can be found in Section 4 ofDawson, Paré, Pronk (where the term oplax double category is used).

Properties

The 1-category of spans

LetCC be a category withpullbacks and letSpan1(C):=(Span(C))1Span_1(C) := (Span(C))_{\sim 1} be the 1-category of objects ofCC and isomorphism classes of spans between them as morphisms.

Then

Next assume thatCC is acartesian monoidal category. Then clearlySpan1(C)Span_1(C) naturally becomes amonoidal category itself, but more: then

Universal property of the bicategory of spans

We discuss theuniversal property that characterizes 2-categories of spans.

ForCC be acategory withpullbacks, write

  1. Span2(C)(Span(C))2Span_2(C) \coloneqq (Span(C))_{\sim2} for theweak 2-category of objects ofCC, spans as morphisms, and maps between spans as 2-morphisms,

  2. ηC:CSpan2(C)\eta_C: C \rightarrow Span_2(C) for the functor given by:

Now let

  1. KK be anybicategory

  2. F,G:CKF, G \,\colon\, C \rightarrow K befunctors such that every map inCC is sent to a map inKK possessing aright adjoint and satisfying theBeck-Chevalley Condition for anycommutative square inKK,

  3. α:FG\alpha \,\colon\, F \rightarrow G be anatural transformation.

Then:

Proposition

(universal property of the bicategory of spans)
The following holds:

  1. ηC\eta_C isuniversal among such functorsFF, i.e.FF as above factors asF=F^ηCF = \hat{F} \circ \eta_C for a functorF^:Span2(C)K\hat{F} \,\colon\, Span_2(C) \rightarrow K which is unique up to isomorphism.

  2. There exists a uniquelax natural transformation:α^:F^G^\hat{\alpha} \,\colon\, \hat{F} \rightarrow \hat{G} such thatα^ηC=α\hat{\alpha} \eta_C = \alpha.

  3. Letx,yx, y be objects inCC andf:xyf: x \rightarrow y be a morphism inCC. If(αx,αy)(\alpha_x, \alpha_y) induce a pseudo-map of adjointsF(f)(Ff)*G(f)(Gf)*F(f) \dashv (Ff)^* \rightarrow G(f) \dashv (Gf)^*, thenα^\hat{\alpha} is apseudonatural transformation

Furthermore, if we denotePbkPbk as the2-category of categories with pullbacks,pullback-preservingfunctors, andequifibered natural transformations andBiCatBiCat as thetricategory ofbicategories,Span():PbkBiCatSpan(-): Pbk \rightarrow BiCat is well-defined as a functor.

This is due toHermida 1999.

Limits and colimits

Since a category of spans/correspondencesCorr(𝒞)Corr(\mathcal{C}) is evidentlyequivalent to itsopposite category, it follows that to the extent thatlimits exists they are alsocolimits and vice versa.

If the underlying category𝒞\mathcal{C} is anextensive category, then thecoproduct/product inCorr(𝒞)Corr(\mathcal{C}) is given by thedisjoint union in𝒞\mathcal{C}. (See alsothis MO discussion).

More generally, everyvan Kampen colimit in𝒞\mathcal{C} is a (co)limit inCorr(𝒞)Corr(\mathcal{C}) — and conversely, this property characterizes van Kampen colimits. (Sobocinski-Heindel 11).

Relation to relations

Correspondences may be seen as generalizations ofrelations. A relation is acorrespondence which is(-1)-truncated as amorphism into thecartesian product. See atrelation and atRel for more on this.

Closure

WhenEE is alocally cartesian closed category,Span(E)Span(E) is aclosed bicategory: see there for details.

Examples

Related concepts

A category of correspondences is a refinement of a categoryRel of relations. See there for more.

References

The terminology “span” appears on page 533 of:

TheSpan(C)Span(C) construction was introduced by Jean Bénabou (as an example of a bicategory) in

  • Jean Bénabou, Introduction to Bicategories,Lecture Notes in Mathematics 47, Springer (1967), pp.1-77. (doi)

Bénabou cites an article by Yoneda (1954) for introducing the concept of span (in the category of categories).

An exposition discussing the role of spans inquantum theory:

The relationship between spans andbimodules is briefly discussed in

The relation tovan Kampen colimits is discussed in

Theuniversal property of categories of spans is due to

and further discussed in:

See also Theorem 5.2.1 and 5.3.7 of:

  • Paul Balmer, and Ivo Dell’Ambrogio.Mackey 2-functors and Mackey 2-motives.arXiv:1808.04902 (2018).

The structure of amonoidaltricategory on spans in2-categories is discussed in

Generally, an(∞,n)-category of spans is indicated in section 3.2 of

Last revised on March 25, 2025 at 14:07:56. See thehistory of this page for a list of all contributions to it.

EditDiscussPrevious revisionChanges from previous revisionHistory (70 revisions)CitePrintSource

[8]ページ先頭

©2009-2025 Movatter.jp