Follow Us
Select Medium / माध्यम चुनें:
Eng (English) Hindi (हिन्दी)
ICSE • Class 6 • Mathematics • Ch 7
Estimated Time: 45-60 mins
Study Progress: In Progress

Idea of Sets and Types of Sets

The chapter on the Idea of Sets and Types of Sets introduces students of Class 6 under the Council for the Indian School Certificate Examinations (CISCE) to one of the most powerful, unifying, and elegant abstract structures in all of mathematics. At its core, a set is defined as a well-defined collection of distinct objects. The phrase 'well-defined' is the decisive litmus test of set theory: it means there must exist an unambiguous, objective criterion that allows any observer to determine beyond any doubt whether a given object belongs to the collection or not. For example, the collection of 'all vowels in the English alphabet' is unquestionably a set, because every person on Earth can agree with certainty that the letter 'e' belongs to this collection while the letter 'k' does not. Conversely, collections such as 'the five best cricketers in India', 'all interesting books in a library', or 'the most talented students in Class 6' do not qualify as sets, because adjectives like 'best', 'interesting', and 'talented' represent vague, subjective, and personal opinions lacking universal mathematical criteria. The objects comprising a set are termed its elements or members. By universal mathematical convention, sets are denoted by capital letters of the alphabet such as A, B, C, X, Y, and Z, while their individual elements are written in lowercase letters, numerals, or specific symbols enclosed strictly within curly braces or flower brackets. The fundamental relationship of set membership is represented by the Greek symbol epsilon: if an element 'x' belongs to set A, we write x belongs to A, and if it does not belong to set A, we use the slashed epsilon symbol to state that x does not belong to A. Two essential invariant rules govern set elements: the Rule of Non-Repetition, which dictates that listing an element multiple times does not alter the set (for instance, the letters forming the word 'MATHEMATICS' form the set containing M, A, T, H, E, I, C, and S, dropping all duplicate letters), and the Order Invariance Principle, which establishes that the sequence in which elements are listed inside the curly braces is completely immaterial. In the ICSE syllabus, sets are specified through three standard representation methods. The first is the Description Form (or Statement Form), where a clear verbal description of the common defining property is written in words. The second is the Roster Form (also called Tabular Form or Listing Method), where all members are explicitly enumerated within curly brackets, separated by commas, such as P equals open brace two, three, five, seven close brace for the prime numbers less than ten. The third and most powerful abstract method is the Set-Builder Form (or Rule Method), which characterizes the elements using a dummy variable like x followed by a colon or vertical bar representing 'such that', and stating the exact governing mathematical condition, such as P equals open brace x such that x is a prime number and x is less than ten close brace. Mastering the skill of translating fluently between Roster Form and Set-Builder Form across natural numbers, whole numbers, integers, multiples, factors, and geometrical figures is a primary curricular milestone. Sets are classified into distinct structural categories based on their cardinality—which is the total count of distinct elements present in a set, denoted by n(A). An Empty Set (or Null Set or Void Set), symbolized by the Greek letter phi or by empty curly brackets, contains absolutely no elements, giving it a cardinality of zero. A critical examiner trap in board examinations is confusing the empty set with a set containing zero or a set containing phi: the set containing the number zero has cardinality one and is therefore a Singleton Set (or Unit Set), not an empty set! A Finite Set is one whose elements can be completely counted, meaning its cardinality is a definite whole number. In contrast, an Infinite Set possesses an unending, limitless supply of elements whose counting process never terminates, traditionally represented in roster notation by three continuation dots (an ellipsis) at the end, such as the set of all natural numbers or all even numbers. Another vital conceptual dimension is the rigorous distinction between Equal Sets and Equivalent Sets. Two finite sets are classified as Equivalent Sets if and only if they possess the exact same cardinal number, meaning n(A) equals n(B), which permits a perfect one-to-one correspondence between their elements, regardless of whether the actual elements themselves are identical. Two sets are defined as Equal Sets if and only if they contain the exact same identical members, element for element. This leads to the fundamental mathematical theorem: every pair of equal sets is automatically equivalent, but equivalent sets are by no means necessarily equal. The syllabus further explores hierarchical relationships among sets through subsets, proper subsets, and the Universal Set. A set A is said to be a subset of set B if every single element of A is also found in B. If A is a subset of B and B contains at least one additional element not present in A, then A is termed a proper subset of B. Students learn the foundational subset laws: the empty set is universally a subset of every set, every set is an improper subset of itself, and any finite set with n elements generates exactly two raised to the power n total subsets, and two raised to the power n minus one proper subsets. The overarching reference framework containing all objects under examination in a specific domain is the Universal Set, symbolized by the Greek letter Xi or capital U. Finally, visual representation through Venn Diagrams—invented by English logician John Venn—provides profound geometric intuition for set relationships. In a Venn diagram, the Universal Set is portrayed as a surrounding boundary rectangle, while sets and subsets are depicted as closed circles or ellipses drawn inside it. Disjoint Sets appear as completely separate, non-overlapping circles possessing zero common elements, whereas Overlapping Sets intersect to create a shared lens region representing their common members. Through Venn diagrams, students discover the foundational operations of Set Union (combining all elements of both sets) and Set Intersection (isolating only the common overlapping elements), building the visual and structural fluency essential for probability, coordinate geometry, computer algorithms, and higher secondary algebra.

Have You Ever Wondered?

When you search for 'smartphones under twenty thousand rupees with five-star customer ratings' on an e-commerce website, or when an airport border control system filters 'passengers holding valid visas traveling to London on flight 402', or when a medical database isolates 'patients with blood group O-negative eligible for emergency transfusion', the computer is not merely processing raw isolated data—it is executing pure set theory. For centuries, mathematics lacked a universal foundational framework to rigorously group, classify, and analyze collections of objects. In the late nineteenth century, German mathematician Georg Cantor made the daring intellectual leap of treating an entire collection of objects as a single unified mathematical entity—a 'Set' (Menge). Although his ideas initially ignited fierce philosophical debates across Europe, set theory triumphed to become the bedrock language of all modern mathematics, formal logic, relational database architecture (SQL), and computer science. Sets transform chaotic oceans of information into structured, unambiguous categories governed by exact logical rules.

Why This Chapter Matters

The study of sets is not an isolated branch of school arithmetic; it is the universal organizational architecture of the digital era. Every modern relational database operating behind banking systems, airline reservation platforms, social media networks, and search engines is built directly upon Codd's Relational Model, which is fundamentally an application of mathematical set theory. When an engineer writes a database query searching for customers who bought a laptop AND lives in Delhi OR bought accessories, they are executing set intersection and set union operations. In computer programming, the 'Set' data structure is indispensable for eliminating duplicate data entries, filtering high-speed network traffic, and optimizing search algorithms from quadratic time to constant lookup time. In the realm of artificial intelligence and machine learning, decision trees classify complex feature spaces into distinct subsets, while natural language processing categorizes words into semantic sets. In biology, taxonomists classify millions of living species into hierarchical subsets of kingdom, phylum, class, order, family, genus, and species. In formal logic and law, contracts and constitutional statutes are interpreted by determining whether specific human actions fall into the well-defined set of legal permissions or prohibitions. By mastering the crisp logic of well-defined collections, cardinality, set builder notations, and Venn diagrams in Class 6, students develop rigorous logical precision, categorical thinking, and the computational mindset essential for twenty-first-century STEM careers.

Before You Begin (Prerequisites)

  • Thorough understanding of basic number classifications: Natural numbers (N), Whole numbers (W), Integers (Z), Even numbers, Odd numbers, and Prime numbers.
  • Clear concept of factors and multiples of natural numbers, including finding divisibility and common factors.
  • Familiarity with alphabetical order, symbols, variables, and writing mathematical expressions using letters as placeholders.
  • Basic logical reasoning to distinguish between objective factual statements and subjective personal opinions.
  • Geometric awareness of simple closed plane figures, such as rectangles, circles, and intersecting regions on a page.

What You Will Learn (Core Objectives)

  • Define a set with mathematical precision and apply the well-defined criteria to distinguish genuine sets from ambiguous everyday collections.
  • Identify and utilize standard set membership notation (belongs to and does not belong to) and explain the rules of non-repetition and order invariance.
  • Express any given mathematical set fluently in Description Form, Roster Form (Tabular Form), and Set-Builder Form (Rule Method).
  • Calculate the cardinal number n(A) of any finite set and distinguish between empty (null) sets, singleton sets, finite sets, and infinite sets.
  • Differentiate rigorously between Equal Sets and Equivalent Sets using one-to-one correspondence and identical element verification.
  • Identify subsets and proper subsets of a given set, list all subsets systematically, and apply the two raised to power n formula.
  • Define the Universal Set and construct clean Venn diagrams representing universal sets, individual sets, disjoint sets, and overlapping sets.
  • Determine the union and intersection of two sets visually and numerically, solving real-world classification problems with logical confidence.

Chapter Roadmap & Progression

1 Module 1: Concept of a Set, Well-De...
2 Module 2: Methods of Representing S...
3 Module 3: Cardinal Number of a Set...
4 Module 4: Finite Sets and Infinite...
5 Module 5: Equal Sets and Equivalent...
6 Module 6: Subsets, Proper Subsets,...
7 Module 7: Introduction to Venn Diag...

Complete Concept Guide (100% Curriculum Coverage)

Module 1: Concept of a Set, Well-Defined Collections & Membership Notation

1.1 The Definition of a Set & Georg Cantor's Breakthrough

In ordinary language, we use various words for groupings: a flock of birds, a pack of cards, a team of players, or a bunch of keys. In mathematics, we require a rigorous, universally consistent concept. That fundamental concept is a Set.

A Set is a well-defined collection of distinct objects.

This foundational definition was formulated in the 1870s by German mathematician Georg Cantor (1845–1918). It contains two crucial pillars: the objects must be distinct (no duplicates), and the collection must be well-defined.

1.2 The "Well-Defined" Litmus Test (Objective vs Subjective)

A collection is described as well-defined if there exists a definite, objective rule or criterion that enables us to state unconditionally whether any given object belongs to the collection or not. There must be zero ambiguity and zero dependence on personal opinion.

Collection Statement Is it a Set? Mathematical Reason
"All vowels in the English alphabet" YES ✓ Well-defined. Every letter is either in $\{a, e, i, o, u\}$ or not. Universal agreement.
"The five best batsmen in the world" NO ✗ Not well-defined. 'Best' is a vague subjective opinion varying from person to person.
"Natural numbers divisible by 5 and less than 30" YES ✓ Well-defined. Numbers $\{5, 10, 15, 20, 25\}$ satisfy crisp mathematical criteria.
"All difficult questions in Chapter 7" NO ✗ Not well-defined. What is 'difficult' for one student may be simple for another.
"All prime numbers between 10 and 20" YES ✓ Well-defined. Exactly $\{11, 13, 17, 19\}$ are primes. No room for debate.
Examiner Trap Warning: Whenever a collection involves subjective qualifying adjectives such as beautiful, rich, intelligent, difficult, popular, good, tall, famous, or dangerous, it is NEVER a set in standard mathematics!

1.3 Notation & Membership Symbols ($\in$ and $ otin$)

The individual objects that constitute a set are called its elements or members.

  • Naming Sets: Capital letters: $A, B, C, X, Y, Z, \dots$
  • Enclosure: Elements are always enclosed within curly braces $\{ \}$, separated by commas.
  • Membership Symbol ($\in$): The Greek letter epsilon indicates membership: $$x \in A \implies ext{'$x$ belongs to set $A$' or '$x$ is an element of set $A$'}$$
  • Non-membership Symbol ($ otin$): The slashed epsilon indicates non-membership: $$y otin A \implies ext{'$y$ does not belong to set $A$' or '$y$ is not an element of set $A$'}$$
Let $V = \{a, e, i, o, u\}$ (Set of English vowels):
• $e \in V$   ✓ ('$e$' is an element of $V$)
• $b otin V$   ✓ ('$b$' is not an element of $V$)
• $o \in V$   ✓ ('$o$' belongs to $V$)
• $8 otin V$   ✓ ('$8$' does not belong to $V$)

1.4 Two Fundamental Set Invariants: Non-Repetition & Order Invariance

1. Rule of Non-Repetition

An element must never be written more than once in a set. Writing an element multiple times is redundant and does not change the set:

Letters in "MATHEMATICS":
$M = \{M, A, T, H, E, I, C, S\}$
(Letters $M, A, T$ appear twice, but are written only ONCE in the set!)

2. Order Invariance Principle

The order in which elements are listed inside the curly braces does not matter at all. The set remains identical:

$\{1, 2, 3\} = \{3, 1, 2\} = \{2, 3, 1\}$
$\{a, b, c\} = \{c, b, a\}$
(Rearranging members produces the EXACT same set!)

Module 2: Methods of Representing Sets & Standard Number Classifications

2.1 The Three Classical Methods of Specifying Sets

In the CISCE Class 6 curriculum, every set can be defined and expressed using three distinct formats:

Method 1: Description Form (Statement Form)

The set is stated as a clear verbal sentence describing the common characteristic property of all its members, often enclosed in curly brackets:

• $A = \{ ext{Counting numbers less than } 7\}$
• $B = \{ ext{First five multiples of } 4\}$

Method 2: Roster Form (Tabular Form / Listing Method)

All members of the set are listed explicitly, separated by commas, within curly braces $\{ \}$:

• $A = \{1, 2, 3, 4, 5, 6\}$
• $B = \{4, 8, 12, 16, 20\}$

Method 3: Set-Builder Form (Rule Method / Defining-Property Form)

Instead of listing members, a variable (usually $x$) represents an arbitrary element, followed by a colon '$:$' or vertical bar '$|$' (read as 'such that'), followed by the precise mathematical rule satisfied by $x$:

• $A = \{x : x \in \mathbb{N} ext{ and } x < 7\}$
• $B = \{x : x = 4n, ext{ where } n \in \mathbb{N} ext{ and } 1 \le n \le 5\}$

2.2 Roster vs Set-Builder Translation Matrix

Board examinations test bidirectional translation between Roster Form and Set-Builder Form:

Description Roster Form (Tabular) Set-Builder Form (Rule)
Factors of 18 $\{1, 2, 3, 6, 9, 18\}$ $\{x : x ext{ is a factor of } 18\}$
Primes between 20 & 35 $\{23, 29, 31\}$ $\{x : x ext{ is prime and } 20 < x < 35\}$
Whole numbers < 5 $\{0, 1, 2, 3, 4\}$ $\{x : x \in \mathbb{W} ext{ and } x < 5\}$
Squares of first 4 naturals $\{1, 4, 9, 16\}$ $\{x : x = n^2, n \in \mathbb{N}, n \le 4\}$

2.3 Standard Mathematical Sets & Universal Symbols

$\mathbb{N}$ (Natural Numbers):
$\{1, 2, 3, 4, 5, \dots\}$
$\mathbb{W}$ (Whole Numbers):
$\{0, 1, 2, 3, 4, \dots\}$
$\mathbb{Z}$ or $\mathbb{I}$ (Integers):
$\{\dots, -2, -1, 0, 1, 2, \dots\}$
Even Natural Numbers:
$\{2, 4, 6, 8, 10, \dots\}$

Module 3: Cardinal Number of a Set & Empty (Null) vs Singleton Sets

3.1 Cardinal Number of a Finite Set: Definition & Formula

The Cardinal Number (or order) of a finite set $A$ is the total number of distinct elements present in the set.

n(A) = Count of distinct members in set A
  • If $V = \{a, e, i, o, u\}$, then $n(V) = 5$.
  • If $D = \{ ext{Days of the week}\}$, then $n(D) = 7$.
  • If $W = \{x : x \in \mathbb{W} ext{ and } x < 10\} = \{0, 1, 2, 3, 4, 5, 6, 7, 8, 9\}$, then $n(W) = 10$.

⚠ High-Yield Board Trap: Finding Cardinality from Words

In board questions, students often mistakenly count all letters in a word instead of dropping duplicates:

Word: "MISSISSIPPI" (11 letters)
Set $S = \{M, I, S, P\}$
⇒ n(S) = 4 (NOT 11!)
Word: "ALLAHABAD" (9 letters)
Set $A = \{A, L, H, B, D\}$
⇒ n(A) = 5 (NOT 9!)

Empty / Null / Void Set ($\emptyset$ or $\{ \}$)

A set containing zero elements. Its cardinality is strictly zero: $$n(\emptyset) = 0$$

Real Examples:
• $\{x : x \in \mathbb{N} ext{ and } 3 < x < 4\} = \emptyset$
• $\{x : x ext{ is an even prime } > 2\} = \emptyset$
• Month with 32 days $= \emptyset$

Singleton / Unit Set

A set containing exactly ONE element. Its cardinality is strictly one: $$n(S) = 1$$

Real Examples:
• $\{2\}$ (Set of all even prime numbers)
• $\{0\}$ (Whole number that is not natural)
• $\{x : x \in \mathbb{N} ext{ and } 7 < x < 9\} = \{8\}$

🚨 CRITICAL ICSE EXAMINER TRAP: $\{0\}$ and $\{\emptyset\}$

Is $\{0\}$ an Empty Set?
NO! $\{0\}$ contains the number zero as an element. It is a Singleton Set with $n(\{0\}) = 1$.
Is $\{\emptyset\}$ an Empty Set?
NO! $\{\emptyset\}$ is a set containing the symbol $\emptyset$ as its member. It is a Singleton Set with $n(\{\emptyset\}) = 1$.

Module 4: Finite Sets and Infinite Sets

4.1 Finite Sets: Definition, Countability & The Empty Set Principle

A set is defined as a Finite Set if the process of counting its elements eventually comes to an end. In formal mathematical terms, its cardinal number $n(A)$ is a definite whole number ($0, 1, 2, 3, \dots$).

Key Property: A finite set has a countable number of members.
• $A = \{ ext{Months of a year}\} \implies n(A) = 12$ (Finite)
• $B = \{x : x \in \mathbb{N} ext{ and } x \le 100\} \implies n(B) = 100$ (Finite)
• $C = \{ ext{Factors of } 24\} = \{1, 2, 3, 4, 6, 8, 12, 24\} \implies n(C) = 8$ (Finite)
Crucial Board Fact: The empty set $\emptyset$ is classified as a finite set, because its cardinal number is $0$, which is a definite whole number ($n(\emptyset) = 0$).

4.2 Infinite Sets: Limitless Elements & The Ellipsis ($\dots$) Notation

A set is defined as an Infinite Set if the process of counting its elements never comes to an end. It contains an unending, limitless supply of members.

  • The cardinal number of an infinite set cannot be expressed as a natural number or zero.
  • In Roster Form, an infinite set is represented by writing the first few terms that establish a clear pattern, followed strictly by three continuation dots (an ellipsis: $\dots$).
• Set of all Natural numbers: $\mathbb{N} = \{1, 2, 3, 4, 5, \dots\}$
• Set of all Whole numbers: $\mathbb{W} = \{0, 1, 2, 3, 4, \dots\}$
• Set of all Integers: $\mathbb{Z} = \{\dots, -3, -2, -1, 0, 1, 2, 3, \dots\}$
• Set of all multiples of $7$: $M_7 = \{7, 14, 21, 28, \dots\}$
• Set of all points on a line segment (Geometrically infinite)

Diagnostic Guide: Factors vs Multiples in Set Finitude

Factors of Any Number $N$:
Always forms a FINITE SET, because no factor can exceed the number $N$ itself. For example, factors of 60 has exactly 12 elements.
Multiples of Any Number $N$:
Always forms an INFINITE SET (unless restricted by an upper bound), because we can endlessly multiply $N$ by increasing natural numbers.

Module 5: Equal Sets and Equivalent Sets

Equivalent Sets ($A \leftrightarrow B$ or $A pprox B$)

Two finite sets $A$ and $B$ are called Equivalent if they have the EXACT SAME cardinal number: $$n(A) = n(B)$$

The actual elements do NOT need to be the same. What matters is that a one-to-one pairing (bijection) can be established between them.

$A = \{1, 2, 3\}$ → $n(A) = 3$
$B = \{x, y, z\}$ → $n(B) = 3$
Since $n(A) = n(B)$, $A \leftrightarrow B$ (Equivalent)

Equal Sets ($A = B$)

Two sets $A$ and $B$ are called Equal if they contain EXACTLY THE SAME elements: $$ orall x, \, x \in A \iff x \in B$$

Every member of $A$ is in $B$, and every member of $B$ is in $A$, regardless of the order or repetition of elements.

$A = \{1, 2, 3\}$
$B = \{3, 1, 2\}$
Every element matches! $A = B$ (Equal)

⚡ The Fundamental Theorem of Equal & Equivalent Sets

✓ Theorem 1: All Equal Sets are automatically Equivalent Sets!

Proof: If two sets have the exact same elements ($A = B$), they must naturally have the same count of elements: $n(A) = n(B)$. Therefore, $A \leftrightarrow B$.

✗ Theorem 2: Equivalent Sets are NOT necessarily Equal Sets!

Proof: Let $A = \{1, 2, 3\}$ and $B = \{a, b, c\}$. Here $n(A) = n(B) = 3$, so they are equivalent. But $1 otin B$ and $a otin A$, so $A e B$.

Module 6: Subsets, Proper Subsets, Universal Set & Power Set Formula

6.1 Subsets ($\subseteq$) and Proper Subsets ($\subset$)

Set hierarchy is defined through subset inclusion:

Subset ($A \subseteq B$): Set $A$ is a subset of set $B$ if every element of $A$ is also an element of $B$.
$$A \subseteq B \iff ( orall x \in A \implies x \in B)$$ If even one element of $A$ is not in $B$, then $A$ is NOT a subset of $B$ ($A ot\subseteq B$).
Proper Subset ($A \subset B$): Set $A$ is a proper subset of $B$ if $A \subseteq B$ and $A eq B$.
This means $B$ must contain at least one element that is not present in $A$.

6.2 Foundational Subset Laws & The $2^n$ Calculation Formula

Law 1: Empty Set Inclusion
The empty set $\emptyset$ is a subset of EVERY set:
$$\emptyset \subseteq A \quad ( orall A)$$
Law 2: Self-Inclusion (Improper Subset)
Every set is an improper subset of itself:
$$A \subseteq A \quad ( orall A)$$
Total Number of Subsets of a set with $n$ elements = $2^n$
Total Number of Proper Subsets = $2^n - 1$
Comprehensive Listing Example: Let $S = \{a, b, c\}$, where $n = 3$.
• Total number of subsets = $2^3 = 8$.
• Systematically listing all 8 subsets:
  1. Empty set: $\emptyset$
  2. Single-element subsets: $\{a\}, \{b\}, \{c\}$
  3. Two-element subsets: $\{a, b\}, \{b, c\}, \{a, c\}$
  4. The set itself: $\{a, b, c\}$
• The proper subsets are all the above EXCEPT $\{a, b, c\}$ itself (Total: $8 - 1 = 7$).

6.3 The Universal Set (\xi or $U$)

A Universal Set is the comprehensive parent set that contains all objects, elements, and subsets under consideration in a particular mathematical discussion.

If we are analyzing English vowels and consonants, the Universal Set is:
\xi = \{x : x ext{ is a letter of the English alphabet}\} \implies n(\xi) = 26

Module 7: Introduction to Venn Diagrams & Basic Set Operations (Union & Intersection)

7.1 John Venn & Geometric Representation of Sets

In 1880, English mathematician and logician John Venn (1834–1923) invented visual diagrams that geometrically illustrate sets, subsets, and their relationships:

  • The Universal Set (\xi or $U$) is represented by a large rectangle.
  • Individual sets inside the universe are represented by closed circles or ellipses drawn inside the rectangle.
  • Elements are written as individual points or labels positioned within their corresponding geometric regions.

Disjoint Sets ($A \cap B = \emptyset$)

Two sets having zero elements in common. In a Venn diagram, they appear as completely separate, non-intersecting circles:

$A = \{ ext{Even numbers}\} = \{2, 4, 6, 8, \dots\}$
$B = \{ ext{Odd numbers}\} = \{1, 3, 5, 7, \dots\}$
$A \cap B = \emptyset$ (Disjoint)

Overlapping / Joint Sets ($A \cap B eq \emptyset$)

Two sets sharing at least one common element. In a Venn diagram, their circles cross to form a shared middle region:

$A = \{1, 2, 3, 4, 5\}$
$B = \{4, 5, 6, 7, 8\}$
Common shared elements: $\{4, 5\}$

7.3 Fundamental Set Operations: Union ($\cup$) & Intersection ($\cap$)

In Class 6, students master two primary operations combining sets:

1. Union of Two Sets ($A \cup B$):
The set of all elements that belong to set $A$ OR set $B$ OR both. All elements are pooled together, dropping duplicates: $$A \cup B = \{x : x \in A ext{ or } x \in B\}$$ Example: If $A = \{1, 2, 3\}$ and $B = \{3, 4, 5\}$, then $A \cup B = \{1, 2, 3, 4, 5\}$.
2. Intersection of Two Sets ($A \cap B$):
The set of only those elements that belong to BOTH set $A$ AND set $B$ simultaneously: $$A \cap B = \{x : x \in A ext{ and } x \in B\}$$ Example: If $A = \{1, 2, 3\}$ and $B = \{3, 4, 5\}$, then $A \cap B = \{3\}$.

Key Formulas, Identities & Theorems

Set Membership & Non-Repetition Invariant
$$x \in A \iff x \text{ is an element of } A; \quad \{x_1, x_1, x_2\} = \{x_1, x_2\}$$
Cardinal Number Formula for Finite Sets
$$n(A) = |A| = \sum_{x \in A} 1 \quad \text{where each distinct element is counted exactly once}$$
Empty Set & Singleton Set Cardinality Identities
$$n(\emptyset) = n(\{\}) = 0; \quad n(\{a\}) = 1; \quad \text{Note: } \{0\} \neq \emptyset \text{ and } \{\emptyset\} \neq \emptyset$$
Equivalent Sets Equi-Cardinality Condition
$$A \leftrightarrow B \iff n(A) = n(B)$$
Equal Sets Mutual Inclusion Law
$$A = B \iff (A \subseteq B \text{ and } B \subseteq A) \implies (A = B \implies n(A) = n(B))$$
Total Subsets Power Law
$$\text{Total Subsets}(A) = 2^n \quad \text{where } n = n(A)$$
Proper Subsets Cardinality Law
$$\text{Proper Subsets}(A) = 2^n - 1 \quad \text{where } n = n(A)$$
Disjoint Sets Union Cardinality Law
$$A \cap B = \emptyset \implies n(A \cup B) = n(A) + n(B)$$

Conceptual Solved Examples & Case Studies

Example 1
(a) State with reason whether the collection of 'all difficult topics in Mathematics' is a set.\n(b) If set $P = \{x : x \in \mathbb{N} \text{ and } x \text{ is a prime number less than } 15\}$, insert the correct symbol $\in$ or $\notin$ in the blanks:\n(i) $9 \ \underline{\quad} \ P$ \quad (ii) $13 \ \underline{\quad} \ P$
Step-by-Step Solution:
Part (a): Evaluating the collection:
The collection of 'all difficult topics in Mathematics' is NOT a set.
Reason: The term 'difficult' is a subjective qualifying adjective based on personal opinion. A topic that is difficult for one student may be very easy for another. Since there is no objective, universal criterion to test membership, the collection is not well-defined.

Part (b): Evaluating set membership for $P$:
First, listing the prime numbers less than $15$:
$$P = \{2, 3, 5, 7, 11, 13\}$$
(i) $9$ is a composite number ($9 = 3 \times 3$), so $9$ is not in $P$:
$$\mathbf{9 \notin P}$$
(ii) $13$ is a prime number and $13 < 15$, so $13$ belongs to $P$:
$$\mathbf{13 \in P}$$

Final Answer:
(a) Not a set (subjective criteria).
(b) (i) $9 \notin P$  |  (ii) $13 \in P$.
Example 2
(a) Write the set $A = \{x : x \in \mathbb{W} \text{ and } x < 6\}$ in Roster Form and find its cardinal number $n(A)$.\n(b) Write the set $B = \{3, 6, 9, 12, 15, 18\}$ in Set-Builder Form.\n(c) Find $n(B)$ and state whether sets $A$ and $B$ are equivalent.
Step-by-Step Solution:
Part (a): Writing Set $A$ in Roster Form:
Whole numbers start from $0$. The condition is $x < 6$:
$$A = \{0, 1, 2, 3, 4, 5\}$$
Counting distinct elements: $n(A) = \mathbf{6}$. (Note: $0$ is included as a whole number!)

Part (b): Writing Set $B$ in Set-Builder Form:
Notice the pattern: $3 = 3 \times 1, \ 6 = 3 \times 2, \ 9 = 3 \times 3, \dots, 18 = 3 \times 6$.
These are the first six multiples of $3$. In set-builder form:
$$\mathbf{B = \{x : x = 3n, \text{ where } n \in \mathbb{N} \text{ and } 1 \le n \le 6\}}$$
Alternative valid form: $B = \{x : x \text{ is a multiple of } 3 \text{ and } x \le 18\}$.

Part (c): Checking Equivalence:
Elements in $B$ are $6$ in number: $n(B) = 6$.
Since $n(A) = 6$ and $n(B) = 6$, we have $n(A) = n(B)$.
Therefore, sets $A$ and $B$ are Equivalent Sets ($A \leftrightarrow B$).

Final Answer:
(a) $A = \{0, 1, 2, 3, 4, 5\}$, $n(A) = 6$.
(b) $B = \{x : x = 3n, n \in \mathbb{N}, 1 \le n \le 6\}$.
(c) $n(B) = 6$; Yes, $A$ and $B$ are equivalent sets because $n(A) = n(B) = 6$.
Example 3
Let $X$ be the set of letters in the word 'MATHEMATICS' and $Y$ be the set of letters in the word 'ALLAHABAD'.\n(a) Write sets $X$ and $Y$ in Roster Form.\n(b) Find the cardinal numbers $n(X)$ and $n(Y)$.\n(c) Are sets $X$ and $Y$ equal? Are they equivalent? Give mathematical reasons.
Step-by-Step Solution:
Part (a): Writing in Roster Form (Dropping Duplicate Letters):
• In 'MATHEMATICS', letters $M, A, T$ appear twice. Dropping duplicates:
$$X = \{M, A, T, H, E, I, C, S\}$$
• In 'ALLAHABAD', letter $A$ appears 4 times, and $L$ appears twice. Dropping duplicates:
$$Y = \{A, L, H, B, D\}$$

Part (b): Finding Cardinal Numbers:
• $n(X) = \mathbf{8}$ (eight distinct letters)
• $n(Y) = \mathbf{5}$ (five distinct letters)

Part (c): Testing Equality and Equivalence:
• Are they Equal? NO. Equal sets must have the exact same members. Here, elements such as $M, T, E, I, C, S \in X$ but are not in $Y$. Thus, $X \neq Y$.
• Are they Equivalent? NO. Equivalent sets must have the same cardinal number ($n(X) = n(Y)$). Since $n(X) = 8 \neq 5 = n(Y)$, the sets are not equivalent ($X \not\leftrightarrow Y$).

Final Answer:
(a) $X = \{M, A, T, H, E, I, C, S\}$ and $Y = \{A, L, H, B, D\}$.
(b) $n(X) = 8$ and $n(Y) = 5$.
(c) Neither equal ($X \neq Y$) nor equivalent ($n(X) \neq n(Y)$).
Example 4
Given the set $S = \{2, 5, 7\}$:\n(a) Calculate the total number of subsets of $S$.\n(b) Calculate the total number of proper subsets of $S$.\n(c) List all the subsets of $S$ systematically.\n(d) Write the improper subset of $S$.
Step-by-Step Solution:

Part (a): Calculating Total Number of Subsets:
Number of elements in $S$ is $n = 3$.

$$\text{Total number of subsets} = 2^n = 2^3 = \mathbf{8}$$



Part (b): Calculating Number of Proper Subsets:

$$\text{Total number of proper subsets} = 2^n - 1 = 2^3 - 1 = 8 - 1 = \mathbf{7}$$



Part (c): Systematic Listing of All 8 Subsets:
We organize the listing by subset size:

  1. Subset with 0 elements (Empty set): $\emptyset$
  2. Subsets with 1 element (Singletons): $\{2\}, \{5\}, \{7\}$
  3. Subsets with 2 elements (Pairs): $\{2, 5\}, \{2, 7\}, \{5, 7\}$
  4. Subset with 3 elements (The set itself): $\{2, 5, 7\}$

$$\text{Subsets} = \{\emptyset, \{2\}, \{5\}, \{7\}, \{2, 5\}, \{2, 7\}, \{5, 7\}, \{2, 5, 7\}\}$$



Part (d): Identifying the Improper Subset:
Every set is an improper subset of itself. Therefore, the improper subset of $S$ is:

$$\mathbf{\{2, 5, 7\}} \quad (\text{the set } S \text{ itself})$$



Final Answer:
(a) Total subsets = $8$.
(b) Proper subsets = $7$.
(c) $\emptyset, \{2\}, \{5\}, \{7\}, \{2, 5\}, \{2, 7\}, \{5, 7\}, \{2, 5, 7\}$.
(d) The improper subset is $\{2, 5, 7\}$.

Example 5
Classify each of the following sets as Empty, Singleton, Finite, or Infinite, giving mathematical justification for each:\n(a) $A = \{x : x \in \mathbb{N} \text{ and } x^2 = 16\}$\n(b) $B = \{x : x \in \mathbb{W} \text{ and } 5 < x < 6\}$\n(c) $C = \{x : x \in \mathbb{N} \text{ and } x \text{ is an odd prime number}\}$\n(d) $D = \{x : x \text{ is a letter in the word 'INDIA'}\}$
Step-by-Step Solution:
(a) Set $A = \{x : x \in \mathbb{N} \text{ and } x^2 = 16\}$:
Solving $x^2 = 16$ gives $x = 4$ or $x = -4$. Since $x \in \mathbb{N}$ (natural numbers), only $x = 4$ is admitted.
$$A = \{4\} \implies n(A) = 1$$
Classification: Singleton Set (contains exactly one element).

(b) Set $B = \{x : x \in \mathbb{W} \text{ and } 5 < x < 6\}$:
Between consecutive whole numbers $5$ and $6$, there exists no whole number.
$$B = \emptyset \implies n(B) = 0$$
Classification: Empty Set (Null Set) (contains zero elements).

(c) Set $C = \{x : x \in \mathbb{N} \text{ and } x \text{ is an odd prime number}\}$:
Odd prime numbers are $3, 5, 7, 11, 13, 17, 19, 23, \dots$
The list of prime numbers continues endlessly without bound.
$$C = \{3, 5, 7, 11, 13, \dots\}$$
Classification: Infinite Set (counting of elements never terminates).

(d) Set $D = \{x : x \text{ is a letter in the word 'INDIA'}\}$:
Listing distinct letters: $D = \{I, N, D, A\}$.
The counting terminates at $4$: $n(D) = 4$.
Classification: Finite Set (has a countable whole number of elements).

Final Answer:
(a) Singleton Set  |  (b) Empty Set  |  (c) Infinite Set  |  (d) Finite Set.
Example 6
Let the Universal Set be $U = \{x : x \in \mathbb{N} \text{ and } x \le 12\}$.\nLet Set $A = \{x : x \text{ is a multiple of } 3\}$ and Set $B = \{x : x \text{ is a factor of } 12\}$.\n(a) Write sets $U, A,$ and $B$ in Roster Form.\n(b) Find the intersection set $A \cap B$ and its cardinal number $n(A \cap B)$.\n(c) Find the union set $A \cup B$ and its cardinal number $n(A \cup B)$.\n(d) Are sets $A$ and $B$ disjoint or overlapping? Explain why.\n(e) List the elements that belong to Universal Set $U$ but belong to NEITHER $A$ nor $B$.
Step-by-Step Solution:
Part (a): Writing $U, A,$ and $B$ in Roster Form:
• $U = \{1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12\}$
• Multiples of $3$ within $U$: $A = \{3, 6, 9, 12\}$
• Factors of $12$ within $U$: $B = \{1, 2, 3, 4, 6, 12\}$

Part (b): Finding Intersection ($A \cap B$):
Elements common to both set $A$ and set $B$:
$$A \cap B = \{3, 6, 12\}$$
$$\mathbf{n(A \cap B) = 3}$$

Part (c): Finding Union ($A \cup B$):
Pooling all elements of $A$ and $B$ together, writing common elements once:
$$A \cup B = \{1, 2, 3, 4, 6, 9, 12\}$$
$$\mathbf{n(A \cup B) = 7}$$

Part (d): Testing Disjoint vs Overlapping:
Two sets are disjoint if $A \cap B = \emptyset$.
Here, $A \cap B = \{3, 6, 12\} \neq \emptyset$.
Therefore, sets $A$ and $B$ are Overlapping (Joint) Sets because they share common elements ($3, 6, 12$).

Part (e): Elements in $U$ but in Neither $A$ nor $B$:
These are elements of the Universal Set that do not appear in $A \cup B$ (the exterior region of the circles in the Venn diagram):
$$\text{Elements} = U \setminus (A \cup B) = \{1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12\} \setminus \{1, 2, 3, 4, 6, 9, 12\}$$
$$\mathbf{\{5, 7, 8, 10, 11\}}$$

Final Answer:
(a) $U = \{1, 2, \dots, 12\}, A = \{3, 6, 9, 12\}, B = \{1, 2, 3, 4, 6, 12\}$.
(b) $A \cap B = \{3, 6, 12\}$, $n(A \cap B) = 3$.
(c) $A \cup B = \{1, 2, 3, 4, 6, 9, 12\}$, $n(A \cup B) = 7$.
(d) Overlapping sets, because $A \cap B \neq \emptyset$.
(e) $\{5, 7, 8, 10, 11\}$.

Common Misconceptions & Examiner Traps

Common Misconception

Confusing the set containing zero {0} or {phi} with the Empty Set phi.

Scientific Reality & Correction

{0} is a Singleton Set with n({0}) = 1, NOT an empty set. The empty set is strictly written as phi or { } with n(phi) = 0.

Common Misconception

Counting duplicate letters when determining the cardinal number of a word's letter set (e.g. claiming n(A) = 11 for 'MISSISSIPPI').

Scientific Reality & Correction

Always eliminate duplicate letters first: for 'MISSISSIPPI', the set is {M, I, S, P}, giving n = 4.

Common Misconception

Assuming that because two sets are equivalent, they must also be equal (e.g. thinking {1, 2, 3} and {a, b, c} are equal).

Scientific Reality & Correction

Equivalent sets have the same count of elements (n(A) = n(B)), whereas Equal sets must have the exact same identical elements.

Common Misconception

Confusing the formula for total subsets (2^n) with the formula for proper subsets (2^n - 1).

Scientific Reality & Correction

Total subsets = 2^n; Total proper subsets = 2^n - 1 (excluding the set itself).

Common Misconception

Mistakenly classifying the Empty Set as an Infinite Set because 'it has nothing inside'.

Scientific Reality & Correction

The empty set is strictly a Finite Set, because its cardinality is 0, which is a definite whole number.

Common Misconception

Treating collections defined by subjective adjectives ('all intelligent students', 'top five rivers', 'most dangerous animals') as sets.

Scientific Reality & Correction

Collections with subjective, vague, or opinion-based criteria are NOT sets.

Visual Learning & Conceptual Map

ICSE Class 6 Mathematics • Idea of Sets and Types of Sets Well-Defined Collections • Three Representation Forms • Cardinality • Types of Sets • Venn Diagrams CISCE / ICSE CLASS 6 1. Conceptual Anatomy of a Set & The Three Representation Methods A. Well-Defined Collection & Membership Definition (Georg Cantor): A set is a well-defined collection of distinct objects. ✓ "Odd natural numbers < 10" → Well-Defined ✗ "Five best singers in India" → NOT a Set (Vague) Notation: 3 ∈ O (Belongs to) | 4 ∉ O (Does not belong) B. Three Forms of Representation 1. Description Form: P = Set of prime numbers < 10 2. Roster / Tabular Form: P = {2, 3, 5, 7} 3. Set-Builder / Rule Form: P = {x : x is a prime number and x < 10} C. Two Fundamental Invariants 1. Rule of Non-Repetition: Letters in word "MATHEMATICS": {M, A, T, H, E, I, C, S} (Repeats dropped!) 2. Order Invariance: Order of elements does not matter: {1, 2, 3} = {3, 1, 2} = {2, 3, 1} 2. Types of Sets & Cardinality n(A) Empty / Null / Void Set (∅ or { }): Contains zero elements → Cardinality n(∅) = 0 Ex: {x : x ∈ ℕ and 2 < x < 3} = ∅ ⚠ Trap: {0} ≠ ∅ and {∅} ≠ ∅ (n = 1) Singleton / Unit Set: Contains exactly ONE element → n(S) = 1 Ex: {2} (Only even prime) | {0} | {∅} Finite vs Infinite Sets: • Finite Set: Counting terminates, n(A) ∈ ℔₀ Ex: Days of week: n(D) = 7 (Countable) • Infinite Set: Counting never ends → uses ... ℕ = {1, 2, 3, 4, ...} | Multiples of 5 Universal Set (ξ or U): Contains ALL objects under current consideration. If U = {x : x is a digit 0 to 9}, Then A = {1, 3, 5, 7, 9} ⊆ U 3. Equal vs Equivalent Sets & Subsets Equal Sets (A = B) Equivalent (A ↔ B) Condition: Exactly same elements Same count: n(A) = n(B) Example: A = {1, 2, 3} B = {3, 1, 2} → A = B A = {1, 2, 3} B = {p, q, r} → A ↔ B All Equal Sets are Equivalent; Reverse is NOT true! Subsets (⊆) and Proper Subsets (⊂): • Subset (A ⊆ B): Every element of A is in B. • Proper Subset (A ⊂ B): A ⊆ B and A ≠ B. Total Subsets Formula = 2ⁿ Proper Subsets Formula = 2ⁿ - 1 For A = {a, b}: Subsets = ∅, {a}, {b}, {a, b} (2² = 4) Subset Invariant Laws (Must-Know): 1. ∅ is a subset of EVERY set (∅ ⊆ A). 2. Every set is a subset of ITSELF (A ⊆ A). 3. The empty set has exactly 2⁰ = 1 subset (∅ itself). 4. Venn Diagrams & Set Operations Disjoint Sets (A ∩ B = ∅): ξ A B No elements in common Overlapping / Joint Sets (A ∩ B ≠ ∅): ξ A B A∩B Union: A ∪ B (All elements in A or B) Set Symbols Quick Guide: ∈ : Belongs to ∉ : Not an element ∅ : Empty / Null set n(A) : Cardinal number ⊆ : Subset ⊂ : Proper subset ∪ : Union (OR) ∩ : Intersection (AND) TargetExams Master Study Material • CISCE / ICSE Class 6 Mathematics • Idea of Sets and Types of Sets www.targetexams.com

Chapter Summary & 10 Key Takeaways

Takeaway 1
A set is a well-defined collection of distinct objects; collections based on subjective adjectives (best, beautiful, difficult) are not sets.
Takeaway 2
Objects belonging to a set are called elements or members, denoted using the membership symbols epsilon (belongs to) and slashed epsilon (does not belong to).
Takeaway 3
Two foundational set invariants are the Rule of Non-Repetition (duplicates dropped) and the Order Invariance Principle (element sequence is immaterial).
Takeaway 4
Sets can be specified in three classical formats: Description Form (verbal), Roster Form (explicit listing in curly braces), and Set-Builder Form (rule method using x : condition).
Takeaway 5
The Cardinal Number n(A) represents the total count of distinct elements in a finite set.
Takeaway 6
An Empty Set (or Null Set phi or { }) has zero elements (n = 0); a Singleton Set contains exactly one element (n = 1).
Takeaway 7
A Finite Set has a countable number of elements (n in W), whereas an Infinite Set has unending elements denoted with an ellipsis (...).
Takeaway 8
Equivalent Sets have equal cardinal numbers (n(A) = n(B)), while Equal Sets have identical elements; all equal sets are equivalent, but the converse is not true.
Takeaway 9
A set A is a subset of B (A subseteq B) if every element of A is in B; a set with n elements has 2^n total subsets and 2^n - 1 proper subsets.
Takeaway 10
Venn Diagrams visually portray sets using a bounding rectangle for the Universal Set (Xi or U) and circles for individual sets, illustrating disjoint and overlapping relations.

Check Your Understanding (Diagnostic Practice Questions)

Diagnostic questions testing core conceptual clarity. Answers are hidden initially — solve each problem first, then click to reveal the step-by-step verified solution.

1
State whether the collection of 'all two-digit natural numbers divisible by 11' is a set. If yes, write it in Roster Form and state its cardinal number.
Reveal Answer & Explanation
Answer: Yes, it is a well-defined set. In Roster Form: S = {11, 22, 33, 44, 55, 66, 77, 88, 99}. Its cardinal number is n(S) = 9.
The numbers are 11, 22, 33, 44, 55, 66, 77, 88, 99.
2
If A = {x : x is a prime number and x < 10} and B = {x : x is an odd natural number and x < 10}, find n(A), n(B), and state whether A and B are equivalent.
Reveal Answer & Explanation
Answer: A = {2, 3, 5, 7} => n(A) = 4. B = {1, 3, 5, 7, 9} => n(B) = 5. Since n(A) = 4 != 5 = n(B), sets A and B are NOT equivalent.
List primes: {2, 3, 5, 7}. List odd naturals: {1, 3, 5, 7, 9}.
3
Write all the subsets of the set P = {x, y}. How many proper subsets does P have?
Reveal Answer & Explanation
Answer: The subsets of P are: phi, {x}, {y}, and {x, y}. Number of proper subsets = 2^2 - 1 = 3 (namely phi, {x}, and {y}).
n = 2. Total subsets = 2^2 = 4.
4
Classify the following sets as finite or infinite:\n(a) Set of all multiples of 8.\n(b) Set of all factors of 48.
Reveal Answer & Explanation
Answer: (a) Multiples of 8 = {8, 16, 24, 32, ...} is an Infinite Set.\n(b) Factors of 48 = {1, 2, 3, 4, 6, 8, 12, 16, 24, 48} has n = 10 and is a Finite Set.
Multiples continue endlessly; factors are bounded by 48.
5
Given sets X = {a, b, c, d} and Y = {c, d, e, f}, find (a) X union Y and (b) X intersection Y.
Reveal Answer & Explanation
Answer: (a) X union Y = {a, b, c, d, e, f}. (b) X intersection Y = {c, d}.
Union combines all elements; intersection takes common elements {c, d}.
6
Are the sets A = {x : x is a letter in 'FOLLOW'} and B = {x : x is a letter in 'WOLF'} equal? Justify your answer.
Reveal Answer & Explanation
Answer: In 'FOLLOW', unique letters are {F, O, L, W}. In 'WOLF', letters are {W, O, L, F}. Since both sets have the exact same elements (order does not matter), A = B (They are Equal Sets).
Write both in Roster Form by removing duplicate letters.
Finished Studying This Chapter?
READY TO PRACTICE?

Timed CBT Practice Tests (Exam Simulator)

Put your concepts to the test with official curriculum-aligned Foundation and Advanced practice tests. Get instant accuracy scores, time metrics, and step-by-step verified explanations.

STAY UPDATED

Get the Latest Updates

New test series, syllabus updates, exam notifications and more.

Syllabus
Updates
Exam
Alerts
Study
Resources