General algebraic systems Definition
Subdirectly irreducible algebra
Builds on Algebraic structureCongruence relationCongruence latticeSubdirect product
Definition
Let be an algebra with universe having at least two elements, and let . The algebra is subdirectly irreducible when the set of congruences on different from has a least element. This least element is called the monolith of .
Remarks
Equivalently, is subdirectly irreducible when, for every subdirect embedding , some composite is an isomorphism. This is the form that gives the name, through subdirect products. In terms of the congruence lattice: the intersection of all congruences other than is not .
Example: the group is subdirectly irreducible. Its congruences come from the subgroups , which form a chain, so the congruence of is the monolith.
Non-example: the group is not subdirectly irreducible. The congruences modulo and modulo are both different from , and their intersection is , so there is no least one.
The ring is not subdirectly irreducible either, since the congruences modulo the primes intersect in .
Reading path
To understand this page from the ground up, read these 5 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
- Subdirect product concept
- Subdirectly irreducible algebra definition
Further reading
About this page
| Tag | TYYS649FAJ |
|---|---|
| URI | m2://TYYS649FAJ |
| Kind | definition |
| Writing | W0 stub |
| MSC | 08B26 |
| Defines | Subdirectly irreducible algebra |
| Uses | Algebraic structure, Congruence relation, Congruence lattice, Subdirect product |
| 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.