General algebraic systems Definition
Commutator theory
Builds on Congruence relationTerm operation
Definition
Let be an algebra and let , , be congruences of . The congruence centralizes modulo , written , if the following holds. For every , every -ary term operation of , every pair and all tuples and with for each : The commutator is the least congruence of such that .
Remarks
The least such exists: holds for the full congruence , and if holds for every , then holds. The definition is often called the term condition, and this commutator the term-condition commutator. Example: in a group , let and be the congruences of normal subgroups and . Then is the congruence of the commutator subgroup . In particular is the congruence of the commutator subgroup of . Non-example of : let be a nonabelian group with , and let . With , and , both and equal , but . In a congruence-modular variety the commutator is symmetric, , and .
Reading path
To understand this page from the ground up, read these 3 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Congruence relation concept
- Term operation concept
- Commutator theory definition
Further reading
About this page
| Tag | WBYTAFMWJR |
|---|---|
| URI | m2://WBYTAFMWJR |
| Kind | definition |
| Writing | W0 stub |
| MSC | 08A30, 08B10 |
| Defines | Commutator theory |
| Uses | Congruence relation, Term operation |
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.