Congruence Permutable

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 $\mathbf$, a pair of congruences $\alpha,\beta\in\operatorname(\mathbf)$ are said to permute when $\alpha\circ\beta=\beta\circ\alpha$. An algebra $\mathbf$ is called congruence-permutable when each pair of congruences of $\mathbf$ permute. A variety of algebras $\mathcal$ is referred to as congruence-permutable when every algebra in $\mathcal$ is congruence-permutable.

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.

Theorem (Maltsev, 1954)

Suppose that $\mathcal$ is a variety of algebras. The following are equivalent:

Such a term is called a Maltsev term and congruence-permutable varieties are also known as Maltsev varieties in his honor.

Examples

Most classical varieties in abstract algebra, such as groups, rings, and Lie algebras are congruence-permutable. Any variety that contains a group operation is congruence-permutable, and the Maltsev term is $xy^z$.

Nonexamples

Viewed as a lattice the chain with three elements is not congruence-permutable and hence neither is the variety of lattices.

References

Universal algebra

{{abstract-algebra-stub