General algebraic systems Congruences and quotients Concept
Permuting congruences
Summary
Two congruences on an algebra permute when their relational products in the two orders are equal. Then their join in the congruence lattice is simply their product, which makes it easy to compute. An algebra whose congruences all permute is called congruence-permutable; groups, rings and modules are examples. This property is the starting point of congruence-permutable varieties and of Mal'cev conditions.
Where this leads
1 page builds on this one.
Further reading
About this page
| Tag | 2BCES6NPYM |
|---|---|
| URI | m2://2BCES6NPYM |
| Kind | concept |
| Writing | W0 stub |
| MSC | 08A30, 08B05 |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.