nLab (infinity,1)-equalizer

Context

(,1)(\infty,1)-Category theory

Internal (,1)(\infty,1)-Categories

Directed homotopy type theory

Limits and colimits

Contents

Idea

An (,1)(\infty,1)-equalizer is a limit in an (∞,1)-category 𝒞\mathcal{C} over a diagram of shape

{ab}𝒞. \{ a \rightrightarrows b\} \to \mathcal{C} \,.

In other words it is a cone

{eq(a,b)ab}𝒞. \{\mathrm{eq}(a, b) \to a \rightrightarrows b\} \to \mathcal{C} \,.

which is universal among all such cones in the (,1)(\infty,1)-categorical sense.

This is the analog in (∞,1)-category theory of the notion of equalizer in category theory.

Incarnations

In model categories

In simplicial type theory

For Segal types

In simplicial type theory, the Segal types are the types that represent (infinity,1)-precategories. Let AA be a type in simplicial type theory, and let x:Ax:A and y:Ay:A be two elements in AA and let f:hom A(x,y)f:\mathrm{hom}_A(x, y) and g:hom A(x,y)g:\mathrm{hom}_A(x, y) be two morphisms from xx to yy. The (,1)(\infty,1)-equalizer of ff and gg is an tuple consisting of

  • an element eq(f,g):A\mathrm{eq}(f, g):A,

  • a morphism out(f,g):hom A(eq(f,g),x)\mathrm{out}(f, g):\mathrm{hom}_A(\mathrm{eq}(f, g), x),

  • and a morphism compout(f,g):hom A(eq(f,g),y)\mathrm{compout}(f, g):\mathrm{hom}_A(\mathrm{eq}(f, g), y)

such that

fout(f,g)=compout(f,g)andgout(f,g)=compout(f,g)f \circ \mathrm{out}(f, g) = \mathrm{compout}(f, g) \qquad \mathrm{and} \qquad g \circ \mathrm{out}(f, g) = \mathrm{compout}(f, g)
  • and for any other element z:Az:A with morphisms h:hom A(z,x)h:\mathrm{hom}_A(z, x) and k:hom A(z,y)k:\mathrm{hom}_A(z, y) such that fh=kf \circ h = k and gh=kg \circ h = k, there exists a unique morphism l(z,h,k):hom A(z,eq(f,g))l(z, h, k):\mathrm{hom}_A(z, \mathrm{eq}(f, g)) such that
    h=out(f,g)l(z,h,k)andk=compout(f,g)l(z,h,k)h = \mathrm{out}(f, g) \circ l(z, h, k) \qquad \mathrm{and} \qquad k = \mathrm{compout}(f, g) \circ l(z, h, k)

For arbitrary types

The notion of an (,1)(\infty,1)-equalizer can be generalised from Segal types to arbitrary types in simplicial type theory, which represent simplicial infinity-groupoids. In a Segal type AA, given morphisms f:hom A(x,y)f:\mathrm{hom}_A(x, y), g:hom A(y,z)g:\mathrm{hom}_A(y, z), and h:hom A(x,z)h:\mathrm{hom}_A(x, z), gf=hg \circ f = h if and only if hh is the unique composite of ff and gg. This means that we can use the latter condition in the definition of an (,1)(\infty,1)-equalizer in types which are not Segal and thus do not have a composition function on morphisms.

Thus, let AA be a type in simplicial type theory, and let x:Ax:A and y:Ay:A be two elements in AA and let f:hom A(x,y)f:\mathrm{hom}_A(x, y) and g:hom A(x,y)g:\mathrm{hom}_A(x, y) be two morphisms from xx to yy. The (,1)(\infty,1)-equalizer of ff and gg is an tuple consisting of

  • an element eq(f,g):A\mathrm{eq}(f, g):A,

  • a morphism out(f,g):hom A(eq(f,g),x)\mathrm{out}(f, g):\mathrm{hom}_A(\mathrm{eq}(f, g), x),

  • and a morphism compout(f,g):hom A(eq(f,g),y)\mathrm{compout}(f, g):\mathrm{hom}_A(\mathrm{eq}(f, g), y)

such that

  • compout(f,g)\mathrm{compout}(f, g) is the unique composite of ff and out(f,g)\mathrm{out}(f, g) and the unique composite of gg and out(f,g)\mathrm{out}(f, g),

  • and for any other element z:Az:A with morphisms h:hom A(z,x)h:\mathrm{hom}_A(z, x) and k:hom A(z,y)k:\mathrm{hom}_A(z, y) such that kk is the unique composite of ff and hh and the unique composite of gg and hh, there exists a unique morphism l(z,h,k):hom A(z,eq(f,g))l(z, h, k):\mathrm{hom}_A(z, \mathrm{eq}(f, g)) such that hh is the unique composite of out(f,g)\mathrm{out}(f, g) and l(z,h,k)l(z, h, k) and kk is the unique composite of compout(f,g)\mathrm{compout}(f, g) and l(z,h,k)l(z, h, k).

The fact that this definition works for any type AA implies that (,1)(\infty,1)-equalizers should be definable in any simplicial infinity-groupoid or simplicial object in an (infinity,1)-category, not just the (,1)(\infty,1)-categories or category objects in an (infinity,1)-category.

References

(,1)(\infty,1)-equalizers are defined in:

Last revised on April 11, 2025 at 09:50:43. See the history of this page for a list of all contributions to it.