classifying topos for the theory of objects


Topos Theory

topos theory



Internal Logic

Topos morphisms

Extra stuff, structure, properties

Cohomology and homotopy

In higher category theory




The classifying topos 𝒮[𝕆]\mathcal{S}[\mathbb{O}] for the theory of objects 𝕆\mathbb{O}, or the object classifier, as it is also called1, is the presheaf topos [FinSet,Set][FinSet, Set] on the opposite category of FinSet.

What motivates the terminology, is that for any topos EE, geometric morphisms E𝒮[𝕆]E \to \mathcal{S}[\mathbb{O}] correspond to objects of EE.

This is because by a standard fact geometric morphisms

EPSh(FinSet op) E \to PSh(FinSet^{op})

are equivalent to morphisms of sites

EFinSet op E \leftarrow FinSet^{op}

hence to finite limit-preserving such functors. Since finite limits in FinSet opFinSet^{op} are finite colimits in FinSet and since FinSetFinSet is generated under finite colimits from the singleton set *\ast, such functors are uniquely determined by their image of *\ast, hence by a choice of object in EE.

The construction is due to Gavin Wraith and constituted an important step towards the general theorem on the existence of classifying toposes for geometric theories in the early development of topos theory.



Generic object

The generic or universal object UU is the inclusion FinSetSetFinSet\hookrightarrow Set: every object XX of EE arises from some geometric morphism ff as Xf *(U)X\cong f^\ast(U).2

As the role of the object classifier bears some resemblance to the role of the polynomial ring k[x]k[x] over a ground ring kk that ‘classifies’ elements of k-algebras AA via AHom k(k[x],A)A\cong Hom_k(k[x], A), it is traditionally denoted 𝒮[U]\mathcal{S}[U], the ‘adjunction’ of the free (=generic) object to the base topos 𝒮\mathcal{S}, in our case SetSet.

The analogy between topos theory and algebra is pursued further in Bunge&Funk (2006) where, in the context of topos distributions and the ‘symmetric algebra’ of a topos (aka the symmetric topos), 𝒮[U]\mathcal{S}[U] is shown to play the role of the real line R\mathbf R in functional analysis.

The relative case

What concerns base toposes 𝒮\mathcal{S} other than SetSet, it is a theorem due to Andreas Blass (Blass 1989) that 𝒮\mathcal{S} has an object classifier 𝒮[𝕆]\mathcal{S}[\mathbb{O}] precisely if 𝒮\mathcal{S} has a natural number object.

A consequence of this, discussed in sec. B4.2 of (Johnstone 2002,I p.431), is that classifying toposes for geometric theories over 𝒮\mathcal{S} exist precisely if the object classifier 𝒮[𝕆]\mathcal{S}[\mathbb{O}] exists.

An alternative characterization


The classifying topos [FinSet,Set][FinSet, Set] is equivalent to the category of finitary endofunctors on Set (those that commute with filtered colimits):

[FinSet,Set]End f(Set). [FinSet, Set] \simeq End_f(Set) \,.

Because every set is the filtered colimit over its finite subsets.

The monoidal point of view

Since the category End f(Set)End(Set)End_f(Set) \hookrightarrow End(Set) of finitary monads is naturally a monoidal category under composition, this induces the structure of a (non-cartesian) monoidal category also on the classifying topos [FinSet,Set][FinSet, Set] and hence makes it a monoidal topos. A monoid with respect to this monoidal structure is equivalently a finitary monad.

A related point of view is that FinSet opFinSet^{op} is the free cartesian monoidal category generated by an object (or by the terminal category), and its free cocompletion [FinSet,Set][FinSet, Set] is the free cartesian monoidally cocomplete category generated by an object. Thus [FinSet,Set][FinSet, Set] plays the role of a cartesian analogue to [ op,Set][\mathbb{P}^{op}, Set], the free symmetric monoidally cocomplete category on an object, where =Core(FinSet)\mathbb{P} = Core(FinSet) is the core of FinSet, the permutation groupoid. And in the same way that [ op,Set][\mathbb{P}^{op}, Set] is a monoidal topos whose monoids are symmetric or permutative operads (as discussed at operad – a detailed onceptual treatment), so [FinSet,Set][FinSet, Set] is seen as a monoidal topos whose monoids are cartesian operads, aka Lawvere theories. Some material on this can be found at Towards a doctrine of operads.

The pointed object classifier

Similarly, the theory of pointed objects 𝕆 *\mathbb{O}_\ast is classified by the presheaf topos [FinSet *,Set][FinSet_\ast, Set] on the opposite FinSet * opFinSet_\ast^{op} of the category of finite pointed sets whose skeleton is Segal's category, hence [FinSet *,Set][FinSet_\ast, Set] is equivalent to the topos of “Γ\Gamma-sets”: cf. Gamma-space and for the role as a classifying space the following MO-discussion: link .3


  1. As this is not to be confused with the notion of an object classifier in an (∞,1)-topos, we prefer to call it in full the classifying topos for the theory of objects.

  2. For another remarkable property of this inclusion functor see at ultrafilter monad.

  3. More generally, classifying toposes for universal Horn theories 𝕋\mathbb{T} correspond to the respective toposes of covariant set-valued functors on the category of finitely presentable models of 𝕋\mathbb{T} (Blass&Scedrov (1983)).

Revised on September 6, 2017 04:23:14 by David Corfield (