A group is a set paired with an operation on the set. As such, a group can be conceptualized as an ordered pair
(
G
,
⋅
)
{\displaystyle (G,\cdot)}
, where
G
{\displaystyle G}
is a set, and
⋅
{\displaystyle \cdot}
is an operation.
A set and operation
(
G
,
⋅
)
{\displaystyle (G,\cdot)}
is a group if and only if it satisfies the following properties:
Identity element — There exists an
e
∈
G
{\displaystyle e\in G}
, called an identity element, such that
e
⋅
g
=
g
=
g
⋅
e
{\displaystyle e\cdot g=g=g\cdot e}
, for all
g
∈
G
{\displaystyle g \in G}
Inverses — For each
g
∈
G
{\displaystyle g \in G}
, there exists an
h
∈
G
{\displaystyle h \in G}
, called an inverse of
g
{\displaystyle g}
, such that
h
⋅
g
=
e
=
g
⋅
h
{\displaystyle h\cdot g=e=g\cdot h}
Associativity — For all
a
,
b
,
c
∈
G
,
(
a
⋅
b
)
⋅
c
=
a
⋅
(
b
⋅
c
)
{\displaystyle a,b,c\in G\ ,\ (a\cdot b)\cdot c=a\cdot(b\cdot c)}
Closure — For all
a
,
b
∈
G
,
a
⋅
b
∈
G
{\displaystyle a,b\in G\ ,\ a\cdot b\in G}
Whenever the group operation is
⋅
{\displaystyle \cdot}
, the operation of group elements
a
,
b
{\displaystyle a, b}
,
a
⋅
b
{\displaystyle a\cdot b}
, is often abbreviated as simply a juxtaposition of the group elements,
a
b
{\displaystyle ab}
.
Important Results [ ]
From the given criterion for a group, the following properties can be shown for any group
(
G
,
⋅
)
{\displaystyle (G,\cdot)}
:
There exists exactly one identity element;
For each
g
∈
G
{\displaystyle g \in G}
, there exists exactly one inverse of
g
{\displaystyle g}
, and henceforth is referred to as
g
−
1
{\displaystyle g^{-1}}
(proof )
For each
g
∈
G
,
(
g
−
1
)
−
1
=
g
{\displaystyle g\in G\ ,\ \left(g^{-1}\right)^{-1}=g}
Groups have the cancellation property : For all
a
,
b
,
c
∈
G
,
a
⋅
b
=
a
⋅
c
{\displaystyle a,b,c\in G\ ,\ a\cdot b=a\cdot c}
implies
b
=
c
{\displaystyle b=c}
, and
b
⋅
a
=
c
⋅
a
{\displaystyle b \cdot a = c \cdot a}
implies
b
=
c
{\displaystyle b=c}
.
Optional Properties [ ]
A group
(
G
,
⋅
)
{\displaystyle (G,\cdot)}
is:
An abelian group if the operation
⋅
{\displaystyle \cdot}
is commutative , i.e.
a
b
=
b
a
{\displaystyle ab = ba}
for all
a
,
b
∈
G
{\displaystyle a, b \in G}
A cyclic group if there exists a
g
∈
G
{\displaystyle g \in G}
such that
G
=
{
g
n
|
n
∈
Z
}
{\displaystyle G=\big\{g^n\big|n\in \Z\big\}}
, where
g
n
{\displaystyle g^n}
is
n
{\displaystyle n}
copies of
g
{\displaystyle g}
being operated together (see exponent )
A subgroup of a group
(
K
,
⋅
)
{\displaystyle (K,\cdot)}
if
G
⊆
K
{\displaystyle G\subseteq K}
(see subset ), where the group operation on
G
{\displaystyle G}
is a domain restriction on the group operation on
K
{\displaystyle K}
A group
G
{\displaystyle G}
with a partial order
≤
{\displaystyle \le}
on it is a partially ordered group if for all
a
,
b
,
g
∈
G
{\displaystyle a,b,g\in G}
, if
a
≤
b
{\displaystyle a \le b}
, then
g
a
≤
g
b
{\displaystyle ga\le gb}
and
a
g
≤
b
g
{\displaystyle ag\le bg}
(translation invariance ). It is a totally ordered group if in addition
≤
{\displaystyle \le}
is a total order .