Namespaces
Variants
Actions

Difference between revisions of "Power associativity"

From Encyclopedia of Mathematics
Jump to: navigation, search
(Start article: Power associativity)
 
(better)
 
Line 1: Line 1:
A [[binary operation]] $\star$ on a set $X$ is ''power associative'' if it satisfies the condition
+
A [[binary operation]] $\star$ on a set $X$ is ''power associative'' if each element $x$ generates an associative [[magma]]: that is, exponentiation $x \mapsto x^n$ is well-defined for positive integers $n$, and $x^{m+n} = x^m \star x^n$.  The set of powers of $x$ thus forms a [[semi-group]].
$$
 
x \star ( x \star x) = (x \star x) \star x
 
$$
 
for all $x \in X$.
 
 
 
For such operations, exponentiation $x \mapsto x^n$ is well-defined for positive integers $n$, and $x^{m+n} = x^m \star x^n$.  The set of powers of $x$ forms a [[semi-group]].
 
  
 
See also: [[Algebra with associative powers]].
 
See also: [[Algebra with associative powers]].

Latest revision as of 10:28, 1 January 2016

A binary operation $\star$ on a set $X$ is power associative if each element $x$ generates an associative magma: that is, exponentiation $x \mapsto x^n$ is well-defined for positive integers $n$, and $x^{m+n} = x^m \star x^n$. The set of powers of $x$ thus forms a semi-group.

See also: Algebra with associative powers.

References

  • Bruck, Richard Hubert A survey of binary systems, Ergebnisse der Mathematik und ihrer Grenzgebiete. Neue Folge. 20 Springer (1958) Zbl 0081.01704
How to Cite This Entry:
Power associativity. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Power_associativity&oldid=37214