krit.club logo

Sets - The Empty Set, Finite and Infinite Sets, Equal Sets

Grade 11CBSE

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

🔑Concepts

The Empty Set: A set which does not contain any element is called the empty set or the null set or the void set. It is denoted by the symbol ϕ\phi or {}\{ \}. Visually, an empty set is represented in a Venn diagram as a region or circle containing no points or markings. It is important to note that {0}\{0\} is NOT an empty set, as it contains the element zero.

Finite Sets: A set which is empty or consists of a definite (countable) number of elements is called a finite set. For example, W={days of the week}W = \{ \text{days of the week} \} is a finite set because n(W)=7n(W) = 7. Visually, a finite set is shown as a closed boundary containing a specific, fixed number of dots representing its members.

Infinite Sets: A set whose elements cannot be listed by a natural number nn for any nn is called an infinite set. The counting process for such a set never ends. Examples include the set of natural numbers N={1,2,3,...}\mathbb{N} = \{1, 2, 3, ...\}. In visual representations, infinite sets are often depicted with an ellipsis (......) to show that the pattern of elements extends indefinitely beyond the visible area.

Equal Sets: Two sets AA and BB are said to be equal if they have exactly the same elements, and we write A=BA = B. Otherwise, the sets are said to be unequal (ABA \neq B). Visually, if two sets are equal, their Venn diagram circles would perfectly overlap. Note that the order in which elements are listed or the repetition of elements does not change the set; for example, {1,2,3}={3,2,1,1,2}\{1, 2, 3\} = \{3, 2, 1, 1, 2\}.

Cardinal Number of a Finite Set: The number of distinct elements in a finite set AA is called its cardinal number and is denoted by n(A)n(A). For example, if A={a,e,i,o,u}A = \{a, e, i, o, u\}, then n(A)=5n(A) = 5. This can be visualized as the total count of distinct items contained within the set's boundary.

Equivalent Sets: Two finite sets AA and BB are called equivalent if their cardinal numbers are the same, i.e., n(A)=n(B)n(A) = n(B). While equal sets must have the same elements, equivalent sets only need to have the same count of elements. Visually, two different circles in a Venn diagram are equivalent if they contain the same number of dots, even if those dots represent different values.

Representation of Infinite Sets: All infinite sets cannot be described in the roster form. For example, the set of real numbers R\mathbb{R} cannot be described in roster form because the elements of this set do not follow any particular pattern that can be shown with an ellipsis. Visually, such sets are often represented as continuous lines or shaded regions on a coordinate plane rather than discrete points.

📐Formulae

For any set AA, if AA is empty, n(A)=0n(A) = 0

A=B    (xA    xB)A = B \iff (x \in A \iff x \in B)

Cardinality of Finite Set: n(A)=kn(A) = k, where k{0,1,2,...}k \in \{0, 1, 2, ...\}

Condition for Equivalent Sets: n(A)=n(B)n(A) = n(B)

💡Examples

Problem 1:

State whether the following set is finite or infinite: A={x:xN and (x1)(x2)=0}A = \{x : x \in \mathbb{N} \text{ and } (x-1)(x-2) = 0 \}.

Solution:

  1. The given set is in set-builder form: A={x:xN and (x1)(x2)=0}A = \{x : x \in \mathbb{N} \text{ and } (x-1)(x-2) = 0 \}.\n2. Solve the equation (x1)(x2)=0(x-1)(x-2) = 0. The roots are x=1x = 1 and x=2x = 2.\n3. Both 11 and 22 are natural numbers (1,2N1, 2 \in \mathbb{N}).\n4. Write the set in roster form: A={1,2}A = \{1, 2\}.\n5. Since the set contains a definite number of elements, n(A)=2n(A) = 2.

Explanation:

The set is finite because the number of elements is countable and definite.

Problem 2:

Are the sets A={x:x is a letter in the word FOLLOW}A = \{x : x \text{ is a letter in the word FOLLOW} \} and B={y:y is a letter in the word WOLF}B = \{y : y \text{ is a letter in the word WOLF} \} equal?

Solution:

  1. List the elements of set AA (the letters in 'FOLLOW'): A={F,O,L,L,O,W}A = \{F, O, L, L, O, W\}.\n2. In roster form, we do not repeat elements, so A={F,O,L,W}A = \{F, O, L, W\}.\n3. List the elements of set BB (the letters in 'WOLF'): B={W,O,L,F}B = \{W, O, L, F\}.\n4. Compare the elements: Every element of AA is in BB, and every element of BB is in AA. The order of elements does not matter.

Explanation:

Since both sets contain exactly the same distinct elements {F,O,L,W}\{F, O, L, W\}, we conclude that A=BA = B. This demonstrates that repetition and order do not affect set equality.