Group 2 ?9 I& d$ t' o3 S
A group is defined as a finite or infinite set of Operands / u4 p5 l4 _' P- ?9 u (called ``elements'') , , , ... that may be combined or ``multiplied'' via a Binary Operator % H+ X, l3 C& L4 T5 i to form well-defined products and which furthermore satisfy the following conditions: 8 E, O0 j( d- E: j1. Closure: If and are two elements in , then the product is also in . ' K; m2 D6 p4 P( \+ N2. Associativity: The defined multiplication is associative, i.e., for all , . 8 F7 m- X4 C( p+ o2 Y6 m
3. Identity: There is an Identity Element + p9 \' @( a& w6 h3 r3 c k (a.k.a. , , or ) such that for every element . 9 [! U. G% \3 G' S
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 . , [/ [4 s+ F/ [+ u
A group is therefore a Monoid* r+ I0 H' K- X: C
for which every element is invertible. A group must contain at least one element. 2 y% v) e/ L" j$ U , v+ }/ J) d& E; K- S5 P, g2 hThe study of groups is known as Group Theory 1 H, u0 @) ^+ H1 R5 j0 P. If there are a finite number of elements, the group is called a Finite Group ( R: n9 h) S% b/ E2 g and the number of elements is called the Order ( F" X5 r8 {! b; W1 w! `. m of the group. , @5 z- o* x% G' O$ o ' o8 \5 K% T0 U5 @ Q
Since each element , , , ..., , and is a member of the group, group property 1 requires that the product ! g; f0 q( I6 J2 F" G
" p* a% Z. _1 s' z( ?2 T6 @
(1) 2 r, E9 P3 s% W5 M8 i
% P# _7 ?0 w1 P7 s" ]6 E6 b; w$ @( a; m3 V
9 i" Y' D9 }( E7 jmust also be a member. Now apply to , + g9 J3 o0 L# Q' @
{9 c0 K, _% s) j& |- y2 O. C2 q! F