$\mathcal{M}$-coextensivity and the strict refinement property
Michael Hoefnagel

TL;DR
This paper introduces the concept of $\\mathcal{M}$-coextensivity in categories to unify and analyze the strict refinement property in universal algebra, connecting it with categorical notions of extensivity and algebraic decomposability.
Contribution
It defines $\mathcal{M}$-coextensive objects in arbitrary categories and relates them to the strict refinement property and algebraic decomposability, providing a categorical framework for these concepts.
Findings
$\\mathcal{M}$-coextensive objects correspond to algebras with the strict refinement property.
In varieties of algebras, projection-coextensive objects are exactly those with the strict refinement property.
Objects with global support in certain categories have the strict refinement property.
Abstract
The notion of an -coextensive object is introduced in an arbitrary category , where is a distinguished class of morphisms from . This notion allows for a categorical treatment of the strict refinement property in universal algebra, and highlights its connection with extensivity in the sense of Carboni, Lack and Walters. If is the class of all product projections in a variety of algebras , then the -coextensive (or projection-coextensive) objects in turn out to be precisely those algebras which have the strict refinement property. If is the class of surjective homomorphisms in the variety, then the -coextensive objects are precisely those algebras which have directly-decomposable (or factorable) congruences. In exact Mal'tsev categories, every centerless…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsHomotopy and Cohomology in Algebraic Topology · Advanced Algebra and Logic · Algebraic structures and combinatorial models
-coextensive objects and the strict refinement property
Michael Hoefnagel
Abstract
The notion of an -coextensive object is introduced in an arbitrary category , where is a distinguished class of morphisms from . This notion allows for a categorical treatment of the strict refinement property in universal algebra, and highlights its connection with extensivity in the sense of Carboni, Lack and Walters. If is the class of product projections in a category with finite products, then -coextensivity is closely related to the notion of Boolean category in the sense of E. Manes: is co-Boolean if and only if its product projections are pushout stable, and every object is -coextensive. We show that if is a variety of algebras then the -coextensive objects are precisely those algebras which have the strict refinement property, when is the class of product projections. If is the class of surjective homomorphisms in the variety, then the -coextensive objects are those algebras which have directly-decomposable (or factorable) congruences. Moreover, these results are proved for any object with global support in a regular category. We also show that in exact Mal’tsev categories, every centerless object with global support is projection-coextensive, i.e., has the strict refinement property. We will also show that in every exact majority category, every object with global support has the strict refinement property.
The published version of this article can be found at [15].
1 Introduction
In universal algebra, various refinement properties have been defined for direct-product decompositions of structures, all of which give information about the uniqueness of such decompositions. The so-called strict refinement property was first defined in [8], and implies that any isomorphism between a product of irreducible structures is uniquely determined by a family of isomorphisms between each factor. If is a universal algebra which has the strict refinement property, then it was proved in [8] that the factor-congruences of (see Definition 4.3) form a Boolean sublattice of - the lattice of congruences on . Moreover, this is a characteristic property of algebras which have the strict refinement property. Examples of structures which possess the strict refinement property include any unitary ring, any centerless or perfect group, any connected poset or digraph [12, 23], any lattice, or more generally, any congruence distributive algebra. Many geometric structures possess the dual property, which is to say that they have the co-strict refinement property. As we will show in this paper, this is mainly due to the fact that categories of geometric structures tend to be extensive in the sense of [5]. The main aim of this paper is to investigate the relationship between the strict refinement property and coextensivity. In particular, we introduce the notion of an -coextensive object in an arbitrary category , where is a distinguished class of morphisms from . When is the class of product-projections in a category with finite products, and in this case the -coextensive objects are called projection-coextensive, then projection-coextensivity is equivalent to the strict refinement property for algebras in a variety. Projection-coextensivity is also closely related to the notion of a Boolean category in the sense of E. Manes [19]. This relationship is captured by Corollary 3.3 below: every object in a co-Boolean category is projection-coextensive. But there are categories with finite products in which every object is projection-coextensive which are not co-Boolean. However, if is a category with finite products and pushout stable product projections, then is co-Boolean if and only if every object in is projection-coextensive.
1.1 The notion of -coextensivity
Recall that a category with finite products is coextensive if the canonical functor
[TABLE]
is an equivalence of categories. The following proposition provides an equivalent definition of coextensivity, which is what the notion of -coextensivity is based on.
Proposition** (Dual of Proposition 2.2 in [5]).**
A category with finite products is coextensive if and only if it admits pushouts of arbitrary morphisms along product projections, and in every commutative diagram
[TABLE]
where the top row is a product diagram, the bottom row is a product diagram if and only if both squares are pushouts.
Definition 1.1**.**
Let be a category and a class of morphisms from . A commutative square
[TABLE]
in is called an -pushout if it is a pushout in , and are morphisms in .
Definition 1.2**.**
Let be a category and a class of morphisms in . An object is said to be -coextensive if every morphism in with domain admits an -pushout along every product projection of , and in each commutative diagram
[TABLE]
where the top row is a product diagram and the vertical morphisms belong to , the bottom row is a product diagram if and only if both squares are -pushouts.
Of particular importance to the current paper is when is the class of all product projections in , and in this case we call an object projection-coextensive if it is -coextensive. We show that every projection-coextensive object in a category with (finite) products has the (finite) strict refinement property, and when the base category is regular [1], the converse also holds. Every projection-coextensive object has epimorphic product projections, so that the full subcategory of consisting of product projections is a preorder. In a coextensive category, the posetal-reflection of this preorder is a Boolean-lattice (since every coextensive category is co-Boolean in the sense of [19]). We show that this result still holds for projection-coextensive objects, and that it is a characteristic property of projection-coextensivity (Theorem 3.1). This result can be seen as an analogue of Theorem 5.11 in [19] and Proposition 1.3.3 in [10] for objects in a category with finite products. It also captures the classical characterization of the strict refinement property for algebras mentioned earlier. Pre-exact categories are defined in Definition 4.4 as an intermediate between regular and exact categories. In the pre-exact context we establish a characterization of the strict refinement property (Theorem 4.2) which allows us to show that centerless objects in a Mal’tsev category [7, 6] have the strict refinement property, as well as that every object (with global support) in a pre-exact majority category [14] has the strict refinement property. In particular, this shows that any object with global support in an arithmetical category in the sense of [22] has the strict refinement property.
When is chosen to be the class of regular epimorphisms in , then we say that is regularly-coextensive if it is -coextensive. We will show that if is then a variety of universal algebras, then any non-empty algebra is regularly-coextensive if and only if it has factorable congruences in the sense of [18]. Moreover, this result extends to regular categories. It is then immediate that any object in a regular category with global support which has factorable congruences necessarily has the strict refinement property. This generalizes a result of [18].
Convention 1**.**
Throughout this paper, we will assume that categories have finite products, so that by “a category ”, we mean “a category with finite products”. If and are morphisms in a category , then we will always denote their composite by .
2 -coextensive objects have strict refinements
Throughout this section, suppose that is a category and that is a class of morphisms in . Unless stated otherwise, we will assume that contains all isomorphisms in , and is closed under composition and products in .
Remark 2.1**.**
Under these assumptions on , any product projection of an -coextensive object is contained in . This is because we may take the vertical morphisms in the diagram of Definition 1.2 to be the identity morphisms. Note also that if is -coextensive, then for any product projection we have that any terminal morphism is in . This is because in the diagram:
[TABLE]
the bottom row is a product diagram, all the vertical morphisms are in , and hence the right-hand square is an -pushout by -coextensivity of .
If is a product projection, then a morphism is called a complement of if the diagram
[TABLE]
is a product diagram in . Recall that is said to have co-disjoint products if any product projection of is an epimorphism and the pushout of any complementary product projections of is terminal. The following proposition is essentially just the dual of Proposition 2.6 in [5], when coextensivity is restricted to single objects.
Proposition 2.1**.**
Let be an -coextensive object in a category , then has co-disjoint products.
Proof.
Consider the diagram below, where the top row is a product diagram.
[TABLE]
By Remark 2.1, all the vertical morphisms are in . Since the bottom row is a product diagram, it follows that both squares are pushouts. This implies that is an epimorphism, and that the pushout of along is a terminal object. ∎
Proposition 2.2**.**
Let be an -coextensive object in , and suppose that is any product projection. Then for any morphism in , if then .
Proof.
There exists an -pushout diagram of along isomorphic to the pushout diagram:
[TABLE]
Since contains all isomorphisms and is closed under composition, it follows that is contained in . ∎
Definition 2.1**.**
An object in a category is called projection-coextensive if it is -coextensive with the class of all product projections in .
Remark 2.2**.**
Note that Remark 2.1 implies that every object in that is -coextensive, is necessarily projection-coextensive.
The strict refinement property mentioned in the introduction may be formulated as follows:
Definition 2.2**.**
*An object in a category is said to have the (finite) strict refinement property if for any two (finite) product diagrams and , there exist families of morphisms and
such that and the diagrams and are product diagrams for any and .*
Theorem 2.1**.**
If is a projection-coextensive object in a category which admits (finite) products, then has the (finite) strict refinement property.
Proof.
Suppose that and are any two product diagrams for . Let be the product of the ’s where and let be the induced morphism , and similarly let be the product of the ’s where . Since is projection-coextensive, for each and there is a diagram
[TABLE]
where each square is a pushout, and the bottom row is a product diagram. We show that the diagrams and are product diagrams for any and . In the diagram
[TABLE]
the bottom row is a product diagram. Moreover, the outer vertical morphisms are product projections by Proposition 2.2, and therefore by projection-coextensivity of the two squares above are pushouts. Since the central vertical morphism in the diagram is an isomorphism, it follows that the morphism is an isomorphism, and we can similarly obtain as an isomorphism. ∎
Remark 2.3**.**
An object is called directly-irreducible if it is not a terminal object, and for any product diagram of , one of the product projections in it is an isomorphism. The uniqueness of coproduct decompositions in an extensive category is well known (see Corollary 5.4 in [9]). Theorem 2.1 together with Proposition 2.3 allows us to deduce the same fact for product decompositions of projection-coextensive objects in a category with (finite) products: if is any projection-coextensive object in a category , and we are given two product diagrams and for , where each and are directly-irreducible, then there exists a bijection and isomorphisms such that .
Proposition 2.3**.**
If is an -coextensive object in and any product projection of , then is -coextensive.
Proof.
Suppose that and are both product diagrams, where is an -coextensive object. Consider the following diagram
[TABLE]
where is the morphism induced into the product . Note that both and are product projections of , and hence both are members of by Remark 2.1. By Proposition 2.2, is a member of since . Since the top and middle rows are product diagrams and are morphisms in , both the squares and are -pushout diagrams, since is -coextensive. Now, suppose that are morphisms from , then we will show that and are -pushouts if and only if the bottom row is a product diagram. If the bottom row is a product diagram, then both and are pushout diagrams by -coextensivity. It then follows from a general fact that since and are pushouts, that is a pushout. Similarly, is a pushout. Conversely, if and are pushouts, then both and are pushouts, which implies that the bottom row is a product diagram by -coextensivity of . Finally, the pushout of a morphism in with domain along a product projection of always exists because the right-hand vertical morphism in is the identity and and were arbitrary. ∎
3 A characterization of projection-coextensivity
In what follows, we are aiming at showing that, under suitable conditions, is projection-coextensive if and only if is a Boolean lattice, which captures in a categorical way the classical characterization of the strict refinement property in [8]. The “only if” part of this statement is a direct analogue of one of the main results of Section 5 in [19], which shows that summands in a Boolean category (see Definition 3.2 below for the dual) form a Boolean lattice. Proposition 3.1 and Proposition 3.2 are also analogues of Lemma 5.9 and the beginning part of the proof of Theorem 5.11, respectively, in [19]. We will conclude this section by showing that if is a co-Boolean category, then every object is projection-coextensive, and that there are categories with finite products in which every object is projection-coextensive, and are not co-Boolean. However, if has pushout stable product projections, then is co-Boolean if and only if every object is projection-coextensive.
Definition 3.1**.**
Let be an object in a category , then by we mean the full subcategory of consisting of product projections of . If has epimorphic product projections, then is a preorder, so that in particular, if is projection-coextensive then is a preorder (see Proposition 2.1). In what follows we shall write for the posetal-reflection of when has epimorphic product projections.
Remark 3.1**.**
Let be a projection-coextensive object in a category . If is a product projection, then we shall write for the element of that represents. For product projections of , note that if and only if factors through . Note that the join exists, and is represented by the diagonal morphism in any pushout of along . Then is bounded with top element and bottom element .
Proposition 3.1**.**
Let be a projection-coextensive object in a category , and let be any element. Then for any two complements of , we have in .
Proof.
Suppose that is any product projection with complements and . By Proposition 2.1 we may form the following diagram where every square is a pushout, and every edge a product diagram.
[TABLE]
It then follows that and are isomorphisms so that . ∎
Corollary 3.1**.**
Given any projection-coextensive object in a category , and any product diagram in . If is an isomorphism then is a terminal object.
Let be a projection-coextensive object in a category , then for any there exists unique complement with members of complements of members of (Proposition 3.1). We always denote the complement of by in what follows.
Proposition 3.2**.**
For a projection-coextensive object in a category , the map is order-reversing.
Proof.
The proof amounts to showing that in the diagram
[TABLE]
where the central column and central row are product diagrams and each square is a pushout, if the dotted arrow exists making the upper right-hand triangle commute, then factors through . Suppose that the dotted arrow exists, so that factors through . Then since is an epimorphism (Proposition 2.1), the upper left-hand triangle commutes, and therefore is an isomorphism. The object is projection-coextensive by Proposition 2.3, so that by Corollary 3.1 it follows that is terminal. Finally, this implies that is an isomorphism, since the right-hand edge is a product diagram, and hence factors through via . ∎
Corollary 3.2**.**
Let be a category and a projection-coextensive object in , then is a Boolean lattice.
Proof.
By Proposition 3.2 and Proposition 3.1, the map is an order-reversing involution. This turns into a lattice, where meets are given by:
[TABLE]
It is straight-forward to check that is uniquely complemented, i.e., for every if is such that and then , so that by Theorem 6.5 in [2], it follows that is distributive, and hence a Boolean lattice. ∎
Proposition 3.3**.**
Suppose that is a category, and let be an object with co-disjoint products, where the pushout of two product projections of are again product projections. If is a Boolean lattice, then is projection-coextensive.
Proof.
Note that the join of and in is represented by the diagonal in any pushout of along . Consider the diagram:
[TABLE]
where are complementary product projections, and are product projections. Note that and , since has co-disjoint products. Suppose that the two squares above are pushouts. Since and are product projections, the morphism is a product projection. By the universal property of product, it follows that in . Also, we have and , but since and , it follows that
[TABLE]
and thus so that the bottom row is a product diagram. Now suppose that the bottom row is a product diagram, then we must have that . If then is an isomorphism, and since is an epimorphism, the right-hand square is a pushout. Moreover, so that , so that the left-hand square is a pushout. Thus, in the case that both of the squares above are pushouts, and similarly if . Now suppose that . Note that since and we have that . In particular, this shows that is not comparable to (since if it were it would be either or ).
Consider the elements and . By the universal property of pushout, we have that and . If , then we would have that , so that , which contradicts the assumption, so that is not comparable to and similarly is not comparable to . Since and , the sublattice of generated by the elements is given by the Hasse diagram:
[TABLE]
where the solid lines indicate strict inequality. By Birkhoff’s characterization of distributive lattices, cannot contain sublattices isomorphic to the pentagon. This forces and . ∎
As a consequence of Corollary 3.2 and Proposition 3.3 we have the following characterization of projection-coextensivity.
Theorem 3.1**.**
Suppose that is a category with finite products and let be any object with co-disjoint products, then the following are equivalent:
- (i)
* is projection-coextensive.* 2. (ii)
The pushout of any two product projections of are product projections, and is a Boolean lattice.
The following definition is the dual of Definition 5.1 in [20] (see also [19] for the original definition of a Boolean category).
Definition 3.2**.**
A category with finite products is co-Boolean if it satisfies the following:
For every product projection and any morphism there exists a pushout square
[TABLE]
with a product projection. 2. 2.
Product projections pushout product diagrams to product diagrams. 3. 3.
If is a product diagram, then is a terminal object.
Corollary 3.3**.**
Every object in a co-Boolean category is projection-coextensive.
Proof.
Let be a co-Boolean category, then by Lemma 5.2 in [19] it follows that every object in has co-disjoint products. Moreover, every in has a Boolean-lattice by Theorem 5.11 in [19], so that by Theorem 3.1, every is projection-coextensive. ∎
Remark 3.2**.**
If is a category with finite products where product projections are pushout stable, then the converse holds: is co-Boolean if and only if every object is projection-coextensive. The necessity of the condition that product projections be pushout stable is illustrated by the full subcategory of consisting of centerless groups. Recall that a group is centerless if its center is the trivial subgroup. A product of groups is centerless if and only if each factor is centerless. Every centerless group is projection-coextensive in as well as in (see Proposition 6.2). However, the category is not a co-Boolean category. To see this, note that for any group the abelianization of may be obtained from the pushout:
[TABLE]
If is non-trivial, then since is abelian, the morphism can not be a product projection, if is centerless. For example, if is the symmetric group on 3 elements, then its abelianization is isomorphic to , and also is centerless. This shows that centerless groups do not form a co-Boolean category, however they do form a category with finite products where every object is projection-coextensive.
4 Projection-coextensivity in regular categories
A category is regular [1] if it has finite limits, coequalizers of kernel-pairs, and the pullback of a regular epimorphism along any morphism is again a regular epimorphism. Listed below are some elementary facts about morphisms in a regular category .
- •
Every morphism in factors into a regular epimorphism followed by a monomorphism.
- •
If are regular epimorphisms in , then their product is a regular epimorphism.
- •
For any two morphisms and in , if is a regular epimorphism, then is a regular epimorphism. Also, if and are regular epimorphisms, then is a regular epimorphism.
Definition 4.1**.**
An object in a regular category is said to have global support if any terminal morphism is a regular epimorphism.
Remark 4.1**.**
If is an object with global support in a regular category , then any product projection of is a regular epimorphism. This is because any factor of an object with global support itself has global support, and any product projection of can be obtained as a pullback of a terminal morphism of one of its factors.
4.1 Subobjects and relations in regular categories
Given any object in a regular category , consider the preorder of all monomorphisms with codomain . The posetal-reflection of this preorder is – the poset of subobjects of . For any morphism in there is an induced Galois connection
[TABLE]
which is defined as follows. Given a subobject of represented by a monomorphism , is defined to be the subobject represented by the monomorphism part of a (regular epi, mono)-factorization of . Given a subobject of represented by a monomorphism , we define to be the subobject of represented by the monomorphism obtained from pulling back along . A relation from to is a subobject of , i.e., an isomorphism class of monomorphisms with codomain . In regular categories we can compose relations as follows: given a relation from to and a relation from to , and two representatives and of and respectively, form the pullback of along :
[TABLE]
Then is defined to be the relation represented by the monomorphism part of any regular-image factorization of .
Definition 4.2**.**
In what follows we will write for the poset of all equivalence relations on an object . Recall that an equivalence relation is said to be effective if it represented by a kernel pair of some morphism. We will write for the poset of all effective equivalence relations on an object .
Definition 4.3**.**
A factor relation on an object is an equivalence relation represented by the kernel equivalence relation of a product projection of . A factor relation represented by the kernel equivalence relation of a complement of is correspondingly called a complement of , and will often be denoted by . The poset of factor relations on is bounded with top element and bottom element .
For any effective equivalence relations on an object in a regular category , we have if and only if the canonical morphism
[TABLE]
is a regular epimorphism (Proposition 4.1). The kernel equivalence relation of is given by , so that is mono if and only if . These remarks are summarized in the following proposition, whose proof is omitted.
Proposition 4.1** (Proposition 1.44. in [13]).**
A pair of effective equivalence relations on an object in a regular category are complementary factor relations if and only if and .
Remark 4.2**.**
Suppose that is an object with global support in a regular category . Every element of maps to an element of (by taking coequalizers), and likewise each element of maps to an element of (by taking kernel pairs). These maps are inverse poset isomorphisms.
Proposition 4.2**.**
Let be a regular category, and suppose that in the diagram
[TABLE]
the vertical morphisms are regular epimorphisms, the top and bottom rows are product diagrams, and that has global support, then the squares are pushouts.
Proof.
Consider the diagram
[TABLE]
where and are the kernel-pairs of and respectively, and are the induced morphisms. The bottom row being a product diagram implies that the top row is a product diagram, and having global support implies that has global support, so that by Remark 4.1 both and are (regular) epimorphisms. Then and being epimorphisms implies that the bottom squares are pushouts. ∎
Theorem 4.1**.**
Suppose that is an object with global support in a regular category , and that admits pushouts of any two of its product projections. Then has the finite strict refinement property if and only if it is projection-coextensive.
Proof.
If is projection-coextensive, then by Theorem 2.1 it follows that has the strict refinement property. Suppose that is a product diagram, and that is any product projection. If has the finite strict refinement property, then there exists product projections making the diagram
[TABLE]
commute, and the bottom row a product diagram. Note that since has global support and is regular, every morphism in the diagram above is a regular epimorphism. By Proposition 4.2 the two squares are pushouts. Therefore, if we are given the diagram above, where the top row is a product diagram and the vertical morphisms are product projections, if the squares are pushouts then the bottom row is a product diagram. On the other hand, if the bottom row is a product diagram, then by Proposition 4.2 it follows that the two squares are pushouts. ∎
Corollary 4.1**.**
Given an object with global support in a regular category , then is projection-coextensive if and only if the pushout of a product diagram along a product projection exists, and is a product diagram.
Corollary 4.2**.**
Let be a complete regular category and let be an object with global support in . If has the finite strict refinement property, then has the strict refinement property.
Proof.
This follows from the fact that if has the finite strict refinement property, then it is projection-coextensive. Then being projection-coextensive, it has the strict refinement property by Theorem 2.1. ∎
4.2 Pre-exact categories and strict refinement
Given a category with kernel pairs and coequalizers of equivalence relations, any equivalence relation on any object in admits an effective closure , namely, the kernel equivalence relation of any coequalizer of .
Definition 4.4**.**
A regular category is said to be pre-exact if it admits coequalizers of equivalence relations, and for any two equivalence relations and , we have .
Remark 4.3**.**
Any exact category in the sense of [1] is pre-exact, since every equivalence relation is effective, and hence , so that satisfies the conditions of Definition 4.4.
Proposition 4.3**.**
Let and be regular categories which have coequalizers of equivalence relations, and let be a functor which preserves finite limits, coequalizers of equivalence relations, and reflects epimorphisms. If is pre-exact, then so is .
The proof of the above proposition is a standard preservation and reflection argument, the details of which can be found in the proof of Proposition 4.1 in [13]. We include a sketch of that argument here:
Proof Sketch.
The functor preserves finite limits and effective closures of equivalence relations, and reflects equality of effective equivalence relation. The latter is due to the fact that any morphism in between kernel pairs, which is an epimorphism, is necessarily and isomorphism. ∎
Example 4.1**.**
The dual categories of topological spaces, ordered sets, graphs and binary relations, all admit forgetful functors to these forgetful functors satisfy the conditions of Proposition 4.3, and since is pre-exact (since it is exact), it follows that each of the categories above are pre-exact (since they are all regular categories which have coequalizers of equivalence relations). The category of topological groups is regular, but not exact. It has all small limits and colimits, and the forgetful functor has both a left and a right adjoint, and therefore it preserves all limits and colimits which exist in . This functor reflects epimorphisms, and therefore since is exact, is pre-exact.
The next result is an analogue of Theorem 4.5 in [8], for regular categories (see also Theorem 5.17 in [21]). Note that, given two factor relations and on an object in a pre-exact category such that , the composite is an equivalence relation which is the join of and in . Moreover, the join of and in the lattice of effective equivalence relations exists, and is given by the effective closure of . In what follows we will write for .
Proposition 4.4**.**
The following are equivalent for an object with global support in a pre-exact category .
- (i)
* is projection-coextensive.* 2. (ii)
* is a sublattice of which is Boolean.* 3. (iii)
* forms a Boolean lattice under the operations and .*
Proof.
: By Corollary 3.2, if is projection-coextensive, then is a Boolean lattice where joins are given by pushout. Note that is isomorphic to (see Remark 4.2), and the join of two factor relations and is given by their join in . We next show that the meet of and in is given by their meet in the lattice of effective equivalence relations on . Suppose that are the complementary factor relations of and respectively. Since is projection-coextensive, every edge in the outer square:
[TABLE]
is a product diagram. This implies that
[TABLE]
Since the canonical morphism
[TABLE]
is a complementary product projection of , and by Proposition 3.1 complements are unique, it follows that the meet of two factor relations in is given by:
[TABLE]
Therefore is a sublattice of which is Boolean. Suppose that , and that is the complement of and the complement of . Then
[TABLE]
which implies that
[TABLE]
This implies that is an equivalence relation, so that in , and therefore is a Boolean lattice under and . For , just note that being Boolean under and implies that is a Boolean lattice, and that the pushout of any two product projections of are product projections. Therefore, by Theorem 3.1 it follows that is projection-coextensive, since every object with global support in a regular category has co-disjoint-products. ∎
Remark 4.4**.**
Note that the proof of is similar to the proof of Theorem 4.5 in [8].
In [3], the author characterized the congruence distributivity property for regular Goursat categories in terms of preservation of binary meets of equivalence relations by regular-epimorphisms. One of the basic observations is that if is any regular epimorphism in a regular category and any equivalence relation on , then in the notation of Section 4.1 we have
[TABLE]
where is the kernel equivalence relation of . In what follows we will denote and , so that the above equation reduces to:
[TABLE]
Proposition 4.5**.**
The following are equivalent for an object with global support in a pre-exact category .
- (i)
* is projection-coextensive.* 2. (ii)
For any , and we have
[TABLE]
where is a canonical quotient.
Proof.
Suppose that is projection-coextensive, so that by Proposition 4.4, is a Boolean lattice under and . Let be a canonical quotient, then:
[TABLE]
For the converse, suppose and that is a canonical quotient, then since it follows that
[TABLE]
Since
[TABLE]
the canonical morphism
[TABLE]
is a regular epimorphism. Its kernel equivalence relation is given by
[TABLE]
since is pre-exact. This implies that pushing out the product diagram along is a product diagram, and thus by Corollary 4.1 it follows that is projection-coextensive. ∎
As a summary of Theorem 2.1, Theorem 4.1, Propositions 4.4 and 4.5 we have the following theorem.
Theorem 4.2**.**
The following are equivalent for an object with global support in a small complete pre-exact category .
- (i)
* has the strict refinement property.* 2. (ii)
* has the finite strict refinement property.* 3. (iii)
* is projection-coextensive.* 4. (iv)
* is a sublattice of which is Boolean.* 5. (v)
* is a Boolean lattice under the operations and .* 6. (vi)
For any , and we have
[TABLE]
where is a canonical quotient, and is the complement of .
5 Majority categories have strict refinements
The notion of a majority category was first introduced and studied in [14] and [17]. The theorem below slightly updates Theorem 3.1 in [17], where the equivalence of , , and of the theorem below was shown.
Theorem 5.1**.**
For a regular category , the following are equivalent.
- (i)
For any three reflexive relations on any object in we have . 2. (ii)
For any three reflexive relations on any object in we have . 3. (iii)
For any three equivalence relations on any object in we have . 4. (iv)
For any three equivalence relations on any object in we have . 5. (v)
* is a majority category.*
Proof.
It is easily seen that implies , thus it suffices show that implies . We note that using a similar argument as in the proof of Theorem 3.1 in [17], it can be shown that if holds, then the formula also holds for any equivalence relations on any object in . Suppose that holds, and that are any equivalence relations on the same object in , then:
[TABLE]
This shows that holds. ∎
In [11] the notion of a factor permutable category was introduced, and as we will see, every regular majority category is factor permutable.
Definition 5.1**.**
A regular category is said to be factor permutable if for any equivalence relation on any object in we have for any factor relation .
Proposition 5.1**.**
Every regular majority category is factor-permutable.
Proof.
Let be any equivalence relation on an object in , and let be a factor relation on with complement . Then
[TABLE]
by Theorem 5.1. ∎
Proposition 5.2**.**
Every object with global support in a pre-exact majority category is projection-coextensive.
Proof.
Given any two factor relations with complements respectively, the two equivalence relations and permute by Proposition 5.1, so that the composite is an equivalence relation. Moreover we have
[TABLE]
but also, we have
[TABLE]
Therefore, and are complementary factor relations, so that is closed under the operations of and . It then follows by Theorem 5.1 that is distributive, so that by Theorem 4.2, is projection-coextensive. ∎
6 Centerless objects in a Mal’tsev category have strict refinements
Recall the notion of a Mal’tsev category:
Definition 6.1** ([6, 7]).**
A finitely complete category is Mal’tsev if any reflexive relation is an equivalence relation.
In [4], the authors develop a categorical approach to centrality of equivalence relations. The central notion, that of a connector of equivalence relations, is defined in any finitely-complete category. When the base category is Mal’tsev, it reduces to the following:
Definition 6.2** ([4]).**
Let be a Mal’tsev category, and let and represent two equivalence relations and on an object , respectively. Consider the pullback below:
[TABLE]
A connector between and is a morphism such that and
[TABLE]
If there exists a representative of which admits a connector with a representative of , then we say that and are connected, or that the pair is commuting.
Let be a regular Mal’tsev category, then for any equivalence relations on any object in , the following properties hold:
- •
If and is commuting, then is commuting (Proposition 3.10 in [4]).
- •
If is commuting and is any regular epimorphism, then is commuting (Proposition 4.2 in [4]).
- •
If is commuting, and is commuting, then is commuting (Proposition 4.3 in [4]).
- •
If is commuting, and is commuting, then is commuting (Proposition 3.12 in [4]).
- •
If , then is commuting (Lemma 3.9 in [4]).
Definition 6.3**.**
An object in a regular Mal’tsev category is said to be centerless if for any equivalence relation on , we have that if is commuting then .
Proposition 6.1**.**
Let and be objects in a regular Mal’tsev category , then is centerless if and only if both and are centerless.
Proof.
Suppose that is centerless, and let be any equivalence relation on such that is commuting. Trivially, we have that is commuting, so that is commuting. Therefore , which implies . Conversely, if and are centerless then given any equivalence relation on such that is commuting, then and is commuting, so that and . This implies that . ∎
Proposition 6.2**.**
If is a centerless object with global support in a pre-exact Mal’tsev category, then is projection-coextensive.
Proof.
We will show that satisfies the conditions of in Theorem 4.2. Suppose that are any factor relations, and let be the corresponding complement of . Then we have that , since regular Mal’tsev categories are congruence permutable [7]. Let be a canonical quotient morphism, then by Proposition 6.1, it follows that is centerless. Since it follows that the pair is commuting, and therefore is commuting, so that both and is commuting, and consequently is commuting. Since , we have that is commuting. This implies since is centerless. ∎
7 Regular-coextensivity and factorable congruences
Suppose that is any object in a category with products. Given any product diagram , and any effective equivalence relations and represented by and then the composite monomorphism
[TABLE]
represents an effective equivalence relation on which will always be denoted by in what follows.
Definition 7.1**.**
An object in a category with finite products is said to have factorable congruences if for any effective equivalence relation on , and any product diagram , there exist effective equivalence relations and on and respectively, such that .
Definition 7.2**.**
An object in a category is said to be regularly-coextensive if it is -coextensive with the class of all regular epimorphisms in .
Proposition 7.1**.**
Let be a regular category, then any object with global support is regularly-coextensive if and only if for any regular epimorphism , and any binary product diagram there exist morphisms and and morphisms and such that in the commutative diagram
[TABLE]
the bottom row is a product diagram.
The proof below is similar to the proof of Theorem 4.1.
Proof.
The “only if” part is immediate. Consider the diagram in the statement of the proposition, then by Proposition 4.2 it follows that the two squares are pushouts. This also implies that pushing out the top row along produces a product diagram. On the other hand, if the bottom row is a product diagram, then by Proposition 4.2 both squares are pushouts. ∎
Proposition 7.2**.**
Let be a regular category, then any object with global support has factorable congruences if and only if it is regularly-coextensive.
Proof.
Let have factorable congruences, and suppose that is any effective equivalence relation, and that is a quotient of by . Suppose also that is any product diagram. By assumption, there exist effective equivalence relations and on and respectively with . Let and be the respective quotients of and , then there exist and such that the bottom row in the diagram
[TABLE]
is a product diagram. Thus by Proposition 7.1 it follows that is regularly-coextensive. ∎
Recall from Remark 4.1 that in a regular category , every object with global support has regular-epimorphic product projections. This immediately gives the following corollary.
Corollary 7.1**.**
If is an object with global support in a regular category , which is regularly-coextensive then is projection-coextensive.
Remark 7.1**.**
In [18] the author shows, amongst other things, that if a non-empty universal algebra has factorable congruences, then it has the strict refinement property. Corollary 7.1, generalizes this result.
Remark 7.2**.**
We note that a similar proof of Proposition 2.7 in [16] (see also Remark 2.8 in [16]) may be used to show that if is a category in which every object is regularly coextensive, then binary products commute with arbitrary coequalizers in . This shows in particular, that if is a variety of universal algebra with constants, in which every algebra has factorable-congruences, then binary products commute with arbitrary coequalizers in .
8 Concluding remarks
If is a class of morphisms closed under products in , then we could have defined to be -coextensive when for any product diagram the canonical functor
[TABLE]
is an equivalence (where is the full subcategory of consisting of morphisms from ). Under suitable conditions on this notion could be equivalently reformulated in a similar way as Definition 1.2, where “-pushout” would have a different meaning. Still further variants of coextensivity are possible, and it is an interesting question of whether or not other refinement properties, such as the intermediate refinement property [8], are captured as some variant of coextensivity.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] M. Barr, P. A. Grillet, and D. H. van Osdol. Exact categories and categories of sheaves. Springer, Lecture Notes in Mathematics , 236, 1971.
- 2[2] T. S. Blyth. Lattices and Ordered Algebraic Structures . Universitext. Springer London, 2005.
- 3[3] D. Bourn. Congruence distributivity in Goursat and Mal’cev categories. Applied Categorical Structures , 13:101–111, 2005.
- 4[4] D. Bourn and M. Gran. Centrality and connectors in Maltsev categories. Algebra Universalis , 48:309–331, 2002.
- 5[5] A. Carboni, S. Lack, and R. F. C. Walters. Introduction to extensive and distributive categories. Journal of Pure and Applied Algebra , 84:145–158, 1993.
- 6[6] A. Carboni, J. Lambek, and M. C. Pedicchio. Diagram chasing in Mal’cev categories. Journal of Pure and Applied Algebra , 69:271–284, 1991.
- 7[7] A. Carboni, M. C. Pedicchio, and N. Pirovano. Internal graphs and internal groupoids in Mal’cev categories. Canadian Math. Soc. Conference proceedings , 13:97–109, 1991.
- 8[8] C. Chang, B. Jonsson, and A. Tarski. Refinement properties for relational structures. Fundamenta Mathematicae , 55:249–281, 1964.
