Power of an Element
From ProofWiki
Contents |
Theorem
Let $\left({S, \circ}\right)$ be a semigroup. Let $x \in S$.
Let $\left({x_1, x_2, \ldots, x_n}\right)$ be the ordered $n$-tuple defined by $x_k = x$ for each $k \in \N_n$.
Then:
- $\displaystyle \prod_{k=1}^n x_k = \circ^n x$
In a general semigroup, we usually write $\circ^n x$ as $x^n$.
In a semigroup in which $\circ$ is addition, or derived from addition, this can be written $n x$, that is, $n$ times $x$.
It can be defined inductively as:
- $x^n = \begin{cases} x & : n = 1 \\ x^{n-1} \circ x & : n > 1 \end{cases}$
or
- $n x = \begin{cases} x & : n = 1 \\ \left({n - 1}\right) x \circ x & : n > 1 \end{cases}$
Sometimes, for clarity, $n \cdot x$ is preferred to $n x$.
Proof
Follows directly from Recursive Mapping to Semigroup.
$\blacksquare$
Also see
Sources
- Iain T. Adamson: Introduction to Field Theory (1964)... (previous)... (next): $\S 1.2$
- J.A. Green: Sets and Groups (1965)... (previous)... (next): $\S 4.2$
- Seth Warner: Modern Algebra (1965)... (previous)... (next): $\S 18$: Theorem $18.2$
- B. Hartley and T.O. Hawkes: Rings, Modules and Linear Algebra (1970): $\S 2.1$: Notation $2$
- Allan Clark: Elements of Abstract Algebra (1971)... (previous)... (next): $\S 27$
- Thomas A. Whitelaw: An Introduction to Abstract Algebra (1978)... (previous)... (next): $\S 30$