nLab
Mal'cev variety

Definition
Proofs of equivalence
Examples
The lattice of congruences $Equiv (X)$
- $Equiv (X)$ is a modular lattice
- $Equiv (X)$ is a Desarguesian lattice
References
Spelling

Definition

A Mal’cev operation on a set $X$ is a ternary operation, a function

t : X \times X \times X \to X, (x, y, z) \mapsto t (x, y, z),

which satisfies the identities $t (x, x, z) = z$ and $t (x, z, z) = x$ . An important motivating example is the operation $t$ of a heap, for example the operation on a group defined by $t (x, y, z) = x y^{- 1} z$ .

An algebraic theory $T$ is a Mal’cev theory when $T$ contains a Mal’cev operation. An algebraic theory is Mal’cev iff one of the following equivalent statements is true:

in the category of $T$ -algebras, every internal reflexive relation is a congruence;
in the category of $T$ -algebras, the composite (as internal relations) of any two congruences as a congruence;
in the category of $T$ -algebras, the composition of equivalence relations is commutative.

Statement (i) is one of the motivations to introduce the notion of Mal'cev category.

A Mal’cev variety is the category of $T$ -algebras for a Mal’cev theory $T$ , thought of as a variety of algebras.

Proofs of equivalence

If $R ↪ X \times Y$ is a binary relation on sets, write $R (x, y)$ to say that $(x, y) \in R$ . If $X$ , $Y$ are $T$ -algebras, then $R$ is an internal relation in $T$ - $Alg$ if the conditions $R (x_{1}, y_{1}) \land \dots \land R (x_{n}, y_{n})$ , and $θ (x_{1}, \dots, x_{n}) = x$ , $θ (y_{1}, \dots, y_{n}) = y$ for any $n$ -ary operation $θ$ of $T$ , jointly imply $R (x, y)$ .

The set-theoretic composite of two internal relations in $T$ - $Alg$ is also an internal relation, and the equality relation is always internal, so we may (and will) apply ordinary set-theoretic reasoning in our proofs below.

Proposition 1

If $T$ is a Mal’cev theory, then any internal reflexive relation in $T$ - $Alg$ is an internal equivalence relation.

Proof

If $t$ is a Mal’cev operation and $R$ is any internal reflexive relation on a $T$ -algebra $X$ , then $R$ is transitive because given $R (x, y) \land R (y, z)$ , we infer $R (x, y) \land R (y, y) \land R (y, z)$ , and this together with $t (x, y, y) = x$ and $t (y, y, z) = z$ gives $R (x, z)$ since $R$ is internal. Also $R$ is symmetric, because if $R (x, y)$ , we infer $R (x, x) \land R (x, y) \land R (y, y)$ , which together with $t (x, x, y) = y$ and $t (x, y, y) = x$ gives $R (y, x)$ .

Proposition 2

If every internal reflexive relation is an internal equivalence relation, then the composite of any two internal equivalence relations is also an internal equivalence relation.

Proof

The hypothesis is that internal reflexive relations and internal equivalence relations coincide. But (internal) reflexive relations are clearly closed under composition: $Δ = Δ \circ Δ \subseteq R \circ S$ .

Proposition 3

If internal equivalence relations are closed under composition, then composition of internal equivalence relations is commutative.

Proof

If $R$ and $S$ are equivalence relations and so is $S \circ R$ , then

S \circ R = (S \circ R)^{op} = R^{op} \circ S^{op} = R \circ S,

as desired.

Proposition 4

If composition of internal equivalence relations in $T$ - $Alg$ is commutative, then the theory $T$ has a Mal’cev operation $t$ .

Proof

According to the yoga of (Lawvere) algebraic theories, $n$ -ary operations are identified with elements of $F (n)$ , the free $T$ -algebra on $n$ generators (more precisely, the Lawvere theory is the category opposite to the category of finitely generated free $T$ -algebras). Thus we must exhibit a suitable element $t$ of $F (3)$ .

Let $x, y, z$ be the generators of $F (3)$ , and let $a, b$ be the generators of $F (2)$ . Let $ϕ$ be the unique algebra map $F (3) \to F (2)$ taking $x$ and $y$ to $a$ and $z$ to $b$ , and let $ψ$ be the unique algebra map $F (3) \to F (2)$ taking $x$ to $a$ and $y$ and $z$ to $b$ . An operation $t \in F (3)$ is Mal’cev precisely when

ϕ (t) = b ψ (t) = a

Let $R$ be the equivalence relation on $F (3)$ given by the kernel pair of $ϕ$ , and let $S$ be the kernel pair of $ψ$ . Then $R (x, y)$ and $S (y, z)$ , so $(S \circ R) (x, z)$ . Then, since composition of equivalence relations is assumed commutative, $(R \circ S) (x, z)$ . This means there exists $t$ such that $S (x, t)$ and $R (t, z)$ , or that $ψ (x) = ψ (t)$ and $ϕ (t) = ϕ (z)$ . This completes the proof.

Examples

The theory of groups, where $t (x, y, z) = x y^{- 1} z$ , is Mal’cev.
The theory of Heyting algebras, where

$t (x, y, z) = ((z \Rightarrow y) \Rightarrow x) \land ((x \Rightarrow y) \Rightarrow z),$ t(x, y, z) = ((z \Rightarrow y) \Rightarrow x) \wedge ((x \Rightarrow y) \Rightarrow z),

is Mal’cev.
If $T$ is Mal’cev, and if $T \to T'$ is a morphism of algebraic theories, then $T'$ is Mal’cev. From this point of view, the theory of groups is Mal’cev because the theory of heaps is Mal’cev, and the theory of Heyting algebras is Mal’cev because the theory of cartesian closed meet-semilattices is Mal’cev.

The lattice of congruences $Equiv (X)$

$Equiv (X)$ is a modular lattice

In any finitely complete category, the intersection of two congruences (equivalence relations) on an object $X$ is a congruence, so that the set of equivalence relations $Equiv (X)$ is a meet-semilattice.

In a regular category such as a variety of algebras, where there is a sensible calculus of relations and relational composition, it is a simple matter to prove that if $Equiv (X)$ is closed under relational composition, then $R \circ S$ is the join $R \lor S$ in $Equiv (X)$ . For, if $R, S \in Equiv (X)$ , then

R = R \circ Δ \subseteq R \circ S, S = Δ \circ S \subseteq R \circ S

while if $R, S \subseteq T$ in $Equiv (X)$ , then

R \circ S \subseteq T \circ T \subseteq T .

Proposition

In a regular category, if $Equiv (X)$ is closed under relational composition (equivalently, if composition of equivalence relations is commutative), then $Equiv (X)$ is a modular lattice.

Proof

The (poset-enriched) category of relations in a regular category is an allegory, and hence satisfies Freyd’s modular law

R \land (S \circ T) \subseteq S \circ ((S^{op} \circ R) \land T)

whenever $T : X \to Y$ , $S : Y \to Z$ , $R : X \to Z$ are relations. As we have just seen, the hypothesis implies that joins in $Equiv (X)$ are given by composition (so $Equiv (X)$ is a lattice), and so for $R, S, T \in Equiv (X)$ we have

R \land (S \lor T) \subseteq S \lor ((S \lor R) \land T) .

Therefore, if $S \subseteq R$ , we have both

R \land (S \lor T) \subseteq S \lor (R \land T)

and also $S \lor (R \land T) \subseteq R \land (S \lor T)$ . Thus $S \subseteq R$ implies $R \land (T \lor S) = (R \land T) \lor S$ : the modular law is satisfied in $Equiv (X)$ .

Corollary

If $T$ is a Mal’cev theory, then the lattice of congruences $Equiv (X)$ on any $T$ -algebra $X$ is a modular lattice.

$Equiv (X)$ is a Desarguesian lattice

A similar argument shows that congruence lattices for $T$ -algebras $X$ , for $T$ a Mal’cev theory, satisfy the following property (stronger than the modular property):

Desarguesian property?: if $R_{i}, S_{i}, T_{i} \in Equiv (X)$ for $i = 1, 2$ , then

$(R_{1} \lor R_{2}) \land (S_{1} \lor S_{2})) \subseteq T_{1} \lor T_{2} implies (R_{1} \lor S_{1}) \land (R_{2} \lor S_{2}) \subseteq ((R_{1} \lor T_{1}) \land (R_{2} \lor T_{2})) \lor ((S_{1} \lor T_{1}) \land (S_{2} \lor T_{2}))$ (R_1 \vee R_2) \wedge (S_1 \vee S_2)) \subseteq T_1 \vee T_2 \qquad implies \qquad (R_1 \vee S_1) \wedge (R_2 \vee S_2) \subseteq ((R_1 \vee T_1) \wedge (R_2 \vee T_2)) \vee ((S_1 \vee T_1) \wedge (S_2 \vee T_2))

Freyd-Scedrov’s Categories, Allegories (2.157, pp. 206-207) gives the following argument: given relations $R_{1}, S_{1}, T_{1} : X \to Y$ , $R_{2}, S_{2}, T_{2} : Y \to Z$ between sets, it is “easily verified” that

R_{2} R_{1} \cap S_{2} S_{2} \subseteq T_{2} T_{1} implies S_{1} R_{1}^{op} \cap S_{2}^{op} R_{2} \subseteq (S_{1} T_{1}^{op} \land S_{2}^{op} T_{2}) (T_{1} R_{1}^{op} \cap T_{2}^{op} R_{2})

Then, under the assumption that equivalence relations internal to $T$ - $Alg$ commute (so that the join of equivalence relations $R, S$ on $X$ is their relational composite $R S = R \circ S$ ), the Desarguesian axiom follows immediately.

References

See the monograph Borceux-Bourn.

Spelling

The original is ‘Мальцев’; besides ‘Malʹcev’, this has also been transliterated ‘Malcev’ and ‘Maltsev’.

Revised on August 22, 2012 19:06:56 by Todd Trimble (67.81.93.25)

nLab Mal'cev variety

Contents

Definition

Proofs of equivalence

Proposition 1

Proof

Proposition 2

Proof

Proposition 3

Proof

Proposition 4

Proof

Examples

The lattice of congruences Equiv(X)

Equiv(X) is a modular lattice

Proposition

Proof

Corollary

Equiv(X) is a Desarguesian lattice

References

Spelling

nLab
Mal'cev variety

The lattice of congruences $Equiv (X)$

$Equiv (X)$ is a modular lattice

$Equiv (X)$ is a Desarguesian lattice