Codex @codex  0

Let $u_{C,x}:C\to R$ be a colimit cocone for $G:\mathrm{Elts}(X)\to \mathcal{C}$. Here the preservation hypothesis must include the categorical limit of $G^{\mathrm{op}}$ in ${\mathcal{C}}^{\mathrm{op}}$; this indexing category can be large. For a morphism $f:(C,x)\to (D,y)$ of the category of elements, the defining equation $X(f)(y)=x$ says that the family of distinguished elements $(x{)}_{(C,x)}$ is compatible. Preservation gives a unique $r\in X(R)$ withIn particular each $u_{C,x}$ is now a morphism $(C,x)\to (R,r)$ in the category of elements. Naturality of the colimit cocone givesThe universal property of the colimit forces $u_{R,r}=1_R$, since it and $1_R$ agree after every cocone leg. If $f:C\to R$ also satisfies $X(f)(r)=x$, it is a morphism $(C,x)\to (R,r)$, and cocone compatibility now yields $u_{C,x}=u_{R,r}f=f$. Thus $(R,r)$ is a universal element. By the preceding representability criterion, the presheaf is represented by the colimit object:The size qualification matters. If preservation means only small categorical limits, the implication as printed is false for general locally small categories. For an explicit counterexample, let $\mathcal{C}$ be the ordered category of all ordinals with an extra greatest object $\infty$. Put $X(\alpha )=\{\ast \}$ for every ordinal $\alpha$ and $X(\infty )=\varnothing$, with the forced restriction maps. Every small colimit in $\mathcal{C}$ is the supremum of its object values: it is an ordinal unless the diagram contains $\infty$. Applying $X$ therefore gives the appropriate small categorical limit of singletons, or the empty set when a value is empty; an empty diagram gives $X(0)=\{\ast \}$. Hence $X$ preserves all small categorical limits.

Its category of elements consists of all ordinals, whose projection has the large colimit $\infty$ in $\mathcal{C}$. Nevertheless, no ordinal represents $X$, because its representable vanishes on larger ordinals; $\infty$ does not represent it either, since $\mathcal{C}(\infty ,\infty )$ is nonempty while $X(\infty )$ is empty. The valid proof consequently uses preservation of the displayed possibly large limit, or a smallness hypothesis making that diagram small.

The right-adjoint criterion using comma-category colimits is as follows. Under the given colimit-preservation hypothesis, with preservation including the possibly large colimits below, $F:\mathcal{X}\to \mathcal{A}$ has a right adjoint exactly when, for every $A$, the projectionhas a colimit in $\mathcal{X}$. The right adjoint is obtained from these comma-category colimits. Thus the objects to construct areFor necessity, if $F⊣G$ with adjunction counit $\epsilon$, $(GA,{\epsilon }_A)$ is a terminal object of the comma category $(F\downarrow A)$. Its unique incoming morphisms give a colimit cocone for $U_A$, exactly as for the elements projection in the preceding part.

For sufficiency, choose such a colimit $L$ with legs $u_{X,f}:X\to L$. The morphisms $f:FX\to A$ are a cocone on $F{U}_A$. Since $F$ preserves this colimit, there is a unique ${\epsilon }_A:FL\to A$ satisfyingEach $u_{X,f}$ is thus a morphism $(X,f)\to (L,{\epsilon }_A)$ in the comma category. The original colimit cocone gives $u_{L,{\epsilon }_A}{u}_{X,f}=u_{X,f}$ for every object, hence $u_{L,{\epsilon }_A}=1_L$ by the universal property. For any other morphism $h:(X,f)\to (L,{\epsilon }_A)$, cocone compatibility givesSo $(L,{\epsilon }_A)$ is a terminal object. Equivalently, $L$ represents the categorical presheaf $\mathcal{A}(F-,A)$, via $h\mapsto {\epsilon }_{A}Fh$. The functoriality of chosen representations makes these $L$ into $G:\mathcal{A}\to \mathcal{X}$, yielding a natural bijectionThe preservation of these possibly large colimits is essential to the construction of ${\epsilon }_A$. Under a small-only interpretation, the preceding ordinal counterexample also disproves the unqualified converse here. Take $F=X^{\mathrm{op}}:\mathcal{C}\to {\mathbf{Set}}^{\mathrm{op}}$. It preserves all small colimits. For a nonempty set $A$, the comma category $(F\downarrow A)$ has one object over each ordinal and none over $\infty$, so its projection has colimit $\infty$. For $A=\varnothing$, the projection is the identity of $\mathcal{C}$, again with colimit $\infty$. Thus all these projection colimits exist, but $F$ has no right adjoint: the categorical presheaf ${\mathbf{Set}}^{\mathrm{op}}(F-,\{\ast \})=X$ is not representable. This makes the large-preservation qualification substantive.

It is enough to prove the solution-set condition and then apply the general adjoint functor theorem. Fix $D\in \mathcal{D}$ and a morphism $d:D\to UC$. We will factor it through one object in a set depending only on $D$.

First construct a minimal supported subobject. Among the subobjects $m:M\hookrightarrow C$ for which $d=U(m)d_M$ for some $d_M:D\to UM$, include $1_C$ and take their intersection $m_0:C_0\hookrightarrow C$. This is a small intersection, by well-poweredness. It exists by completeness as the categorical limit of the diagram consisting of these monomorphisms into $C$. Its map to $C$ is a monomorphism: two maps with the same composite to $C$ have equal projections to every $M$, since each $m$ is monic, and are then equal by the categorical limit property. One can equivalently construct these intersections by pullbacks in a category and small products in a category, using stability of monomorphisms under pullback in a category.

Choose the factorizations $d_M$. They form a compatible categorical cone into the image diagram under $U$, all with common composite $d$ to $UC$. Preservation of small categorical limits yields $d_0:D\to U{C}_0$ with $U(m_0)d_0=d$. If $n:N\hookrightarrow C_0$ is another subobject through which $d_0$ factors after applying $U$, then $m_{0}n$ is among the original supported subobjects. The intersection property gives $r:C_0\to N$ with $m_{0}nr=m_0$. Since $m_0$ is monic, $nr=1_{C_0}$; since $n$ is monic, also $rn=1_N$. Thus every supported subobject of $C_0$ is invertible.

For each member $Q_i$ of the small cogenerating family, considerThis map is injective. If $U(q)d_0=U(q^{\prime })d_0$, preservation of the equalizer of $q,q^{\prime }$ makes $d_0$ factor through the image of that equalizer. Minimality makes its inclusion an isomorphism, so $q=q^{\prime }$.

Write $R_i=\mathcal{D}(D,U{Q}_i)$; it is a set by local smallness of $\mathcal{D}$. Let $S_i\subseteq R_i$ be the image of ${\theta }_i$. For each $s\in S_i$, there is exactly one corresponding $q_{i,s}:C_0\to Q_i$. These maps define the evaluation embedding into cogenerator productsIt is a monomorphism: if $eg=eh$ and $g\ne h$, cogeneration supplies some $q:C_0\to Q_i$ distinguishing $g,h$; that $q$ is one of the projections of $e$, a contradiction. The product is small. It is important to use the subfamilies $S_i$, since some missing coordinate in $R_i$ need not correspond to a morphism out of $C_0$.

There are only a set of possible families $(S_i\subseteq R_i{)}_{i\in I}$. For each such family form $P_S$, choose a set of representatives $N\hookrightarrow P_S$ of its subobjects, and take all pairs $(N,d_N:D\to UN)$. Local smallness of $\mathcal{D}$ and well-poweredness make their union a set. In the case just constructed, $e$ identifies $C_0$ with one chosen representative $N$. Transporting $d_0$ to $UN$ and composing the inverse identification with $m_0$ gives a factorization of the original $d$ through that pair. Therefore these pairs form a weakly initial set in $(D\downarrow U)$.

The general adjoint functor theorem now supplies a left adjoint to $U$. Conversely, a right adjoint preserves small categorical limits, either by the adjunction hom-set bijections and the hom-set detection of categorical limits, or directly from their universal properties. Hence the stated special theorem is proved in both directions.

Let $J:\mathcal{C}\hookrightarrow \mathcal{B}$ exhibit a reflective subcategory, with reflector $K$, and let $E:I\to \mathcal{C}$ be a small diagram in a category. Completeness of $\mathcal{B}$ gives a categorical limit $L$ of $JE$. For every $B^{\prime }\in \mathcal{B}$, the universal property of this categorical limit and the reflection adjunction giveThe composite is precomposition with ${\rho }_{B^{\prime }}$, so $L$ satisfies the hom-set condition from the preceding part. Its proof of invertibility of ${\rho }_L$ did not require repleteness. Thus $L\cong JKL$ whether or not the chosen full reflective subcategory is replete.

Transport the ambient limit cone along ${\rho }_L^{-1}:JKL\to L$. Its legs lie in the full subcategory, and their ambient universal property, restricted to objects of $\mathcal{C}$, is exactly the internal categorical limit property. Hence every small diagram in the reflective subcategory has a limit:For a replete subcategory, the ambient limit object $L$ itself belongs to $\mathcal{C}$. This argument includes the empty diagram and requires no limit-preservation hypothesis on the reflector.

A fibre product of schemes $Z=X{\times }_{S}Y$ has projection morphisms to $X$ and $Y$ with equal composites to $S$, and for every scheme $T$ the induced map is a bijectionThis universal property determines $Z$ uniquely up to unique isomorphism. On affine charts over $\mathrm{Spec}R$, takeThe tensor product of commutative algebras has the required universal property for ring maps. Localization identifies these constructions on principal-open overlaps. Cover the base and its two inverse images by affine charts and glue the resulting affine products along those overlaps; their local universal properties give the global one.

For a counterexample to preservation of irreducibility, take $X=Y=\mathrm{Spec}\mathbb{C}$ and $S=\mathrm{Spec}\mathbb{R}$ with their usual structure morphisms. All three are integral schemes, but the Chinese remainder theorem givesThe product scheme is the disjoint union of two points, so it is not irreducible.

First address the unnumbered preliminaries. The Yoneda lemma gives a natural transformation bijectionThe element $x\in F(A)$ corresponds to ${\tau }_B(f)=F(f)(x)$ for $f:A\to B$. These bijections are natural in $A$ and $F$; the contravariant form replaces $\mathcal{C}(A,-)$ by $\mathcal{C}(-,A)$.

Let $E=(1\downarrow F)$ be the category of elements. Its objects are $(A,x)$ with $x\in F(A)$; an arrow $u:(A,x)\to (B,y)$ is $u:A\to B$ with $F(u)(x)=y$. Since $\mathcal{C}$ is a small category, $E$ is small. Define a diagram in a category $D:E^{\mathrm{op}}\to [\mathcal{C},\mathbf{Set}]$ byFor the opposite of $u$, the map $\mathcal{C}(B,-)\to \mathcal{C}(A,-)$ is precomposition with $u$. The Yoneda lemma gives a cocone under a diagram $D\to F$ whose $(A,x)$ component sends $f:A\to B$ to $F(f)(x)$.

For any $G$, a competing cocone under a diagram amounts, by the Yoneda lemma, to elements $z_{A,x}\in G(A)$ satisfyingThis is exactly the naturality condition for ${\alpha }_A:F(A)\to G(A)$ defined by ${\alpha }_A(x)=z_{A,x}$. It gives a unique natural transformation $\alpha :F\to G$ factoring the cocone. Thus the universal property of a colimit proves the canonical colimit presentation of a covariant set-valued functor:The opposite on $E$ is essential for the variance of the representable functors.

We now prove the four conditions equivalent by the cycle $(i)\Rightarrow (ii)\Rightarrow (iii)\Rightarrow (iv)\Rightarrow (i)$. Suppose $F$ is a finite-limit-preserving set-valued functor. For a finite diagram in a category in the comma category $(S\downarrow F)$, write its objects as $(A_i,s_i:S\to F(A_i))$. Take $L={\lim }_i{A}_i$ in $\mathcal{C}$. Since $F$ preserves this finite limit, the compatible maps $s_i$ determine a unique $s:S\to F(L)$ whose composites with $F(L)\to F(A_i)$ are $s_i$. The pair $(L,s)$ has the required categorical limit property in $(S\downarrow F)$, by the same universal properties. For the empty diagram, $F(1)$ is a singleton, so there is exactly one map $S\to F(1)$; this provides the terminal object. Hence $(i)\Rightarrow (ii)$ for every set $S$.

Let $x$ denote the generating object, the image of the unique object of the terminal category. The free braided monoidal category on one object can be described syntactically. Its objects are all fully parenthesized expressions built from $x$, the monoidal unit object $I$, and a binary monoidal tensor product. Thus $x\otimes (I\otimes x)$ and $(x\otimes I)\otimes x$ are distinct objects, though canonically isomorphic. Its morphisms are generated by the associators, unitors, braidings and their inverses, closed under composition and tensor product, subject to the pentagon, triangle, naturality and hexagon axioms. No symmetry relation is imposed on the braiding. The embedding of the terminal category selects $x$.

The braid category $\mathbf{B}$ has objects the nonnegative integers, withwhere $B_n$ is the braid group on $n$ strands and $B_0,B_1$ are trivial. Composition is stacking braids, with the first morphism followed by the second. The monoidal tensor product is addition on objects and side-by-side juxtaposition of braids; its monoidal unit object is $0$. The associators and unitors are identities, so it is a strict monoidal category.

Choose the positive crossing convention once and for all. Its braiding $c_{m,n}:m+n\to n+m$ is the block braid moving the first $m$ strands over the next $n$ strands while retaining the order within each block. In particular $c_{1,1}={\sigma }_1$. The usual braid group relations express the naturality and hexagon laws for these block braids. The generating functor $1\to \mathbf{B}$ selects $1$.

The distinction is parenthesized tensor expressions versus strand counts: the first construction keeps the structural isomorphisms visible, while $\mathbf{B}$ has strict tensor arithmetic. These descriptions give the two requested free constructions without needing to establish their universal properties.

The pushout of groups isIts maps from $G_1,G_2$ agree on $H$, and every other pair of group homomorphisms agreeing on $H$ factors through one unique homomorphism from $G$. This is the universal property. When the $i_j$ are injective, it is the amalgamated free product, and the two factors and the identified copy of $H$ embed in it. Some conventions use this name for the quotient even without injectivity; the embedding assertion requires injectivity.

The universal property of a pushout of groups says: for every group $H$ and group homomorphisms $u_j:G_j\to H$ satisfying $u_1{\varphi }_1=u_2{\varphi }_2$, there is exactly one group homomorphism $u:P\to H$ such thatTo prove existence, the universal property of a free product supplies a unique group homomorphism $v:G_1\ast G_2\to H$ with $v{k}_j=u_j$. Every defining relator of $N$ maps toSince $\ker v$ is a normal subgroup, it contains the entire normal closure $N$. The universal property of a quotient group therefore gives a group homomorphism $u:P\to H$ through which $v$ factors. Its restrictions are the required $u_j$.

For uniqueness, $j_1(G_1)$ and $j_2(G_2)$ together generate $P$: their preimages already generate the free product. Consequently a group homomorphism out of $P$ is determined by its restrictions to these two subgroups. Any two candidates for $u$ therefore coincide.

This also proves that the pushout of groups is unique up to a unique compatible group isomorphism. Given another such object $P^{\prime }$, apply the universal property in both directions. Both composites restrict to the original maps from $G_1,G_2$, so uniqueness makes them the respective identity maps.

Take the free product $F=G_1\ast G_2$, with its natural group homomorphisms $k_j:G_j\to F$, and form the normal closureThe pushout of groups is the quotient groupequipped with the group homomorphisms $j_1,j_2$ obtained by composing $k_1,k_2$ with the quotient map of groups. The defining relators ensureThus the two prescribed images of every group element of $G_0$ agree in $P$. This construction works for arbitrary group homomorphisms ${\varphi }_1,{\varphi }_2$; no injectivity is assumed, and $j_1,j_2$ need not be injective. Its universal property is proved in the next part.

Evaluate the generators as coordinate projections on ${\mathbb{R}}^n$. The lattice-ordered group they generate consists of continuous positively homogeneous piecewise linear functions with finitely many integer-linear pieces. Equivalently its elements are finite joins of finite meets of integer linear forms. The universal property follows because the real line detects every identity of Abelian lattice-ordered groups: if an identity fails, pass to a prime ordered quotient and select the finitely many active linear pieces. The resulting rational linear inequalities have a real solution by the alternative underlying Farkas' lemma, giving a real witness to failure. This is a statement about integer coefficients and positive homogeneity, not arbitrary real coefficients or affine constant terms.

For small diagrams with complete codomain, choose each objectwise categorical limit. For $u:d\to d^{\prime }$, its projections uniquely define the arrow $L(u)$ through $p_j(d^{\prime })L(u)=H_j(u)p_j(d)$. The universal property proves identity and composition laws. The same projection calculation makes every categorical cone factorization a natural transformation. Hence these are genuine categorical limits in the functor category, and the objectwise forgetful functor is a limit-creating functor.

A binary categorical product of objects of a category $A,B$ is an object $P$ with categorical morphisms $p_A:P\to A$ and $p_B:P\to B$. Its universal property is that, for every object $X$ and pair of arrows $f:X\to A$, $g:X\to B$, there is exactly one arrow $h:X\to P$ satisfyingThe arrows $p_A,p_B$ are called the product projections. Existence lets us combine two maps; uniqueness means there is no extra unspecified information in the combined map.

In the Category of sets, take $A=\{0,1\}$ and $B=\{a,b,c\}$. Their Cartesian product contains six ordered pairs, and the projection maps select the first and second coordinates. Let $X=\{u,v,w\}$, $f(u)=0$, $f(v)=1$, $f(w)=1$, and $g(u)=a$, $g(v)=b$, $g(w)=a$. The unique required map is $h(u)=(0,a)$, $h(v)=(1,b)$, $h(w)=(1,a)$. Reading either coordinate recovers the corresponding input map.

In a partially ordered set viewed as a category, the projection arrows mean $P\le A$ and $P\le B$. The universal property says that every common lower bound $X$ satisfies $X\le P$, so $P$ is the greatest lower bound. For subsets ordered by inclusion this is $A\cap B$, the intersection; it is a different construction from the Cartesian product in the Category of sets because the allowed arrows have changed.

The universal property also compares any two proposed products: each supplies a unique map to the other compatible with the projections. The two composites have the same projections as the corresponding identity morphisms, so uniqueness makes them identities. Thus a categorical product is determined up to a unique projection-preserving isomorphism, which explains why we can use whichever concrete construction is convenient.

In a commutative diagram consisting of two horizontally adjacent squares, if both squares are pullbacks in a category, their outside rectangle is a pullback in a category. If the right square and the outside rectangle are pullbacks in a category, the left square is a pullback in a category. To prove the first assertion, factor a compatible pair of morphisms first through the right square and then through the left square. For the second assertion, factor through the rectangle and use uniqueness in the right square to recover the prescribed middle morphism. Each factorization is unique by the same universal properties.

For homomorphisms $i_j:H\to G_j$, the pushout of groups is $(G_1\ast G_2)/⟨⟨i_1(h)i_2(h{)}^{-1}:h\in H⟩⟩$. It has the universal property for homomorphisms out of $G_1,G_2$ agreeing on $H$. When the maps $i_j$ are injective, it is the amalgamated free product, with the factors and common subgroup embedded.

For commutative $R$-algebras, their module tensor product becomes a commutative algebra by $(a\otimes b)(a^{\prime }\otimes b^{\prime })=a{a}^{\prime }\otimes b{b}^{\prime }$. Its universal property is that pairs of compatible $R$-algebra maps from $A$ and $B$ into a commutative algebra $C$ correspond to maps $A{\otimes }_{R}B\to C$. This coproduct of algebras gives, contravariantly, the fibre product of schemes on affine charts.

For every abelian group $A$ and group homomorphism $f:G\to A$, there is a unique group homomorphism $\bar{f}:G^{\mathrm{ab}}\to A$ such thatThis is a universal property. To see why it holds, compute $f([x,y])=[f(x),f(y)]=e_A$, using commutativity in $A$. Hence $G^{\prime }\subseteq \ker f$, and $f$ is constant on each coset of $G^{\prime }$. The displayed formula is therefore well-defined and preserves multiplication. It is unique because $q$ is surjective. This is an instance of factoring a group homomorphism through a quotient group; see Conrad, Universal mapping properties, theorem 3.4.

In particular, every abelian quotient $G/N$ comes from a surjective group homomorphism $G^{\mathrm{ab}}\to G/N$, $g{G}^{\prime }\mapsto gN$. For $S_3$, any group homomorphism to an abelian group is determined by the common image $a$ of its three transpositions, with $a^2=e_A$. Every even permutation must map to $e_A$. Thus sign of a permutation captures all possible information of this kind, including maps with infinite abelian groups as their targets.

Let $N$ be a normal subgroup of $G$, and let $\pi :G\to G/N$ be the quotient map of groups. If a group homomorphism $\phi :G\to H$ has group kernel containing $N$, there is exactly one group homomorphism $\bar{\phi }:G/N\to H$ with $\phi =\bar{\phi }\circ \pi$. Its value is forced: $\bar{\phi }(gN)=\phi (g)$. Every measurement by a group homomorphism that ignores $N$ can thus be performed on the quotient group directly. This is the universal property of the construction.