General algebraic systems Products and constructions Theorem
Birkhoff's subdirect representation theorem
Builds on Algebraic structureSubdirect productSubdirectly irreducible algebraCongruence relationQuotient algebraZorn's lemma
Statement
Let be an algebra with at least two elements. Then is isomorphic to a subdirect product of a family of subdirectly irreducible algebras. Moreover, each factor of the family can be chosen to be a quotient of .
Remarks
Proof idea. For each pair in , Zorn's lemma gives a congruence that is maximal among the congruences not containing . Every congruence of other than equality comes from a strictly larger congruence, which contains . So is subdirectly irreducible, with monolith generated by the classes of and . The intersection of all is equality, so is a subdirect embedding.
Example: the ring is a subdirect product of the fields , prime, which are simple and hence subdirectly irreducible. Another example: the only subdirectly irreducible distributive lattice is the two-element chain, so every distributive lattice with at least two elements is a subdirect product of copies of it.
A subdirect product may need infinitely many factors even for a countable algebra, as for . For a finite algebra, finitely many factors suffice, and Zorn's lemma is not needed.
Going deeper
For a student
The theorem reduces many questions about a variety to its subdirectly irreducible members. A variety is generated by its subdirectly irreducible algebras, so two varieties with the same subdirectly irreducible members are equal. For example, it shows that every Boolean algebra is a subdirect product of copies of the two-element Boolean algebra. This leads to notions such as residually finite algebras, which are subdirect products of finite algebras.
Reading path
To understand this page from the ground up, read these 35 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Algebraic structure concept
- Congruence relation concept
- Element definition
- Proposition concept
- Quotient algebra concept
- Subdirect product concept
- Subdirectly irreducible algebra concept
- Set definition
- Disjunction definition
- Implication definition
- Predicate definition
- Family of sets definition
- Ordered pair definition
- Union definition
- Existential quantifier definition
- Universal quantifier definition
- Cartesian product definition
- Union of a family of sets definition
- Subset definition
- Uniqueness quantifier definition
- Binary relation definition
- Antisymmetric relation definition
- Reflexive relation definition
- Transitive relation definition
- Function definition
- Preorder definition
- Choice function definition
- Partial order definition
- Axiom of choice statement
- Maximal element definition
- Total order definition
- Upper bound definition
- Chain definition
- Zorn's lemma statement
- Birkhoff's subdirect representation theorem statement
Further reading
About this page
| Tag | CZF5696TPY |
|---|---|
| URI | m2://CZF5696TPY |
| Kind | statement, theorem |
| Writing | W0 stub |
| MSC | 08B26 |
| Status | This copy of the site has no build data. Run m2 status CZF5696TPY. |
| About | Subdirect product, Subdirectly irreducible algebra |
| Uses | Algebraic structure, Subdirect product, Subdirectly irreducible algebra, Congruence relation, Quotient algebra, Zorn's lemma |
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.