General algebraic systems Definition
Permuting congruences
Builds on Algebraic structureCongruence relationCongruence lattice
Definition
Let be an algebra with universe , and let and be congruences on . Their relational product is The congruences and permute when . The algebra is congruence-permutable when every two congruences on permute.
Remarks
The congruences and permute if and only if is a congruence. In that case , the join in the congruence lattice. A congruence-permutable algebra has a modular congruence lattice.
Example: let be a group and , normal subgroups, with congruences and . Then if and only if , and if and only if . Since for normal subgroups, and permute.
Non-example: on the set with no operations, let have classes and have classes . Then through . But , since the only with is , and .
Reading path
To understand this page from the ground up, read these 4 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Algebraic structure concept
- Congruence lattice concept
- Congruence relation concept
- Permuting congruences definition
Further reading
About this page
| Tag | QB05EN6HEQ |
|---|---|
| URI | m2://QB05EN6HEQ |
| Kind | definition |
| Writing | W0 stub |
| MSC | 08A30, 08B05 |
| Defines | Permuting congruences |
| Uses | Algebraic structure, Congruence relation, Congruence lattice |
| 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.
What links here
No page links to this page yet.