krit.club logo

Sets and Functions - Sets, their representations, and types

Grade 11ICSE

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

🔑Concepts

Definition of a Set: A set is a well-defined collection of distinct objects, called elements or members. To be 'well-defined', there must be a clear rule to determine if an object belongs to the set or not. Visually, a set is often represented by a closed loop (Venn diagram) where the elements are points plotted inside the boundary.

Representation of Sets: Sets are expressed in two primary ways. The Roster (Tabular) form lists all elements separated by commas within braces, like A={1,2,3}A = \{1, 2, 3\}. The Set-Builder form describes the common property of the elements using a variable, such as A={x:x is a natural number and x<4}A = \{x : x \text{ is a natural number and } x < 4\}. Visually, Roster form looks like a discrete list, while Set-Builder form looks like a mathematical condition or logical constraint.

Types of Sets based on Cardinality: An Empty Set (or Null Set) contains no elements, denoted by ϕ\phi or {}\{\}. A Finite Set contains a countable number of elements, whereas an Infinite Set has elements that cannot be counted (e.g., the set of all stars). Visually, a finite set has a clear end to its list of elements, while an infinite set is denoted by an ellipsis '...' indicating it continues forever.

Equal vs. Equivalent Sets: Two sets AA and BB are Equal (A=BA = B) if they have exactly the same elements. They are Equivalent (ABA \approx B) if they have the same number of elements (cardinality), meaning n(A)=n(B)n(A) = n(B). Visually, equal sets would be represented by the same circle in a Venn diagram, while equivalent sets might be different circles but containing the same number of distinct points.

Subsets and Proper Subsets: A set AA is a subset of BB (ABA \subseteq B) if every element of AA is also an element of BB. If ABA \subseteq B and ABA \neq B, then AA is a Proper Subset (ABA \subset B). Visually, this is shown as a smaller circle AA completely enclosed within a larger circle BB.

Power Set: The collection of all possible subsets of a set AA is called the Power Set, denoted by P(A)P(A). If a set has nn elements, the power set will contain 2n2^n elements. Visually, if you think of a set as a box of items, the power set represents every possible combination of items you could take out of that box, including taking nothing (the empty set) and taking everything.

Universal Set and Complement: The Universal Set (UU) is the set containing all objects under consideration for a particular discussion. The complement of set AA, denoted AA' or AcA^c, consists of all elements in UU that are not in AA. Visually, if UU is a large rectangle and AA is a circle inside it, AA' is represented by the entire shaded area inside the rectangle but outside the circle.

📐Formulae

Cardinal number of a set AA: n(A)n(A)

Number of subsets of a set with nn elements: 2n2^n

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

Condition for Equality: A=B    AB and BAA = B \iff A \subseteq B \text{ and } B \subseteq A

Power Set notation: P(A)={S:SA}P(A) = \{S : S \subseteq A\}

Set-Builder notation: {xP(x)} where P(x) is the property satisfied by x\{x \mid P(x)\} \text{ where } P(x) \text{ is the property satisfied by } x

💡Examples

Problem 1:

Write the set A={x:xZ,x2<20}A = \{x : x \in \mathbb{Z}, x^2 < 20\} in Roster form and find its cardinal number n(A)n(A).

Solution:

  1. Identify the condition: xx must be an integer (Z\mathbb{Z}) and its square must be less than 2020.
  2. Test integers: 02=0<200^2 = 0 < 20 (Yes) (±1)2=1<20(\pm 1)^2 = 1 < 20 (Yes) (±2)2=4<20(\pm 2)^2 = 4 < 20 (Yes) (±3)2=9<20(\pm 3)^2 = 9 < 20 (Yes) (±4)2=16<20(\pm 4)^2 = 16 < 20 (Yes) (±5)2=2520(\pm 5)^2 = 25 \not< 20 (No)
  3. List the elements: A={4,3,2,1,0,1,2,3,4}A = \{-4, -3, -2, -1, 0, 1, 2, 3, 4\}.
  4. Count the elements: There are 99 elements in total.
  5. Therefore, n(A)=9n(A) = 9.

Explanation:

This problem requires converting a logic-based set-builder notation into a specific list of elements by checking which integers satisfy the inequality x2<20x^2 < 20.

Problem 2:

If S={1,2,3}S = \{1, 2, 3\}, find the Power Set P(S)P(S) and verify the number of elements.

Solution:

  1. List all possible subsets of SS:
    • Subsets with 0 elements: ϕ\phi
    • Subsets with 1 element: {1},{2},{3}\{1\}, \{2\}, \{3\}
    • Subsets with 2 elements: {1,2},{1,3},{2,3}\{1, 2\}, \{1, 3\}, \{2, 3\}
    • Subsets with 3 elements: {1,2,3}\{1, 2, 3\}
  2. Combine them into one set: P(S)={ϕ,{1},{2},{3},{1,2},{1,3},{2,3},{1,2,3}}P(S) = \{\phi, \{1\}, \{2\}, \{3\}, \{1, 2\}, \{1, 3\}, \{2, 3\}, \{1, 2, 3\}\}.
  3. Verify the count: The number of elements in SS is n=3n = 3. The formula for the number of elements in P(S)P(S) is 2n=23=82^n = 2^3 = 8. Counting the listed subsets, we get exactly 88.

Explanation:

The Power Set is the set of all subsets. Systematic listing (by number of elements) ensures no subset is missed, and the 2n2^n formula serves as a check for accuracy.