Lably
Skip to content

Non-associative algebra

Algebra over a field where binary multiplication is not necessarily associative

  • 10 min read
  • 5 chapters

Related on Lably

Through Algebra over a field, Associative property and Algebraic structure

While this use of non-associative means that associativity is not assumed, it does not mean that associativity is disallowed. In other words, "non-associative" means "not necessarily associative", just as "noncommutative" means "not necessarily commutative" for noncommutative rings.

An algebra is unital or unitary if it has an identity element e with ex = x = xe for all x in the algebra. For example, the octonions are unital, but Lie algebras never are.

The nonassociative algebra structure of A may be studied by associating it with other associative algebras which are subalgebras of the full algebra of K-endomorphisms of A as a K-vector space. Two such are the derivation algebra and the (associative) enveloping algebra, the latter being in a sense "the smallest associative algebra containing A".

More generally, some authors consider the concept of a non-associative algebra over a commutative ring R: An R-module equipped with an R-bilinear binary multiplication operation. If a structure obeys all of the ring axioms apart from associativity (for example, any R-algebra), then it is naturally a Z-algebra, so some authors refer to non-associative Z-algebras as non-associative rings.

Algebras satisfying identities

Ring-like structures with two binary operations and no other restrictions are a broad class, one which is too general to study. For this reason, the best-known kinds of non-associative algebras satisfy identities, or properties, which simplify multiplication somewhat. These include the following ones.

Usual properties

Let x, y and z denote arbitrary elements of the algebra A over the field K. Let powers to positive (non-zero) integer be recursively defined by x1 ≝ x and either xn+1 ≝ xnx (right powers) or xn+1 ≝ xxn (left powers) depending on authors.

  • Unital: there exist an element e so that ex = x = xe; in that case we can define x0 ≝ e.
  • Associative: (xy)z = x(yz).
  • Commutative: xy = yx.
  • Anticommutative: xy = −yx.
  • Jacobi identity: (xy)z + (yz)x + (zx)y = 0 or x(yz) + y(zx) + z(xy) = 0 depending on authors, but these are equivalent for anticommutative algebras, and Lie algebras are anticommutative algebras obeying the Jacobi identity.
  • Jordan identity: (x2y)x = x2(yx) or (xy)x2 = x(yx2) depending on authors, but these are equivalent for commutative algebras, and Jordan algebras are commutative algebras obeying the Jordan identity.
  • Alternative: (xx)y = x(xy) (left alternative) and (yx)x = y(xx) (right alternative).
  • Flexible: (xy)x = x(yx).
  • nth power associative with n ≥ 2: xn−kxk = xn for all integers k so that 0 < k < n.
    • Third power associative: x2x = xx2.
    • Fourth power associative: x3x = x2x2 = xx3 (compare with fourth power commutative below).
  • Power associative: the subalgebra generated by any element is associative, i.e., nth power associative for all n ≥ 2.
  • nth power commutative with n ≥ 2: xn−kxk = xkxn−k for all integers k so that 0 < k < n.
    • Third power commutative: x2x = xx2.
    • Fourth power commutative: x3x = xx3 (compare with fourth power associative above).
  • Power commutative: the subalgebra generated by any element is commutative, i.e., nth power commutative for all n ≥ 2.
  • Nilpotent of index n ≥ 2: the product of any n elements, in any association, vanishes, but not for some n−1 elements: x1x2…xn = 0 and there exist n−1 elements so that y1y2…yn−1 ≠ 0 for a specific association.
  • Nil of index n ≥ 2: power associative and xn = 0 and there exist an element y so that yn−1 ≠ 0.

Relations between properties

For K of any characteristic:

  • Associative implies alternative.
  • Any two out of the three properties left alternative, right alternative, and flexible, imply the third one.
    • Thus, alternative implies flexible.
  • Alternative implies Jordan identity.
  • Commutative implies flexible.
  • Anticommutative implies flexible.
  • Alternative implies power associative.
  • Flexible implies third power associative.
  • Second power associative and second power commutative are always true.
  • Third power associative and third power commutative are equivalent.
  • nth power associative implies nth power commutative.
  • Nil of index 2 implies anticommutative.
  • Nil of index 2 implies Jordan identity.
  • Nilpotent of index 3 implies Jacobi identity.
  • Nilpotent of index n implies nil of index N with 2 ≤ N ≤ n.
  • Unital and nil of index n are incompatible.

If K ≠ GF(2) or dim(A) ≤ 3:

  • Jordan identity and commutative together imply power associative.

If char(K) ≠ 2:

  • Right alternative implies power associative.
    • Similarly, left alternative implies power associative.
  • Unital and Jordan identity together imply flexible.
  • Jordan identity and flexible together imply power associative.
  • Commutative and anticommutative together imply nilpotent of index 2.
  • Anticommutative implies nil of index 2.
  • Unital and anticommutative are incompatible.

If char(K) ≠ 3:

  • Unital and Jacobi identity are incompatible.

If char(K) ∉ {2,3,5}:

  • Commutative and x4 = x2x2 (one of the two identities defining fourth power associative) together imply power associative.

If char(K) = 0:

  • Third power associative and x4 = x2x2 (one of the two identities defining fourth power associative) together imply power associative.

If char(K) = 2:

  • Commutative and anticommutative are equivalent.

Associator

The associator on A is the K-multilinear map [⋅,⋅,⋅]:A×A×A→A given by

[x,y,z] = (xy)z − x(yz).

It measures the degree of nonassociativity of A, and can be used to conveniently express some possible identities satisfied by A.

Let x, y and z denote arbitrary elements of the algebra.

  • Associative: [x,y,z] = 0.
  • Alternative: [x,x,y] = 0 (left alternative) and [y,x,x] = 0 (right alternative).
    • It implies that permuting any two terms changes the sign: [x,y,z] = −[x,z,y] = −[z,y,x] = −[y,x,z]; the converse holds only if char(K) ≠ 2.
  • Flexible: [x,y,x] = 0.
    • It implies that permuting the extremal terms changes the sign: [x,y,z] = −[z,y,x]; the converse holds only if char(K) ≠ 2.
  • Jordan identity: [x2,y,x] = 0 or [x,y,x2] = 0 depending on authors.
  • Third power associative: [x,x,x] = 0.

The nucleus is the set of elements that associate with all others: that is, the n in A such that

[n,A,A] = [A,n,A] = [A,A,n] = {0}.

The nucleus is an associative subring of A.

Center

The center of A is the set of elements that commute and associate with everything in A, that is the intersection of C(A)={n∈A|nr=rn∀r∈A} with the nucleus. It turns out that for elements of C(A) it is enough that two of the sets ([n,A,A],[A,n,A],[A,A,n]) are {0} for the third to also be the zero set.

Sign in to keep reading

4 more chapters are free with a Lably account.

More in Algebra