Group 9 M5 \* _5 S6 LA group is defined as a finite or infinite set of Operands + d( B; O5 F) m (called ``elements'') , , , ... that may be combined or ``multiplied'' via a Binary Operator4 Z9 q; }0 ]. j9 |
to form well-defined products and which furthermore satisfy the following conditions: , H2 B% j+ R! n6 G" @4 K
1. Closure: If and are two elements in , then the product is also in . - c! G `0 \0 u/ i1 s5 v! v
2. Associativity: The defined multiplication is associative, i.e., for all , . 9 B- ?- E5 n3 [/ o3. Identity: There is an Identity Element9 t3 O8 [) X8 H9 {
(a.k.a. , , or ) such that for every element . 5 L V s2 X8 y# F4. Inverse: There must be an inverse or reciprocal of each element. Therefore, the set must contain an element such that for each element of . ! Y& K( c; _" m
A group is therefore a Monoid ) {. g: k" j3 c( f3 `: C5 Y6 } for which every element is invertible. A group must contain at least one element. 8 K+ j2 Q1 S9 {( q3 |- ~ * M6 E6 H* @5 P) @8 R1 V$ uThe study of groups is known as Group Theory H( o( _/ s+ W e. N1 P. If there are a finite number of elements, the group is called a Finite Group& M& ^1 d! l3 f# x! M. ?' j/ p5 |
and the number of elements is called the Order & o( U' L% n# Z' ?- I of the group. & _ Y. P; z9 T0 B 4 Z1 S( g" _& q& JSince each element , , , ..., , and is a member of the group, group property 1 requires that the product ; \( T9 v: r7 _2 j6 n( F$ m
8 T' h/ _$ M) U8 x: {2 P
(1) : E3 R" G5 u7 l8 e
) f! [* F) A; ]) R4 O
* {7 g) j% I9 A' Z. O9 L/ I( u
* I8 H( ^; k& C( V: \7 Z/ amust also be a member. Now apply to , 4 Z, O& J2 ~; O: Q \ & q" [- h: _* I$ R