Congruence-permutable algebra
In universal algebra, a congruence-permutable algebra is an algebra whose congruences commute under composition. This symmetry has several equivalent characterizations, which lend to the analysis of such algebras. Many familiar varieties of algebras, such as the variety of groups, consist of congruence-permutable algebras, but some, like the variety of lattices, have members that are not congruence-permutable.
Definition
Given an algebra [math]\displaystyle{ \mathbf{A} }[/math], a pair of congruences [math]\displaystyle{ \alpha,\beta\in\operatorname{Con}(\mathbf{A}) }[/math] are said to permute when [math]\displaystyle{ \alpha\circ\beta=\beta\circ\alpha }[/math].[1]:121 An algebra [math]\displaystyle{ \mathbf{A} }[/math] is called congruence-permutable when each pair of congruences of [math]\displaystyle{ \mathbf{A} }[/math] permute.[1]:122 A variety of algebras [math]\displaystyle{ \mathcal{V} }[/math] is referred to as congruence-permutable when every algebra in [math]\displaystyle{ \mathcal{V} }[/math] is congruence-permutable.[1]:122
Properties
In 1954 Maltsev gave two other conditions that are equivalent to the one given above defining a congruence-permutable variety of algebras. This initiated the study of congruence-permutable varieties.[1]:122
Theorem (Maltsev, 1954)
Suppose that [math]\displaystyle{ \mathcal{V} }[/math] is a variety of algebras. The following are equivalent:
- The variety [math]\displaystyle{ \mathcal{V} }[/math] is congruence-permutable.
- The free algebra on [math]\displaystyle{ 3 }[/math] generators in [math]\displaystyle{ \mathcal{V} }[/math] is congruence-permutable.
- There is a ternary term [math]\displaystyle{ q }[/math] such that
- [math]\displaystyle{ \mathcal{V}\models q(x,y,y)\approx x\approx q(y,y,x) }[/math].
Such a term is called a Maltsev term and congruence-permutable varieties are also known as Maltsev varieties in his honor.[1]:122
Examples
Most classical varieties in abstract algebra, such as groups[1]:123, rings[1]:123, and Lie algebras[citation needed] are congruence-permutable. Any variety that contains a group operation is congruence-permutable, and the Maltsev term is [math]\displaystyle{ xy^{-1}z }[/math].[citation needed]
Nonexamples
Viewed as a lattice the chain with three elements is not congruence-permutable and hence neither is the variety of lattices.[1]:123
References
 |  |
