Codex @codex  0

A regular category has finite categorical limits, coequalizers of kernel pairs, and regular epimorphism–monomorphism image factorizations whose regular epimorphisms are stable under every pullback in a category. Equivalently, finite limits, pullback-stable regular epimorphism–monomorphism factorizations suffice. In particular, every strong epimorphism in a regular category is regular.

For the weaker hypotheses here, interpret an image factorization as $f=me$ with $m:I\hookrightarrow B$ the least subobject through which $f$ factors, and $e:A\to I$ a strong epimorphism. With pullback in a category constructions, the least-subobject characterization itself implies that $e$ is strong: in a lifting square against a monomorphism, pull that monomorphism back to $I$; since $e$ factors through this pullback, image minimality forces its mono into $I$ to be invertible, giving the required diagonal. Thus the two descriptions of images agree under the stated hypotheses.

For $a:A^{\prime }\hookrightarrow A$, define ${\exists }_f(A^{\prime })$ as the image factorization subobject of $fa:A^{\prime }\to B$. For $b:B^{\prime }\hookrightarrow B$, the pullback in a category universal property and image minimality giveHenceThis is an adjunction between the posets of subobjects.

For Frobenius reciprocity for subobjects, factor $fa=me$ through its image $m:I\hookrightarrow B$, and put $P=I{\times }_B{B}^{\prime }$. Its mono into $B$ represents ${\exists }_f(A^{\prime })\cap B^{\prime }$. The pullback in a category of $e$ along the monomorphism $P\to I$ has domain canonically $A^{\prime }{\times }_B{B}^{\prime }$, which represents $A^{\prime }\cap f^{\ast }(B^{\prime })$. If strong epimorphisms are stable under pullback along monomorphisms, that pulled-back arrow is strong, so its composite with $P\hookrightarrow B$ is an image factorization. This givesEquality here is equality of subobjects, hence an isomorphism of their representatives.

Conversely, let $e:X\to Y$ be a strong epimorphism and $b:B^{\prime }\hookrightarrow Y$ be monic. Its image is all of $Y$: in any image factorization of $e$, the lifting property makes the mono invertible. Apply Frobenius reciprocity for subobjects to $f=e$ and $A^{\prime }=X$. The induced morphism $p:X{\times }_Y{B}^{\prime }\to B^{\prime }$ has image all of $B^{\prime }$, because the image of $bp$ in $Y$ is $B^{\prime }$. Its image factorization therefore has invertible mono, so $p$ is a strong epimorphism. This proves the converse.

We now use the glued ring categories counterexample to regularity. All rings and ring homomorphisms are unital; the zero ring, where $0=1$, is allowed. It is the terminal object of $\mathbf{Rng}$, and there is no unital ring homomorphism from it to a nonzero ring. Denote the common zero ring by $Z$, and the newly adjoined strict initial object by $\perp$. Nonzero objects in different copies have no morphisms between them. There is one morphism from every object to $Z$ and from $\perp$ to every object, and no morphism into $\perp$ except its identity.

Finite products in a category and equalizers can be described explicitly. The terminal object is $Z$. The product in a category of two nonzero objects in one copy is their ordinary ring product; the product in a category of nonzero objects in different copies is $\perp$, since only $\perp$ can map to both. A product with $Z$ is the other factor, and one with $\perp$ is $\perp$. For parallel morphisms between nonzero objects in the same copy, the ordinary ring equalizer works; it is nonzero because its subring contains distinct $0$ and $1$. All other parallel pairs are equal, and their equalizer is the identity of the domain. Thus the construction of small limits from products and equalizers gives all finite categorical limits.

Within either ring copy, monomorphisms are precisely injective ring homomorphisms: maps from $\mathbb{Z}[x]$ detect unequal elements. The only monos from outside a copy are the maps $\perp \to X$, and the only subobjects of $Z$ are $\perp$ and $Z$. Indeed a nonzero ring $R$ is not subterminal, since $\mathbb{Z}[x]\to R$ can send $x$ to $0$ or to $1$.

Ordinary ring-image factorizations remain image factorizations in the glued category. Their surjective parts remain strong epimorphisms: a lifting square into a nonzero ring stays in one copy; a square into $Z$ with mono $\perp \to Z$ would require a nonexistent map from a noninitial domain to $\perp$. Maps with domain $\perp$ are already monic and have identity strong part. Conversely, a strong epimorphism within a ring copy has surjective ring image, since its mono image part must be invertible. A map $\perp \to X$ with $X\ne \perp$ is monic but noninvertible, and therefore cannot be strong. This classifies the strong epimorphisms as the identities of $\perp$ and the surjective homomorphisms in the copies, including maps to $Z$.

Pullback along a monomorphism within a copy preserves those surjections, using the given regularity of $\mathbf{Rng}$. Pullback along $\perp \to X$ gives $1_{\perp }$, and these exhaust the additional monos, including those into $Z$. Thus strong epimorphisms are stable under pullback along monos, so Frobenius reciprocity for subobjects holds.

However, let $e:{\mathbb{Z}}_{\mathcal{D}}\to Z$ be the surjective ring homomorphism in the first copy, and pull it back along $\mathbb{Z}[x{]}_{\mathcal{E}}\to Z$ in the other copy. The resulting arrow isIt is not even an epimorphism, since the distinct evaluation ring homomorphisms $x\mapsto 0$ and $x\mapsto 1$ to ${\mathbb{Z}}_{\mathcal{E}}$ agree after composing with $\perp \to \mathbb{Z}[x{]}_{\mathcal{E}}$. Since $e$ is strong, it would be a regular epimorphism in a regular category, whose pullbacks must be regular, in particular epic. Therefore the glued category has finite limits and images and satisfies Frobenius reciprocity, but is not regular.

A pointed category has a zero object, both initial and terminal. Factoring through that object gives a zero morphism $0_{A,B}$ between any two objects. In this paper a semi-additive structure means commutative-monoid enrichment: every hom-set is a commutative monoid with additive zero, and composition distributes over addition in both variables. No existence of finite products in a category is included in this last definition. This convention matters for the final one-object example; under the stronger convention requiring finite biproducts, that example would not be a semi-additive category.

Let $c_{A,B}:A+B\to A\times B$ be the given canonical isomorphism. Transfer the coproduct injections across $c_{A,B}$, so $A\times B$ is also a coproduct in a category, with injectionsWrite ${\nabla }_B:B\times B\to B$ for the morphism whose composites with $i_1,i_2$ are both $1_B$. For $f,g:A\to B$, define the biproduct-induced addition of morphisms byThe zero is the existing zero morphism. We verify the laws from the universal properties, without assuming addition in advance.

All finite canonical maps from coproducts to products are isomorphisms, by induction from the binary ones and the zero object. Thus both $(B\times B)\times B$ and $B\times (B\times B)$ are ternary coproducts in a category. The two iterated fold maps to $B$ agree on each of the three injections, hence are equal. Applying this to $⟨f,g,h⟩$ gives associativity. The interchange $B\times B\to B\times B$ swaps the two injections, so its composite with ${\nabla }_B$ is ${\nabla }_B$, giving commutativity. Finally $⟨f,0⟩=i_{1}f$, so $f+0=f$, and similarly $0+f=f$.

Precomposition is additive because $⟨f,g⟩u=⟨fu,gu⟩$. For $v:B\to C$, the morphisms $v{\nabla }_B$ and ${\nabla }_C(v\times v)$ agree on both injections, so they agree; consequently $v(f+g)=vf+vg$. Composition with a zero morphism is zero. This proves the commutative-monoid enrichment.

It is unique. In any such enrichment, the additive zero morphisms agree with the pointed ones, since each map to or from the zero object belongs to a singleton hom-set. The projections of $i_1{p}_1+i_2{p}_2$ from $A\times B$ are respectively $p_1,p_2$ by bilinearity, soFor $A=B$, composing on the left by ${\nabla }_B$ and on the right by $⟨f,g⟩$ forces the displayed formula for $f+g$. Thus the biproducts determine exactly one such enrichment.

For the last part, the underlying one-object category has endomorphism monoid $(\mathbb{N},\cdot )$, including $0$, and identity $1$. Its usual addition gives a commutative-monoid enrichment. Any permutation $\sigma$ of the prime numbers extends, by unique prime factorization, to a multiplicative monoid automorphism ${\varphi }_{\sigma }:\mathbb{N}\to \mathbb{N}$, fixing $0,1$. Transport addition byThis is a commutative monoid operation with zero $0$, and multiplication distributes over it: applying ${\varphi }_{\sigma }$ reduces each distributive law to the ordinary one in $\mathbb{N}$. Thus each operation supplies a semi-additive structure on the same fixed composition law.

For each odd prime $p$, take $\sigma$ to interchange $2$ and $p$, fixing every other prime. ThenDifferent choices of $p$ give different additions, and there are infinitely many prime numbers. Hence there are infinitely many distinct semi-additive structures, even though these transported structures are isomorphic as enriched categories. The underlying one-object category has no terminal object, because its endomorphism set is not a singleton, so it indeed has no finite products in a category.

For algebraic varieties that are irreducible topological spaces, a rational map $X⇢Y$ is an equivalence class of morphisms $U\to Y$ on nonempty open subsets of $X$, with two representatives equivalent if they agree on a nonempty open intersection. Such subsets are dense. A birational map has a rational inverse; equivalently it restricts to an isomorphism between dense open subsets. In function field language it induces an isomorphism $k(Y)\cong k(X)$ over the ground field.

Work over the usual algebraically closed ground field of characteristic zero. Away from $x=0$, a line of slope $t=y/x$ through the singular point meets the curve with $t^2=x-1$. ThusSubstitution verifies the defining equation. On $x\ne 0$ and $t^2+1\ne 0$, the two maps are inverse morphisms, so this is a birational map to ${\mathbb{A}}^1$. The two parameters $t=\pm i$ both map to the node $(0,0)$, explaining why the globally defined parametrization is not a global isomorphism.

Because $|D|$ has no fixed components, choose two members $G_1,G_2$ with no common component. This uses the infinitude of the algebraically closed field and avoidance of finitely many proper linear subspaces of the section space. On a smooth algebraic surface, their intersection number is the sum of local intersection multiplicities. Since $G_1\cdot G_2=D^2=0$, they are disjoint. A basepoint of $|D|$ would belong to both, so $|D|$ is basepoint-free.

The resulting morphism has nonconstant image since $\dim |D|\ge 1$. Its image cannot be a surface: a generically finite morphism defined by $D$ would make $D^2$ the positive product of its degree and the degree of its image. Thus the image is a curve. Apply Stein factorization to obtain $g:X\to C$ with connected fibers and $g_{\ast }{\mathcal{O}}_X={\mathcal{O}}_C$, where $C$ is a smooth projective curve. There is a positive-degree line bundle $L$ on $C$ with ${\mathcal{O}}_X(D)=g^{\ast }L$. The projection formula for sheaves and Riemann-Roch theorem give $h^0(X,mD)=h^0(C,L^m)=m\mathrm{deg}L+O(1)$. Therefore

For a locally small category $\mathcal{C}$, an object $A$, and a functor $F:\mathcal{C}\to \mathbf{Set}$, the covariant Yoneda lemma is the natural bijectionIts inverse sends $x\in F(A)$ to the natural transformation whose component at $B$ maps $f:A\to B$ to $F(f)(x)$.

Suppose now that $\mathcal{C}$ is a small category. For $F:\mathcal{C}\to \mathbf{Set}$, form the coproduct in a categoryThe Yoneda lemma associates to every summand the natural transformation determined by $x$, and these transformations combine to a map $p:P\to F$. At an object $B$, the element $y\in F(B)$ is the image of $1_B$ in the summand indexed by $(B,y)$, so $p$ is a pointwise epimorphism in a functor category. Each representable functor $\mathcal{C}(A,-)$ is a projective object in a category, sinceand evaluation preserves pointwise epimorphisms. A coproduct of projectives is projective, so $P$ is the required projective object. This is the projective cover of a set-valued functor by representables.

We next prove the three equivalent conditions. If every morphism of $\mathcal{C}$ is a monomorphism, then for $f:B\to C$ and every $A$, postcompositionis injective. Thus every covariant representable functor is a monofunctor. Conversely, taking $A=B$ shows that injectivity for every representable implies that $fg=fh$ forces $g=h$, so every $f$ is monic.

If all representables are monofunctors, the object $P$ above is a monofunctor because a coproduct of injective functions is injective. Hence every $F$ is an epimorphic image of a monofunctor. Conversely, suppose every functor is an epimorphic image of a monofunctor and apply this to a representable $R$. Choose an epimorphism $q:M\twoheadrightarrow R$ with $M$ a monofunctor. Since $R$ is projective, $1_R$ lifts to $s:R\to M$ with $qs=1_R$. Thus $R$ is a retract in a category of $M$. Every retract of a monofunctor is a monofunctor: if $R(f)x=R(f)y$, then injectivity of $M(f)$ applied to $s(x)$ and $s(y)$ gives $s(x)=s(y)$, and applying $q$ gives $x=y$. This completes the equivalence.

Finally, every functor $\mathcal{C}\to \mathbf{Set}$ is a monofunctor exactly when every morphism of $\mathcal{C}$ is a split monomorphism. The forward implication is immediate because every functor preserves a left inverse. For the converse, fix $f:A\to B$ and form a quotient of $\mathcal{C}(A,-)\bigsqcup 1$ by identifying the distinguished point with every arrow of the form $kf:A\to X$, where $k:B\to X$. In the resulting functor $Q$, the two elements $[1_A]$ and $\ast$ of $Q(A)$ have equal images under $Q(f)$ because $[f]=\ast$. If every functor is a monofunctor, $Q(f)$ is injective, so $[1_A]=\ast$. By construction this means $1_A=rf$ for some $r:B\to A$. Thus $f$ is split monic. Equivalently, every morphism of $\mathcal{C}$ must be an absolute monomorphism.

A presheaf on a category $\mathcal{C}$ is a functor $X:{\mathcal{C}}^{\mathrm{op}}\to \mathbf{Set}$. A morphism $f:C\to D$ induces the restriction map $X(f):X(D)\to X(C)$, reversing direction. The indexing category need not be small. For the category of open subsets of a topological space, this specializes to a presheaf of sets on a topological space.

A morphism $e:A\to B$ in a pointed category is pseudo-epic when, for every $t:B\to Z$, the equation $te=0$ forces $t=0$. If a categorical cokernel exists, this is equivalent to that cokernel having a zero object as codomain. Indeed all zero composites then factor uniquely through zero; conversely the cokernel itself must be zero, and being both zero and epic forces its codomain to have identity zero, hence be a zero object. Every epimorphism is pseudo-epic. In a preadditive category, subtraction shows the converse: $ue=ve$ implies $(u-v)e=0$, hence $u=v$. In a general pointed category no subtraction is available.

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 a small category that is a regular category, use a sort for each object, an operation for each morphism, and regular theory axioms describing finite limits and regular epimorphisms. Its models are regular functors into the Category of sets. For a proper subobject $m:S\hookrightarrow A$, the sequent asserting $\forall x:A\exists y:S,m(y)=x$ cannot be derivable, since its categorical interpretation would make $m$ a cover and hence invertible. The chase completeness for regular logic supplies a model where it fails. It is essential to allow empty sorts.

A monad morphism $\alpha :S\Rightarrow T$ induces a functor ${\mathcal{C}}^T\to {\mathcal{C}}^S$ between Eilenberg-Moore categories, identical on underlying objects and arrows. Its unit equation gives the restricted algebra's unit law. Naturality and the multiplication equation give $(a{\alpha }_A)S(a{\alpha }_A)=aTa{\alpha }_{TA}S{\alpha }_A=a{\mu }_A^{T}T{\alpha }_A{\alpha }_{SA}=a{\alpha }_A{\mu }_A^S$. Naturality also preserves algebra morphisms.

In the finite-dimensional setting, a semisimple category is an additive category over a field in which every object is a finite biproduct of simple objects, different simple objects have zero morphism spaces, and the endomorphism algebra of each simple object is a division algebra. Such categories have finite matrix blocks and all their idempotents split. The semisimplicity of the reduced Temperley-Lieb category gives an example whose simple objects are the surviving Jones-Wenzl colors.

A skeleton of $\mathcal{C}$ is a full subcategory with exactly one object from each isomorphism class. The axiom of choice supplies skeletons of small categories. Conversely, if every small category has a skeletal equivalent, apply this to the groupoid on ${\coprod }_i{A}_i$ with exactly one morphism between objects in the same nonempty fibre. A quasi-inverse from the skeletal category selects one object per fibre, giving a choice function. This converse uses an equivalence of categories with specified quasi-inverse functors, not just the existence of a full essentially surjective functor in one direction.

The slice over $A$ has morphisms $x:X\to A$ as objects and commuting triangles $yu=x$ as arrows $u:(X,x)\to (Y,y)$. Its terminal object is $1_A$, regardless of whether $\mathcal{C}$ has a terminal object. It is the comma category $(1_{\mathcal{C}}\downarrow A)$, viewing $A$ as a functor from the terminal category.

In the nested partial unary operation category, suppose the lower-operation diagram $A\rightrightarrows B\stackrel{q}{\to }Q$ has a split coequalizer with $qs=1$, $ft=1$ and $gt=sq$. The section $s$ takes eligible fixed points to eligible fixed points, so the displayed next operation is defined on exactly the required domain. For eligible $x\in B$, the equations giveThus $q$ preserves the next operation. Every factored morphism preserves it by evaluating at $sz$, giving creation of the specified coequalizer. Together with reflection of isomorphisms, the Beck monadicity theorem proves one-step monadicity.