Unit-2

Short Answer Questions

1. Give an example of antisymmetric relation.
Ans: A relation R on a set A is antisymmetric if:(a,b)∈R and (b,a)∈R⇒a=b
Example:
Let A={1,2,3} and define relation R={(1,1),(2,2),(3,3),(1,2)}.
Here, (1,2)∈R but (2,1)∉R, so it is antisymmetric.
2. Define equivalence relation. Give an example.
Ans: A relation on a set is called an equivalence relation if it is reflexive, symmetric, and
transitive. Ex: The sign of ‘is equal to (=)’ on a set of numbers
3. Define POSET? (or) What is partial order relation?
Ans: A relation R on a set S is called a partial ordering, or partial order, if it is reflexive,
antisymmetric, and transitive. A set S together with a partial ordering R is called a partially
ordered set, or poset, and is denoted by (S, R). Members of S are called elements of the poset.
4. Give an example of a relation on a set that is symmetric and anti-symmetric.
Ans: R = { (a,b) | a = b} is an example of a relation of a set that is both symmetric and
antisymmetric. It is both symmetric because if (a,b) ∈ R, then (b,a) ∈ R (if a = b). Since (a,b)
∈ R and (b,a) ∈ R if and only if a = b, then it is anti-symmetric.
Ex: The relation R = {(1,1),(2,2)} on the set A = {1,2,3}.
5. Give the properties of relations
Ans: A relation can have the following properties:
1. Reflexive
2. Symmetric
3. Antisymmetric
4. Transitive
5. Equivalence
6. Partial Order
Write definitions also
6. What is well-ordering principle?
Ans: The Well-Ordering Principle states:
Every non-empty subset of the natural numbers N has a least element.
Example: The set {4,7,9,12}has the least element 4.
7. Define lattice. Give an example.
Ans: A partially ordered set in which every pair of elements has both a least upper bound and
a greatest lower bound is called a lattice.
Example: The set {1,2,3,6} under the divisibility relation.
8. Explain about glb,lub and Lattice
Ans: GLB (Greatest Lower Bound): The element x is called the Greatest Lower Bound of the
subset A if x is an lower bound that is greater than every other lower bound of A.(or)
The largest element that is less than or equal to both a and b.
LUB (Least Upper Bound): The element x is called the least upper bound of the subset A if x
is an upper bound that is less than every other upper bound of A.(or)
The smallest element that is greater than or equal to both a and b.
Lattice: A set where GLB and LUB exist for all elements.
9. Let A={0,1,2} , B={a,b}. What is the Cartesian product of A and B?
Ans: A×B={(0,a),(0,b),(1,a),(1,b),(2,a),(2,b)}
10. If f(x)=x+2 g(x)=x-2 h(x)=3x. Find f∘g∘h and g∘h∘f
Ans: Sol: f∘g∘h: This means f(g(h(x))). Start from the innermost function:
Step 1: Compute h(x)
h(x)=3x
Step 2: Compute g(h(x))=g(3x)
g(3x)=3x−2
Step 3: Compute f(g(h(x)))=f(3x−2)f(g(h(x))) = f(3x - 2)f(g(h(x)))=f(3x−2)
f(3x−2)=(3x−2)+2=3xf(3x - 2) = (3x - 2) + 2 = 3xf(3x−2)=(3x−2)+2=3x
So, f∘g∘h=3x.
g∘h∘f: This means g(h(f(x))). Start from the innermost function:
Step 1: Compute f(x)
f(x)=x+2
Step 2: Compute h(f(x))=h(x+2)
h(x+2)=3(x+2)=3x+6
Step 3: Compute g(h(f(x)))=g(3x+6)
g(3x+6)=(3x+6)−2=3x+4
So, g∘h∘f=3x+4.
11. Define Bijective function. Write a bijective relation for set A = {1, 2, 3, 4}.
Ans: A function is bijective if it is both:
 Injective (One-to-One): No two elements in the domain map to the same value.
 Surjective (Onto): Every element in the codomain has a preimage.
Example:Let A={1,2,3,4}, a bijection is:f:A→A,f(x)=5−x
f(1)=4,f(2)=3,f(3)=2,f(4)=1 (Both one-to-one and onto).
12. Consider the functions f and g defined by f(x)=x3, g(x)=x2+1, x ∈ R. Find gof, fog,f2 and
g2.
Ans: The composition g∘f means g(f(x)), which is applying g to the result of f(x).
First, compute f(x)=x3.
Now, substitute this into g(x):
g(f(x))=g(x3)=(x3)2+1=x6+1.
The composition f∘g means f(g(x)), which is applying f to the result of g(x).
First, compute g(x)=x2+1.
Now, substitute this into f(x):
f(g(x))=f(x2+1)=(x2+1)3.
Expand (x2+1)3 using the binomial theorem: (x2+1)3 =x6+3x4+3x2+1.
f2:f(f(x))=(x3)3=x9
g2:g(g(x))=(x2+1)2+1
13. Define function. What are the different types of function?
Ans: A function is a relation where every input has exactly one output.
Types:
 Injective (One-to-One)
 Surjective (Onto)
 Bijective
Write definitions also
14. Define algebraic system. Write its properties.
Ans: Algebraic System: A set ‘A’ with one or more binary(closed) operations defined on
it is called an algebraic system.
Associativity: Let * be a binary operation on a set A.
The operation * is said to be associative in A if
(a * b) * c = a *( b * c) for all a, b, c in A
Commutative: Let * be a binary operation on a set A.
 The operation * is said to be commutative in A if
a * b= b * a for all a, b in A
Identity: For an algebraic system (A, *), an element ‘e’ in A is said to be an identity
element of A if
a * e = e * a = a for all a Î A.
Note: For an algebraic system (A, *), the identity element, if exists, is unique.
Inverse: Let (A, *) be an algebraic system with identity ‘e’. Let a be an element in A. An
element b is said to be inverse of A if
a*b=b*a=e
15. Define groups and monoids with examples.
Ans: Group: If a Monoid satisfy inverse property then it is called Group.
An algebraic system (G, *) is said to be a group if the following conditions are satisfied.
1. * is a closed operation.
2. * is an associative operation.
3. There is an identity in G.
4. Every element in G has inverse in G.
Example: (Z,+) with identity 0 and inverse −x.
Monoid: If a semigroup satisfies identity property then it is called Monoid.
An algebraic system (G, *) is said to be a Monoid if the following conditions are satisfied.
1. * is a closed operation.
2. * is an associative operation.
3. There is an identity in G.
Example: (N,+) with identity 0.
Long Answer Questions
1. Explain properties of Binary relations.
Ans: Properties of Binary Relations
A binary relation R on a set A is a subset of A×A. It can have the following properties:
1. Reflexive: (a,a)∈R for all a∈A.
2. Symmetric: If (a,b)∈R, then (b,a)∈R.
3. Antisymmetric: If (a,b)∈R and (b,a)∈R, then a=b.
4. Transitive: If (a,b)∈R and (b,c)∈R, then (a,c)∈R.

2. Identify the properties that following relations on set {1, 2, 3, 4} holds :

R1 = {(1, 1), (1, 2), (2, 1), (2, 2), (3, 4), (4, 1), (4, 4)},
R2 = {(1, 1), (1, 2), (2, 1)},
R3 = {(1, 1), (1, 2), (1, 4), (2, 1), (2, 2), (3, 3), (4, 1) (4, 4)}.
Ans: Let A={1,2,3,4}:
R1={(1,1),(1,2),(2,1),(2,2),(3,4),(4,1),(4,4)}
 Reflexive: No (missing (3,3))
 Symmetric: No (contains (3,4) but not (4,3))
 Antisymmetric: No (contains both (1,2) and (2,1))
 Transitive: No (contains (3,4) and (4,1) but not (3,1))
R2={(1,1),(1,2),(2,1)}
 Reflexive: No (missing (2,2), (3,3), (4,4).)
 Symmetric: Yes (contains (1,2) and (2,1))
 Antisymmetric: No (contains both (1,2) and (2,1))
 Transitive: No (contains (2,1) and (1,2) but not (2,2))
R3={(1,1),(1,2),(1,4),(2,1),(2,2),(3,3),(4,1),(4,4)}
 Reflexive: Yes
 Symmetric:Yes
 Antisymmetric: No (contains both (1,2) and (2,1))
 Transitive: No (contains (4,1) and (1,2) but not (4,2))

3. Obtain a zero-one matrix of the transitive closure of the relation R where

Ans: Let MR be the zero–one matrix of the relation R on a set with n elements. Then
the zero–one matrix of the transitive closure R∗ is MR∗ = MR ∨M[2]R∨M[3]R∨ ・ ・ ・
∨M[n]R .
MR∗ = MR ∨M[2]R∨M[3]R.
Because M[2]R= 1 1 1
010
011

And M[3]R= 1 1 1
010
011
it follows that
MR∗ =1 0 1
010
 011
∨
111
010
011
∨
111
010
011

= 111
010
011

4. Obtain Hasse diagram for the relation xRy iff x divides y for the set A={2,4,6,8,12,24,32}
Ans: For A={2,4,6,8,12,24,32}, draw a diagram where:
 Lower elements divide higher elements.
 Edges indicate direct division without intermediates.

5. Draw the Hasse Diagram representing the partial ordering relation {(a,b) │a divides b} on
{1, 2, 3, 4, 6, 8, 12} also find maximal and minimal elements (or) Construct Hasse
diagram for {(1,2,3,4,6,8,12), |}
Ans: Begin with the digraph for this partial order.

Remove all loops.

 Then delete all the edges implied by the transitive property
These are (1, 4), (1, 6), (1, 8), (1, 12), (2, 8), (2, 12), and (3, 12)
Arrange all edges to point upward, and delete all arrows to obtain the Hasse diagram.

Maximal: 8 and 12.

Minimal: 1
6. A = {2, 3, 6, 12, 24, 36, 72} R: {(x,y) / x,y ε A, x divides y} write the partial order and
draw the Hasse diagram for R and compute lower bounds, upper bounds, greatest lower
bound, least upper bound for {2,12, 24}.
Ans: Partial order is {(2,2), (2,6), (2,12), (2,24), (2,36), (2,72), (3,3), (3,6), (3,12), (3,24),
(3,36), (3,72), (6,6), (6,12), (6,24), (6,36), (6,72), (12,12), (12,24), (12,36), (12,72), (24,24),
(24,72), (36,36), (36,72), (72,72).
Hasse Diagram:

Bounds for {2,12,24}:

Lower Bounds:
Elements x∈A are lower bounds for {2, 12, 24} if x≤2, x≤12, x≤24 (in divisibility terms).
 The lower bounds of {2, 12, 24} are {2}, as 2 divides all three elements.
Upper Bounds:
Elements x∈A are upper bounds for {2, 12, 24} if x≥2, x≥12, x≥24 (in divisibility terms).
 The upper bounds of {2, 12, 24} are {24, 72}, as these elements are divisible by all
three elements.
Greatest Lower Bound (GLB):
The greatest lower bound (meet) of {2, 12, 24} is the largest element in the set of lower
bounds.
 The GLB is 2.
Least Upper Bound (LUB):
The least upper bound (join) of {2, 12, 24} is the smallest element in the set of upper bounds.
 The LUB is 24.
7. If f(x) = 3x + 5 where x > 0 and = -3x + 1 x ≤ 0 then compute f(2), f(-1),f -1(0), f -1(-1), f -1
(6)
Ans: Given f(x)=3x+5 for x>0, and f(x)=−3x+1 for x≤0:
 f(2)=3(2)+5=11
 f(−1)=−3(−1)+1=4
-1
 Compute f (0):To find the inverse, we need to solve for x in the equation f(x) = 0.
 For x > 0: 3x + 5 = 0 --> 3x = -5 --> x = -5/3 (not valid since x > 0)
 For x ≤ 0: -3x + 1 = 0 --> -3x = -1 --> x = 1/3 (not valid since x ≤ 0)
 However, we can try to find the inverse for each part of the function:
-1
 For x > 0: f(x) = 3x + 5 --> f (x) = (x - 5)/3
-1
 For x ≤ 0: f(x) = -3x + 1 --> f (x) = (1 - x)/3
Now, we can compute f-1(0) using the first inverse (since 0 is in the range of the second
part of the function): f-1(0) = (1 - 0)/3 = 1/3.
-1
 Compute f (-1)
-1
 Using the first inverse: f (-1) = (1 – (-1))/3 = 2/3.
-1
 Compute f (6)
-1
 Using the first inverse: f (6) = (6 - 5)/3 = 1/3.
 The final answer is:
-1 -1 -1
 f(2) = 11,f(-1) = 4, f (0) = 1/3,f (-1) = 2/3, f (6) = 1/3
8. If f(x)=x+2 g(x)=x-2 h(x)=3x find fog, gof, foh, goh, hog, hof, fogoh
Ans: Sol: 1. f∘g∘h
This means f(g(h(x))). Start from the innermost function:
Step 1: Compute h(x)
h(x)=3x
Step 2: Compute g(h(x))=g(3x)
g(3x)=3x−2
Step 3: Compute f(g(h(x)))=f(3x−2)f(g(h(x))) = f(3x - 2)f(g(h(x)))=f(3x−2)
f(3x−2)=(3x−2)+2=3xf(3x - 2) = (3x - 2) + 2 = 3xf(3x−2)=(3x−2)+2=3x
So, f∘g∘h=3x.
2. g∘h∘f
This means g(h(f(x))). Start from the innermost function:
Step 1: Compute f(x)
f(x)=x+2
Step 2: Compute h(f(x))=h(x+2)
h(x+2)=3(x+2)=3x+6
Step 3: Compute g(h(f(x)))=g(3x+6)
g(3x+6)=(3x+6)−2=3x+4
So, g∘h∘f=3x+4.
3. h∘g∘f
This means h(g(f(x))). Start from the innermost function:
Step 1: Compute f(x)
f(x)=x+2
Step 2: Compute g(f(x))=g(x+2)
g(x+2)=(x+2)−2=x
Step 3: Compute h(g(f(x)))=h(x)
h(x)=3x
So, h∘g∘f=3x.
9. Define Algebraic structure and its properties.(or) What is an algebraic system? Write the
properties of an algebraic system.
 Ans: : Algebraic System: A set ‘A’ with one or more binary(closed) operations defined
on it is called an algebraic system.
An Algebraic System is denoted by: ⟨𝑆, 𝑓1, 𝑓2, …⟩, where S is a nonempty set and 𝑓1,
𝑓2, … are operations on S.
Ex: (N, + ),(Z, +, – ), (R, +, . , – ) are algebraic systems.
Since the operations on a set S define a structure on elements of S, an Algebraic System is
also called as an Algebraic Structure.
Properties:
Associativity: Let * be a binary operation on a set A.
The operation * is said to be associative in A if (a * b) * c = a *( b * c) for all a, b, c in A
Commutative: Let * be a binary operation on a set A.
The operation * is said to be commutative in A if a * b= b * a for all a, b in A
Identity: For an algebraic system (A, *), an element ‘e’ in A is said to be an identity
element of A if a * e = e * a = a for all a  A. For an algebraic system (A, *), the
identity element, if exists, is unique.
Inverse: Let (A, *) be an algebraic system with identity ‘e’. Let a be an element in A. An
element b is said to be inverse of A if a * b = b * a = e
Give examples also and elaborate

10. Prove that (Q+,*), where * is a binary operation defined by a*b = ab/5 is a group?
Ans: We need to prove that the set (Q+,∗) (the set of positive rational numbers with the binary
operation *) forms a group. The binary operation * is defined by a∗b=ab/5 for a,b∈Q+.
To show that (Q+,*) is a group, we need to verify the following four group properties:
1. Closure: ∀a,b∈Q+, a∗b∈Q+.
2. Associativity: ∀a,b,c∈Q+, a∗(b∗c)=(a∗b)∗c.
3. Identity Element: There exists an identity element e∈Q+ such that a∗e=e∗a=a for all
a∈Q+.
4. Inverse Element: For each a∈Q+, there exists an inverse a−1∈Q+ such that
a∗a−1=a−1∗a=e, where e is the identity element.
Closure: a∗b=ab/5.
Since a,b∈Q+ and the product of two positive rational numbers is a positive rational
number, ab/5 is also a positive rational number. Therefore, a∗b∈Q+, which shows that * is
closed on Q+.
Associativity:We need to show that a∗(b∗c)=(a∗b)∗c for all a,b,c∈Q+.
 First, compute a∗(b∗c):
b∗c=bc/5, so a∗(b∗c)=a∗bc/5=(a⋅bc/5)/5=abc/25.
 Now compute (a∗b)∗c:
a∗b=ab/5, so(a∗b)∗c=((ab/5)⋅c)/5=abc/25.
Since a∗(b∗c)=(a∗b)∗c=abc/25, the operation * is associative.
Identity Element: We need to find an element e∈Q+ such that a∗e=e∗a=a for all a∈Q+.
 Using the definition of *, we require: a∗e=ae/5=a.
 Solving for e, we get: ae/5=a ⟹ e=5.
Thus, the identity element is e=5
Inverse Element: For each a∈Q+, we need to find an inverse a−1∈Q such that a∗a−1=5.
−1 −1
 Using the definition of ∗, we require: a∗a =a⋅a /5=5.
−1 −1 −1 −1
 Solving for a , we get: a(a )5=5 ⟹ a⋅a =25 ⟹ a =25/a.
−1
Thus, the inverse of a is a =25/a , and we can verify that:
a∗a−1=(a⋅25/a)/5=25/5=5.
Therefore, a−1=25/a is the inverse of a.
As it satisfies all four properties it is a group.

11. What is an algebraic system? Write properties of (Q , ∗) where ∗ is a binary operation

+

defined by a∗b = a+b-5ab

Ans: Closure Property: A set is closed under an operation if applying the operation to any
two elements in the set results in another element from the set.
For a,b∈Q+:
a∗b=a+b−5ab
Since a,b are positive rational numbers, we need to check whether a+b−5ab is always positive
 If 5ab<a+b, then a∗b remains positive.
 This is not always true for all positive rational numbers.
 Counterexample: Let a=1, b=1.
a∗b=1+1−5(1)(1)=2−5=−3
Since the result is not always positive, the operation is not closed in Q+.
Thus, (Q+,∗) is not a valid algebraic structure because closure fails.
Identity Element: An identity element e satisfies:
a∗e=a∀a∈Q+
Substituting in the operation:
a+e−5ae=a
Simplifying:
e−5ae=0
e(1−5a)=0
For all a∈Q+, the only possible solution is e=0. However, 0 is not in Q+ (the set of positive
rational numbers).
Since no identity element exists in Q+, this structure cannot be a monoid or group.
Associativity: To check associativity, we verify whether:
(a∗b)∗c=a∗(b∗c)
Expanding both sides:
Left-Hand Side:(a∗b)∗c=(a+b−5ab)∗c
Applying the operation:
=(a+b−5ab)+c−5(a+b−5ab)c
=a+b+c−5ab−5ac−5bc+25abc
Right-Hand Side:
a∗(b∗c)=a∗(b+c−5bc)
Applying the operation:
=a+(b+c−5bc)−5a(b+c−5bc)
=a+b+c−5bc−5ab−5ac+25abc
Since both sides are equal, the operation is associative.
Inverse Element
For a to have an inverse a−1, it must satisfy:
a∗a−1=e
Since we already established that there is no identity element, an inverse cannot exist.
Even if we assume an identity element e, solving for a−1 in:
a+a−1−5aa−1=e
Would give:
a−1=e−a/(1−5a)
Since e does not exist in Q+, we cannot define an inverse.
Thus, (Q+,∗) is not a group.
12. If <G,∗> is an Abelian group then prove that (a∗b)n = an∗bn for all n ε N.
Ans: Let a and b be any two elements of G.
Suppose n, n+1 , n + e are three consecutive integers such that
(ab)n = an.bn …………….(1)
(ab)n+1 = an+1.bn+1 ………..(2)
(ab)n+2 = an+2. bn+2……………(3)
Equation (2) can also be written as,
(ab)(ab)n = a.an.b.bn
a.b.an.bn = a.an.b.bn
b.an = an.b [by cancellation law]
Equation (3) can also be written as,
(ab)(ab)n+1 = a.an+1.b.bn+1
a.b.an+1.bn+1 = a.an+1.b.bn+1
b.an+1 = an+1.b [by cancellation law]
b.an.a = an.a.b
an.b.a = an.a.b
⇒ ba = ab [by left cancellation law]
Therefore, G is an abelian group.