krit.club logo

Sets - Subsets, Power Set, Universal Set

Grade 11CBSE

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

🔑Concepts

Definition of a Subset: A set AA is said to be a subset of a set BB if every element of AA is also an element of BB. We write this as ABA \subseteq B. If AA is not a subset of BB, we write A⊈BA \not\subseteq B. Visually, this is represented in a Venn Diagram as a small circle AA residing entirely within the perimeter of a larger circle BB.

Proper Subsets and Supersets: If ABA \subseteq B and ABA \neq B, then AA is called a proper subset of BB, denoted by ABA \subset B. In this relationship, BB is called the superset of AA. Visually, this means that while AA is inside BB, there is some shaded area in BB that does not belong to AA, indicating BB has elements not present in AA.

The Empty Set and Itself: Every set AA is a subset of itself (AAA \subseteq A). Additionally, the empty set \emptyset (or null set) is considered a subset of every set. Visually, the empty set is like an empty container that can be placed inside any other container.

Power Set: The collection of all subsets of a set AA is called the power set of AA, denoted by P(A)P(A). Every element of the power set is a set itself. For example, if AA is represented by a box of distinct items, the power set is a master list of every possible combination of items you could take from that box, including taking nothing and taking everything.

Universal Set: In a particular context, all sets under consideration are treated as subsets of a larger fixed set called the Universal Set, denoted by UU. In Venn Diagrams, the Universal Set is visually represented by a large outer rectangle that serves as the 'universe' for all other set circles drawn inside it.

Subsets of Real Numbers (Intervals): The set of Real Numbers R\mathbb{R} has subsets called intervals. An open interval (a,b)={x:a<x<b}(a, b) = \{x : a < x < b\} is visualized on a number line as a segment between aa and bb with empty circles at the endpoints. A closed interval [a,b]={x:axb}[a, b] = \{x : a \le x \le b\} is visualized with solid/filled circles at the endpoints, indicating they are included.

📐Formulae

AB    (xA    xB)A \subseteq B \iff (x \in A \implies x \in B)

If n(A)=nn(A) = n, then the number of subsets in P(A)=2nP(A) = 2^n

Number of proper subsets of a set with nn elements = 2n12^n - 1

Total number of non-empty subsets = 2n12^n - 1

A=B    (AB and BA)A = B \iff (A \subseteq B \text{ and } B \subseteq A)

💡Examples

Problem 1:

Given the set S={1,2,3}S = \{1, 2, 3\}, list all the elements of its Power Set P(S)P(S) and find the total number of subsets.

Solution:

Step 1: Identify the number of elements in SS. Here, n=3n = 3. Step 2: Use the formula for the number of subsets: 2n=23=82^n = 2^3 = 8. Step 3: List all subsets systematically:

  • Subset with 0 elements: \emptyset
  • Subsets with 1 element: {1},{2},{3}\{1\}, \{2\}, \{3\}
  • Subsets with 2 elements: {1,2},{2,3},{1,3}\{1, 2\}, \{2, 3\}, \{1, 3\}
  • Subset with 3 elements: {1,2,3}\{1, 2, 3\} Step 4: Combine them into the power set: P(S)={,{1},{2},{3},{1,2},{2,3},{1,3},{1,2,3}}P(S) = \{\emptyset, \{1\}, \{2\}, \{3\}, \{1, 2\}, \{2, 3\}, \{1, 3\}, \{1, 2, 3\}\}.

Explanation:

The power set includes the empty set and the set itself. We move from the smallest possible size (0) to the maximum size (3) to ensure no subsets are missed.

Problem 2:

Consider the sets A={x:x is a divisor of 6}A = \{x : x \text{ is a divisor of 6}\} and B={x:x is a divisor of 12}B = \{x : x \text{ is a divisor of 12}\}. Determine if ABA \subseteq B.

Solution:

Step 1: Write set AA in roster form. The divisors of 6 are 1,2,3,61, 2, 3, 6. So, A={1,2,3,6}A = \{1, 2, 3, 6\}. Step 2: Write set BB in roster form. The divisors of 12 are 1,2,3,4,6,121, 2, 3, 4, 6, 12. So, B={1,2,3,4,6,12}B = \{1, 2, 3, 4, 6, 12\}. Step 3: Check if every element of AA is in BB.

  • 1B1 \in B
  • 2B2 \in B
  • 3B3 \in B
  • 6B6 \in B Since all elements of AA are present in BB, ABA \subseteq B.

Explanation:

To check the subset relationship, we verify the inclusion of every individual member of the first set into the second set.