Back to the index. Or to the chambers
This article has 12 links. View as Cloud or List.
| 1 | Binary Operation |
| 1 | Expression |
| 1 | Positive |
| 1 | Operation |
| 1 | Even Number |
| 1 | Integer |
| 1 | Induction |
| 1 | Ring |
| 1 | Identity Element |
| 1 | Associative |
| 1 | Group |
| 5 | Catalan Numbers |
Loading ...
Planetmath Browser (2008—2009)
BSD licence | A django site
All articles taken from PlanetMath.org snapshot under CC-BY-SA licence.
→ The original article on PlanetMath.org
Other Formats: LaTeX
General Associativity
If an associative
binary operation
of a set
is denoted by “
”, the associative law in
is usually expressed as
Note. The
elements can be joined, without changing their order, in
ways (see the Catalan numbers).
The theorem is proved by induction
on
. The cases
and
have been stated right above.
Let
. The expression
with
equal “factors”
may be denoted by
and called a power of
. If the associative operation
is denoted “additively”, then the “sum”
of
equal elements
is denoted by
and called a multiple of
; hence in every ring
one may consider powers and multiples. According to whether
is an even
or an odd number, one may speak of even powers, odd powers, even multiples, odd multiples.
The following two laws can be proved by induction:
Note. If the set
together with its operation is a group, then the notion of multiple
resp. power
can be extended for negative
integer
and zero values of
by means of the inverse
and identity elements. The above laws remain in force.