Group 7 ~" i; N7 Z' o7 x+ w
A group is defined as a finite or infinite set of Operands* Q6 _ @( h6 |4 T
(called ``elements'') , , , ... that may be combined or ``multiplied'' via a Binary Operator 9 P, _& n5 ?: w) x+ j' z to form well-defined products and which furthermore satisfy the following conditions: * G0 H! ]6 F5 E+ V c1 N; H
1. Closure: If and are two elements in , then the product is also in . & ~$ O* P! |. i9 F) C( x2 v4 v2. Associativity: The defined multiplication is associative, i.e., for all , . + D4 m a. s! M# h7 Y
3. Identity: There is an Identity Element! T' j) q, B# V
(a.k.a. , , or ) such that for every element . l7 p8 I0 ] X5 ^/ q0 s4. Inverse: There must be an inverse or reciprocal of each element. Therefore, the set must contain an element such that for each element of . 3 a4 ^4 z9 Q5 m! b
A group is therefore a Monoid+ E/ B0 Y- b# n* P1 E
for which every element is invertible. A group must contain at least one element. + l+ E+ h9 m4 W; ]8 H g% [ 5 B- f u& t" W/ K% ~
The study of groups is known as Group Theory& J9 i2 v7 K1 M
. If there are a finite number of elements, the group is called a Finite Group; S! X0 r4 `! j, m
and the number of elements is called the Order ) |! G9 J. Z; ]: ? of the group. 6 r7 g1 a: }. O0 J2 V 1 ^' w' {+ F& Z4 i
Since each element , , , ..., , and is a member of the group, group property 1 requires that the product ) J/ m# d1 O. [4 @( u. \5 a! A
' O* }) X& \0 G
(1)5 l0 b& H# h E F y
D' c9 R1 b) |" N/ `& X5 ` 1 A, y3 O1 J: Y( N( q5 j. J7 |! e1 q7 H
must also be a member. Now apply to , " W1 `, h2 B1 p( N
& m' P' ]# t$ ^
0 q. v" ^$ E$ |: O( i) D [ O
(2) 2 r8 Y v8 G) l0 T) P+ z
2 y. i7 \0 ?# I4 \! d; ?9 H+ T/ N& Y, Q$ O# S7 l7 r, u
: n5 U- ^6 ^9 _) x0 o! h, G1 u
But 5 u: ^. z2 a/ @/ V& A! s* v