Documente Academic
Documente Profesional
Documente Cultură
www.nammakalvi.in
12. Discrete Mathematics (iv) 𝑚 + 𝑒 = 𝑒 + 𝑚 = 𝑚 ⇒ e = 0.
Thus ∃ 0 ∈ ℤ, ⋺ (𝑚 + 0) = (0 + 𝑚) = 𝑚.
Example12.1
Examine the binary operation (closure Hence the existence of identity is assured.
property) of the following operations on the
(v) 𝑚 + 𝑚/ = 𝑚/ + 𝑚 = 0 ⇒ m/ = −𝑚.
respective sets (if it is not, make it binary):
(i) 𝑎 ∗ 𝑏 = 𝑎 + 3𝑎𝑏 − 5𝑏2 ; ∀ 𝑎, 𝑏 ∈ ℤ Thus ∀ 𝑚 ∈ ℤ, ∃ − 𝑚 ∈ ℤ,
𝑎−1
(ii) 𝑎 ∗ 𝑏 = (𝑏 − 1) ; ∀ 𝑎, 𝑏 ∈ ℚ ⋺ m+ (−𝑚) = (−𝑚) + 𝑚 = 0. Hence, the
Solution:
existence of inverse property is also
(i) Since × is binary operation on ℤ,
assured. Thus we see that the usual
2
𝑎, 𝑏 ∈ ℤ ⇒ 𝑎𝑏 ∈ ℤ and b ×b = 𝑏 ∈ ℤ ... (1)
addition + on ℤ satisfies all the above five
The fact that + is binary operation on ℤ
properties.
and (1) ⇒ 3ab = (ab + ab + ab) ∈ ℤ and
Note that the additive identity is 0 and the
2 2 2 2 2 2
5 𝑏 = (𝑏 + 𝑏 + 𝑏 + 𝑏 + 𝑏 ) ∈ ℤ. .... (2)
additive inverse of any integer m is −𝑚.
Also a ∈ ℤ and 3ab ∈ ℤ implies 𝑎 + 3𝑎𝑏 ∈ ℤ. …..(3) ………………………………………………………………………
(2), (3), the closure property of − on ℤ yield Example 12.3
Verify the (i) closure property,
𝑎 ∗ 𝑏 = 𝑎 + 3𝑎𝑏 − 5𝑏2 ; ∀ 𝑎, 𝑏 ∈ ℤ . (ii) commutative property,
Since 𝑎 ∗ 𝑏 belongs to ℤ, * is a binary operation (iii) associative property
(iv) existence of identity and
on ℤ . (v)existence of inverse for the arithmetic
(ii) In this problem a ∗b is in the quotient form. operation − 𝑜𝑛 ℤ
Solution:
Since the division by 0 is undefined, the
(i) Though − is not binary on ℕ; it is binary on
denominator b −1must be nonzero.
ℤ . To check the validity of any more
It is clear that b −1 = 0 if b =1. As 1∈ ℚ, ∗ is
properties satisfied by – on ℤ , it is better to
not a binary operation on the whole of ℚ.
check them for some particular simple values.
However it can be found that by omitting 1
(ii) Take m = 4, n = 5 and
from ℚ, the output a ∗b exists in ℚ \{1}.
(m − n) = (4 − 5) = −1and
Hence ∗ is a binary operation on ℚ \{1}.
……………………………………………………………………… (n −m) = (5 − 4) =1.
Example 12.2 Hence (m − n) ≠ (n −m). So the operation − is
Verify the (i) closure property,
(ii) commutative property, not commutative on ℤ.
(iii) associative property (iii) In order to check the associative property,
(iv) existence of identity and
(v) existence of inverse for the arithmetic let us put m = 4, n = 5 and p = 7 in both
operation + on ℤ (m − n) − p and m − (n − p) .
Solution:
(m −n)− p = (4 −5)−7=(−1−7)=−8 …(1)
(i) m + n_∈ ℤ , ∀ 𝑚, 𝑛 ∈ ℤ.
m −(n − p)= 4 −(5 −7)=(4+2)=6 . … (2)
Hence + is a binary operation on ℤ .
From (1) and (2), it follows that
(ii) Also m+ n = n + m,_ ∀ 𝑚, 𝑛 ∈ ℤ.
(m − n) − p ≠ m − (n − p).
So the commutative property is satisfied
Hence – is not associative on ℤ .
(iii) ∀ 𝑚, 𝑛, 𝑝 ∈ ℤ , 𝑚 + (𝑛 + 𝑝) = (𝑚 + 𝑛) + 𝑝 .
(iv) Identity does not exist
Hence the associative property is satisfied.
www.nammakalvi.in
(v) So, Inverse does not exist . Thus ∀ 𝑥 ∈ ℤ𝑒 , ∃ − 𝑥 ∈ ℤ𝑒 ,
……………………………………………………………………… ⋺ 𝑥 + (−𝑥 ) = (−𝑥 ) + 𝑥 = 0
Example 12.4 Hence −𝑥 is the inverse of 𝑥 ∈ ℤ𝑒 .
Verify the (i) closure property, ………………………………………………………………………
(ii) commutative property, Example 12.5
(iii) associative property Verify the (i) closure property,
(iv) existence of identity and (ii) commutative property,
(v) existence of inverse for the arithmetic (iii) associative property
operation + on ℤ𝑒 = the set of all even integers. (iv) existence of identity and
(v) existence of inverse for the arithmetic
Solution : Consider the set of all even integers
operation + on ℤ0 = the set of all odd integers
ℤ𝑒 = {2k | k ∈ ℤ} = {...,−6,−4,−2,0,2,4,6,...}. Solution:
Let us verify the properties satisfied by + on ℤ𝑒 Consider the set ℤ0 of all odd integers
(i) The sum of any two even integers is also an ℤ0 = {2k +1: k ∈ ℤ }
even integer. Because 𝑥, 𝑦 ∈ ℤ𝑒 ⇒ 𝑥 = 2𝑚 = {..., −5, −3, −1, 1, 3, 5,}. + is not a
and y = 2n , 𝑚, 𝑛 ∈ ℤ . binary operation on ℤ0 because when
So (𝑥 + 𝑦) = 2𝑚 + 2𝑛 𝑥 = 2𝑚 + 1, 𝑦 = 2𝑛 + 1, 𝑥 + 𝑦 = 2(𝑚 + 𝑛) + 2
= 2(𝑚 + 𝑛) ∈ ℤ𝑒 is even for all m and n. For instance, consider
= 2(𝑛 + 𝑚 ) the two odd numbers 3, 7∈ ℤ0 .
= 2𝑛 + 2𝑚 Their sum 3+ 7 =10 is an even number. In
= (𝑦 + 𝑥 ). general, if x, y ∈ ℤ0 , (𝑥 + 𝑦) ∉ ℤ0 . Other
Hence + is a binary operation on ℤ𝑒 . properties need not be checked as it is not a
(ii) ∀ 𝑥, 𝑦 ∈ ℤ𝑒 , binary operation.
(𝑥 + 𝑦) = 2𝑚 + 2𝑛 ………………………………………………………………………
= 2(𝑚 + 𝑛 ) Example 12.6
Verify (i) closure property
= 2(𝑛 + 𝑚 ) (ii) commutative property, and
= 2𝑛 + 2𝑚 (iii) associative property of the following
operation on the given set.
= (𝑦 + 𝑥 ). (𝑎 ∗ 𝑏) = 𝑎𝑏 ; ∀ 𝑎, 𝑏 ∈ ℕ (exponentiation
So + has commutative property. property)
Solution :
(iii) Similarly it can be seen that ∀ 𝑥, 𝑦, 𝑧 ∈ ℤ𝑒 ,
(i) It is true that 𝑎 ∗ 𝑏 = 𝑎𝑏 ; ∀ 𝑎, 𝑏 ∈ ℕ.
(x + y) + z = x + ( y + z) .
So ∗ is a binary operation on ℕ .
Hence the associative property is true.
(ii) 𝑎 ∗ 𝑏 = 𝑎𝑏 and 𝑏 ∗ 𝑎 = 𝑏𝑎 .
(iv) Now take 𝑥 = 2𝑘, then
Put, 𝑎 = 2 and 𝑏 = 3.
2𝑘 + 𝑒 = 𝑒 + 2𝑘 = 2𝑘 ⇒ 𝑒 = 0 .
Then 𝑎 ∗ 𝑏 = 23 = 8 but
Thus ∀ 𝑥 ∈ ℤ𝑒 , ∃ 0 ℤ𝑒 ⋺ 𝑥 + 0 = 0 + 𝑥 = 𝑥.
𝑏 ∗ 𝑎 = 32 = 9
So, 0 is the identity element.
So a ∗b need not be equal to b ∗ a.
(v) Taking 𝑥 = 2𝑘 and 𝑥 / as its inverse,
Hence ∗ does not have commutative property.
we have 2𝑘 + 𝑥 / = 0 = 𝑥 / + 2𝑘
(iii) Next consider
⇒ 𝑥 / = −2k = 𝑥 / = −𝑥 𝑐
𝑎 ∗ (𝑏 ∗ 𝑐 ) = 𝑎 ∗ (𝑏𝑐 ) = 𝑎(𝑏 ) .
Take Put, 𝑎 = 2. 𝑏 = 3 and 𝑐 = 4. identity element and hence the existence of
𝑎 ∗ (𝑏 ∗ 𝑐 ) = 2 ∗ (3 ∗ 4) = 2 ∗ (34 ) = 2(81) identity is assured.
But (𝑎 ∗ 𝑏) ∗ 𝑐 = (𝑎𝑏 ) ∗ 𝑐 = (𝑎𝑏 )𝑐 = 𝑎𝑏𝑐 = 212 (v) An integer 𝑚/ is to be found that
Hence 𝑎 ∗ (𝑏 ∗ 𝑐 ) ≠ (𝑎 ∗ 𝑏) ∗ 𝑐. 𝑚 ∗ 𝑚/ = 𝑚/ ∗ 𝑚 = 𝑒, ∀ 𝑚 ∈ ℤ
So ∗ does not have associative property on ℕ . So, 𝑚 ∗ 𝑚/ = 𝑚 + 𝑚/ − 𝑚𝑚/ = 0
………………………………………………………………………
Example 12.7 𝑚/ − 𝑚𝑚/ = −𝑚
Verify (i) closure property, 𝑚/ (1 − 𝑚) = −𝑚
(ii) commutative property, 𝑚
(iii) associative property, 𝑚/ = − (1−𝑚) is not defined at
(iv) existence of identity, and
(1 − 𝑚) = 0, that is at 𝑚 = 1
(v) existence of inverse for following operation
on the given set. 𝑚 ∗ 𝑛 = 𝑚 + 𝑛 − 𝑚𝑛 ; 𝑚, 𝑛 ∈ ℤ Hence inverse does not exist in ℤ.
Solution:
………………………………………………………………………
(i) 𝑚 + 𝑛 − 𝑚𝑛 is clearly an integer and hence Example 12.8
∗ is a binary operation on ℤ. 0 1 1 1
Let 𝐴 = [ ],𝐵 = [ ] be any two
1 1 0 1
(ii) 𝑚 ∗ 𝑛 = 𝑚 + 𝑛 − 𝑚𝑛 and
Boolean matrices of the same type. Find 𝐴 ∨ 𝐵
= 𝑛 + 𝑚 − 𝑛𝑚
and 𝐴 ∧ 𝐵
= 𝑛∗𝑚
Solution:
So, ∗ has commutative property .
0 1 1 1
(iii) Consider (𝑚 ∗ 𝑛) ∗ 𝑝 = (𝑚 + 𝑛 − 𝑚𝑛) ∗ 𝑝 Given 𝐴 = [ ],𝐵 = [ ]
1 1 0 1
= (𝑚 + 𝑛 − 𝑚𝑛) + 𝑝 − (𝑚 + 𝑛 − 𝑚𝑛)𝑝 0 1 1 1
𝐴∨𝐵 = [ ]∨[ ]
= 𝑚 + 𝑛 + 𝑝 − 𝑚𝑛 − 𝑚𝑝 − 𝑛𝑝 + 𝑚𝑛𝑝…(1) 1 1 0 1
0∨1 1∨1
𝑚 ∗ (𝑛 ∗ 𝑝) = 𝑚 ∗ (𝑛 + 𝑝 − 𝑛𝑝) = [ ]
1∨0 1∨1
= 𝑚 + (𝑛 + 𝑝 − 𝑛𝑝) − 𝑚(𝑛 + 𝑝 − 𝑛𝑝) 1 1
=[ ]
1 1
= 𝑚 + 𝑛 + 𝑝 − 𝑛𝑝 − 𝑚𝑛 − 𝑚𝑝 + 𝑚𝑛𝑝…(2)
0 1 1 1
From (1) and (2) we see that, 𝐴∧𝐵 = [ ]∧[ ]
1 1 0 1
(𝑚 ∗ 𝑛 ) ∗ 𝑝 = 𝑚 ∗ (𝑛 ∗ 𝑝 ) 0∧1 1∧1
= [ ]
1∧0 1∧1
So, ∗ has associative property .
0 1
(iv) An integer 𝑒 is to be found that =[ ]
0 1
𝑚 ∗ 𝑒 = 𝑒 ∗ 𝑚 = 𝑚, ∀ 𝑚 ∈ ℤ ………………………………………………………………………
Example 12.9
So, 𝑚 ∗ 𝑒 = 𝑚 + 𝑒 − 𝑚𝑒 = 𝑚
Verify (i) closure property,
𝑒 − 𝑚𝑒 = 𝑚 − 𝑚
(ii) commutative property,
𝑒 (1 − 𝑚 ) = 0
(iii) associative property,
Gives, 𝑒 = 0 𝑎𝑛𝑑 (1 − 𝑚) = 0
(iv) existence of identity, and
But m is an arbitrary integer and hence need
(v) existence of inverse for the operation +5 on
not be equal to 1. So the only possibility is
ℤ5 using table corresponding to addition
𝑒 = 0. Also 𝑚 ∗ 0 = 0 ∗ 𝑚 = 𝑚. Hence 0 is the
modulo 5.
www.nammakalvi.in
Solution: Example 12.10 Verify (i) closure property,
We know that ℤ5 = {[0], [1], [2], [3], [4]} (ii) commutative property,
+5 0 1 2 3 4 (iii) associative property,
0 0 1 2 3 4 (iv) existence of identity, and
1 1 2 3 4 0 (v) existence of inverse for the operation ×11
2 2 3 4 0 1 on a subset A ={1,3,4,5,9} of the set of
3 3 4 0 1 2 remainders {0,1,2,3,4,5,6,7,8,9,10}.
4 4 0 1 2 3 Solution:
(i) Since each box in the table is filled by Given 𝐴 = {[1], [3], [4], [5], [9]}
exactly one element of +5 , the output 𝑎 +5 𝑏 is ×11 1 3 4 5 9
unique and hence +5 is a binary operation. 1 1 3 4 5 9
(ii) The entries are symmetrically placed with 3 3 9 1 4 5
respect to the main diagonal. So +5 has 4 4 1 5 9 3
commutative property. 5 5 4 9 3 1
(iii) The table cannot be used directly for the 9 9 5 3 1 4
verification of the associative property. So it is (i) Since each box in the table is filled by
to be verified as usual. exactly one element of ×11 , the output 𝑎 ×11 𝑏
For instance, (2 +5 3) +5 4 = 0 +5 4 = 4 (mod 5) is unique and hence ×11 is a binary operation.
and 2 +5 (3 +5 4) = 2+5 2 = 4 (mod 5) (ii) The entries are symmetrically placed with
Hence (2 +5 3) +5 4 = 2 +5 (3 +5 4). respect to the main diagonal. So ×11 has
Proceeding like this one can verify this for all commutative property.
possible triples and ultimately it can be shown (iii) The table cannot be used directly for the
provided the identity 0 exists in each row and Hence (3 ×11 4) ×11 5 = 3 ×11 (4 ×11 5).
each column. Proceeding like this one can verify this for all
Inverse of 3 is 2 element is 1.
Inverse of 4 is 1
………………………………………………………………………
(v) The existence of inverse is guaranteed Solution:
provided the identity 1 exists in each row Let m, 𝑛 ∈ ℤ.
and each column. From the table, Take 𝑚 = 3, 𝑛 = −2, then
Inverse of 1 is 1 𝑚𝑛 + 𝑛𝑚 = 3−2 + (−3)2
1
Inverse of 3 is 4 = 32 + 9
Inverse of 4 is 3 1
=9+9
Inverse of 5 is 9
1+81
Inverse of 9 is 5 = 9
82
……………………………………………………………………… = ∉ℤ
9
EXERCISE 12.1 So, (𝑚 ⊗ 𝑛) ≠ ℤ
1. Determine whether ∗ is a binary
operation on the sets given below Hence, ⊗ is not a binary operation on ℤ .
(i) 𝑎 ∗ 𝑏 = 𝑎. |𝑏| 𝑜𝑛 ℝ ………………………………………………………………………
(ii) 𝑎 ∗ 𝑏 = min(𝑎, 𝑏) 𝑜𝑛 𝐴 = {1,2,3, 4,5} 3. Let ∗ be defined on ℝ by
(iii) (𝑎 ∗ 𝑏) = 𝑎 √𝑏 𝑖𝑠 𝑏𝑖𝑛𝑎𝑟𝑦 𝑜𝑛 ℝ . (𝑎 ∗ 𝑏) = 𝑎 + 𝑏 + 𝑎𝑏 − 7 . Is ∗ binary on ℝ ?
−7
If so, find 3 ∗ ( 15 ) .
Solution: Solution:
(i) Let 𝑎, 𝑏 ∈ ℝ Let 𝑎, 𝑏 ∈ ℝ
Then |𝑏| ∈ ℝ Then 𝑎 + 𝑏 + 𝑎𝑏 − 7 ∈ ℝ
Hence, 𝑎. |𝑏| ∈ ℝ , ∀ 𝑎, 𝑏 ∈ ℝ So, ∗ is the binary operation on ℝ.
So, ∗ is the binary operation on ℝ. −7 7 7
3 ∗ ( 15 ) = 3 + (− 15) + 3 (− 15) − 7
(ii) 𝑎 ∗ 𝑏 = min(𝑎, 𝑏) 𝑜𝑛 𝐴 = {1, 2, 3, 4, 5} 7 21
=3− − −7
Let 𝑎, 𝑏 ∈ 𝐴 15 15
28
Then min(𝑎, 𝑏) ∈ 𝐴 = −4 − 15
For Example, −60−28
= 15
min(3, 4) = 3 ∈ 𝐴, 88
= − 15
min(2, 5) = 2 ∈ 𝐴
………………………………………………………………………
So, 𝑎 ∗ 𝑏 = min(𝑎, 𝑏) ∈ 𝐴 , ∀ 𝑎, 𝑏 ∈ 𝐴 4. Let A = {𝑎 + √5𝑏 ∶ 𝑎, 𝑏 ∈ ℤ } . Check
So, ∗ is the binary operation on 𝐴. whether
the usual multiplication is a binary operation
(iii) (𝑎 ∗ 𝑏) = 𝑎√𝑏 𝑖𝑠 𝑏𝑖𝑛𝑎𝑟𝑦 𝑜𝑛 ℝ on A .
Let 𝑎, 𝑏 ∈ ℝ Solution:
If b is positive then √𝑏 ∈ ℝ, but even Let A = {𝑥, 𝑦 }
Examine the existence of identity and the (2) Since there is no identity, inverse of 𝑎 that
existence of inverse for the operation ∗ on ℚ. is 𝑎 −1 cannot be defined. That is,
Solution: (i) 𝑎 ∗ 𝑎−1 = 𝑎−1 ∗ 𝑎 = 𝑒, cannot be defined.
(1) Given 𝑎, 𝑏 ∈ ℚ Hence ∗ has no inverse.
………………………………………………………………………
It gives 𝑎 + 𝑏 ∈ ℚ. 6. Fill in the following table so that the
𝑎+𝑏
Hence also ∈ ℚ. binary operation ∗ on A = {a, b, c} is
2
(ii) c a a c
(1) Given 𝑎 ∈ ℚ. Let 𝑒 be the identity.
………………………………………………………………………
Then 𝑎 ∗ 𝑒 = 𝑒 ∗ 𝑎 = 𝑎
www.nammakalvi.in
7. Consider the binary operation ∗ defined on 1 1 1 1
the set A = {a, b, c, d} by the following table: = (1 1 1 1)
1 0 0 1
∗ a b c d 1 0 1 0 0 1 0 1
(ii) 𝐴 ∧ 𝐵 = (0 1 0 1) ∧ ( 1 0 1 0)
a a c b d 1 0 0 1 1 0 0 1
1∧0 0∧1 1∧0 0∧1
b d a b c = (0 ∧ 1 1∧0 0∧1 1 ∧ 0)
1∧1 0∧0 0∧0 1∧1
c c d a a
0 0 0 0
d d b a c = (0 0 0 0)
1 0 0 1
Is it commutative and associative? (iii)(𝐴 ∨ 𝐵 ) ∧ 𝐶
Solution: 1 1 1 1 1 1 0 1
= (1 1 1 1) ∧ (0 1 1 0)
From table 𝑎 ∗ 𝑏 = 𝑐 1 0 0 1 1 1 1 1
and 𝑏∗𝑎 =𝑑 1∧1 1∧1 1∧0 1∧1
= (1 ∧ 0 1∧1 1∧1 1 ∧ 0)
So, 𝑎 ∗ 𝑏 ≠ 𝑏 ∗ 𝑎 1∧1 0∧1 0∧1 1∧1
From table 𝑐 ∗ 𝑎 = 𝑐 1 1 0 1
= (0 1 1 0)
and 𝑎∗𝑐 = 𝑏
1 0 0 1
So, 𝑐 ∗ 𝑎 ≠ 𝑎 ∗ 𝑐
(iv) (𝐴 ∧ 𝐵 ) ∨ 𝐶
Hence, ∗ is not commutative 0 0 0 0 1 1 0 1
From table 𝑎 ∗ (𝑏 ∗ 𝑐 ) = 𝑎 ∗ 𝑏 = 𝑐 and = (0 0 0 0) ∨ (0 1 1 0)
1 0 0 1 1 1 1 1
(𝑎 ∗ 𝑏 ) ∗ 𝑐 = 𝑐 ∗ 𝑐 = 𝑎
0∨1 0∨1 0∨0 0∨1
Therefore, 𝑎 ∗ (𝑏 ∗ 𝑐 ) ≠ (𝑎 ∗ 𝑏) ∗ 𝑐 = (0 ∨ 0 0∨1 0∨1 0 ∨ 0)
1∨1 0∨1 0∨1 1∨1
Hence, ∗ is also not associative.
……………………………………………………………………… 1 1 0 1
1 0 1 0 0 1 0 1 = (0 1 1 0)
8. Let A =(0 1 0 1), B = (1 0 1 0), 1 1 1 1
1 0 0 1 1 0 0 1 ………………………………………………………………………
1 1 0 1 𝑥 𝑥
9. (i) Let 𝑀 = {( ) : 𝑥 ∈ 𝑅 − (0) } and
C = (0 1 1 0) be any three Boolean 𝑥 𝑥
let ∗ be the matrix multiplication. Determine
1 1 1 1
whether M is closed under ∗. If so, examine
matrices of the same type. the commutative and associative properties
Find (i) 𝐴 ∨ 𝐵 (ii) 𝐴 ∧ 𝐵 satisfied by ∗ on M .
𝑥 𝑥
(ii) Let 𝑀 = {( ) : 𝑥 ∈ 𝑅 − (0) } and
(iii) (𝐴 ∨ 𝐵 ) ∧ 𝐶 (iv) (𝐴 ∧ 𝐵 ) ∨ 𝐶. 𝑥 𝑥
let ∗ be the matrix multiplication. Determine
Solution: whether M is closed under ∗ . If so, examine
1 0 1 0 0 1 0 1 the existence of identity, existence of inverse
Given A =(0 1 0 1), B = (1 0 1 0) properties for the operation ∗ on M .
1 0 0 1 1 0 0 1 Solution: (i)
1 0 1 0 0 1 0 1
(i) 𝐴 ∨ 𝐵 = (0 1 0 1) ∨ (1 0 1 0) (1) Closure
1 0 0 1 1 0 0 1 𝑥 𝑥 𝑦 𝑦
Let 𝐴 = ( ) and 𝐵 = (𝑦 𝑦) : 𝑥, 𝑦 ∈ 𝑅 − (0)
1∨0 0∨1 1∨0 0∨1 𝑥 𝑥
= (0 ∨ 1 1 ∨ 0 0 ∨ 1 1 ∨ 0) Hence 𝑀 = {𝐴, 𝐵 }
1∨1 0∨0 0∨0 1∨1
𝑥 𝑥 𝑦 𝑦 ∴ ∗ is closed on M
Now, 𝐴𝐵 = ( )( )
𝑥 𝑥 𝑦 𝑦
(2) Existence of Identity
𝑥𝑦 + 𝑥𝑦 𝑥𝑦 + 𝑥𝑦
= (𝑥𝑦 + 𝑥𝑦 𝑥𝑦 + 𝑥𝑦
) 𝑥 𝑥
Let 𝐴 = ( ) and
2𝑥𝑦 2𝑥𝑦
𝑥 𝑥
=( )∈𝑀 𝑒 𝑒
2𝑥𝑦 2𝑥𝑦 𝐸=( ) be the identity,
𝑒 𝑒
Since, 𝑥, 𝑦 ∈ 𝑅 − (0) gives 𝑥𝑦 𝑎𝑙𝑠𝑜 ∈ 𝑅 − (0)
such that : 𝑎, 𝑒 ∈ 𝑅 − (0)
So, 𝐴𝐵 ∈ 𝑀 ⟹ 𝐴 ∗ 𝐵 ∈ 𝑀
Hence 𝑀 = {𝐴, 𝐸 }
∴ ∗ is closed on M
Now, 𝐴 ∗ 𝐸 = 𝐸 ∗ 𝐴 = 𝐴
(2) Commutative 𝑥 𝑥 𝑒 𝑒 𝑥 𝑥
𝑦 𝑦 ( )( )=( )
𝑥 𝑥 𝑥 𝑥 𝑒 𝑒 𝑥 𝑥
Let 𝐴 = ( ) , 𝐵 = (𝑦 𝑦)
𝑥 𝑥 2𝑥𝑒 2𝑥𝑒 𝑥 𝑥
( )=( )
such that : 𝑥, 𝑦 ∈ 𝑅 − (0) 2𝑥𝑒 2𝑥𝑒 𝑥 𝑥
(6) How beautiful this flower is! and(iv) contra positive statement for the two
It is expressing wishes. So it is not a statement. Then the four types of conditional statements
(9) This is the beginning of the end. corresponding to p and q are respectively
7. Verify whether the following compound (p →r) ((p →q) ⋀ (q →r)) → (p →r)
propositions are tautologies or
contradictions or contingency T T
(i) ( p ⋀q) ⋀¬( p ∨q) F T
p q p ⋀q p ∨q ¬( p ∨q) ( p ⋀q) ⋀¬( p ∨q)
T T
T T T T F F
F T
T F F T F F
T T
F T F T F F
T T
F F F F T F
T T
The last column contains only F. Hence it is
T T
contradiction.
The last column contains only T. Hence it is
(ii) (( p ∨q) ⋀¬p) →q tautology.
………………………………………………………………………
p q p ∨q ¬p ( p ∨q) ⋀¬p (( p ∨q) ⋀¬p) →q
8. Show that
T T T F F T (i) ¬( p ⋀q) ≡¬p ∨¬q
p q p ⋀q ¬( p ⋀q) ¬p ¬q ¬p ∨¬q
T F T F F T
T T T F F F F
F T T T T T
T F F T F T T
F F F T F T
F T F T T F T
The last column contains only T. Hence it is
tautology. F F F T T T T
From column (4) and (7), it is proved that
(iii) ( p →q) ↔ (¬p →q)
¬( p ⋀q) ≡¬p ∨¬q
(ii) ¬( p →q) ≡ p ⋀¬q . 12. Check whether the statement p → (q → p) is
p q p →q ¬( p →q) ¬q p ⋀¬q a tautology or a contradiction without
T T T F F F using the truth table.
T F F T T T Solution:
F T T F F F p → (q → p) ≡ 𝑝 → (¬𝑞 ∨ 𝑝)
F F T F T F ≡ ¬ 𝑝 ∨ (¬𝑞 ∨ 𝑝)
From column (4) and (6), it is proved that ≡ ¬ 𝑝 ∨ (𝑝 ∨ ¬𝑞 )
¬( p →q) ≡ p ⋀¬q . ≡ (¬ 𝑝 ∨ 𝑝) ∨ ¬𝑞
……………………………………………………………………… ≡ 𝑇 ∨ ¬𝑞
≡ 𝑇
9. Prove that q → p ≡¬p →¬q
p q q →p ¬ p ¬q ¬p →¬q Hence, p → (q → p) is a tautology.
………………………………………………………………………
T T T F F T
13. Using truth table check whether the
T F T F T T
statements ¬ (p ∨q) ∨ (¬p ⋀q) and ¬p are
F T F T F F
logically equivalent.
F F T T T T
p q p ∨q ¬ (p ∨q) ¬p ¬ p ⋀q ¬ (p ∨q) ∨ (¬p ⋀q)
From column (3) and (6), it is proved that
T T T F F F F
q → p ≡¬p →¬q
……………………………………………………………………... T F T F F F F
10. Show that p →q and q → p are not
F T T F T T T
equivalent
p q p →q q→p F F F T T F T
T T T T
From column (5) and (7), it is proved that
T F F T
¬p ≡¬ (p ∨q) ∨ (¬p ⋀q).
F T T F
………………………………………………………………………
F F T T
14. Prove p → (q →r) ≡ (p ⋀q) →r without
p →q and q → p are not equivalent.
……………………………………………………………………… using truth table.
11. Show that ¬ (p ↔q) ≡ p ↔¬q
Solution:
p q p ↔q ¬ (p ↔q) ¬q p ↔¬q
p → (q → r) ≡ 𝑝 → (¬𝑞 ∨ 𝑟)
T T T F F F
T F F T T T ≡ ¬ 𝑝 ∨ (¬𝑞 ∨ 𝑟)
F T F T F T
≡ (¬ 𝑝 ∨ ¬ 𝑞 ) ∨ 𝑟
F F T F T F
≡ ¬( 𝑝 ⋀ 𝑞 ) ∨ 𝑟
From column (4) and (6), it is proved that
¬ (p ↔q) ≡ p ↔¬q. ≡ (p ⋀q) →r Hence proved.
………………………………………………………………………
………………………………………………………………………
www.nammakalvi.in
15. Prove that p → (¬q ∨r) ≡¬p ∨ (¬q ∨r) 4. In the set ℝ of real numbers ‘*’ is defined as
follows. Which one of the following is
using truth table.
not a binary operation on ℝ ?
LHS : p → (¬q ∨r) (1) 𝑎 ∗ 𝑏 = min(𝑎, 𝑏) (2) 𝑎 ∗ 𝑏 = max(𝑎, 𝑏)
(3) 𝑎 ∗ 𝑏 = 𝑎 (4) 𝒂 ∗ 𝒃 = 𝒂𝒃
p q r ¬q (¬q ∨r) p → (¬q ∨r)
T T T F T T 𝑎𝑏
5. The operation * defined by 𝑎 ∗ 𝑏 = 7 is
T T F F F F not a binary operation on
(1) ℚ+ (2) ℤ (3) ℝ (4) ℂ
T F T T T T
T F F T T T 6. In the set ℚ define ⨀𝑏 = 𝑎 + 𝑏 + 𝑎𝑏 .
For what value of y, 3 ⨀ (y ⨀ 5) = 7?
F T T F T T 2 −𝟐
(1) 𝑦 = (2) 𝒚 =
F T F F F T 3 𝟑
−3
(3) 𝑦 = (4) 𝑦 = 4
F F T T T T 2
F F F T T T
7. If 𝑎 ∗ 𝑏 = √𝑎2 + 𝑏2 on the real numbers
then * is
RHS : ¬p ∨ (¬q ∨r)
(1) commutative but not associative
p q r ¬q (¬q ∨r) ¬p ¬p ∨ (¬q ∨r)
(2) associative but not commutative
T T T F T F T
(3) both commutative and associative
T T F F F F F
(4) neither commutative nor associative
T F T T T F T
T F F T T F T 8. Which one of the following statements has
F T T F T T T the truth value T ?
F T F F F T T (1) sin 𝑥 is an even function.
F F T T T T T (2) Every square matrix is non-singular
F F F T T T T (3) The product of complex number and its
From the above tables, the last columns are conjugate is purely imaginary
identical. Hence p → (¬q ∨r) ≡¬p ∨ (¬q ∨r).
……………………………………………………………………… (4) √𝟓 is an irrational number
EXERCISE 12.3
Choose the correct or the most suitable answer 9. Which one of the following statements has
from the given four alternatives.
truth value F ?
1. A binary operation on a set 𝑆 is a function (1) Chennai is in India or √2 is an integer
from
(1) S →S (2) (S ×S) →S (2) Chennai is in India or √2 is an irrational
(3) S → (S×S) (4)(S×S) → (S×S) number
2. Subtraction is not a binary operation in (3) Chennai is in China or √𝟐 is an integer
(1) ℝ (2) ℤ (3) ℕ (4) ℚ
(4) Chennai is in China or √2 is an irrational
3. Which one of the following is a binary number
operation on ℕ ?
(1) Subtraction (2) Multiplication
(3) Division (4) All the above
10. If a compound statement involves 3 simple 17. The dual of ¬ ( p ∨q) ∨ [ p ∨ ( p ∧¬r)] is
statements, then the number of rows in (1) ¬ ( p ∧q) ∧ [ p ∨ ( p ∧¬r)]
the truth table is (2) ( p ∧q) ∧ [ p ∧ ( p ∨ ¬r)]
(1) 9 (2) 8 (3) 6 (4) 3 (3) ¬ ( p ∧q) ∧ [ p ∧ ( p ∧ r)]
(4) ¬ ( p ∧q) ∧ [ p ∧ ( p ∨¬r)]
11. Which one is the inverse of the statement
(𝑝 ∨ 𝑞 ) → (𝑝 ∧ 𝑞 )? 18. The proposition p ∧ (¬p ∨q) is
(1) (𝑝 ∧ 𝑞 ) → (𝑝 ∨ 𝑞 ) (1) a tautology
(2) ¬ (𝑝 ∨ 𝑞 ) → (𝑝 ∧ 𝑞 ) (2) a contradiction
(3) (¬p ∨¬q) → (¬p ∧¬q) (3) logically equivalent to p ∧q
(4) (¬p ∧¬q) → (¬p ∨¬q) (4) logically equivalent to p ∨q
www.nammakalvi.in