We know that n(A)=n(A−B)+n(A∩B)
or n(A−B)=n(A)−n(A∩B) ..(1)
Also n(B−A)=n(B)−n(A∩B) ..(2)
n(A∩B)=n(A∩B) ..(3)
Adding (1), (2) and (3), we get
n(A−B)+n(B−A)+n(A∩B)
=n(A)+n(B)−n(A∩B) ..(4)
But A−B, B−A and A∩B are clearly disjoint and hence
L.H.S.=n(A∪B)−n(A−B)+n(B−A)+n(A∩B)
or n(A∪B)=n(A)+n(B)−n(A∩B) by (4)
Cor. n(AΔB)=n{(A−B)∪(B−A)} by def.
=n(A−B)+n(B−A)−n{(A−B)∩(B−A)}
=n(A)−n(A∩B)+n(B)−n(B∩A)−0
=n(A)+n(B)−2n(A∩B)
Order of Finite Sets :
n(A) means the total number of elements in A. They may belong to B also. It does not mean the number of elements which exclusively belong to A.
We give below certain results which are obvious by the help of Venn diagram. If A,B,C be different sets and U be the universal set, then
(1) n(A′)=n(U)−n(A)
(2) n(A∩B′)=n(A−B)=n(A)−n(A∩B)
(3) n(A∪B)=n(A)+n(B)−n(A∩B)
or n(A∩B)=n(A)+n(B)−n(A∪B)
(4) n(A∪B∪C)=n(A)+n(B)+n(C)−{n(A∩B)−n(B∩C)−n(C∩A)}+n(A∩B∩C)
i.e. S1−S2+S3
Proof. n(A∪B∪C)=n(A∪P)
where P=B∪C
=n(A)+n(P)−n(A∩P). Put for P
=n(A)+n(B∪C)−n{A∩(B∪C)}
=n(A)+n(B∪C)−n{(A∩B)∪(A∩C)} Dist. Law
=n(A)+n(B∪C)−n{L∪M}
=n(A)+n{n(B)+n(C)−n(B∩C)}−{n(L)+n(M)−n(L∩M)}
Now put for L and M and
L∩M=(A∩B)∩(A∩C)=A∩(B∩C)
∴n(A∪B∪C)=n(A)+n(B)+n(C)−n(B∩C)−n(A∩B)−n(A∩C)+n(A∩B∩C)
=S1−S2+S3
Note. If A,B,C are all disjoint, then
n(A∪B∪C)=n(A)+n(B)+n(C) only.
This can be extended to any number of disjoint sets.
(5) n(A′∩B′∩C′)=n(A∪B∪C)′
=n(U)−n(A∪B∪C)
=n(U)−{S1−S2+S3}
Above stands for the number of elements which do not belong to any of the sets A,B and C.
(6) n(A∩B′∩C′). This stands for the number of elements which belong to A only i.e. they do not belong to both B and C.
n(A∩B′∩C′)=n(A∩(B∪C)′)
=n(A)−n{A∩(B∪C)}
=n(A)−n{(A∩B)∪(A∩C)}
=n(A)−n(P∪Q)
=n(A)−{n(P)+n(Q)−n(P∩Q)}
=n(A)−n(A∩B)−n(A∩C)+n{(A∩B)∩(A∩C)}
=n(A)−n(A∩B)−n(A∩C)+n(A∩B∩C)
∴n(A∩B′∩C′)=n(A)−n(A∩B)−n(A∩C)+n{A∩B∩C}
(7)n(A∩B∩C′). This stands for number of elements which belong to both A and B but do not belong to C
n(A∩B∩C′)=n(P∩C′)
=n(P)−n(p∩C) by (2)
=n(A∩B)−n(A∩B∩C)