krit.club logo

Sets - Cardinal Numbers of Two Finite Sets-advanced

Grade 9CBSE

Review the key concepts, formulae, and examples before starting your quiz.

🔑Concepts

•

The number of elements in a finite set AA is called its cardinal number and is denoted by n(A)n(A).

•

For any two finite sets AA and BB, the set A∪BA \cup B represents the elements belonging to AA, or BB, or both.

•

The set A∩BA \cap B represents the elements common to both AA and BB.

•

Two sets are said to be disjoint if A∩B=∅A \cap B = \emptyset, in which case n(A∩B)=0n(A \cap B) = 0.

•

The set A−BA - B (elements in AA but not in BB) is also written as A∩B′A \cap B'. The cardinality is n(A−B)=n(A)−n(A∩B)n(A - B) = n(A) - n(A \cap B).

•

The cardinality of the symmetric difference AΔBA \Delta B (elements in exactly one of the sets) is given by n(A−B)+n(B−A)n(A - B) + n(B - A).

📐Formulae

n(A∪B)=n(A)+n(B)−n(A∩B)n(A \cup B) = n(A) + n(B) - n(A \cap B)

n(A∪B)=n(A−B)+n(B−A)+n(A∩B)n(A \cup B) = n(A - B) + n(B - A) + n(A \cap B)

n(A)=n(A−B)+n(A∩B)n(A) = n(A - B) + n(A \cap B)

n(B)=n(B−A)+n(A∩B)n(B) = n(B - A) + n(A \cap B)

n(A′∩B′)=n((A∪B)′)=n(U)−n(A∪B)n(A' \cap B') = n((A \cup B)') = n(U) - n(A \cup B)

n(A only)=n(A)−n(A∩B)n(A \text{ only}) = n(A) - n(A \cap B)

💡Examples

Problem 1:

In a group of 100100 people, 7070 can speak Hindi and 4545 can speak English. If every person speaks at least one of the two languages, find: (i) how many can speak both Hindi and English? (ii) how many can speak Hindi only?

Solution:

Let HH be the set of people who speak Hindi and EE be the set of people who speak English. Given: n(H∪E)=100n(H \cup E) = 100 n(H)=70n(H) = 70 n(E)=45n(E) = 45

(i) Using the formula: n(H∪E)=n(H)+n(E)−n(H∩E)n(H \cup E) = n(H) + n(E) - n(H \cap E) 100=70+45−n(H∩E)100 = 70 + 45 - n(H \cap E) 100=115−n(H∩E)100 = 115 - n(H \cap E) n(H∩E)=115−100=15n(H \cap E) = 115 - 100 = 15 So, 1515 people speak both languages.

(ii) Number of people who speak Hindi only: n(H−E)=n(H)−n(H∩E)n(H - E) = n(H) - n(H \cap E) n(H−E)=70−15=55n(H - E) = 70 - 15 = 55 So, 5555 people speak Hindi only.

Explanation:

We use the addition principle of sets. Since everyone speaks at least one language, the union equals the total group size. Hindi only is calculated by subtracting the overlap (intersection) from the total Hindi speakers.

Problem 2:

In a survey of 500500 car owners, 400400 owned car AA and 200200 owned car BB. 5050 owned both AA and BB. Is this data correct?

Solution:

Let n(A)=400n(A) = 400, n(B)=200n(B) = 200, and n(A∩B)=50n(A \cap B) = 50. We calculate the number of people who own at least one car: n(A∪B)=n(A)+n(B)−n(H∩B)n(A \cup B) = n(A) + n(B) - n(H \cap B) n(A∪B)=400+200−50n(A \cup B) = 400 + 200 - 50 n(A∪B)=550n(A \cup B) = 550

However, the total number of people surveyed is given as 500500. Since n(A∪B)n(A \cup B) cannot be greater than the universal set n(U)n(U), we have: 550>500550 > 500 This is a contradiction.

Explanation:

The cardinality of the union of subsets can never exceed the cardinality of the universal set. Here, the calculated union (550550) exceeds the total surveyed (500500), proving the data is inconsistent.

Problem 3:

If n(U)=700n(U) = 700, n(A)=200n(A) = 200, n(B)=300n(B) = 300 and n(A∩B)=100n(A \cap B) = 100, find n(A′∩B′)n(A' \cap B').

Solution:

First, find n(A∪B)n(A \cup B): n(A∪B)=n(A)+n(B)−n(A∩B)n(A \cup B) = n(A) + n(B) - n(A \cap B) n(A∪B)=200+300−100=400n(A \cup B) = 200 + 300 - 100 = 400

By De Morgan's Law, A′∩B′=(A∪B)′A' \cap B' = (A \cup B)'. n(A′∩B′)=n(U)−n(A∪B)n(A' \cap B') = n(U) - n(A \cup B) 700−400300\begin{array}{r} 700 \\ - 400 \\ \hline 300 \end{array} So, n(A′∩B′)=300n(A' \cap B') = 300.

Explanation:

We use the relation between the intersection of complements and the complement of the union. After finding the union, we subtract it from the universal set to find the elements outside both AA and BB.