Math 2.0

General algebraic systems Definition

Abelian algebra

Builds on Term operationCommutator theory

Definition

Let AA be an algebra. The algebra AA is abelian if the following holds. For every n≥1n \ge 1, every (n+1)(n+1)-ary term operation tt of AA, all elements a,b∈Aa, b \in A and all tuples cˉ,dˉ∈An\bar{c}, \bar{d} \in A^n: t(a,cˉ)=t(a,dˉ)  ⟹  t(b,cˉ)=t(b,dˉ).t(a, \bar{c}) = t(a, \bar{d}) \implies t(b, \bar{c}) = t(b, \bar{d}).

Remarks

In the language of commutator theory, AA is abelian if and only if [1A,1A]=0A[1_A, 1_A] = 0_A, where 1A1_A and 0A0_A are the largest and the least congruences of AA. Example: every module MM over a ring RR is abelian. Each term operation has the form t(x,yˉ)=rx+s1y1+⋯+snynt(x, \bar{y}) = r x + s_1 y_1 + \cdots + s_n y_n with r,si∈Rr, s_i \in R. So t(a,cˉ)=t(a,dˉ)t(a, \bar{c}) = t(a, \bar{d}) means ∑isici=∑isidi\sum_i s_i c_i = \sum_i s_i d_i, and this gives t(b,cˉ)=t(b,dˉ)t(b, \bar{c}) = t(b, \bar{d}) for every bb. Non-example: a lattice LL with elements 0<10 < 1 is not abelian. Take t(x,y)=x∧yt(x, y) = x \wedge y, a=0a = 0, c=0c = 0 and d=1d = 1: then t(0,0)=0=t(0,1)t(0, 0) = 0 = t(0, 1), but t(1,0)=0≠1=t(1,1)t(1, 0) = 0 \ne 1 = t(1, 1). A group is abelian in this sense exactly when it is commutative.

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. Commutator theory concept
  2. Term operation concept
  3. Abelian algebra definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Universal_algebra
About this page
TagXK1KDMCW4K
URIm2://XK1KDMCW4K
Kinddefinition
WritingW0 stub
MSC08A30, 08B10
DefinesAbelian algebra
UsesTerm operation, Commutator theory
Changed2 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.