A regular category is almost totally supported if every object is a well-supported object or a strict initial object. The case in which every object is well-supported is allowed. There can be at most one strict initial object up to isomorphism. In the Category of sets, these two cases distinguish nonempty sets from the empty set. A meet-semilattice regarded as a category satisfies the condition precisely when it has at most two objects up to isomorphism.
Glued ring categories counterexample to regularity Created 2026-10-05 Updated 2026-10-07
Take two copies of the category of rings, identify their terminal zero rings, and adjoin a strict initial object . Same-copy finite categorical limits are ordinary ring limits; products of nonzero objects in different copies are . Ring surjections and are precisely the strong epimorphisms. They are stable under pullback along monomorphisms, so image factorizations exist and Frobenius reciprocity for subobjects holds. But pulling in one copy back along in the other copy gives . This is not epic: evaluations agree after precomposing with it. Thus the category is not regular, since strong epimorphisms would then be regular and pullback-stable.
A capital regular category is one whose well-supported objects are well-pointed objects in a category. Here well-supported means is a regular epimorphism; well-pointed means a subobject of containing every point must be the whole object. This is the convention of Definition 1.3. It permits objects of proper support with no points. Replacing this condition by global points detecting every isomorphism would change the assertion: a three-element chain is regular but cannot admit a conservative finite-limit-preserving functor to such a category.
Here is a regular-logic proof sketch of capitalization of a small regular category. Use a sort for every object of , a function symbol for every morphism, and regular theory axioms for composition, finite limiting diagrams and regular-epimorphism lifting. Its set models are precisely regular functors . Empty sorts must be allowed.
The key separation lemma is the regular-logic separation of a proper subobject. For proper, the sequent
is not derivable: interpreting a derivation in would make the monomorphism a regular epimorphism, hence an isomorphism. The chase completeness for regular logic supplies a set model in which it fails. Briefly, start with a named antecedent element, adjoin witnesses for the existential axioms, and quotient by required equalities. Every consequent about the original parameter arising at a finite stage has a finite proof; thus a nonderivable consequent remains false. The filtered union is the desired model. This witness construction, rather than an assumption that every sort is inhabited, is what keeps proper supports distinguishable.
Since is small, choose a set-indexed family of regular functors, one detecting each proper monomorphism, and form
It is regular by coordinatewise finite limits and surjections. It reflects invertibility of monomorphisms. If is invertible, apply this fact to the image inclusion of and to the diagonal of its kernel pair. They are invertible, so is both a regular epimorphism and a monomorphism, hence invertible. Thus is a conservative functor.
The target is a power of sets as a capital regular category. A well-supported family has every coordinate nonempty, and choice extends any coordinate element to a global tuple. A subobject containing every tuple must consequently contain every coordinate element. Therefore it is capital, giving the required isomorphism-reflecting regular functor. This is the separation aspect of the regular representation results originating in Barr's embedding work; full faithfulness is unnecessary here.
The stronger target of a single set category has a precise restriction: admits a conservative regular functor to the Category of sets exactly when it is an almost totally supported regular category. This means every object is well-supported or a strict initial object. Here are necessity and sufficiency.
Suppose is regular and conservative. If is nonempty, its support in sets is . Since preserves images, it sends the support inclusion to an isomorphism; conservativity makes , so is well-supported.
If is empty, every projection is sent to the unique bijection between empty sets, hence is invertible. This supplies a morphism for every . The equalizer of any two such morphisms is also sent to a bijection, hence is invertible, proving uniqueness. Thus is initial. Every arrow forces to be empty and is then sent to a bijection; conservativity makes it invertible. So is strict initial.
Conversely suppose this support condition holds. Use above and take
Products preserve finite limits and, by choice, coordinatewise surjections, so is regular. A well-supported object has all coordinates nonempty. A proper strict initial object has a subterminal image in every coordinate, with at least one empty coordinate: otherwise its arrow to would be sent by to an isomorphism, contradicting conservativity.
If is a bijection between well-supported objects, the conservativity of set products on totally supported families makes each bijective: a missing coordinate preimage or a pair of equal-image coordinate elements extends to a tuple witnessing failure of surjectivity or injectivity. Hence is invertible and so is . An arrow between strict initial objects is already invertible; an arrow from a strict initial object to a well-supported object cannot become a bijection between empty and nonempty sets. An arrow into a strict initial object is invertible by definition. These cases prove conservativity and the conservative regular representation in sets criterion.
For the weaker hypotheses here, interpret an image factorization as with the least subobject through which factors, and a strong epimorphism. With pullback in a category constructions, the least-subobject characterization itself implies that is strong: in a lifting square against a monomorphism, pull that monomorphism back to ; since factors through this pullback, image minimality forces its mono into to be invertible, giving the required diagonal. Thus the two descriptions of images agree under the stated hypotheses.
For , define as the image factorization subobject of . For , the pullback in a category universal property and image minimality give
Hence
This is an adjunction between the posets of subobjects.
For Frobenius reciprocity for subobjects, factor through its image , and put . Its mono into represents . The pullback in a category of along the monomorphism has domain canonically , which represents . If strong epimorphisms are stable under pullback along monomorphisms, that pulled-back arrow is strong, so its composite with is an image factorization. This gives
Equality here is equality of subobjects, hence an isomorphism of their representatives.
Conversely, let be a strong epimorphism and be monic. Its image is all of : in any image factorization of , the lifting property makes the mono invertible. Apply Frobenius reciprocity for subobjects to and . The induced morphism has image all of , because the image of in is . Its image factorization therefore has invertible mono, so 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 , is allowed. It is the terminal object of , and there is no unital ring homomorphism from it to a nonzero ring. Denote the common zero ring by , and the newly adjoined strict initial object by . Nonzero objects in different copies have no morphisms between them. There is one morphism from every object to and from to every object, and no morphism into except its identity.
Finite products in a category and equalizers can be described explicitly. The terminal object is . 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 , since only can map to both. A product with is the other factor, and one with is . For parallel morphisms between nonzero objects in the same copy, the ordinary ring equalizer works; it is nonzero because its subring contains distinct and . 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 detect unequal elements. The only monos from outside a copy are the maps , and the only subobjects of are and . Indeed a nonzero ring is not subterminal, since can send to or to .
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 with mono would require a nonexistent map from a noninitial domain to . Maps with domain 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 with is monic but noninvertible, and therefore cannot be strong. This classifies the strong epimorphisms as the identities of and the surjective homomorphisms in the copies, including maps to .
Pullback along a monomorphism within a copy preserves those surjections, using the given regularity of . Pullback along gives , and these exhaust the additional monos, including those into . Thus strong epimorphisms are stable under pullback along monos, so Frobenius reciprocity for subobjects holds.
However, let be the surjective ring homomorphism in the first copy, and pull it back along in the other copy. The resulting arrow is
It is not even an epimorphism, since the distinct evaluation ring homomorphisms and to agree after composing with . Since 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.