nLab
(infinity,1)Topos

Context

(,1)-Topos Theory

(∞,1)-topos theory

Background

Definitions

Characterization

Morphisms

Extra stuff, structure and property

Models

Constructions

structures in a cohesive (∞,1)-topos

Contents

Idea

By (,1)Topos is denoted the collection of all (∞,1)-toposes. This is the (∞,1)-category-theory analog of Topos.

Definition

(,1)Topos is the (non-full) sub-(∞,1)-category of (∞,1)Cat on (∞,1)-toposes and (∞,1)-geometric morphisms between them.

Morally, this should actually be an (∞,2)-category, just as Topos is a 2-category, but since the technology of (,2)-categories is not well developed, this point of view is not often taken yet.

Properties

Existence of sites of definition

(…)

Existence of limits and colimits

We discuss existence of (∞,1)-limits and (∞,1)-colimits in (,1)Topos.

Proposition

The (,1)-category (,1)Topos has all small (,1)-colimits and functor

(,1)Topos(,1)Cat(\infty,1)Topos \to (\infty,1)Cat

preserves these.

This is HTT, prop. 6.3.2.3.

Proposition

The (,1)-category (,1)Topos has all small (,1)-colimits and the inclusion

(,1)Topos op(,1)Cat(\infty,1)Topos^{op} \to (\infty,1)Cat

sends (∞,1)-limits to (∞,1)-limits.

Propoisition

The (,1)-category (,1)Topos has filtered (∞,1)-limits and the inclusion

(,1)Topos(,1)Cat(\infty,1)Topos \to (\infty,1)Cat

preserves these.

This is HTT, prop. 6.3.3.1.

Propoisition

The (,1)-category (,1)Topos has all small (∞,1)-limits.

This is HTT, prop. 6.3.4.7.

Remark

The (,1)-limits in (,1)Topos coincide actually with the proper (,2)-limits.

This is HTT, remark 6.3.4.10.

Computation of limits and colimits

We discuss more or less explicit descriptions of (∞,1)-limits and (∞,1)-colimits in (,1)Topos.

Proposition

Let

𝒳 (g *g *) 𝒴 (f *f *) 𝒵\array{ && \mathcal{X} \\ && \downarrow^{\mathrlap{(g^* \dashv g_*)}} \\ \mathcal{Y} &\stackrel{(f^* \dashv f_*)}{\to}& \mathcal{Z} }

be a diagram of (∞,1)-toposes. Then its (∞,1)-pullback is computed, roughly, by the (∞,1)-pushout of their (∞,1)-sites of definition (see above).

More in detail: there exist (∞,1)-sites 𝒟˜, 𝒟, and 𝒞 with finite (∞,1)-limit and morphisms of sites

𝒟 g 𝒟˜ f 𝒞\array{ && \mathcal{D} \\ && \uparrow^{\mathrlap{g}} \\ \tilde \mathcal{D} &\stackrel{f}{\leftarrow}& \mathcal{C} }

such that

( 𝒳 (g *g *) 𝒴 (f *f *) 𝒵)( Sh (,1)(𝒟) (Lan g()g) Sh (,1)(𝒟˜) (Lan f()f) Sh (,1)(𝒞)).\left( \array{ && \mathcal{X} \\ && \downarrow^{\mathrlap{(g^* \dashv g_*)}} \\ \mathcal{Y} &\stackrel{(f^* \dashv f_*)}{\to}& \mathcal{Z} } \right) \,\,\, \simeq \,\,\, \left( \array{ && Sh_{(\infty,1)}(\mathcal{D}) \\ && \downarrow^{\mathrlap{(Lan_g \dashv (-)\circ g)}} \\ Sh_{(\infty,1)}(\tilde \mathcal{D}) &\stackrel{(Lan_f \dashv (-)\circ f)}{\to}& Sh_{(\infty,1)}(\mathcal{C}) } \right) \,.

Let then

𝒟˜ 𝒞𝒟 f 𝒟 g g 𝒟˜ f 𝒞(,1)Cat lex\array{ \tilde \mathcal{D} \coprod_{\mathcal{C}} \mathcal{D} &\stackrel{f'}{\leftarrow}& \mathcal{D} \\ {}^{\mathllap{g'}}\uparrow &\swArrow_{\simeq}& \uparrow^{\mathrlap{g}} \\ \tilde \mathcal{D} &\stackrel{f}{\leftarrow}& \mathcal{C} } \,\,\,\,\, \in (\infty,1)Cat^{lex}

be the (∞,1)-pushout of the underlying (∞,1)-categories in the full sub-(∞,1)-category (∞,1)Cat lex(,1)Cat of (,1)-categories with finite (,1)-limits.

Let moreover

Sh (,1)(𝒟˜ 𝒞𝒟)PSh (,1)(𝒟˜ 𝒞𝒟)Sh_{(\infty,1)}(\tilde \mathcal{D} \coprod_{\mathcal{C}} \mathcal{D}) \hookrightarrow PSh_{(\infty,1)}(\tilde \mathcal{D} \coprod_{\mathcal{C}} \mathcal{D})

be the reflective sub-(∞,1)-category obtained by localization at the class of morphisms generated by the inverse image Lan f() of the coverings of 𝒟 and the inverse image Lan g() of the coverings of 𝒟˜.

Then

Sh (,1)(𝒟˜ 𝒞𝒟) 𝒳 (g *g *) 𝒴 (f *f *) 𝒵\array{ Sh_{(\infty,1)}(\tilde \mathcal{D} \coprod_{\mathcal{C}} \mathcal{D}) &\to& \mathcal{X} \\ \downarrow &\swArrow_{\simeq}& \downarrow^{\mathrlap{(g^* \dashv g_*)}} \\ \mathcal{Y} &\stackrel{(f^* \dashv f_*)}{\to}& \mathcal{Z} }

is an (∞,1)-pullback square.

This is HTT, prop. 6.3.4.6.

References

section 6.3 in

category: category

Revised on October 31, 2012 22:18:17 by Urs Schreiber (82.169.65.155)