Group " D. r3 g2 \2 ^ i, \A group is defined as a finite or infinite set of Operands. _, O8 k/ w* T
(called ``elements'') , , , ... that may be combined or ``multiplied'' via a Binary Operator 8 ]$ e3 |3 y" N7 x5 M7 e' K3 s; ^: g to form well-defined products and which furthermore satisfy the following conditions: % Q9 y- @/ P9 N1. Closure: If and are two elements in , then the product is also in . . h- n/ `7 A. N( T1 n8 U' W1 B2. Associativity: The defined multiplication is associative, i.e., for all , . , k( k3 h8 q3 T# K ^: Z3. Identity: There is an Identity Element1 D/ y. ?* e& G6 }+ q
(a.k.a. , , or ) such that for every element . " J! v, U1 ]% l+ S6 u6 g9 }4 @6 U
4. Inverse: There must be an inverse or reciprocal of each element. Therefore, the set must contain an element such that for each element of . 7 A U: l' e7 U3 Q8 ^5 b7 ZA group is therefore a Monoid& o6 m4 |- H& H! c. R8 @7 U
for which every element is invertible. A group must contain at least one element. v& m2 g# h6 Z& f5 } ' a- M& l9 H) |- G0 q4 v
The study of groups is known as Group Theory 5 o; j- n. k6 t- b. If there are a finite number of elements, the group is called a Finite Group: |8 q+ L9 D% Y/ m3 s/ ^6 j
and the number of elements is called the Order & O1 d) f* H8 S8 G8 ~% n of the group. " z% O) `% K( A! T9 y1 R" \
. o& Z$ _! `, lSince each element , , , ..., , and is a member of the group, group property 1 requires that the product ! E9 p( [. W1 ^$ i' O+ J
5 Z8 n3 O& I, t8 n2 Z' W
(1) + f9 U6 A* ^. k
+ O; t2 B# e% j9 e7 x" u
Z" a, t3 l/ K* J9 Q$ | 7 \' q9 {6 X7 m& f# Kmust also be a member. Now apply to , $ K: A) @5 r# ?5 p/ y
7 P% s1 V( B8 v
! i& @' t- G: D3 ~
(2)1 m" l7 B! ]) ~5 c& u1 r
& e1 ^6 j `2 G0 g " G- z1 m- o9 b" k 6 s8 X) H% ~$ G/ bBut - W. u9 }& j/ N, x7 K