Jump to content

Power associativity: Difference between revisions

From Wikipedia, the free encyclopedia
Content deleted Content added
.anacondabot (talk | contribs)
Trigintaduonion
 
(49 intermediate revisions by 39 users not shown)
Line 1: Line 1:
{{Short description|Property of a binary operation}}
In [[abstract algebra]], '''power associativity''' is a weak form of [[associativity]].
In [[mathematics]], specifically in [[abstract algebra]], '''power associativity''' is a property of a [[binary operation]] that is a weak form of [[associativity]].


== Definition ==
An [[algebra over a field|algebra]] (or more generally a [[magma (algebra)|magma]]) is said to be power-associative if the [[subalgebra]] generated by any element is associative.
Concretely, this means that if an element ''x'' is multiplied by itself several times, it doesn't matter in which order the multiplications are carried out, so for instance ''x''(''x''(''xx'')) = (''x''(''xx''))''x'' = (''xx'')(''xx'').
An [[algebra over a field|algebra]] (or more generally a [[magma (algebra)|magma]]) is said to be power-associative if the [[subalgebra]] generated by any element is associative. Concretely, this means that if an element <math>x</math> is performed an operation <math>*</math> by itself several times, it doesn't matter in which order the operations are carried out, so for instance <math>x*(x*(x*x)) = (x*(x*x))*x = (x*x)*(x*x)</math>.
This is stronger than merely saying that (''xx'')''x'' = ''x''(''xx'') for every ''x'' in the algebra.


== Examples and properties ==
Every [[associative algebra]] is obviously power-associative, but so are all other [[alternative algebra]]s (like the [[octonion]]s, which are non-associative) and even some non-alternative algebras like the [[sedenion]]s.
Every [[associative algebra]] is power-associative, but so are all other [[alternative algebra]]s (like the [[octonion]]s, which are non-associative) and even non-alternative [[flexible algebra]]s like the [[sedenion]]s, [[trigintaduonion]]s, and [[Okubo algebra]]s. Any algebra whose elements are [[idempotent]] is also power-associative.


[[Exponentiation]] to the power of any [[positive integer]] can be defined consistently whenever multiplication is power-associative. For example, there is no need to distinguish whether ''x''<sup>3</sup> should be defined as (''xx'')''x'' or as ''x''(''xx''), since these are equal. Exponentiation to the power of zero can also be defined if the operation has an [[identity element]], so the existence of identity elements is useful in power-associative contexts.
[[Exponentiation]] to the power of any [[natural number]] other than [[0 (number)|zero]] can be defined consistently whenever multiplication is power-associative.
For example, there is no ambiguity as to whether ''x''<sup>3</sup> should be defined as (''xx'')''x'' or as ''x''(''xx''), since these are equal.
Exponentiation to the power of zero can also be defined if the operation has an [[identity element]], so the existence of identity elements becomes especially useful in power-associative contexts.


Over a [[field (mathematics)|field]] of [[Characteristic (algebra)|characteristic]] 0, an algebra is power-associative if and only if it satisfies <math>[x,x,x]=0</math> and <math>[x^2,x,x]=0</math>, where <math>[x,y,z]:=(xy)z-x(yz)</math> is the [[associator]] (Albert 1948).
A nice substitution law holds for real power-associative algebras with unit, which basically asserts that multiplication of polynomials works as expected. For ''f'' a real polynomial in ''x'', and for any ''a'' in such an algebra define ''f''(''a'') to be the element of the algebra resulting from the obvious substitution of ''a'' into ''f''. Then for any two such polynomials ''f'' and ''g'', we have that (''fg'') (''a'') = ''f''(''a'')''g''(''a'').


Over an infinite field of [[prime number|prime]] characteristic <math>p>0</math> there is no finite set of identities that characterizes power-associativity, but there are infinite independent sets, as described by Gainov (1970):
[[Category:Nonassociative algebra]]
[[Category:Binary operations|*Power associativity]]


* For <math>p=2</math>: <math>[x,x^2,x]=0</math> and <math>[x^{n-2},x,x]=0</math> for <math>n=3,2^k</math> (<math>k=2,3...)</math>
[[fr:Associativité des puissances]]
* For <math>p=3</math>: <math>[x^{n-2},x,x]=0</math> for <math>n=4,5,3^k</math> (<math>k=1,2...)</math>
[[it:Associatività della potenza]]
* For <math>p=5</math>: <math>[x^{n-2},x,x]=0</math> for <math>n=3,4,6,5^k</math> (<math>k=1,2...)</math>
[[zh:冪結合性]]
* For <math>p>5</math>: <math>[x^{n-2},x,x]=0</math> for <math>n=3,4,p^k</math> (<math>k=1,2...)</math>

A substitution law holds for [[real number|real]] power-associative algebras with unit, which basically asserts that multiplication of [[polynomial]]s works as expected. For ''f'' a real polynomial in ''x'', and for any ''a'' in such an algebra define ''f''(''a'') to be the element of the algebra resulting from the obvious substitution of ''a'' into ''f''. Then for any two such polynomials ''f'' and ''g'', we have that {{nowrap|1=(''fg'')(''a'') = ''f''(''a'')''g''(''a'')}}.

==See also==
*[[Alternativity]]

==References==

*{{cite journal | last1=Albert | first1=A. Adrian |author-link = Abraham Adrian Albert| title=Power-associative rings | jstor=1990399 | zbl=0033.15402 | mr=0027750 | year=1948 | journal=[[Transactions of the American Mathematical Society]] | issn=0002-9947 | volume=64 | pages=552–593 | doi=10.2307/1990399| doi-access=free }}
*{{cite journal | last1=Gainov | first1=A. T. | title=Power-associative algebras over a finite-characteristic field | zbl=0208.04001 | mr=0281764 | year=1970 | journal=[[Algebra and Logic]] | issn=0002-9947 | volume=9| issue=1| pages=5–19 | doi=10.1007/BF02219846}}
* {{cite book | last1=Knus | first1=Max-Albert | last2=Merkurjev | first2=Alexander | author2-link=Alexander Merkurjev | last3=Rost | first3=Markus | author3-link=Markus Rost | last4=Tignol | first4=Jean-Pierre | title=The book of involutions | others=With a preface by [[Jacques Tits]] | zbl=0955.16001 | series=Colloquium Publications | publisher=[[American Mathematical Society]] | volume=44 | location=Providence, RI | year=1998 | isbn=0-8218-0904-0 }}
*{{cite book | zbl= 0841.17001 | mr=1356224 | last=Okubo | first= Susumu | author-link = Susumu Okubo|title=Introduction to octonion and other non-associative algebras in physics | series=Montroll Memorial Lecture Series in Mathematical Physics | volume=2 | publisher=[[Cambridge University Press]] | year= 1995 | isbn=0-521-01792-0 | page=17 }}
* {{cite book | first=R. D. | last=Schafer | title=An introduction to non-associative algebras | publisher=Dover | year=1995 | orig-year=1966 | isbn=0-486-68813-5 | pages=[https://archive.org/details/introductiontono0000scha/page/128 128–148] | url=https://archive.org/details/introductiontono0000scha/page/128 }}

[[Category:Non-associative algebra]]
[[Category:Properties of binary operations]]

Latest revision as of 06:27, 11 October 2024

In mathematics, specifically in abstract algebra, power associativity is a property of a binary operation that is a weak form of associativity.

Definition

[edit]

An algebra (or more generally a magma) is said to be power-associative if the subalgebra generated by any element is associative. Concretely, this means that if an element is performed an operation by itself several times, it doesn't matter in which order the operations are carried out, so for instance .

Examples and properties

[edit]

Every associative algebra is power-associative, but so are all other alternative algebras (like the octonions, which are non-associative) and even non-alternative flexible algebras like the sedenions, trigintaduonions, and Okubo algebras. Any algebra whose elements are idempotent is also power-associative.

Exponentiation to the power of any positive integer can be defined consistently whenever multiplication is power-associative. For example, there is no need to distinguish whether x3 should be defined as (xx)x or as x(xx), since these are equal. Exponentiation to the power of zero can also be defined if the operation has an identity element, so the existence of identity elements is useful in power-associative contexts.

Over a field of characteristic 0, an algebra is power-associative if and only if it satisfies and , where is the associator (Albert 1948).

Over an infinite field of prime characteristic there is no finite set of identities that characterizes power-associativity, but there are infinite independent sets, as described by Gainov (1970):

  • For : and for (
  • For : for (
  • For : for (
  • For : for (

A substitution law holds for real power-associative algebras with unit, which basically asserts that multiplication of polynomials works as expected. For f a real polynomial in x, and for any a in such an algebra define f(a) to be the element of the algebra resulting from the obvious substitution of a into f. Then for any two such polynomials f and g, we have that (fg)(a) = f(a)g(a).

See also

[edit]

References

[edit]
  • Albert, A. Adrian (1948). "Power-associative rings". Transactions of the American Mathematical Society. 64: 552–593. doi:10.2307/1990399. ISSN 0002-9947. JSTOR 1990399. MR 0027750. Zbl 0033.15402.
  • Gainov, A. T. (1970). "Power-associative algebras over a finite-characteristic field". Algebra and Logic. 9 (1): 5–19. doi:10.1007/BF02219846. ISSN 0002-9947. MR 0281764. Zbl 0208.04001.
  • Knus, Max-Albert; Merkurjev, Alexander; Rost, Markus; Tignol, Jean-Pierre (1998). The book of involutions. Colloquium Publications. Vol. 44. With a preface by Jacques Tits. Providence, RI: American Mathematical Society. ISBN 0-8218-0904-0. Zbl 0955.16001.
  • Okubo, Susumu (1995). Introduction to octonion and other non-associative algebras in physics. Montroll Memorial Lecture Series in Mathematical Physics. Vol. 2. Cambridge University Press. p. 17. ISBN 0-521-01792-0. MR 1356224. Zbl 0841.17001.
  • Schafer, R. D. (1995) [1966]. An introduction to non-associative algebras. Dover. pp. 128–148. ISBN 0-486-68813-5.