Group Theory
From ZuluNotes - Free Leaving Cert Notes
Contents |
What is Group Theory?
A 'group' is a combination of a set and an operator that together obey certain properties (listed below). A set is simply a list of objects, usually numbers. For example . An operator is something that takes two elements and produces a third element. For example, if we perform the addition operator on the numbers
and
, the number
is produced. Dozens of operators appear on the Leaving Certificate course - from addition to division to nCr.
In fact, not all operators take two elements. Factorial, for example, takes only one - we can perform the factorial 'operator' on to produce
. Operators that take two elements are called binary operators. When we deal with groups we will only be concerned with binary operations.
Group Theory is an area of mathematics concerned with deciding if a certain set and operation form a group, and examining certain properties of groups. At its hardest, Leaving Certificate Group Theory involves investigating similarities between different groups. Group Theory is not difficult, but may appear so due to the amount of definitions involved, coupled with the fact that it is unlike almost all other areas of Leaving Certificate maths. However, if you develop a good understanding of these definitions, the questions asked become quite repetitive and straight-forward.
Properties of Groups
There are four properties that groups must have: closure, associativity, identity and inverses.
Closure
Let's represent some operation by , and a let the set
. Then, if for every two elements,
and
,
, then
forms a group under the operation
(we could also write this as "
is a group").
For example, the set of natural numbers under the addition operator is closed, as if we add any two natural numbers, we get another natural number.
Associativity
is associative if
for all
.
Addition is associative: . However, subtraction is not, as
.
Composition of permutations and multiplication (modulo and matrix) are associative
Identity
There must exist some element in the set, let's call it , such that
for all
.
In addition, is the identity, as
. In multiplication
is the identity.
Inverses
For every element in the set H, there is another element
such that
, where
is the identity.
Note: is not necessarily the same as
to the power of
in this context. For example, if we take the integers under addition, then the inverse of
is
as
. So we could write
! This is just notation, don't take it literally.
If a set and operation have these four properties, then they form a group.
Examples of Groups
Let's take the integers () under the addition operation. Do they form a group? Let's check each of the properties.
First of all, is always an integer when
and
are integers? Yes, of course (we could never have
!). So we have closure.
We know that is true (the associativity of addition can be assumed at Leaving Cert level). So we have associativity.
We also know that , so we know that the identity is
.
Finally, for every integer , we know that
is also an integer, and so because
, we have inverses.
So, they do form a group! Now, something to consider, do the Naturals () form a group under addition?
Sample Problems
Believe it or not, we have already covered enough to tackle some LC questions (well, parts of questions anyway).
2006. Paper 2.
10.(a) For each of the following, give a reason why it is not a group.
(i) The set of natural numbers under subtraction.
(ii) The set of real numbers under multiplication.
(i) Firstly, subtraction is not associative. Eg. . Secondly, we do not have closure. Eg.
, which is not a natural number.
(ii) Note that is the identity under multiplication. But there is no number such that
, so
has no inverse.
2004. Paper 2.
10(a) The binary operationis identified by
, where
are real numbers and
. (i) Find the identity element. (ii) Calculate
, the inverse of
. (iii) Find
in terms of
. (iv) Show that
. (v) Show that
for all
.</b>
(i) Let's call the identity . Then:
=>
=>
=> or
.
But , therefore
.
(ii)
=>
=>
=>
(iii)
=>
=>
=>
(iv)
=> ... equation I
</ br>
=>
... equation II
Equation I = equation II, therefore .
(v) If
=>
=>
=>
Contradiction, so .
Under Construction
This is very much still under construction. The above is only the introduction really, and could use refinement!

