Math 2.0

General algebraic systems Definition

Commutator theory

Builds on Congruence relationTerm operation

Definition

Let AA be an algebra and let α\alpha, β\beta, δ\delta be congruences of AA. The congruence α\alpha centralizes β\beta modulo δ\delta, written C(α,β;δ)C(\alpha, \beta; \delta), if the following holds. For every n≥1n \ge 1, every (n+1)(n+1)-ary term operation tt of AA, every pair (a,b)∈α(a, b) \in \alpha and all tuples cˉ=(c1,…,cn)\bar{c} = (c_1, \dots, c_n) and dˉ=(d1,…,dn)\bar{d} = (d_1, \dots, d_n) with (ci,di)∈β(c_i, d_i) \in \beta for each ii: t(a,cˉ)δt(a,dˉ)  ⟹  t(b,cˉ)δt(b,dˉ).t(a, \bar{c}) \mathrel{\delta} t(a, \bar{d}) \implies t(b, \bar{c}) \mathrel{\delta} t(b, \bar{d}). The commutator [α,β][\alpha, \beta] is the least congruence δ\delta of AA such that C(α,β;δ)C(\alpha, \beta; \delta).

Remarks

The least such δ\delta exists: C(α,β;1A)C(\alpha, \beta; 1_A) holds for the full congruence 1A1_A, and if C(α,β;δi)C(\alpha, \beta; \delta_i) holds for every ii, then C(α,β;⋂iδi)C(\alpha, \beta; \bigcap_i \delta_i) holds. The definition is often called the term condition, and this commutator the term-condition commutator. Example: in a group GG, let α\alpha and β\beta be the congruences of normal subgroups MM and NN. Then [α,β][\alpha, \beta] is the congruence of the commutator subgroup [M,N][M, N]. In particular [1G,1G][1_G, 1_G] is the congruence of the commutator subgroup of GG. Non-example of C(1G,1G;0G)C(1_G, 1_G; 0_G): let GG be a nonabelian group with bc≠cbb c \ne c b, and let t(x,y)=xyx−1y−1t(x, y) = x y x^{-1} y^{-1}. With a=ea = e, cˉ=c\bar{c} = c and dˉ=e\bar{d} = e, both t(e,c)t(e, c) and t(e,e)t(e, e) equal ee, but t(b,c)=bcb−1c−1≠e=t(b,e)t(b, c) = b c b^{-1} c^{-1} \ne e = t(b, e). In a congruence-modular variety the commutator is symmetric, [α,β]=[β,α][\alpha, \beta] = [\beta, \alpha], and [α,β]≤α∧β[\alpha, \beta] \le \alpha \wedge \beta.

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
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Congruence relation concept
  2. Term operation concept
  3. Commutator theory definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Universal_algebra
About this page
TagWBYTAFMWJR
URIm2://WBYTAFMWJR
Kinddefinition
WritingW0 stub
MSC08A30, 08B10
DefinesCommutator theory
UsesCongruence 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.