45 Cards 24 Min Read

Ch 01 - Sets11th Mathematics

Mathematical Definition of a Set

What specifically constitutes a 'well-defined' collection in the context of mathematical sets?

DEFINITION

Core Definition

Set: A well-defined collection of objects.
Well-defined: The collection must be universally deterministic; one must be able to definitively decide if a specific object belongs to the collection or not.

Boundary Conditions / Domain

Distinction Trap: A collection of '10 most talented writers' is subjective and strictly NOT well-defined. A collection of 'vowels in the English alphabet' IS well-defined.

Prism Memory Hook

A premium mnemonic for this topic is available in the Prism App.

Standard Mathematical Set Notations

State the standard mathematical notations for the sets of natural numbers, integers, rational numbers, and complex numbers.

FACT

$\mathbb{N}$ : Set of all natural numbers.
$\mathbb{Z}$ : Set of all integers.
$\mathbb{Q}$ : Set of all rational numbers.
$\mathbb{R}$ : Set of all real numbers.
$\mathbb{C}$ : Set of all complex numbers.
$\mathbb{W}$ : Set of all whole numbers.

Boundary Conditions / Domain

Superscripts like $+$ or $-$ (e.g., $\mathbb{Z}^+$ ) strictly restrict the domain to positive or negative elements respectively.

Prism Memory Hook

A premium mnemonic for this topic is available in the Prism App.

Roster (Tabular) Form Representation

What are the two strict boundary conditions regarding order and repetition when defining a set in Roster Form?

CONCEPT

Core Concept

Definition: All elements of the set are explicitly listed, separated by commas, enclosed within braces $\{ \}$ .
Rule 1 (Order Immaterial): The sequence of elements does not change the set (e.g., $\{1, 2\} = \{2, 1\}$ ).

Boundary Conditions / Domain

Rule 2 (No Repetition): Elements are strictly taken as distinct. Duplicates are mathematically ignored (e.g., the letters of 'SCHOOL' form the set $\{S, C, H, O, L\}$ ).

Prism Memory Hook

A premium mnemonic for this topic is available in the Prism App.

Set-Builder Form Representation

How does the Set-Builder form isolate elements of a set, and what is its standard mathematical syntax?

CONCEPT

Core Concept

Definition: Elements are not listed individually. Instead, they are described by a single, unique property $P(x)$ shared by all elements in the set.
Syntax: $A = \{x: P(x)\}$ or $A = \{x | P(x)\}$ .
Reading: 'The set of all $x$ such that $x$ satisfies property $P$ .'

Prism Memory Hook

A premium mnemonic for this topic is available in the Prism App.

The Empty (Null or Void) Set

Define the Empty Set, provide its standard notations, and mathematically explain why $\{\emptyset\}$ is not an empty set.

DEFINITION

Core Definition

Definition: A set which contains absolutely no elements.
Notation: Denoted strictly by the symbol $\emptyset$ or empty braces $\{ \}$ .

Boundary Conditions / Domain

Conceptual Trap: $\{\emptyset\}$ or $\{0\}$ are strictly NOT empty sets. They are singleton sets containing the element $\emptyset$ and the element $0$ , respectively.

Prism Memory Hook

A premium mnemonic for this topic is available in the Prism App.

Learning through recall beats re-reading.

Study this chapter with Active Recall in the Prism App.

Start Studying

Finite vs. Infinite Sets

What is the strict mathematical distinction between a Finite Set and an Infinite Set?

DISTINCTION

Core Distinctions

Finite Set: A set containing a specific, countable number of elements, or no elements at all (the empty set is finite). The process of counting definitively terminates.
Infinite Set: A set where the process of counting elements never ends (e.g., the set of real numbers $\mathbb{R}$ ).

Boundary Conditions / Domain

Limitation: All infinite sets cannot be expressed in Roster form (e.g., $\mathbb{R}$ lacks a clear step-pattern to list).

Prism Memory Hook

A premium mnemonic for this topic is available in the Prism App.

Cardinality (Cardinal Number) of a Finite Set

What does the notation $n(A)$ represent, and what is its strict value for an empty set?

FACT

Core Definition

Definition: The exact number of distinct elements present in a given finite set $A$ .
Notation: Denoted mathematically as $n(A)$ .

Boundary Conditions / Domain

Cardinality is always a non-negative integer ( $n(A) \in \mathbb{W}$ ).
For an empty set $\emptyset$ , $n(\emptyset) = 0$ .

Prism Memory Hook

A premium mnemonic for this topic is available in the Prism App.

Equal vs. Equivalent Sets

Explain the fundamental mathematical distinction between Equal Sets and Equivalent Sets.

DISTINCTION

Core Distinctions

Equal Sets: Two sets $A$ and $B$ have exactly the same elements, regardless of order ( $A = B$ ).
Equivalent Sets: Two finite sets have the same number of elements, i.e., $n(A) = n(B)$ , but the elements themselves can be completely different.

Boundary Conditions / Domain

Trap: Equal sets are invariably equivalent, but equivalent sets are strictly NOT necessarily equal.

Prism Memory Hook

Equal = Same DNA. Equivalent = Same Weight.

Mathematical Definition of a Subset

State the formal logical condition for a set A to be considered a subset of set B.

DEFINITION

Core Definition

Definition: A set $A$ is a subset of $B$ (denoted $A \subset B$ ) if and only if every element of $A$ is also an element of $B$ .
Logical Condition: $A \subset B \iff (a \in A \implies a \in B)$ .

Boundary Conditions / Domain

Proper Subset: If $A \subset B$ and $A \neq B$ , then $A$ is a 'proper subset', and $B$ is a 'superset'.

Prism Memory Hook

A premium mnemonic for this topic is available in the Prism App.

Element Membership vs. Subset Containment ( $\in$ vs $\subset$ )

What is the strict mathematical distinction in usage between the symbols $\in$ and $\subset$ ?

DISTINCTION

Core Distinctions

$\in$ (Belongs to): Used exclusively to denote that an individual element is a member of a set (e.g., $1 \in \{1, 2, 3\}$ ).
$\subset$ (Subset): Used exclusively to denote that a set is entirely contained within another set (e.g., $\{1\} \subset \{1, 2, 3\}$ ).

Boundary Conditions / Domain

Cognitive Trap: Writing $\{1\} \in \{1, 2, 3\}$ is mathematically FALSE because the set $\{1\}$ is not an element of the right-hand set.

Prism Memory Hook

Elements go IN, Sets are SUB

Formulas require repetition, not just reading.

Prism uses spaced repetition to cement formulas in long-term memory.

Try Prism Free

Fundamental Axioms of Subsets

What are the two universal subset axioms applicable to any given mathematical set?

FACT

Axiom 1: Every set is trivially a subset of itself. Mathematically: $A \subset A$ .
Axiom 2: The empty set contains no elements to contradict subset logic, so it is universally a subset of every set. Mathematically: $\emptyset \subset A$ .

Prism Memory Hook

A premium mnemonic for this topic is available in the Prism App.

Intervals as Subsets of $\mathbb{R}$ : Open vs Closed

Differentiate between open $(a, b)$ and closed $[a, b]$ intervals in terms of endpoint boundaries and set-builder notation.

DISTINCTION

Core Distinctions

Open Interval $(a, b)$ : The set of all real numbers between $a$ and $b$ , strictly excluding the endpoints $a$ and $b$ . Set-builder: $\{x: a < x < b\}$ .
Closed Interval $[a, b]$ : The set of all real numbers between $a$ and $b$ , strictly including the endpoints $a$ and $b$ . Set-builder: $\{x: a \le x \le b\}$ .

Boundary Conditions / Domain

The endpoints $a$ and $b$ must strictly be real numbers where $a < b$ .

Prism Memory Hook

A premium mnemonic for this topic is available in the Prism App.

Intervals as Subsets of $\mathbb{R}$ : Semi-Open / Semi-Closed

How are semi-open intervals represented mathematically, and how is the geometric length of any real interval calculated?

CONCEPT

Core Concept

Left-closed, Right-open $[a, b)$ : Includes $a$ but strictly excludes $b$ . $\{x: a \le x < b\}$ .
Left-open, Right-closed $(a, b]$ : Strictly excludes $a$ but includes $b$ . $\{x: a < x \le b\}$ .

Boundary Conditions / Domain

Interval Length Axiom: The mathematical length of any of these intervals bounded by $a$ and $b$ is exactly $(b - a)$ , regardless of boundary inclusion.

Prism Memory Hook

A premium mnemonic for this topic is available in the Prism App.

Total Number of Subsets of a Finite Set

PROCEDURAL Formula

2^n

Calculates the total number of subsets of a finite set of order n.

Derivation

By the Fundamental Principle of Counting: When forming a subset, every single element in the set has exactly 2 independent choices—either it is IN the subset, or OUT of the subset. For $n$ elements, the total combinatorial configurations are $2 \times 2 \times \dots \times 2$ ( $n$ times) = $2^n$ .

Component Anatomy

$n$ : The cardinality $n(A)$ (total number of elements) of the finite set $A$ .
$2^n$ : The total number of possible subsets.

Boundary Conditions / Domain

$n$ must be a non-negative integer ( $n \in \mathbb{W}$ ).
The number of Proper Subsets is strictly $2^n - 1$ (subtracting the original set itself).

Prism Memory Hook

A premium mnemonic for this topic is available in the Prism App.

The Universal Set ( $U$ )

What defines a Universal Set in a specific mathematical problem context?

DEFINITION

Core Definition

Definition: The fundamental, overarching base set that contains all elements and subsets relevant to a specific mathematical context or problem.
Notation: Denoted typically by the capital letter $U$ .

Boundary Conditions / Domain

Example Context: If discussing sets of integers $\mathbb{Z}$ and rationals $\mathbb{Q}$ , the set of Real Numbers $\mathbb{R}$ acts as the Universal Set.

Prism Memory Hook

A premium mnemonic for this topic is available in the Prism App.

NCERT + Active Recall = Exam Mastery.

Every card here is designed for smart study, not passive scrolling.

Unlock Full Access

The Power Set ( $P(A)$ )

Define the Power Set $P(A)$ and state the specific structural nature of its elements.

DEFINITION

Core Definition

Definition: The Power Set is the set containing all possible subsets of a given set $A$ .
Notation: Denoted mathematically as $P(A)$ .

Boundary Conditions / Domain

Structural Property: Every single element of a power set is itself a set.
Cardinality Property: If $n(A) = m$ , then $n(P(A)) = 2^m$ .

Prism Memory Hook

A premium mnemonic for this topic is available in the Prism App.

Power Set of an Empty Set ( $P(\emptyset)$ )

APPLICATION Formula

\begin{aligned} P(\emptyset) &= \{\emptyset\} \\ n(P(\emptyset)) &= 2^0 = 1 \end{aligned}

Defines the elements and calculates the cardinality of the Power Set of an empty set.

Derivation

By definition, the power set is the set of all subsets. The only subset of an empty set is the empty set itself. Therefore, the power set is a singleton set containing $\emptyset$ .

Component Anatomy

$\emptyset$ : The empty set (contains 0 elements).
$P(\emptyset)$ : The power set of the empty set.
$n(P(\emptyset))$ : The cardinality of the power set.

Boundary Conditions / Domain

While $\emptyset$ has exactly 0 elements, its Power Set contains exactly ONE element: the empty set itself. It is strictly never empty.

Prism Memory Hook

A premium mnemonic for this topic is available in the Prism App.

Comparable vs. Non-Comparable Sets

Under what strict mathematical condition are two sets A and B classified as 'Comparable'?

DEFINITION

Core Definition

Comparable Sets: Two sets $A$ and $B$ are mathematically comparable if and only if one is a subset of the other (i.e., strictly $A \subset B$ or $B \subset A$ ).
Non-Comparable Sets: If neither set is a subset of the other (i.e., $A \not\subset B$ and $B \not\subset A$ ), they are non-comparable.

Boundary Conditions / Domain

Significance: This property establishes a 'partial order' among sets, crucial for advanced relation theory.

Prism Memory Hook

A premium mnemonic for this topic is available in the Prism App.

Transitivity Trap: Membership ( $\in$ ) vs. Subset ( $\subset$ )

If set A is an element of set B ( $A \in B$ ), and set B is a subset of set C ( $B \subset C$ ), does this mathematically imply $A \subset C$ ? Provide a counter-example if false.

DISTINCTION

Core Distinctions

Valid Transitivity: If $x \in A$ and $A \subset B$ , it is mathematically guaranteed that $x \in B$ .
The Trap (Invalid Transitivity): If a set is an element of another set ( $A \in B$ ), and $B \subset C$ , it does NOT guarantee that $A \subset C$ .

Boundary Conditions / Domain

Counter-example: Let $A = \{1\}$ , $B = \{\{1\}, 2\}$ , and $C = \{\{1\}, 2, 3\}$ . Here, $A \in B$ and $B \subset C$ are TRUE. However, $A \subset C$ is strictly FALSE because the integer $1 \notin C$ .

Prism Memory Hook

Elements fall IN, Subsets sit UNDER. Don't mix the streams!

Union of Sets ( $A \cup B$ )

Define the Union of two sets and state its strict mathematical representation in set-builder form.

CONCEPT

Core Concept

Definition: The set of all elements which belong to $A$ , or to $B$ , or to both.
Set-Builder Logic: $A \cup B = \{x: x \in A \text{ or } x \in B\}$ .

Boundary Conditions / Domain

Venn Diagram Visual: Visually represented by the entire region covered by the combined area of circles $A$ and $B$ .

Prism Memory Hook

A premium mnemonic for this topic is available in the Prism App.

Download Prism to study offline.

Access your entire NCERT library anywhere, even without internet.

Get the App

Intersection of Sets ( $A \cap B$ )

Define the Intersection of two sets and state its strict mathematical representation in set-builder form.

CONCEPT

Core Concept

Definition: The set of all elements which are exclusively common to both sets $A$ and $B$ .
Set-Builder Logic: $A \cap B = \{x: x \in A \text{ and } x \in B\}$ .

Boundary Conditions / Domain

Venn Diagram Visual: Visually represented strictly by the overlapping intersection region between circles $A$ and $B$ .

Prism Memory Hook

A premium mnemonic for this topic is available in the Prism App.

Disjoint Sets

What is the strict mathematical condition required for two sets to be classified as 'Disjoint'?

DEFINITION

Core Definition

Definition: Two sets $A$ and $B$ are classified as disjoint if they share absolutely no elements in common.
Mathematical Condition: $A \cap B = \emptyset$ .

Boundary Conditions / Domain

Venn Diagram Visual: Visually represented by two totally separate, non-overlapping circles.

Prism Memory Hook

A premium mnemonic for this topic is available in the Prism App.

Difference of Sets ( $A - B$ )

Define the difference of two sets $A - B$ and state an equivalent operation using set intersection and a complement.

PROCEDURAL

Core Procedure

Definition: The set of all elements which belong to $A$ but do NOT belong to $B$ .
Set-Builder Logic: $A - B = \{x: x \in A \text{ and } x \notin B\}$ .
Intersection Equivalent: $A - B = A \cap B'$ , where $B'$ is the complement of $B$ .

Boundary Conditions / Domain

Trap: Set difference is strictly non-commutative. $A - B \neq B - A$ (unless $A = B$ ).

Prism Memory Hook

A premium mnemonic for this topic is available in the Prism App.

Symmetric Difference of Sets ( $A \Delta B$ )

Define the Symmetric Difference of two sets A and B, and state its two standard mathematical representations.

DEFINITION

Core Definition

Definition: The set of elements belonging to either set A or set B, but strictly not both.
Formula 1 (Union of Differences): $A \Delta B = (A - B) \cup (B - A)$
Formula 2 (Difference of Union and Intersection): $A \Delta B = (A \cup B) - (A \cap B)$

Boundary Conditions / Domain

Venn Diagram Visual: Two circles with only the non-overlapping outer regions shaded.

Prism Memory Hook

Symmetric Difference = The 'Exclusive OR' (XOR) of Sets.

Complement of a Set ( $A'$ or $A^c$ )

Define the mathematical complement of a set $A$ relative to a universal set $U$ .

DEFINITION

Core Definition

Definition: The set of all elements existing in the universal set $U$ that are strictly not present in set $A$ .
Mathematical Formula: $A' = U - A$ .
Set-Builder Logic: $A' = \{x: x \in U \text{ and } x \notin A\}$ .

Boundary Conditions / Domain

A complement $A'$ is absolutely meaningless without a strictly pre-defined Universal Set $U$ .

Prism Memory Hook

A premium mnemonic for this topic is available in the Prism App.

Learning through recall beats re-reading.

Study this chapter with Active Recall in the Prism App.

Start Studying

Fundamental Laws of Complement Sets

FACT Formula

\begin{aligned} A \cup A' &= U \\ A \cap A' &= \emptyset \\ (A')' &= A \\ \emptyset' &= U \\ U' &= \emptyset \end{aligned}

State the Complement Laws for Union and Intersection, the Law of Double Complementation, and the Laws of Empty/Universal Sets.

Derivation

Axiomatic definitions directly stemming from the logic of elements belonging, or not belonging, to a predefined space $U$ .

Component Anatomy

$A \cup A'$ : Union of a set and its complement (yields the entire Universal Set).
$A \cap A'$ : Intersection of a set and its complement (yields the empty set).
$(A')'$ : The complement of a complement returns the original set.

Boundary Conditions / Domain

All complement operations are strictly meaningless unless bounded within a pre-defined finite or infinite Universal Set $U$ .

Prism Memory Hook

A premium mnemonic for this topic is available in the Prism App.

Algebraic Laws of Union and Intersection (Commutative, Associative, Idempotent)

FACT Formula

\begin{aligned} A \cup B &= B \cup A \quad \text{(Commutative)} \\ A \cap B &= B \cap A \\ (A \cup B) \cup C &= A \cup (B \cup C) \quad \text{(Associative)} \\ (A \cap B) \cap C &= A \cap (B \cap C) \\ A \cup A &= A \quad \text{(Idempotent)} \\ A \cap A &= A \end{aligned}

State the Commutative, Associative, and Idempotent algebraic laws for both Set Union and Set Intersection.

Derivation

Derived via fundamental logic of 'and' / 'or' operators which themselves exhibit commutativity and associativity.

Component Anatomy

Commutative Law: The procedural order of sets does not alter the result.
Associative Law: The procedural grouping of sets does not alter the result.
Idempotent Law: Applying union or intersection of a set with itself yields the original set.

Boundary Conditions / Domain

These laws universally govern all operations over finite, infinite, and empty sets within any mathematical space.

Prism Memory Hook

A premium mnemonic for this topic is available in the Prism App.

Distributive Laws of Sets

APPLICATION Formula

\begin{aligned} A \cap (B \cup C) &= (A \cap B) \cup (A \cap C) \\ A \cup (B \cap C) &= (A \cup B) \cap (A \cup C) \end{aligned}

State the two Distributive Laws demonstrating how intersection distributes over union, and how union distributes over intersection.

Derivation

Proven logically by taking an arbitrary element $x$ and showing that $x \in \text{LHS} \iff x \in \text{RHS}$ using logical conjunction (and) distributing over disjunction (or).

Component Anatomy

Intersection over Union: Spreading the $\cap$ operation across elements grouped by $\cup$ .
Union over Intersection: Spreading the $\cup$ operation across elements grouped by $\cap$ .

Boundary Conditions / Domain

Critical algebraic operation for expanding complex set expressions, directly mirroring the distributive property of multiplication over addition in algebra.

Prism Memory Hook

A premium mnemonic for this topic is available in the Prism App.

De Morgan's Laws of Sets

APPLICATION Formula

\begin{aligned} (A \cup B)' &= A' \cap B' \\ (A \cap B)' &= A' \cup B' \end{aligned}

State the two mathematical equations defining De Morgan's Laws for the complements of unions and intersections.

Derivation

Visual proof via Venn Diagrams: The area strictly outside the union of A and B is identically the overlapping region of everything outside A and everything outside B.

Component Anatomy

$(A \cup B)'$ : The complement of the entire union of A and B.
$(A \cap B)'$ : The complement of the entire intersection of A and B.

Boundary Conditions / Domain

Fully applicable to any sets $A$ and $B$ that are strictly subsets of the same Universal Set $U$ .

Prism Memory Hook

Break the line, change the sign (Union becomes Intersection, Intersection becomes Union)

Difference Distributive Laws (De Morgan's for Difference)

APPLICATION Formula

\begin{aligned} A - (B \cup C) &= (A - B) \cap (A - C) \\ A - (B \cap C) &= (A - B) \cup (A - C) \end{aligned}

State the two mathematical laws distributing the difference operation over union and intersection.

Derivation

Using Set-Builder Algebra:

$A - (B \cup C) = A \cap (B \cup C)'$
Apply De Morgan's Law: $= A \cap (B' \cap C')$
Associative/Commutative Property: $= (A \cap B') \cap (A \cap C')$
Convert back to Difference: $= (A - B) \cap (A - C)$

Component Anatomy

$A - (B \cup C)$ : Elements in A strictly excluding anything in either B or C.
$A - (B \cap C)$ : Elements in A strictly excluding anything shared by B and C.

Boundary Conditions / Domain

Highly useful for breaking down complex set subtractions algebraically without resorting to Venn Diagrams.

Prism Memory Hook

Break the bracket, flip the inner sign (Union flips to Intersection).

Formulas require repetition, not just reading.

Prism uses spaced repetition to cement formulas in long-term memory.

Try Prism Free

Difference and Intersection Equivalency Identity

How do you mathematically rewrite the set difference $A - B$ strictly using the intersection and complement operations?

APPLICATION

Equivalency: $A - B = A \cap B'$
Logical Reasoning: The difference $A - B$ dictates taking all elements that exist in A, AND strictly intersecting them with the set of all elements that are NOT in B.
Symmetric Application: $B - A = B \cap A'$

Boundary Conditions / Domain

Strategic Value: Converting subtraction to intersection is the absolute most critical algorithmic step in solving advanced Miscellaneous Exercise set identity proofs.

Prism Memory Hook

Minus becomes Intersect-Prime.

Subset/Superset Algebraic Simplifications

If set A is a strict subset of set B ( $A \subset B$ ), what do the mathematical operations $A \cup B$ , $A \cap B$ , and $A - B$ respectively evaluate to?

APPLICATION

Given strict condition $A \subset B$ :

Union ( $A \cup B = B$ ): Evaluates strictly to the superset ( $B$ ). Since all elements of A are already completely swallowed by B, adding A yields nothing new.
Intersection ( $A \cap B = A$ ): Evaluates strictly to the subset ( $A$ ). Since A is entirely inside B, the only shared elements are A itself.
Difference ( $A - B = \emptyset$ ): Evaluates to the empty set. Since nothing in A exists outside of B, subtracting B completely annihilates A.

Prism Memory Hook

Union takes the Big (Superset). Intersection takes the Small (Subset).

Disjoint Set Equivalency via Set Difference

APPLICATION Formula

A - B = A \iff A \cap B = \emptyset

State the strict intersection condition that must be true if the difference of set A and set B evaluates simply to set A.

Derivation

We know $A - B = A \cap B'$ . If $A \cap B = \emptyset$ , it implies that all elements of A are strictly outside B (meaning $A \subset B'$ ). Therefore, intersecting A with $B'$ yields all of A. Hence, $A - B = A$ .

Component Anatomy

$A - B = A$ : Subtracting B from A leaves A completely unaffected.
$A \cap B = \emptyset$ : A and B share absolutely no elements.

Boundary Conditions / Domain

Applies universally to all sets within a defined universal set.

Prism Memory Hook

If taking B away does nothing, B was never there.

Absorption of Difference into Union

PROCEDURAL Formula

A \cup (B - A) = A \cup B

State the simplified equivalency for the expression combining A with the difference of B and A.

Derivation

SOP:

Convert difference to intersection: $A \cup (B \cap A')$ .
Apply the Distributive Law: $(A \cup B) \cap (A \cup A')$ .
Apply Complement Law ( $A \cup A' = U$ ): $(A \cup B) \cap U$ .
Apply Identity Law: $(A \cup B)$ .

Component Anatomy

$A \cup (B - A)$ : Combining set A with elements strictly exclusive to B.
$A \cup B$ : The standard union of both sets.

Boundary Conditions / Domain

This serves as a critical algebraic simplification SOP for Miscellaneous Exercise proofs.

Prism Memory Hook

A premium mnemonic for this topic is available in the Prism App.

Annihilation of Intersection by Difference

PROCEDURAL Formula

(A - B) \cap B = \emptyset

State the simplified mathematical evaluation for the intersection of $(A - B)$ with set $B$ .

Derivation

SOP:

Convert difference strictly to intersection: $(A \cap B') \cap B$ .
Apply Associative Law: $A \cap (B' \cap B)$ .
Apply Complement Law ( $B' \cap B = \emptyset$ ): $A \cap \emptyset$ .
Apply Domination Law: $\emptyset$ .

Component Anatomy

$(A - B) \cap B$ : Finding common elements strictly between 'A excluding B' and 'B'.

Boundary Conditions / Domain

Evaluates universally to the empty set $\emptyset$ for any sets A and B.

Prism Memory Hook

A premium mnemonic for this topic is available in the Prism App.

NCERT + Active Recall = Exam Mastery.

Every card here is designed for smart study, not passive scrolling.

Unlock Full Access

Decoding Set Word Problems (Keywords)

In set theory word problems, what mathematical operations strictly correspond to the English phrases 'At least one', 'Both', and 'Neither'?

DISTINCTION

'At least one' (A or B): Translates strictly to the Union: $n(A \cup B)$ .
'Both' (A and B): Translates strictly to the Intersection: $n(A \cap B)$ .
'Neither' (Not A and Not B): Translates to the Complement of Union: $n(A' \cap B')$ or $n((A \cup B)')$ .
'A only' (A but not B): Translates to Difference: $n(A - B)$ or $n(A \cap B')$ .

Boundary Conditions / Domain

Word problems often disguise logical operations; converting English strictly to set-builder notation prevents algebraic overlapping errors.

Prism Memory Hook

A premium mnemonic for this topic is available in the Prism App.

Principle of Inclusion-Exclusion (Two Sets)

PROCEDURAL Formula

n(A \cup B) = n(A) + n(B) - n(A \cap B)

State the general mathematical formula for the cardinality of the union of two finite sets A and B.

Derivation

When you add $n(A)$ and $n(B)$ , the intersection region $(A \cap B)$ is counted exactly twice. You must subtract $n(A \cap B)$ once to mathematically correct the overlap and find the exact union cardinality.

Component Anatomy

$n(A \cup B)$ : Total distinct elements in either set A, set B, or both.
$n(A)$ & $n(B)$ : Total elements in individual sets.
$n(A \cap B)$ : Elements shared by both sets.

Boundary Conditions / Domain

Sets A and B must strictly be finite sets.

Prism Memory Hook

A premium mnemonic for this topic is available in the Prism App.

Cardinality of Union for Disjoint Sets

APPLICATION Formula

n(A \cup B) = n(A) + n(B)

State the formula for the cardinality of the union of two finite sets A and B if they are strictly disjoint.

Derivation

For strictly disjoint sets, $A \cap B = \emptyset$ . Therefore, the cardinality of the intersection is exactly zero: $n(A \cap B) = 0$ . Substituting this boundary condition into the standard inclusion-exclusion formula yields the simplified addition rule.

Component Anatomy

$n(A \cup B)$ : Total distinct elements.
$n(A)$ & $n(B)$ : Elements in individual sets.

Boundary Conditions / Domain

A and B must strictly be finite sets.
Strict Condition: A and B must be entirely disjoint (meaning exactly $n(A \cap B) = 0$ ).

Prism Memory Hook

A premium mnemonic for this topic is available in the Prism App.

Cardinality of the Difference of Two Sets

PROCEDURAL Formula

n(A - B) = n(A) - n(A \cap B)

State the mathematical formula to find the number of elements exclusively in set A but not in set B.

Derivation

Geometrically via Venn diagram: The entire circle A is composed of the region exclusive to A ( $A - B$ ) plus the overlapping region ( $A \cap B$ ). Algebraically subtracting the overlap from the total $n(A)$ isolates the exclusive difference region.

Component Anatomy

$n(A - B)$ : The absolute number of elements exclusively in set A, strictly excluding anything shared with B.
$n(A \cap B)$ : The intersection overlap.

Boundary Conditions / Domain

A and B must strictly be finite sets.

Prism Memory Hook

A premium mnemonic for this topic is available in the Prism App.

Cardinality of Symmetric Difference

PROCEDURAL Formula

n(A \Delta B) = n(A) + n(B) - 2n(A \cap B)

State the formula to calculate the exact number of elements in the symmetric difference of two finite sets A and B.

Derivation

Since $A \Delta B$ is mathematically the union of disjoint sets $(A - B)$ and $(B - A)$ , its cardinality is $n(A - B) + n(B - A)$ . Substituting the difference formula: $[n(A) - n(A \cap B)] + [n(B) - n(A \cap B)] = n(A) + n(B) - 2n(A \cap B)$ .

Component Anatomy

$n(A \Delta B)$ : Number of elements in exactly one of the two sets (exclusive OR).
$n(A) + n(B)$ : Sum of individual elements.
$2n(A \cap B)$ : The intersection subtracted twice.

Boundary Conditions / Domain

Sets A and B must strictly be finite.

Prism Memory Hook

A premium mnemonic for this topic is available in the Prism App.

Download Prism to study offline.

Access your entire NCERT library anywhere, even without internet.

Get the App

Cardinality of the Complement of Union (Neither A nor B)

APPLICATION Formula

n(A' \cap B') = n(U) - n(A \cup B)

State the formula to find the number of elements belonging to 'neither set A nor set B' using the Universal Set.

Derivation

SOP:

Apply De Morgan's Law to strictly rewrite the intersection of complements: $A' \cap B' = (A \cup B)'$ .
Use the standard complement cardinality axiom: $n(X') = n(U) - n(X)$ . Here, $X$ is substituted with the entire union.

Component Anatomy

$n(A' \cap B')$ : The number of elements that are strictly outside both A and B.
$n(U)$ : Cardinality of the defined Universal Set.
$n(A \cup B)$ : Elements inside either A, B, or both.

Boundary Conditions / Domain

A and B must be finite sets defined strictly within a finite Universal Set $U$ . Without $U$ , this calculation is mathematically impossible.

Prism Memory Hook

A premium mnemonic for this topic is available in the Prism App.

Principle of Inclusion-Exclusion (Three Sets)

PROCEDURAL Formula

n(A \cup B \cup C) = n(A) + n(B) + n(C) - n(A \cap B) - n(B \cap C) - n(A \cap C) + n(A \cap B \cap C)

State the mathematical formula for the cardinality of the union of three finite sets A, B, and C.

Derivation

Adding the three individual sets overcounts all pairwise intersections. Subtracting the three pairwise intersections correctly adjusts those overlapping regions, but inadvertently subtracts the central triple intersection completely out. Thus, it must be mathematically added back exactly once at the end.

Component Anatomy

$n(A \cup B \cup C)$ : Total elements across all three sets.
Singles: $+n(A) + n(B) + n(C)$
Pairs: $-n(A \cap B) - n(B \cap C) - n(A \cap C)$
Triple: $+n(A \cap B \cap C)$

Boundary Conditions / Domain

All three sets must strictly be finite.

Prism Memory Hook

Add singles, Subtract pairs, Add triple back.

Number of Elements in Exactly Two of Three Sets

PROCEDURAL Formula

n(A \cap B) + n(B \cap C) + n(C \cap A) - 3n(A \cap B \cap C)

State the formula for calculating the exact number of elements belonging to strictly TWO out of three finite sets A, B, and C.

Derivation

Each standard pairwise intersection (e.g., $A \cap B$ ) naturally includes the triple intersection area ( $A \cap B \cap C$ ). If we sum all three pairs, the triple intersection is counted exactly 3 times. Since we only want elements in exactly two sets, we must completely subtract out the triple intersection, utilizing $-3$ times.

Component Anatomy

Pairwise Intersections: $n(A \cap B)$ , $n(B \cap C)$ , $n(C \cap A)$ represent overlapping areas.
Triple Intersection Penalty: $-3n(A \cap B \cap C)$ strictly removes the center core entirely.

Boundary Conditions / Domain

All sets must strictly be finite.

Prism Memory Hook

A premium mnemonic for this topic is available in the Prism App.

Number of Elements in Exactly One of Three Sets

PROCEDURAL Formula

n(A) + n(B) + n(C) - 2n(A \cap B) - 2n(B \cap C) - 2n(A \cap C) + 3n(A \cap B \cap C)

State the formula for calculating the exact number of elements belonging to strictly ONE out of three finite sets A, B, and C.

Derivation

Summing the individuals counts pairwise overlaps twice and the triple overlap three times. Subtracting $2 \times$ each pair completely removes the pure pair regions, but severely over-subtracts the triple center (added 3 times, subtracted $2 \times 3 = 6$ times, netting $-3$ ). Mathematically adding $+3n(A \cap B \cap C)$ strictly zeroes out the center, leaving only the outer singular regions.

Component Anatomy

Singles: Sum of individual cardinalities.
Pairwise Penalty: $-2 \times$ (each pairwise intersection).
Triple Compensation: $+3 \times$ (triple intersection).

Boundary Conditions / Domain

All sets must strictly be finite.

Prism Memory Hook

A premium mnemonic for this topic is available in the Prism App.

Subset Difference Equation: Factorization Step

PROCEDURAL Formula

2^m - 2^n = K \implies 2^n(2^{m-n} - 1) = K

State the algebraic factorization setup required when given that the number of subsets of one set is K more than the number of subsets of another.

Derivation

SOP Step 1 (Setup & Factor):

Translate the problem into the equation: $2^m - 2^n = K$ .
Because $m > n$ , we strictly factor out the smaller power of 2 ( $2^n$ ).
This yields $2^n(2^{m-n} - 1) = K$ , separating the expression into an even multiplier ( $2^n$ ) and an odd multiplier ( $2^{m-n} - 1$ ).

Component Anatomy

$m, n$ : Cardinalities of two finite sets where $m > n$ .
$K$ : The given numerical difference between their total subsets.

Boundary Conditions / Domain

$m, n$ must strictly be positive integers.
$K$ must be factorable into a power of 2 and an odd number.

Prism Memory Hook

A premium mnemonic for this topic is available in the Prism App.

Reading ≠ Remembering

You've studied this chapter. But will you remember it on exam day? Use Aspira Prism to automate your revisions and guarantee recall.

Join Prism

Want to actually remember this?Study these NCERT cards using Active Recall in the Prism App.

Want to actually remember this?

Study Now →

What specifically constitutes a 'well-defined' collection in the context of mathematical sets?

Core Definition

Boundary Conditions / Domain

Prism Memory Hook

State the standard mathematical notations for the sets of natural numbers, integers, rational numbers, and complex numbers.

Boundary Conditions / Domain

Prism Memory Hook

What are the two strict boundary conditions regarding order and repetition when defining a set in Roster Form?

Core Concept

Boundary Conditions / Domain

Prism Memory Hook

How does the Set-Builder form isolate elements of a set, and what is its standard mathematical syntax?

Core Concept

Prism Memory Hook

Define the Empty Set, provide its standard notations, and mathematically explain why {∅}\{\emptyset\}{∅} is not an empty set.

Core Definition

Boundary Conditions / Domain

Prism Memory Hook

Learning through recall beats re-reading.

What is the strict mathematical distinction between a Finite Set and an Infinite Set?

Core Distinctions

Boundary Conditions / Domain

Prism Memory Hook

What does the notation n(A)n(A)n(A) represent, and what is its strict value for an empty set?

Core Definition

Boundary Conditions / Domain

Prism Memory Hook

Explain the fundamental mathematical distinction between Equal Sets and Equivalent Sets.

Core Distinctions

Boundary Conditions / Domain

Prism Memory Hook

State the formal logical condition for a set A to be considered a subset of set B.

Core Definition

Boundary Conditions / Domain

Prism Memory Hook

What is the strict mathematical distinction in usage between the symbols ∈\in∈ and ⊂\subset⊂?

Core Distinctions

Boundary Conditions / Domain

Prism Memory Hook

Formulas require repetition, not just reading.

What are the two universal subset axioms applicable to any given mathematical set?

Prism Memory Hook

Differentiate between open (a,b)(a, b)(a,b) and closed [a,b][a, b][a,b] intervals in terms of endpoint boundaries and set-builder notation.

Core Distinctions

Boundary Conditions / Domain

Prism Memory Hook

How are semi-open intervals represented mathematically, and how is the geometric length of any real interval calculated?

Core Concept

Boundary Conditions / Domain

Prism Memory Hook

Total Number of Subsets of a Finite Set

Component Anatomy

Boundary Conditions / Domain

Prism Memory Hook

What defines a Universal Set in a specific mathematical problem context?

Core Definition

Boundary Conditions / Domain

Prism Memory Hook

NCERT + Active Recall = Exam Mastery.

Define the Power Set P(A)P(A)P(A) and state the specific structural nature of its elements.

Core Definition

Boundary Conditions / Domain

Prism Memory Hook

Power Set of an Empty Set (P(∅)P(\emptyset)P(∅))

Component Anatomy

Boundary Conditions / Domain

Prism Memory Hook

Under what strict mathematical condition are two sets A and B classified as 'Comparable'?

Core Definition

Boundary Conditions / Domain

Prism Memory Hook

If set A is an element of set B (A∈BA \in BA∈B), and set B is a subset of set C (B⊂CB \subset CB⊂C), does this mathematically imply A⊂CA \subset CA⊂C? Provide a counter-example if false.

Core Distinctions

Boundary Conditions / Domain

Prism Memory Hook

Define the Union of two sets and state its strict mathematical representation in set-builder form.

Core Concept

Boundary Conditions / Domain

Prism Memory Hook

Download Prism to study offline.

Define the Empty Set, provide its standard notations, and mathematically explain why $\{\emptyset\}$ is not an empty set.

What does the notation $n(A)$ represent, and what is its strict value for an empty set?

What is the strict mathematical distinction in usage between the symbols $\in$ and $\subset$ ?

Differentiate between open $(a, b)$ and closed $[a, b]$ intervals in terms of endpoint boundaries and set-builder notation.

Define the Power Set $P(A)$ and state the specific structural nature of its elements.

Power Set of an Empty Set ( $P(\emptyset)$ )

If set A is an element of set B ( $A \in B$ ), and set B is a subset of set C ( $B \subset C$ ), does this mathematically imply $A \subset C$ ? Provide a counter-example if false.

Define the difference of two sets $A - B$ and state an equivalent operation using set intersection and a complement.

Define the mathematical complement of a set $A$ relative to a universal set $U$ .

How do you mathematically rewrite the set difference $A - B$ strictly using the intersection and complement operations?

If set A is a strict subset of set B ( $A \subset B$ ), what do the mathematical operations $A \cup B$ , $A \cap B$ , and $A - B$ respectively evaluate to?