Student Name : NGUYEN PHUONG NAM

Student ID : BKC18316

PROGRAM TITLE: BTEC-COMPUTING

UNIT TITLE: DISCRETE MATHS
ASSIGNMENT NUMBER: 4
ASSIGNMENT NAME: Abstract algebra.
SUBMISSION DATE:
DATE RECEIVED: 19/12/2021
TUTORIAL LECTURER: LUU THI HUONG GIANG
WORD COUNT: 1880

STUDENT NAME: NGUYEN PHUONG NAM

STUDENT ID: BKC18316
MOBILE NUMBER: 0388898670

1
Student Name : NGUYEN PHUONG NAM
Student ID : BKC18316

Summative Feedback

Internal verification

2
Student Name : NGUYEN PHUONG NAM
Student ID : BKC18316

Content
LO4: Explore applicable concepts within abstract algebra....................................................................4
Part 1 When considering the set of all the natural numbers ( ℕ), show whether the mathematical
operations of addition, subtraction, multiplication and division are.................................................4
(a) Associative....................................................................................................................................4
(b) Commutative................................................................................................................................6
Part 2......................................................................................................................................................7
1. Build up the operation tables for group G with orders 1, 2, 3 and 4 using the elements a, b, c,
and e as the identity element in an appropriate way.......................................................................7
2...........................................................................................................................................................8
Lagrange Theorem Statement..........................................................................................................8
What is Coset?...................................................................................................................................8
Lagrange Theorem Proof..................................................................................................................9
Lagrange Theorem Corollary...........................................................................................................9
c. Discuss whether a group H with order 6 can be a subgroup of a group with order 13 or not.
Clearly state the reasons..................................................................................................................10
Part 3 Given that 𝐺 = {𝑎 ∈ ℝ|𝑎 ≠ −1} and 𝑎 ∗ 𝑏 = 𝑎 + 𝑏 + 𝑎𝑏, show that (𝐺, ∗) is indeed a group 10
REFERENCES......................................................................................................................................12

3
Student Name : NGUYEN PHUONG NAM
Student ID : BKC18316

LO4: Explore applicable concepts within abstract algebra

Part 1 When considering the set of all the natural numbers (ℕ), show whether the
mathematical operations of addition, subtraction, multiplication and division are

(a) Associative
Addition
Similar to addtion, to know if subtraction is connected, we need to prove:
a+(b+c)=a +b+c=(a+b)+c
Let's try to assign any value of the set N of natural numbers:
1 + (2+ 3) = 6 (1)
1+2+3=6 (2)
(1 + 2) + 3 = 6 (3)
Thus, we have the result that (1) = (2) ¿(3) is similar a + ( b + c ) = a + b + c = ( a + b ) + c, so it
can be concluded that subtraction is association on the set N of natural numbers

Multiplication
Similar to addtion, to know if subtraction is connected, we need to prove:
a*(b*c)=a*b*c=(a*b)*c
Let's try to assign any value of the set N of natural numbers:
1 * (2 * 3) = 6 (1)
1 * 2 * 3= 6 (2)
(1 * 2) * 3 = 6 (3)
Thus, we have the result that (1) = (2) ¿(3) is similar a * ( b * c ) = a * b * c = ( a * b ) * c , so it
can be concluded that subtraction is association on the set N of natural numbers

4
Student Name : NGUYEN PHUONG NAM
Student ID : BKC18316

Subtraction
Similar to subtraction, to know if subtraction is connected, we need to prove:
(a - b) - c = a - b - c = a - (b - c)
Let's try to assign any value of the set N of natural numbers:
(6 - 2) - 1 = 3 (1)
6 - 2- 1 = 3 (2)
6 - (2 - 1) = 5 (3)
Thus, we have the result that (1) = (2) ≠(3) is similar to (a - b) - c = a - b - ca - (b - c), so it can be
concluded that subtraction is not association on the set N of natural numbers
Division
Similar to division, to know if subtraction is connected, we need to prove:
(a : b) : c = a : b : c = a : (b : c)
Let's try to assign any value of the set N of natural numbers:
(8 : 4) : 2 = 1 (1)
8:4:2=1 (2)
8 : (4 : 2) = 4 (3)
Thus, we have the result that (1) = (2) ≠(3) is similar to (a : b) : c = a : b : c = a : (b : c), so it can
be concluded that subtraction is not association on the set N of natural numbers

(b) Commutative.
Addition
Since a +b=b+a for any a,b∈N, we conclude that the operation of addition is commutative on the
set N of natural numbers

Similar to addtion, to know if subtraction is connected, we need to prove:

a+b=b+a

5
Student Name : NGUYEN PHUONG NAM
Student ID : BKC18316

Let's try to assign any value of the set N of natural numbers:

1+2=3 (1)
2+1=3 (2)
Thus, we have the result that (1) = (2) is a + b = b + a , so it can be concluded that subtraction is
commutative on the set N of natural numbers

Multiplication
Similar to addtion, to know if subtraction is connected, we need to prove:
a*b=b*a
Let's try to assign any value of the set N of natural numbers:
1*2=2 (1)
2*1=2 (2)
Thus, we have the result that (1) = (2) is a * b = b * a , so it can be concluded that subtraction
is commutative on the set N of natural numbers

Subtraction
Similar to addtion, to know if subtraction is connected, we need to prove:
a-b=b-a
Let's try to assign any value of the set N of natural numbers:
1 - 2 = -1 (1)
2 -1=1 (2)
Thus, we have the result that (1) ≠(2) is a - b = b - a , so it can be concluded that subtraction is
not commutative on the set N of natural numbers

Division
Similar to addtion, to know if subtraction is connected, we need to prove:
a:b=b:a
Let's try to assign any value of the set N of natural numbers:

6
Student Name : NGUYEN PHUONG NAM
Student ID : BKC18316

1 : 2 = 0.5 (1)
2 :1= 2 (2)
Thus, we have the result that (1) ≠(2) is a : b = b : a , so it can be concluded that subtraction is
not commutative on the set N of natural numbers

Part 2
1. Build up the operation tables for group G with orders 1, 2, 3 and 4 using the elements a,
b, c, and e as the identity element in an appropriate way.

We denote by *∗ an operation of the group GG . We point out that the group can not have
elements of order 3. I.e., if b^3 = e
then the operation is wrongly defined. We point out that the general number of possible
definitions of operation *∗ on the group GG is less than 9. As an example, *∗ can be defined in
the following way:

* e a b c
e e a b c
a a c c b
b b c a e
c c b e a

* e a b c
e e a b c
a a e c b
b b c e a
c c b e a

* e a b c
e e a b c
a a b c e
b b c e a
c c e a b
7
Student Name : NGUYEN PHUONG NAM
Student ID : BKC18316

* e a b c
e e a b c
a a c e b
b b e c a
c c b e a

2
Lagrange Theorem Statement
As per the statement, the order of the subgroup H divides the order of the group G. This can be
represented as;
|G| = |H|
Before proving the Lagrange theorem, let us discuss the important terminologies and three
lemmas that help to prove this theorem.
What is Coset?
In group theory, if G is a finite group, and H is a subgroup of G, and if g is an element of G,
then;
gH = { gh: h an element of H } is the left coset of H in G with respect to the element of G
And
Hg = { hg: h an element of H } is the right coset of H in G with respect to the element of G.
Now, let us have a discussion about the lemmas that helps to prove the Lagrange theorem.
Lemma 1: If G is a group with subgroup H, then there is a one to one correspondence between H
and any coset of H.
Lemma 2: If G is a group with subgroup H, then the left coset relation, g1 ∼ g2 if and only if g1
∗ H = g2 ∗ H is an equivalence relation.
Lemma 3: Let S be a set and ∼ be an equivalence relation on S. If A and B are two equivalence
classes with A ∩ B = ∅, then A = B.
Lagrange Theorem Proof
With the help of the above mentioned three lemmas, we can easily prove the Lagrange statement.
Proof of Lagrange Statement:
Let H be any subgroup of the order n of a finite group G of order m. Let us consider the cost
breakdown of G related to H.
Now let us consider each coset of aH comprises n different elements.

8
Student Name : NGUYEN PHUONG NAM
Student ID : BKC18316

Let H = {h1,h2,…,hn}, then ah1,ah2,…,ahn are the n distinct members of aH.

Suppose, ahi=ahj⇒hi=hj be the cancellation law of G.
Since G is a finite group, the number of discrete left cosets will also be finite, say p. So, the total
number of elements of all cosets is np which is equal to the total number of elements of G.
Hence, m=np
p = m/n
This shows that n, the order of H, is a divisor of m, the order of the finite group G. We also see
that the index p is also a divisor of the order of the group.
Hence, proved, |G| = |H|
Lagrange Theorem Corollary
Corolx`lary 1: If G is a group of finite order m, then the order of any a∈G divides the order of G
and in particular am = e.
Proof: Let p be the order of a, which is the least positive integer, so,
ap = e
Then we can say,
a, a2, a3, …., ap-1,ap = e, the elements of group G are all distinct and forms a subgroup.
Since the subgroup is of order p, thus p the order of a divides the group G.
So, we can write,
m = np, where n is a positive integer.
So,
am = anp = (ap)n = e
Hence, proved.
Corollary 2: If the order of finite group G is a prime order, then it has no proper subgroups.
Proof: Let us consider, the prime order of the group G is m. Now, m has only two divisors 1 and
m (prime numbers property). Therefore, the subgroups of G will be {e} and G itself. So, there
are no proper subgroups. Hence, proved.
Corollary 3: A group of prime order (the order has only two divisors) is a cyclic group.
Proof: Suppose, G is the group of prime order of m and a ≠ e∈G.
Since the order of a is a divisor of m, it is either 1 or m.
But the order of a, o(a) ≠ 1, since a ≠ e.

9
Student Name : NGUYEN PHUONG NAM
Student ID : BKC18316

Therefore, the order of o(a) = p, and the cyclic subgroup of G generated by a are also of order m.
It proves that G is the same as the cyclic subgroup formed by a, i.e. G is cyclic.

c. Discuss whether a group H with order 6 can be a subgroup of a group with order 13 or
not. Clearly state the reasons.
A consequence of Lagrange's Theorem would be,
Group H with order 6 can be a subgroup of a group with order 13 or not,
That a group with Oder 13 elements couldn't have a subgroup of 6 elements since 6 does not
divide 13. It could have subgroups with 13 elements since only this number is divisors of 13

Part 3 Given that 𝐺 = {𝑎 ∈ ℝ|𝑎 ≠ −1} and 𝑎 ∗ 𝑏 = 𝑎 + 𝑏 + 𝑎𝑏, show that (𝐺, ∗)
is indeed a group

If this set is a group, it has to satisfy associativity with the operation, and the existence of an
identity and inverse element.
Suppose we have a ,b ,c ∈ G
(a * b) * c = (a * b) + c + (a * b).c
= (a + b + ab) + c + (a + b + ab).c
= a + b + ab + c + ac + bc + abc
= a + (b + c + bc) + (b + c + bc).a
= a + (b * c) + (b * c).a
= a * (b * c)
Because (a ∗ b) ∗ c = a ∗ (b ∗ c) so we can conclude that the operation of * is associative on the
{ℝ/-1}
We can pick out the identity element using the definition: we must have, for example :
a∗e=a
for all a, and expanding gives
a + e –ae = a.
To show that the operation admits inverses, it's enough to produce a formula for the inverse a−1
of an arbitrary element a, that is, an element that satisfies a∗a−1 = e = a−1 ∗ a. As with the
identity, use the definition of ∗ and solve for a−1 in terms of a.

10
Student Name : NGUYEN PHUONG NAM
Student ID : BKC18316

Back to the topic, if the identity element e exists, then: a * e = e * a = a

We will have *e = a
<=> a + e + ae = a
<=> e (1 + a) = a - a
<=> e (1 + a) = 0
<=> e = 0
or a = -1 (not satisfying 𝐺 = {a ∈ ℝ | a ≠ −1})
From this, I have the result that (𝐺, ) has a homogeneous element e = 0
For all a ∈ 𝐺, we have a ' where a * a' = e.
We have a *a '= e
<=> a + a '+ aa' = 0,
<=> a '(1 + a) = -a
<=> a '= (-a) ⁄ ((1) + a) (∀a ≠ -1)
We conclude that a ∈ (𝐺, ), we have a ' that a * a '= e.
Thus (𝐺, ∗) has satisfied all three conditions above, so we can conclude that (𝐺, ∗) is indeed a
group.

REFERENCES
- https://en.wikipedia.org/wiki/Group_theory
- https://en.wikipedia.org/wiki/Abstract_algebra
- https://brilliant.org/wiki/abstract-algebra/
- https://mathworld.wolfram.com/AbstractAlgebra.html
- https://www.britannica.com/science/group-theory

11
Student Name : NGUYEN PHUONG NAM
Student ID : BKC18316

- https://www.vedantu.com/maths/group-theory-in-mathematics
- https://brilliant.org/wiki/group-theory-introduction/
- https://www.youtube.com/watch?v=BnE_MJaU8BQ
- https://www.analyticssteps.com/blogs/what-group-theory-propertiesaxioms-and-
applications
-

12