Assignment # 1
Functional English
Submitted by: Mahnoor Roll
No. : 23014119-010
“On my honor, as student of University of Gujrat, I have neither given nor received unauthorized
assistance on this academic work.”
Submitted to:
SIR ADEEL
Question # 1
Let A = {8, 9}, B = {3, 4, 5}, Define a binary relation R from A to B as follows:
R = {(a, b) ∈A × B | a > b} Then
Answer
a. Find the ordered pairs in R.
Let
A = {8, 9} and B = {3, 4, 5} as R = {(a, b) ∈A × B | a > b}
We get
{(8,3),(8,4),(8,5),(9,3),(9,4),(9,5)}
b. Find the Domain and Range of R.
Let
A = {8, 9} and B = {3, 4, 5} as R = {(a, b) ∈A × B | a > b}
We get
{(8,3),(8,4),(8,5),(9,3),(9,4),(9,5)}
Domain(R)={8,9}
c. Is 8R9, 4R3?
For 8R9
Since (8,9) is not present in R, 8R9 is false.
For 4R3
Since (4,3) is not present in R, 4R3 is false.
Question # 2
Let A = {1, 2, 3, 4} and define relations R1, R2 and R3 on A as
follows:
⦁ R1 = {(1, 1), (1, 2), (1, 3), (2, 3)}
⦁ R2 = {(1, 2), (1, 4), (2, 3), (3, 4)}
⦁ R3 = {(2, 1), (2, 4), (2, 3), (3,4)}
Determine whether R1, R2 and R3 are equivalence relation or
not?
Answer
To check whether R1, R2 and R3 are equivalence relations, we
need to check if they satisfy the properties of reflexivity,
symmetry, and transitivity.
Reflexivity: Every element relates to itself. (a, a) ∈ R for all a in
A.
Symmetry: If (a, b) ∈ R, then (b, a) ∈ R .
Transitivity: If (a, b) ∈ R and (b, c) ∈ R, then (a, c) ∈ R .
Reflexivity
For R1
Since (2, 2), (3, 3), and (4, 4) are missing. Reflexivity is
not satisfied.
For R2
Since (1, 1), (2, 2), (3, 3), and (4, 4) are missing.
Reflexivity is not satisfied.
For R3
Since (1, 1), (3, 3), and (4, 4) are missing. Reflexivity is
not satisfied.
Symmetry
For R1
Since (1, 2) is in R1 but (2, 1) is not. Symmetry is not
satisfied.
For R2
Since For each ordered pair in R2, the reverse is also
present. Symmetry is satisfied.
For R3
Since (2, 1) is in R3 but (1, 2) is not. Symmetry is not
satisfied.
Transitivity
For R1
Satisfied. Since R1 has very few elements, we can check
all combinations and see that transitivity holds.
For R2
Satisfied. We can check all combinations and see that
transitivity holds.
For R3
Satisfied. We can check all combinations and see
that transitivity holds.
Conclusion
R1 is not an equivalence relation because it fails
reflexivity and symmetry.
R2 is not an equivalence relation because it fails
reflexivity.
R3 is not an equivalence relation because it fails
reflexivity and symmetry.
Question # 3
Prove/disapprove the following using Membership Table:
(i) (A – B) -A = A ∩ B
(ii) (A ∪ B) ' = A' ∩ B'
(iii) A – B = A' ∩ B
Answer
(i) (A – B) -A = A ∩ B
L.H.S.
A B A-B (A-B)-A
0 0 0 0
0 1 0 0
1 0 1 0
1 1 0 0
R.H.S
A B A∩B
0 0 0
0 1 0
1 0 0
1 1 1
Since both tables are not equal. We can disapprove (A –
B) -A = A ∩ B.
(ii) (A ∪ B) ' = A' ∩ B'
L.H.S
A B A∪B (A ∪ B) '
0 0 0 1
0 1 1 0
1 0 1 0
1 1 1 0
R.H.S
A B A' B'' A' ∩ B'
0 0 1 1 1
0 1 1 0 0
1 0 0 1 0
1 1 0 0 0
Since both tables not equal. We can prove (A ∪ B) ' = A' ∩
B'
(iii) A – B = A' ∩ B
L.H.S
A B A-B
0 0 0
0 1 0
1 0 1
1 1 0
R.H.S
A B A' A' ∩ B
0 0 1 0
0 1 1 1
1 0 0 0
1 1 0 0
Since both tables are not equal. We can disapprove A – B
= A' ∩ B
