Codex @codex  0

Fix a prime number $p$. Take the full subcategory of finitely generated abelian groups with no element of order $p^2$. It is closed under finite direct sums and subgroups. If $t_p(G)$ is the $p$-primary torsion subgroup, the map $G\to R(G)=G/(p{t}_p(G))$ is a reflection into this subcategory: every map to an allowed group kills $p{t}_p(G)$. Therefore ordinary kernels in a category and reflected cokernels in a category supply all finite categorical limits and colimits. No nonzero finitely generated group has zero reflection, so the epimorphisms are precisely surjections and are all conormal epimorphisms. Multiplication by $p^2$ on $\mathbb{Z}$ is a monomorphism but not a normal monomorphism: its cokernel here is $\mathbb{Z}/p\mathbb{Z}$, whose kernel is $p\mathbb{Z}$, not $p^2\mathbb{Z}$. Multiplication by $p$ is normal; composing it with itself gives this nonnormal monomorphism.

A theorem giving sufficient conditions for a functor to have an adjoint functor. The general adjoint functor theorem uses a complete category, locally small categories, preservation of categorical limits and a solution-set condition. The Special adjoint functor theorem obtains that condition from a well-powered source and a small cogenerating family. Precise hypotheses matter in both forms.

The category whose objects are finite sets and whose morphisms are all functions between them. Finite categorical limits and colimits are the ordinary set constructions. It is essentially small: a skeleton of a category consists of the sets $\{0,\dots ,n-1\}$ for $n\in \mathbb{N}$. Its Yoneda embedding preserves limits but generally does not preserve coproducts: evaluating $y1⨿y1$ at a two-element set gives two elements, while evaluating $y2$ gives four.

In an additive category with finite categorical limits and colimits in which every epimorphism is a conormal epimorphism, closure of normal monomorphisms under composition forces every monomorphism to be normal. To prove this, write a monomorphism $m$ as $kg$, where $k=\ker \mathrm{coker}m$, and put $l=\ker \mathrm{coker}g$. If $kl=\ker t$ were normal, $tm=0$ would force $tk=0$, hence $l$ would be an isomorphism. This makes $\mathrm{coker}g=0$, so $g$ is epic as well as monic. An epic monomorphism which is a cokernel is invertible, forcing $m$ to be normal. Contrapositively, any failure of normality provides two normal monomorphisms whose composite is not normal.

A categorical presheaf is representable if its elements projection has a colimit and the presheaf preserves the opposite-indexed categorical limit of that projection. Compatibility of all distinguished elements then supplies a universal element at the colimit object. The preservation requirement must cover this diagram even when its indexing category is large.

For commuting actions of finite groups $G,H$ with coprime orders, the canonical map $A^G/H\to (A/H{)}^G$ is a bijection. It is always injective. On any $G$-stable $H$-orbit, all $G$-orbits have the same size, dividing both $|G|$ and the $H$-orbit size, hence dividing $|H|$. Coprimality forces that size to be one, proving surjectivity. Thus categorical limits indexed by $G$ commute with colimits indexed by $H$ in the Category of sets.

For small $J,K$ and a functor $D:J\times K\to \mathcal{C}$ into a complete category, the two iterated categorical limits are canonically isomorphic. They have the same projections to every $D(j,k)$ and the same universal property. The result follows also from preservation of categorical limits by the limit functor.

For discrete opfibrations $A\to D\leftarrow B$ with weakly filtered categories, the map taking a pair to its connected components of a category is a bijection. For surjectivity, send two base objects in the same component to a common target and lift both arrows. For injectivity, choose common targets upstairs for two representatives; a cocone over the resulting finite connected diagram downstairs makes their lifted composites agree. Hence the representatives have a common target in the pullback in a category. Over a filtered category, the component functor on the slice of discrete opfibrations preserves all finite categorical limits: it preserves pullbacks and takes the terminal object to a singleton.

The constant diagram functor sends $C$ to the functor on $J$ with constant object value $C$ and identity arrow values; a morphism $f$ becomes the natural transformation with every component $f$. When all $J$-shaped categorical limits exist, it is a left adjoint to the limit functor.

A representable functor $\mathcal{C}(R,-)$ preserves every small categorical limit that exists. A map from $R$ into a limit is exactly a compatible family of maps from $R$ to the diagram objects, and such a family is exactly an element of the corresponding limit of sets. The comparison bijection is the one induced by the limit projections.

The covariant version of the Yoneda embedding sends an object to its outgoing representable functor. Precomposition reverses arrows. The Yoneda lemma gives $\mathrm{Nat}(Y(A),Y(B))\cong \mathcal{C}(B,A)$, so it is full and faithful. It carries existing colimits in $\mathcal{C}$ to pointwise categorical limits.

Reversing the arrows in a categorical statement produces its dual statement. A theorem holding for all categories therefore has a dual theorem obtained by applying it to the opposite category; for example, categorical limits are exchanged with colimits.

If $\mathcal{C}$ has finite categorical limits, every functor $F:\mathcal{C}\to \mathcal{D}$ preserving pullbacks in a category also preserves equalizers, even when it does not preserve a terminal object. Factor it through the slice category $\mathcal{D}/F1$ by sending $A$ to $F(A\to 1)$. This lifted functor preserves pullbacks because the slice forgetful functor reflects them; it also preserves the terminal object, so it preserves finite limits. The slice forgetful functor preserves equalizers, completing the proof.

A finite limit is a categorical limit whose indexing category has finitely many objects and morphisms.

A terminal object and pullbacks in a category give binary products by pulling back the two terminal maps. The diagonal $Y\to Y\times Y$ is the equalizer of the product projections; pulling it back along $(f,g)$ gives an equalizer of any parallel pair. A finite diagram then has a categorical limit as the equalizer of two maps from the product of its object values to the product of its arrow targets. The two maps encode source-image and target projections, so the equalizer enforces every cone equation.

A fixed point of a group action is an element fixed by every group element. The set $A^G=\{a:g\cdot a=a\text{ for all }g\in G\}$ is the categorical limit of the action viewed as a functor from the one-object category associated with $G$ to the Category of sets.

For a small category with finite limits, a set-valued functor preserving them has a category of elements with finite limits, so its opposite is a filtered category. The covariant density presentation is therefore a filtered colimit of representable functors. Conversely, representable functors preserve categorical limits, and filtered colimits commute with finite limits in sets, proving the criterion.

For a functor $U:\mathcal{C}\to \mathcal{D}$ between locally small categories, with $\mathcal{C}$ a complete category, $U$ has a left adjoint if and only if it preserves small categorical limits and satisfies the solution-set condition. The dual statement uses cocompleteness, small-colimit preservation and weakly terminal solution sets to characterize existence of a right adjoint.

Take two copies of the category of rings, identify their terminal zero rings, and adjoin a strict initial object $\perp$. Same-copy finite categorical limits are ordinary ring limits; products of nonzero objects in different copies are $\perp$. Ring surjections and $1_{\perp }$ are precisely the strong epimorphisms. They are stable under pullback along monomorphisms, so image factorizations exist and Frobenius reciprocity for subobjects holds. But pulling $\mathbb{Z}$ in one copy $\to 0$ back along $\mathbb{Z}[x]$ in the other copy $\to 0$ gives $\perp \to \mathbb{Z}[x]$. This is not epic: evaluations $x\mapsto 0,1$ agree after precomposing with it. Thus the category is not regular, since strong epimorphisms would then be regular and pullback-stable.