Characterizations of majority categories
Michael Hoefnagel

TL;DR
This paper extends algebraic characterizations of majority terms to regular categories, establishing categorical versions of key theorems like Bergman's Double-projection and Pixley's congruence equation.
Contribution
It provides categorical analogues of algebraic majority characterizations, including a version of Bergman's theorem and the Chinese Remainder Theorem, for regular categories.
Findings
A regular category is a majority category iff subobjects are determined by two-fold projections.
Established a categorical version of Bergman's Double-projection Theorem.
Characterized regular majority categories via Pixley's congruence equation.
Abstract
In universal algebra, it is well known that varieties admitting a majority term admit several Mal'tsev-type characterizations. The main aim of this paper is to establish categorical counterparts of some of these characterizations for regular categories. We prove a categorical version of Bergman's Double-projection Theorem: a regular category is a majority category if and only if every subobject of a finite product is uniquely determined by its two-fold projections. We also establish a categorical counterpart of the Pairwise Chinese Remainder Theorem for algebras, and characterize regular majority categories by the classical congruence equation due to A.F.~Pixley.
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
TopicsAlgebraic structures and combinatorial models · Advanced Algebra and Logic · Homotopy and Cohomology in Algebraic Topology
Characterizations of majority categories
Michael Hoefnagel
Abstract
In universal algebra, it is well known that varieties admitting a majority term admit several Mal’tsev-type characterizations. The main aim of this paper is to establish categorical counterparts of some of these characterizations for regular categories. We prove a categorical version of Bergman’s Double-projection Theorem: a regular category is a majority category if and only if every subobject of a finite product is uniquely determined by its two-fold projections. We also establish a categorical counterpart of the Pairwise Chinese Remainder Theorem for algebras, and characterize regular majority categories by the classical congruence equation due to A.F. Pixley.
1 Introduction
The variety of lattices is one which admits a majority term, i.e., a ternary term satisfying the equations . This property of sharply distinguishes it from other familiar varieties, such as the varieties of groups, of rings, and of modules over a ring . For lattices, the median operation:
[TABLE]
as well as its lattice-theoretic dual, are both majority terms [4]. Several theorems that hold for the variety of lattices extend to characterizations of those varieties which admit a majority term. Among such theorems is Bergman’s Double-projection Theorem, which asserts that a sublattice of a finite product of lattices is uniquely determined by its two-fold projections in for [3]. Also, there is the Pairwise Chinese Remainder Theorem for lattices due to R. Willie [17]: if are congruences on a lattice , and any elements, then if the system of congruences
[TABLE]
is solvable two at a time, then it is solvable.
A.P. Huhn showed that the theorems mentioned above extend to characterizations of those varieties which admit a majority term (for a proof see [1]):
Theorem 1**.**
The following are equivalent for a variety of algebras.
- (i)
* admits a majority term.* 2. (ii)
Any subalgebra of a finite product of algebras is uniquely determined by its two-fold projections in 3. (iii)
For any congruences on any algebra and any elements , if the system of congruences
[TABLE]
is solvable two at a time, then it is solvable.
These results complement the first Mal’tsev-type characterization of varieties admitting a majority term due to A.F. Pixley.
Theorem 2** ([16]).**
A variety admits a majority term if and only for any algebra in , and any three congruences on , we have
[TABLE]
The main aim of this paper is to establish categorical counterparts of the two theorems above. Using the general techniques of [14], it is possible to reformulate statement (i) of Theorem 1 for general categories. The resulting notion, that of a majority category, has been introduced and studied in [12]. If we are to categorically reformulate the statement of Theorem 2, and also the statement (ii) of the Theorem 1, then the base category should possess a corresponding notion of composition of binary relations, as well as a corresponding notion of image-factorization of a morphism. Regular categories [2] provide a good context for both of these notions, and it is for regular categories that we establish the categorical counterparts of the above-mentioned theorems.
One of the consequences of one of the main theorems (Theorem 3) is that a regular Mal’tsev category (see [10] and [9]) is congruence distributive if and only if it is a majority category. This result generalizes Pixley’s result for varieties, and clarifies a remark of D. Bourn in [7] about whether or not the categories of topological von Neumann regular rings and of topological Boolean rings are fully congruence distributive or not.
2 Preliminaries
Recall that a category is said to be regular [2] if:
- (i)
has finite limits and coequalizers of kernel pairs. 2. (ii)
The class of regular epimorphisms in is pullback stable, i.e., if the diagram
[TABLE]
is a pullback in , and is a regular epimorphism, then so is .
The following are important consequences (i) and (ii), and will be used without mention in what follows:
Every morphism in factors as where is a regular epimorphism and a monomorphism. The factorization is sometimes called an image factorization of . 2. 2.
If and are regular epimorphisms in , then is a regular epimorphism in . 3. 3.
If the composite of two morphisms and in is a regular epimorphism, then is a regular epimorphism.
If and are monomorphisms in a category , then we write if factors through , i.e., if there exists such that . This defines a preorder on the class of all monomorphisms in with codomain . The posetal reflection of is called the poset of subobjects of , and is denoted by . Explicitly, a subobject is an equivalence class of monomorphisms with codomain , where two monomorphisms are equivalent if and only if and . If is a member of , then we will say that is the subobject represented by in what follows.
In any category the pullback of a monomorphism along any morphism is again a monomorphism, which is to say that if the diagram:
[TABLE]
is a pullback diagram in , and is a monomorphism, then so is . Given that has pullbacks of monomorphisms along monomorphisms and are any subobjects represented by and respectively, then we write for the subobject of represented by the diagonal monomorphism in any pullback
[TABLE]
Remark 1**.**
If and are two image factorizations of a morphism in a regular category , then and represent the same subobject of , which is denoted by . Given a subobject of represented by we will write for the subobject represented by the mono part of an image factorization of . Also, we will often refer to as the image of under .
Definition 1**.**
Given a subobject , represented by , then for any morphism with codomain we write if factors through , and has domain .
[TABLE]
Remark 2**.**
If factors through one representative of , then it factors through all representatives of . If is a regular epimorphism, then if and only if .
Definition 2**.**
Let be a category with binary products, then an -ary relation between is simply a subobject of .
Definition 3** ([12]).**
A ternary relation between objects in a category with products is said to be majority-selecting if it satisfies:
[TABLE]
A category (with products) is then a majority category if every internal ternary relation in is majority selecting.
Let be a relation between objects and , and a relation between objects and in a regular category . Suppose that and represent ans respectively. Consider the diagram:
[TABLE]
where is a pullback of along . The composite is the relation represented by the monomorphism , which is obtained by taking the image factorization of as in the diagram:
[TABLE]
Proposition 1**.**
If is any morphism, then if and only if there exists a regular epimorphism and a such that and .
Proof.
If factors though , then the dotted arrow exists making the triangle in the diagram
[TABLE]
commute. Then we can pull back along , to produce and in the diagram above. Then setting , we have that and satisfy the required conditions.
For the ’only if’ part, suppose that and , then it is easy to see that which by Remark 2 implies that . ∎
3 Pixley’s theorem for categories
The first Mal’tsev type characterization of varieties admitting a majority term was given by Pixley (Theorem 2), and it states that a variety admits a majority term if and only if for any three congruences on any algebra in we have
[TABLE]
The aim of this section is to establish the corresponding categorical theorem.
Lemma 1**.**
Let be a regular majority category, then for any three reflexive relations on any object in we have:
[TABLE]
Proof.
Let , and represent the three reflexive relations respectively. Consider the quaternary relation represented by , which is formed from the following pullback:
[TABLE]
Set theoretically, is the relation defined by:
[TABLE]
Consider the image factorization of in the diagram below:
[TABLE]
Now, let be such that then there exist regular epis and as well as morphisms and such that and , together with and . We may assume that , since if not, we could pullback along . Then note that we have that
[TABLE]
which implies that
[TABLE]
and since is majority selecting, it follows that . Thus, there exists such that . Now, take the pullback of along , to obtain the diagram below:
[TABLE]
Then, if we let , it follows that . Now by construction of , it follows that and , so that
[TABLE]
- by Remark 2. ∎
Lemma 2**.**
Let be a regular category such that for any three effective equivalence relations on an object , we have
[TABLE]
then is a majority category.
Proof.
Consider the ternary relation represented by the monomorphism , we will show that it is majority selecting in the sense of Definition 3. Let
[TABLE]
and be any morphisms in such that the diagrams:
[TABLE]
commute. Consider the kernel congruences on formed from taking the kernel pairs of respectively. Then , so that there exists a regular epimorphism and a morphism such that and by Proposition 1. This implies that and and , and therefore which implies that by Remark 2. ∎
Theorem 3**.**
Let be a regular category, then the following are equivalent for .
- (i)
* is a majority category.* 2. (ii)
For any three reflexive relations on any object in we have:
[TABLE] 3. (iii)
For any three reflexive relations on any object in we have:
[TABLE] 4. (iv)
For any equivalence relations on any object in we have:
[TABLE] 5. (v)
For any effective equivalence relations on any object in we have:
[TABLE]
Proof.
Note that if satisfies , then for any three reflexive relations on an object in we have
[TABLE]
This is because we may take the double opposite of the left-hand side:
[TABLE]
Now, to prove the theorem above it suffices to show the implication , since Lemma 1 gives , and Lemma 2 gives , and is trivial. Suppose that holds, then we have:
[TABLE]
by repeated application of . ∎
Given a morphism in a regular category and a subobject , we will write for the subobject , and similarly we write for . If is regular, then we have:
[TABLE]
where is the kernel equivalence relation on associated to . D. Bourn showed in [7], that a regular Mal’tsev category is congruence distributive if and only if for any regular epimorphism and any equivalence relations , we have (in fact this was shown more generally for Goursat categories). The proof of the following proposition is essentially the proof of Theorem 2.1 in [7], however we include it for completeness.
Proposition 2**.**
Let be a regular category, then the following are equivalent.
- (i)
For any regular epimorphism , and any reflexive relations we have . 2. (ii)
For any three reflexive relations on any object in , we have
[TABLE]
The proof below is essentially that which can be found in [7], however we include a sketch for completeness.
Proof Sketch.
For : suppose that and and represent respectively. Note that since is reflexive, that and are regular epimorphisms (as they are split epimorphisms). Also, we have and , so that:
[TABLE]
For : suppose that is any regular epimorphism, then we have that
[TABLE]
∎
Corollary 1**.**
For any regular epimorphism in a regular majority category , and any reflexive relations on we have
[TABLE]
Proof.
We show that any regular majority category satisfies of Proposition 2: suppose that are reflexive relations on an object in . Then we always have:
[TABLE]
For the reverse inequality, we have
[TABLE]
- by (ii) of Theorem 3. ∎
Recall that if is a regular Mal’tsev category, then for any two equivalence relations on any object in , the join exists, and is given by
[TABLE]
Corollary 2**.**
Let be a regular Mal’tsev category. Then is congruence distributive if and only if is a majority category.
The notion of a protoarithmetical category, which was first introduced by D. Bourn in [6], has a strong relation to majority categories: every finitely complete Mal’tsev majority category is protoarithmetical (see [12]), and a Barr exact category is protoarithmetical if and only if it is both Mal’tsev and a majority category. In the regular context, we have the following characterization of protoarithmetical categories in terms of a certain weak congruence distributivity.
Theorem** ([5]).**
For a regular Mal’tsev category the following are equivalent.
* is a protoarithmetical category.* 2. 2.
For any three equivalence relations on any object in , if and then .
For example, in [7], the author remarks that the categories of topological Von Neumann regular rings, or of topological Boolean rings, are both regular protoarithmetical categories, and therefore they satisfy the above weak version of congruence distributivity. It is then remarked that ’it is far less clear, at this point, if they are fully congruence distributive or not’. However, the corollary above shows that it is indeed the case that they are fully congruence distributive (since they are majority categories). The general question of whether weak congruence distributivity is equivalent to full congruence distributivity, is given in the negative in [12]. There the author constructs a regular protoarithmetical category which is not a majority category, and hence which is not congruence distributive.
4 Bergman’s Double-projection Theorem for regular categories
If is any sublattice of a finite product of lattices , then is uniquely determined by its images under the canonical projections . As mentioned in the introduction, this is property of extends to a characterization of varieties which admit a majority term.
Theorem** (K.A. Baker and A.F. Pixley [1]).**
The following are equivalent for a variety of algebras.
* admits a majority term.* 2. 2.
Any subalgebra of a finite product of algebras in is uniquely determined by its two-fold images under the canonical projections .
The aim of this section is to generalize this theorem to a characterization of regular majority categories.
Definition 4**.**
Let be a regular category and let be a set, and any subset. Suppose that is a family of objects in , such that both products and exist. Then for any subobject of , the image of under the canonical morphism:
[TABLE]
is called the -image of in and is denoted by .
Definition 5**.**
Let be a regular category and let be a set and a family of subsets of . Then the product (if it exists) is said to have -fold subobject decompositions if it satisfies the following property: for any two subobjects of , if for any , then . In other words, we say that every subobject of is uniquely determined by its -fold images. If every product indexed by (which exists) has -fold subobject decompositions, then we say that has -fold subobject decompositions.
Proposition 3**.**
Let be a regular category, and let be a set and a family of subsets of . The following are equivalent for a family of objects in .
- (i)
* has -fold subobject decompositions.* 2. (ii)
For any monomorphism , the diagram
[TABLE]
is a pullback, where
[TABLE]
is a regular epi, mono factorization of .
Proof.
For (i) (ii): let be any monomorphism, and consider the diagram below where the square is a pullback:
[TABLE]
By construction, the outer rectangle commutes, so that the dotted arrow exists. We claim that the subobject represented by has the same two fold images as the subobject represented by . Let be any element then since is a regular epimorphism, is also a regular epimorphism. Then the factorization is an image factorization, therefore the -image of the subobject represented by in is . Therefore, the subobjects represented by and are the same, so that is an isomorphism, which implies that the outer rectangle is a pullback. Finally, (ii) (i) follows from the universal property of pullback. ∎
Definition 6**.**
Let be any set. For any regular category , we say that has -fold subobject decompositions over (where is a positive integer) if it has -fold decompositions, where is the set of all subsets of of size . If is a countable set, then we say that has countable -fold subobject decompositions. If has -fold subobject decompositions over any finite set, then is said to have finite -fold subobject decompositions.
Theorem 4**.**
Let be a regular category. If has finite 2-fold subobject decompositions, then is a majority category.
Proof.
Suppose that is any subobject of represented by . Let and and be the monomorphisms formed from taking the mono part of the image-factorization of , and respectively. Consider the pullback square below:
[TABLE]
It is easily seen that is majority selecting in the sense of Definition 3, and therefore by Proposition 3 we have , so that is majority selecting. ∎
Given any relation on a product , we can consider the image of under the canonical projections and which give two relations and on and , respectively. Conversely, given and represented by and respectively, then the composite morphism
[TABLE]
is a mono (where is the canonical ’transpose’ isomorphism), which represents a relation on . Note, that we always have .
Definition 7**.**
A regular category is said to have directly decomposable reflexive relations, if for any reflexive relation on a product in , we have .
Example 1**.**
The category of unitary rings has directly decomposable reflexive relations, and the category does not. For a proof of this, we refer the reader to Example 3.9 in [11].
Proposition 4**.**
Let be any regular category with which has finite two-fold subobject decompositions. Then has directly decomposable reflexive relations.
Proof.
For any relation on a product , its easy to see that both and have the same two-fold projections, when viewed as subobjects of . ∎
In Theorem 5, we will see that any regular majority category has finite 2-fold subobject decompositions. This is then the categorical analogue of the lattice-theoretic double-projection theorem of Bergman mentioned in the introduction. As we will see in the next section, there are no finitary varieties which have countable 2-subobject decompositions, however, there are infinitary varieties which do.
4.1 Infinite subobject decompositions
Proposition 5**.**
The only finitary varieties of algebras which have countable -fold subobject decompositions are trivial, i.e., each algebra in has at most element.
Proof.
Suppose that is a finitary variety which has countable -fold subobject decompositions. Consider the set theoretic maps:
[TABLE]
Let and , then each induces a homomorphism via the free algebra in . Now let be the induced homomorphism into the product of the
[TABLE]
Then is a monomorphism. Let be the two-fold image of in , and consider the image factorization:
[TABLE]
where is the canonical inclusion, and the canonical projection. Let be the homomorphism sending to , and let . Now, for any we have that since if then and . Consider the homomorphism sending to , this gives the following commutative diagram:
[TABLE]
Now, by Proposition 3, the square:
[TABLE]
is a pullback. Therefore, there exists a morphism , making the relevant triangle commute. This amounts to the existence of an element such that for any . Since is an element of it follows that where is a -ary term, and . Now, let , then it follows that
[TABLE]
but also we have
[TABLE]
so that in . This implies that every algebra in has at most one element. ∎
In the above proof it is crucial that be finitary, as the finiteness of allows us to select the maximum of . In what follows, we will see that there can be infinitary varieties with 2-fold subobject decompositions over any set .
Recall that if is an arbitrary set, then an -complete lattice is one in which any family has a meet and a join. A homomorphism of -complete lattices is a function which preserves joins and meets of families indexed by . ln what follows we shall denote the category of -complete lattices by .
Proposition 6**.**
The category of -complete lattices has 2-fold subobject decompositions over .
Proof.
Suppose that is any -complete sublattice of a product of -complete lattices, and suppose that are the canonical product projections. Then to show that satisfies (ii) of Proposition 3 where is the set of all -element subsets of , amounts to showing that has the following property: for any , if for any there exists such that and – (), then . To that end, suppose that satisfies (), and let be elements of with and . Define the elements of as follows:
[TABLE]
then for any we have , since
[TABLE]
This implies that
[TABLE]
so that . ∎
Proposition 7**.**
If are infinite sets and , then does not have 2-fold subobject decompositions of size .
Proof.
Consider the subset of consisting of all elements such that
[TABLE]
suppose that is a collection of elements of and let . Then it is easy to see that
[TABLE]
But then since is infinite, it follows that . Therefore we have:
[TABLE]
so that . Thus, is a sublattice of . Moreover, has the same 2-fold projections as , but is not equal to . As, for example, the top element of is not contained in . ∎
Interestingly, many duals of geometric categories such as , have 2-fold subobject decompositions over any set. In general, given a coregular category , to show that has two-fold subobject decompositions over , we have to show that if and are any two epimorphisms in with the same two-fold coimages, then is isomorphic to in the slice category . This amounts to showing that if for any we have the following commutative diagram of solid arrows
where are isomorphisms, and are the canonical coimage factorizations, then the dotted arrow exists, is an isomorphism, and makes the diagram above commute. For , we define the as follows: if , then select an element and set . To see that this is well-defined, suppose that then there exists such that and . Now, since is a monomorphism, and therefore so that which implies . In each of the coregular categories it is easy to see that the map defined above, is actually and isomorphism in each category. This shows, in particular, that the categories mentioned above are majority categories by Theorem 4.
Perhaps it is surprising that the category does not have 2-fold subobject decompositions over arbitrary sets. Indeed, it does not even have countable two-fold subobject decompositions: consider together with the subspace topology induced by . Define the continuous maps by . The induced continuous map in the diagram
[TABLE]
is an epimorphism. Moreover, has the same two-fold co-images as the identity on , so that if had two-fold subobject decompositions, then we would have — which is a contradiction.
Proposition 8**.**
* has finite two-fold subobject decompositions.*
Recall that regular monomorphisms in are precisely the embeddings of spaces.
Proof.
We will show that in the above figure, that is a homeomorphism, provided that is finite. We first show that preserves open sets: let be any open set in , then for any we have that is open in , which implies that is open in since each is a homeomorphism. Therefore, there exists an open set such that , and hence we have:
[TABLE]
Let and . Then we have
[TABLE]
then we will show that . For the direction : let then there exists such that , so that
[TABLE]
For the reverse inclusion : suppose that for some . Then there exists such that and therefore,
[TABLE]
∎
5 The Pairwise Chinese Remainder Theorem in a category
Let be a regular category and an object of . If is an equivalence relation on and morphisms in , then we will write if in what follows. Given an object of a category , morphisms and equivalence relations , we will be concerned with solving the system of congruence equations:
[TABLE]
Definition 8**.**
An approximate solution to the system above consists of a morphism (the approximate solution), together with a regular epimorphism (the approximation of ), such that for any we have
[TABLE]
If such an and exist, then the above system () is said to be approximately solvable. The above system () is said to be approximately pairwise solvable, if for any the system
[TABLE]
is approximately solvable.
Remark 3**.**
The above notion is similar to the notion of an approximate operation in the sense of [8], in how it compares with the ordinary notion of solution to a system of equations.
Definition 9** (PCRT).**
Let be an object of a regular category , then is said to satisfy the Pairwise Chinese Remainder Theorem, if for any morphisms , and any effective equivalence relations , if the system
[TABLE]
is approximately pairwise solvable, then it is approximately solvable. If every object of satisfies the PCRT, then we say that satisfies the PCRT, or that the PCRT holds in .
Lemma 3**.**
If and are regular epimorphisms making the diagram
[TABLE]
commute, then there exist regular epimorphisms and making the diagram
[TABLE]
commute for any .
Proof.
Simply consider the limit of the diagram:
[TABLE]
where ranges from to . This produces a family of regular epimorphisms making the diagram
[TABLE]
commute, where is any composite where . Then defining , it follows that and satisfy the required properties. ∎
Lemma 4**.**
Let be a regular category, then (i) (ii) where
- (i)
The PCRT holds in . 2. (ii)
* has finite 2-fold subobject decompositions.*
Proof.
Suppose that are any objects in , and let be any subobjects of , with representatives and , and which have the same 2-fold images in . Let and , then we will show that . Consider the regular-epi mono factorizations of the morphisms and below:
[TABLE]
Since and have the same two-fold images, there exists an isomorphism such that . Now, we can pullback along , and get two regular epimorphisms and making the diagram
[TABLE]
commute. Then by Lemma 3, there exist regular epimorphisms and such that the diagram
[TABLE]
commutes for any . Now define , and let be the kernel equivalence relation on defined by . Then we have that
[TABLE]
so that the system
[TABLE]
is pairwise approximately solvable (the approximation in each case is the identity on ). Therefore, by (i) there exists a regular epimorphism and a morphism such that
[TABLE]
This implies that
[TABLE]
for any , and therefore, . Therefore the diagram of solid arrows
[TABLE]
commutes, and the dotted arrow exists since is a regular epimorphism and is a monomorphism. This shows that , and similarly we may get . ∎
Lemma 5**.**
Let be a majority category with finite products, and any -ary relation with . If
[TABLE]
then
[TABLE]
Proof.
Follows by Definition 3 from the fact that is a ternary relation between and , which must be majority-selecting. ∎
Lemma 6**.**
If is a regular majority category, then the Pairwise Chinese Remainder Theorem holds for .
Consider the system of congruences from Definition 9:
[TABLE]
In the proof below, we will show that in any regular majority category , if any system of congruences of length is approximately solvable as soon as it is pairwise approximately solvable, then any system of length is approximately solvable as soon as it is pairwise approximately solvable. The result will then follow by induction, since in any regular category , any system of length is approximately solvable if and only if it is pairwise approximately solvable.
Proof.
Suppose that is any natural number, and suppose that any system of congruences in of length is approximately solvable as soon as it is pairwise approximately solvable. Let be any object in , any morphisms, and any effective equivalence relations of the morphisms respectively. Suppose that the system
[TABLE]
is pairwise approximately solvable. By assumption, the three systems obtained from removing the first, second and third rows from () are approximately pairwise solvable and therefore they are approximately solvable. Let together with , together with and together with be the approximate solutions of after removing the first, second and third rows respectively. Consider the limit of the diagram:
[TABLE]
which gives an object together with three regular epimorphisms making the diagram
[TABLE]
commute, where is any composite . Define for , then we have that together with together with , and together with , are approximate solutions of the after removing the first, second and third row respectively. Now, let and be the regular epi and mono part of the regular image factorization of , and let be the -ary relation represented by . Then we have
[TABLE]
which by Lemma 5, implies that . Therefore, there exists making the square
[TABLE]
commute. The morphism exists because is a regular epimorphism. Finally, by pulling back along , we get the commutative diagram:
[TABLE]
where is an approximate solution of the system () with approximation . ∎
This brings us to the main theorem of this paper, which combines all of the previous results.
Theorem 5**.**
The following are equivalent for a regular category :
- (i)
* is a majority category.* 2. (ii)
For any three reflexive relations on any object in we have
[TABLE] 3. (iii)
For any three reflexive relations on any object in we have
[TABLE] 4. (iv)
The Pairwise Chinese Remainder Theorem holds for . 5. (v)
* has finite -fold subobject decompositions.*
Proof.
This result follows from application of Lemma 4, Theorem 4, and Lemma 6. ∎
6 Concluding remarks
Not all facts about varieties admitting a majority term generalize to regular (or even exact majority categories). We give two representative illustrations of where this can occur. Illustration 1: it is well known that finitary varieties admitting a majority term are necessarily congruence distributive [16], however, is not true in general that exact majority categories are congruence distributive. For a counterexample we refer the reader to Example 12.1 in [13], where the author of that paper shows that the variety of distributive lattices equipped with an operation of countable arity is not even congruence modular, although it is a majority category. Illustration 2: A -ary near unanimity term is a -ary term satisfying,
[TABLE]
Clearly the above system of equations determines an elementary matix of terms in the sense of [14]:
[TABLE]
If we call categories -unanimous when they are strictly -closed (see [14]), then 4-unanimous varieties precisely those that admit a -ary near unanimity term. Now, if a variety of algebras possesses such a term, then it is congruence distributive (see [15]). Consequently, if is a Mal’tsev variety which admits a near unanimity term, then admits a majority term (see [16]). Thus for varieties, we have the relationship
[TABLE]
among these notions. This relationship extends to Barr-exact categories: if is a Barr exact Mal’tsev 4-unanimous category, then is majority category. However, this relationship does not extend to regular categories (see section 5 of [11]). This shows that there can be relationships between matrix conditions [14], which depend on subtle exactness conditions such as every equivalence relation being effective.
Acknowledgements
Many thanks are due to Prof. Z. Janelidze, for many helpful and stimulating discussions on the topic of regular majority categories.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] K. A. Baker and A. F. Pixley. Polynomial interpolation and the Chinese remainder theorem for algebraic systems. Mathematische Zeitschrift , 143:165–174, 1975.
- 2[2] M. Barr, P.A. Grillet, and D. H. van Osdol. Exact categories and categories of sheaves. Springer, Lecture Notes in Mathematics , 236, 1971.
- 3[3] G.M. Bergman. (unpublished).
- 4[4] G. Birkhoff and S.A. Kiss. A ternary operation in distributive lattices. Bulletin of the American Mathematical Society , 53(8):749–752, 1947.
- 5[5] D. Bourn. A categorical genealogy for the congruence distributive property. Theory and Applications of Categories , 8:391–407, 2001.
- 6[6] D. Bourn. Intrinsic centrality and associated classifying properties. Journal of Algebra , 256:126–145, 2002.
- 7[7] D. Bourn. Congruence distributivity in Goursat and Mal’cev categories. Applied Categorical Structures , 13:101–111, 2005.
- 8[8] D. Bourn and Z. Janelidze. Approximate Mal’tsev operations. Theory and Applications of Categories , 21:152–171, 2008.
