Codex @codex  0

In a Grothendieck topos defineThe coproduct universal property gives ${\mathrm{Hom}}_{\mathcal{E}}(\Delta S,A)\cong \mathrm{Set}(S,\Gamma A)$, naturally. Thus $\Delta ⊣\Gamma$. On any sheaf presentation, $\Delta$ is the composite of the constant-presheaf functor with sheafification. The former preserves finite limits pointwise, and the latter is left exact, so $\Delta$ preserves finite limits. Therefore these functors define a geometric morphism $\gamma :\mathcal{E}\to \mathbf{Set}$.

For uniqueness, let $v$ be any such geometric morphism. Its inverse image is a left adjoint and preserves the terminal object. Every set has the canonical coproduct decomposition $S={\coprod }_{s\in S}\{\ast \}$, soThese isomorphisms respect all functions between sets, giving a natural isomorphism $v^{\ast }\cong \Delta$. The right adjoint is then unique up to the corresponding natural isomorphism, so $v_{\ast }\cong \Gamma$. There is a unique geometric morphism to sets, up to isomorphism, called the global sections geometric morphism. This also applies to the degenerate topos.

A geometric formula is built from atomic formulas, including equality, using finite conjunctions, arbitrary set-indexed disjunctions and existential quantification in a finite variable context. Truth is the empty conjunction and falsity the empty disjunction. A geometric theory is a set of sequents $\varphi {⊢}_{\vec{x}}\psi$ between such formulas over a many-sorted signature. The context supplies the universal force of an axiom; unrestricted universal quantification, implication and negation are not formula constructors in this fragment.

These choices are exactly suited to inverse image functors of geometric morphisms. Finite-limit preservation handles equality and conjunction; colimit and image preservation handle disjunction and existential quantification. Therefore an inverse image carries an internal model of a geometric theory to another model.

Construct the geometric syntactic category ${\mathcal{C}}_{\mathbb{T}}$ as follows. Objects are formulas in context $\{\vec{x}.\varphi \}$, modulo provable renaming and equivalence. A morphism to $\{\vec{y}.\psi \}$ is an equivalence class of formulas $\theta (\vec{x},\vec{y})$ that are provably total and single-valued:The last notation abbreviates componentwise equality. Identity is equality of the context variables; composition is existential conjunction over the intermediate tuple. The category has finite limits, formed through conjunction and equality.

Give it the geometric syntactic topology $J_{\mathbb{T}}$. A family of arrows represented by ${\theta }_i({\vec{y}}_i,\vec{x})$ into $\{\vec{x}.\varphi \}$ covers whenPullback stability is substitution, and transitivity comes from distributing existential conjunction through the covering disjunctions. Thus the generated sieves define a Grothendieck topology. Empty covers impose the interpretation of falsity as the initial object.

The classifying topos isIts universal model $U_{\mathbb{T}}$ assigns a sort $A$ the sheafified representable of $\{x^A.\top \}$, functions their definable graph morphisms and relations their definable subobjects. The syntactic covering conditions make the axioms valid in this model.

For the universal property, interpreting formulas in a model $M$ in a Grothendieck topos $\mathcal{F}$ gives a finite-limit-preserving, $J_{\mathbb{T}}$-continuous functor ${\mathcal{C}}_{\mathbb{T}}\to \mathcal{F}$: covers go to jointly epimorphic families precisely because the relevant sequents hold. The Diaconescu equivalence for geometric morphisms associates to this functor a geometric morphism $\mathcal{F}\to \mathbf{Set}[\mathbb{T}]$. Conversely, pulling $U_{\mathbb{T}}$ back along a geometric morphism gives a model. The constructions on models and their homomorphisms are inverse up to natural isomorphism, yieldingnaturally in $\mathcal{F}$. This proves the required classifying property, not merely classification of set-valued models.

Suppose $G$ is a representable functor, with a natural isomorphism $\theta :\mathcal{C}(R,-)\to G$. Put $r={\theta }_R(1_R)$. For any $(A,a)$ in the comma category $(1\downarrow G)$, the representing bijection gives a unique $f:R\to A$ with ${\theta }_A(f)=a$. By naturality, ${\theta }_A(f)=G(f)(r)$, exactly the condition for $f:(R,r)\to (A,a)$. Hence $(R,r)$ is an initial object.

Conversely, if $(R,r)$ is an initial object, thenis a bijection for each $A$: existence and uniqueness are precisely initiality applied to every $(A,a)$. For $h:A\to B$, $G(h){\theta }_A(f)=G(hf)(r)={\theta }_B(hf)$, proving naturality. Thus $r$ is a universal element and $\theta$ is a representation of a functor. Being representable is equivalent to the singleton comma category having an initial object.

For the monad $(T,\eta ,\mu )$, an algebra for a monad is $(A,a:TA\to A)$ with $a{\eta }_A=1_A$ and $aT(a)=a{\mu }_A$. A morphism of algebras for a monad $f:(A,a)\to (B,b)$ satisfies $fa=bTf$. These objects and arrows form the Eilenberg-Moore category ${\mathcal{C}}^T$.

The free algebra functor sends $A$ to $(TA,{\mu }_A)$ and $f$ to $Tf$. The monad identities verify the algebra laws. For the forgetful functor $U$, the free adjunction iswith inverse $v\mapsto bTv$. The algebra law makes the latter an monad algebra morphism. The identities $h{\eta }_A\mapsto bT(h{\eta }_A)=h{\mu }_{A}T{\eta }_A=h$ and $bTv{\eta }_A=b{\eta }_{B}v=v$ prove the bijection.

In the category of adjunctions inducing a fixed monad, objects are adjunctions $F⊣G$ with their induced monad identified with $T$. A morphism to $F^{\prime }⊣G^{\prime }$ is a functor $H$ between the right-hand categories satisfying $G^{\prime }H=G$, $HF=F^{\prime }$ and compatibility with units and counits. With these strict identifications, defineThe triangle identities give the unit algebra law; naturality of $\epsilon$ at ${\epsilon }_B$ gives the multiplication law. Naturality at $f$ makes $Gf$ an monad algebra morphism. Moreover $UK=G$, $KF=F^T$ because $G{\epsilon }_{FA}={\mu }_A$, and $K{\epsilon }_B$ is the free-adjunction counit at $K(B)$. Hence $K$ is a morphism into the Eilenberg-Moore adjunction.

For any other such $H$, its underlying object at $B$ must be $GB$. Counit compatibility forces its algebra action to be $G{\epsilon }_B$, and the forgetful functor, which is a faithful functor, forces $H(f)=Gf$. Thus $H=K$. This proves terminality of the Eilenberg-Moore adjunction. If adjunctions are specified only up to coherent isomorphisms, the same argument gives uniqueness up to the corresponding compatible natural isomorphism.

A functor $U:\mathcal{C}\to \mathbf{Set}$ is a representable functor if some object $R$ admits a natural isomorphism $\mathcal{C}(R,-)\cong U$. Here the representable is covariant.

For the identity functor on the Category of sets, choose the singleton $1=\{\ast \}$. The evaluation mapsare bijections with inverse $x\mapsto (\ast \mapsto x)$. For $u:X\to Y$, evaluation of $uf$ is $u(f(\ast ))$, proving naturality. Hence the identity functor on sets is represented by a singleton.

Let $U\cong \mathcal{C}(R,-)$ be a representable functor, and let $(L,p_j)$ be the categorical limit of a small diagram $D:J\to \mathcal{C}$. A morphism $R\to L$ is uniquely equivalent to a family $f_j:R\to D(j)$ satisfying $D(u)f_j=f_k$ for every $u:j\to k$.

Such compatible families are exactly the elements of the categorical limit of the set-valued diagram $\mathcal{C}(R,D(-))$. Consequently the canonical comparisonis a bijection. Transporting it through the representing natural isomorphism proves that $U$ preserves every small limit that exists in $\mathcal{C}$. This proves that covariant representables preserve limits. For an empty diagram this says that maps into a terminal object form a singleton.

Choose a representing object $R$ and a natural isomorphism ${\theta }_X:\mathcal{C}(R,X)\cong UX$. Using the assumed small coproducts in a category, defineFor a function $v:S\to S^{\prime }$, define $F(v)$ by $F(v){\iota }_s={\iota }_{v(s)}$. The coproduct in a category uniqueness clause proves preservation of identities and composition, so this is a functor.

Restriction to the coproduct summands, followed by $\theta$, givesThese bijections are natural in $S$ by the definition of $F(v)$, and natural in $X$ by naturality of $\theta$. They establish $F⊣U$, the left adjoint to a covariant representable functor. The empty set is sent to the empty coproduct.

For the categorical presheaf $X$, its category of elements has objects $(C,x)$ with $x\in X(C)$. A morphism $(C,x)\to (D,y)$ is a morphism $f:C\to D$ satisfying $X(f)(y)=x$. Composition in a category is inherited from $\mathcal{C}$: if also $X(g)(z)=y$, then $X(gf)(z)=X(f)X(g)(z)=x$. The identity morphisms are inherited as well. The forgetful functor sends $(C,x)$ to $C$ and $f$ to $f$.

A universal element is a pair $(R,r)$ for which each $x\in X(C)$ is uniquely of the form $X(f)(r)$ for $f:C\to R$. Thus $(R,r)$ is a terminal object of the category of elements, with the variance appropriate to a categorical presheaf.

Given a universal element, defineThe defining uniqueness makes each map a bijection; $X(u){\psi }_C(f)={\psi }_{C^{\prime }}(fu)$ gives naturality for $u:C^{\prime }\to C$. Hence $\psi$ is a natural isomorphism and $X$ is a representable presheaf. Conversely, from a natural isomorphism $\psi :\mathcal{C}(-,R)\cong X$, take $r={\psi }_R(1_R)$. The Yoneda lemma gives ${\psi }_C(f)=X(f)(r)$; its bijectivity makes $(R,r)$ a universal element. Therefore the two descriptions coincide:

If $G^{\mathbb{T}}$ is fully faithful, the criterion proved for a right adjoint says that the adjunction counit of $F^{\mathbb{T}}⊣G^{\mathbb{T}}$ is a natural isomorphism. Its component at $(A,a)$ is precisely the algebra action $a$. In particular, its component at the free algebra for a monad $(TX,{\mu }_X)$ has underlying morphism ${\mu }_X:T^{2}X\to TX$. Thus every ${\mu }_X$ is an isomorphism, and the natural transformation $\mu$ is invertible. This closes the cycle and proves all four conditions equivalent:

Define the length of a formal tensor expression recursively byThe canonical strict monoidal functor $Q:\mathcal{F}br\to \mathbf{B}$ sends $u$ to $|u|$, sends every associator and unitor to an identity braid, and sends $c_{u,v}$ to the block braiding $c_{|u|,|v|}$. The pentagon and triangle become identity equations; the braiding axioms become the corresponding block-braid equations. Thus the assignment respects the defining relations, andon the nose. It is a braided monoidal functor with identity comparison maps.

To prove that $Q$ is an equivalence of categories, choose a standard parenthesization $x^{[n]}$ of $n$ copies of $x$, with $x^{[0]}=I$. On $x^{[n]}$, define the image of ${\sigma }_i$ by canonically exposing the $i$th and $(i+1)$st factors, applying $c_{x,x}$ there, and restoring the chosen parentheses. The monoidal coherence theorem makes this independent of the structural rebracketing. Crossings on disjoint pairs commute by the tensor interchange law. The adjacent braid group relations follows from the hexagon laws and naturality of the braiding, as in the Yang–Baxter calculation below. Hence these assignments give group homomorphisms $B_n\to \mathrm{Aut}(x^{[n]})$ and a functor $S:\mathbf{B}\to \mathcal{F}br$.

Equip $S$ with the canonical rebracketing maps $x^{[m]}\otimes x^{[n]}\to x^{[m+n]}$. Their monoidal functor axioms follow from the monoidal coherence theorem; the block-braiding compatibility follows by iterating the two hexagon laws. Therefore $S$ is a strong monoidal functor compatible with the braiding.

We have $QS=1_{\mathbf{B}}$, including its comparison maps. For every formal expression $u$, there is a canonical structural isomorphismobtained by rebracketing and inserting the units appearing in $u$. These maps form a natural isomorphism $SQ\Rightarrow 1_{\mathcal{F}br}$. To check naturality, it suffices to check the generating morphisms: for associators and unitors it is exactly monoidal coherence; for $c_{u,v}$ it follows from the hexagon expansion into the elementary crossings defining $S$. Composition and tensor product then preserve the equation. The same structural coherence shows that $\theta$ is monoidal.

Thus $Q$ has a specified quasi-inverse and is the required equivalence:Only ordinary monoidal coherence, together with the defining braiding axioms, has been used; a separate braided coherence theorem is unnecessary.