EduProd
EduProd
JEE PCM PLATFORM
📊 Dashboard
LEARN MODULE · SCHEMATIC MODE

Trace it. Derive it. Know it.

Every cluster below maps one schematic path — from first principles to the final equation. Expand a node to follow the full derivation trace.

// CHAPTER_OVERVIEW Relations and Functions form the overarching algebraic architecture for modern advanced mathematics, real analysis, and competitive calculus. Master the formal taxonomy of relations on arbitrary sets—reflexive, symmetric, transitive, and equivalence relations; explore equivalence classes, set partitions, and quotient sets under congruence modulo m; analyze functional mappings through injectivity (one-one), surjectivity (onto), and bijectivity with horizontal line tests and combinatorial counting theorems; unravel functional composition pipelines (g o f) with strict domain-range constraints and preservation theorems; investigate invertibility criteria, unique inverse mappings, and bilateral reflection symmetry across y = x; and conclude with the structural axioms of binary operations, Cayley operation tables, identity elements, and inverses.
⚡ INTEGRATED VIRTUAL LABORATORIES (5)
Open Subject Labs Catalog ↗
Function Composition
Stage ↗
Invertible Functions
Stage ↗
Mapping Diagram
Stage ↗
Relations Properties
Stage ↗
Types Of Functions
Stage ↗
01

Types of Relations: Reflexive, Symmetric, Transitive & Equivalence Relations

3 concepts · 1.1
3 nodes

What formal criteria classify a relation on a set as reflexive, symmetric, or transitive, and how do their combinations yield equivalence relations and combinatorial counting formulas?

A relation R on a set A is a subset of the Cartesian product A x A. The empty set (null relation) and A x A (universal relation) represent the extreme trivial relations. Non-trivial relations are classified by three fundamental structural axioms: Reflexivity mandates that every element is related to itself ((a, a) in R for all a in A), meaning the diagonal identity relation I_A is a subset of R; Symmetry dictates that for every ordered pair in R, its transposed reverse pair must also belong to R ((a, b) in R implies (b, a) in R for all a, b in A), equivalently R = R^(-1); and Transitivity requires that an intermediate link guarantees a direct link ((a, b) in R and (b, c) in R implies (a, c) in R for all a, b, c in A). A relation satisfying all three conditions simultaneously is termed an Equivalence Relation. For a finite set of cardinality n, there are 2^(n^2) total relations, 2^(n(n-1)) reflexive relations, 2^(n(n+1)/2) symmetric relations, and 2^(n(n-1)/2) relations that are simultaneously reflexive and symmetric.

01

Empty, Universal, and Identity Relations on a Set

A relation R on set A is a subset of A x A. The empty relation R = Phi and universal relation R = A x A are the trivial extreme relations. The identity relation I_A = {(a, a) : a in A} contains ONLY diagonal pairs.

Key Idea
The identity relation contains (a, a) and NOTHING else. A reflexive relation contains (a, a) for all a in A, but MAY contain other pairs as well.
Why It Works
Distinguishing strict identity from reflexive subsets is critical for set-theoretic proofs.
Boundary Trap
Confusing the identity relation with general reflexive relations: identity relations admit NO non-diagonal elements.
Application Note
For A = {1, 2}: Identity relation is {(1, 1), (2, 2)}. A reflexive relation can be {(1, 1), (2, 2), (1, 2)}.
Derivation Trace · Empty, Universal, and Identity Relations on a Set
Think of relations as networks: Reflexivity means every node has an individual self-loop. Symmetry means every road is a two-way street. Transitivity means if you can fly from city A to B and from B to C, there exists a direct non-stop flight from A to C. An equivalence relation represents a completely clustered club where all members share an indistinguishable characteristic.
Key Definitions: Null relation and Universal relation are called trivial relations. Identity relation I_A = {(a, a) : a in A} is strictly reflexive, symmetric, and transitive, but R is reflexive if I_A is a SUBSET of R (R may contain non-diagonal pairs too). Note carefully: Transitivity can only be violated if pairs (a, b) and (b, c) exist while (a, c) is missing; if no such chained pairs exist, the condition is VACUOUSLY satisfied (e.g., R = {(1, 2)} is transitive!).
Classic Exam Pitfall: In the set of all straight lines in a plane, the relation 'L1 is perpendicular to L2' is Symmetric (L1 perp L2 <=> L2 perp L1), but NOT Reflexive (no line is perpendicular to itself) and NOT Transitive (if L1 perp L2 and L2 perp L3, then L1 is PARALLEL to L3, not perpendicular!). Conversely, 'L1 is parallel to L2' (assuming L || L) is Reflexive, Symmetric, and Transitive—an Equivalence Relation.
See it in action: Construct directed graph topologies, toggle edges between nodes, and observe instantaneous truth-evaluations of Reflexive, Symmetric, and Transitive properties in the Relations Properties Explorer.
🔬 VIRTUAL LAB Relations Properties
Full Stage ↗
? Quick Concept Check

Is the universal relation R = A x A an equivalence relation?

Answer: Yes, it is reflexive, symmetric, and transitive for any non-empty set A.

02

Reflexive, Symmetric, and Transitive Relations: Definitions and Counterexamples

R on A is: (1) Reflexive if (a, a) in R for all a in A; (2) Symmetric if (a, b) in R implies (b, a) in R; (3) Transitive if (a, b) in R and (b, c) in R implies (a, c) in R.

Key Idea
To disprove any property, a single explicit counterexample is sufficient.
Why It Works
These three independent axioms establish whether a mathematical relation behaves like generalized equality.
Boundary Trap
Checking transitivity only when a != b != c: if (a, b) in R and no pair starts with b, transitivity is vacuously true!
Application Note
Relation R = {(a, b) : a <= b} on R: Reflexive (a <= a); Transitive (a <= b and b <= c => a <= c); but NOT symmetric (2 <= 3 does not imply 3 <= 2).
Derivation Trace · Reflexive, Symmetric, and Transitive Relations: Definitions and Counterexamples
Think of relations as networks: Reflexivity means every node has an individual self-loop. Symmetry means every road is a two-way street. Transitivity means if you can fly from city A to B and from B to C, there exists a direct non-stop flight from A to C. An equivalence relation represents a completely clustered club where all members share an indistinguishable characteristic.
Key Definitions: Null relation and Universal relation are called trivial relations. Identity relation I_A = {(a, a) : a in A} is strictly reflexive, symmetric, and transitive, but R is reflexive if I_A is a SUBSET of R (R may contain non-diagonal pairs too). Note carefully: Transitivity can only be violated if pairs (a, b) and (b, c) exist while (a, c) is missing; if no such chained pairs exist, the condition is VACUOUSLY satisfied (e.g., R = {(1, 2)} is transitive!).
Classic Exam Pitfall: In the set of all straight lines in a plane, the relation 'L1 is perpendicular to L2' is Symmetric (L1 perp L2 <=> L2 perp L1), but NOT Reflexive (no line is perpendicular to itself) and NOT Transitive (if L1 perp L2 and L2 perp L3, then L1 is PARALLEL to L3, not perpendicular!). Conversely, 'L1 is parallel to L2' (assuming L || L) is Reflexive, Symmetric, and Transitive—an Equivalence Relation.
See it in action: Construct directed graph topologies, toggle edges between nodes, and observe instantaneous truth-evaluations of Reflexive, Symmetric, and Transitive properties in the Relations Properties Explorer.
🔬 VIRTUAL LAB Relations Properties
Full Stage ↗
? Quick Concept Check

Is R = {(1, 2), (2, 1)} on {1, 2, 3} transitive?

Answer: No. (1, 2) and (2, 1) are in R, but (1, 1) is NOT in R.

03

Equivalence Relations and Integer Difference Proofs

A relation R on A is an Equivalence Relation if and only if it is simultaneously Reflexive, Symmetric, and Transitive.

Key Idea
Standard board exam proof: R = {(a, b) : 2 divides (a - b)} on Z is an equivalence relation.
Why It Works
Equivalence relations generalize standard equality '=' while preserving the ability to group elements into indistinguishable clusters.
Boundary Trap
Forgetting to state that k1 + k2 is an integer when proving transitivity.
Application Note
On Z, R = {(a, b) : (a - b) is divisible by n}. Reflexive: a - a = 0 = 0*n. Symmetric: a - b = k*n => b - a = (-k)*n. Transitive: (a - b) + (b - c) = (k1 + k2)*n.
Derivation Trace · Equivalence Relations and Integer Difference Proofs
Think of relations as networks: Reflexivity means every node has an individual self-loop. Symmetry means every road is a two-way street. Transitivity means if you can fly from city A to B and from B to C, there exists a direct non-stop flight from A to C. An equivalence relation represents a completely clustered club where all members share an indistinguishable characteristic.
Key Definitions: Null relation and Universal relation are called trivial relations. Identity relation I_A = {(a, a) : a in A} is strictly reflexive, symmetric, and transitive, but R is reflexive if I_A is a SUBSET of R (R may contain non-diagonal pairs too). Note carefully: Transitivity can only be violated if pairs (a, b) and (b, c) exist while (a, c) is missing; if no such chained pairs exist, the condition is VACUOUSLY satisfied (e.g., R = {(1, 2)} is transitive!).
Classic Exam Pitfall: In the set of all straight lines in a plane, the relation 'L1 is perpendicular to L2' is Symmetric (L1 perp L2 <=> L2 perp L1), but NOT Reflexive (no line is perpendicular to itself) and NOT Transitive (if L1 perp L2 and L2 perp L3, then L1 is PARALLEL to L3, not perpendicular!). Conversely, 'L1 is parallel to L2' (assuming L || L) is Reflexive, Symmetric, and Transitive—an Equivalence Relation.
See it in action: Construct directed graph topologies, toggle edges between nodes, and observe instantaneous truth-evaluations of Reflexive, Symmetric, and Transitive properties in the Relations Properties Explorer.
🔬 VIRTUAL LAB Relations Properties
Full Stage ↗
? Quick Concept Check

If R is an equivalence relation on A, is the inverse relation R^(-1) also an equivalence relation?

Answer: Yes, R^(-1) is always reflexive, symmetric, and transitive whenever R is.

02

Equivalence Classes, Set Partitions & Congruence Modulo m

3 concepts · 1.2
3 nodes

How does an equivalence relation decompose a set into mutually disjoint equivalence classes, and why does congruence modulo m provide the archetype for modular arithmetic and quotient sets?

Let R be an equivalence relation on a non-empty set A. For any element a in A, the Equivalence Class of a, denoted by [a] or cl(a), is the set of all elements in A that are related to a: [a] = { x in A : (x, a) in R }. By the Fundamental Theorem of Equivalence Relations, the collection of all equivalence classes forms a Partition of A, satisfying three ironclad criteria: (1) Every class is non-empty ([a] != empty since a in [a]), (2) Any two equivalence classes are either strictly identical or completely disjoint (either [a] = [b] or [a] cap [b] = empty), and (3) The union of all equivalence classes reconstructs the original set A (cup [a] = A). The most celebrated arithmetic equivalence relation is Congruence Modulo m on the set of integers Z: a = b (mod m) if and only if m divides (a - b). For any positive integer m, this relation partitions Z into exactly m pairwise disjoint equivalence classes [0], [1], ..., [m - 1], forming the quotient set Z_m = Z/mZ. Geometrically, equivalence classes correspond to parallel line families (same slope), concentric circles (equal distance from origin), or congruence classes of polygons.

01

Equivalence Class Definition: [a] = {x in A : (x, a) in R}

Given an equivalence relation R on A, the equivalence class of an element a in A, denoted [a], is the set of all elements in A related to a: [a] = {x in A : (x, a) in R}.

Key Idea
Every element of [a] is mutually equivalent to every other element in [a]. An element a is always an element of its own class: a in [a].
Why It Works
Because R is reflexive, (a, a) in R, ensuring every equivalence class is non-empty.
Boundary Trap
Thinking an equivalence class can be empty: [a] always contains at least 'a'.
Application Note
For R = {(a, b) : 2 divides (a - b)} on Z: [0] = {..., -4, -2, 0, 2, 4, ...} (even integers); [1] = {..., -3, -1, 1, 3, 5, ...} (odd integers).
Derivation Trace · Equivalence Class Definition: [a] = {x in A : (x, a) in R}
An equivalence class is like sorting laundry into color-coded bins: every shirt belongs to exactly one bin (whites, darks, colored). No shirt belongs to two bins simultaneously, and putting all bins together gives back all the laundry. The equivalence relation is simply the rule: 'two clothes belong to the same bin'.
Fundamental Theorem Statement: An equivalence relation R on a set A partitions the set into mutually disjoint equivalence classes whose union is A; conversely, any partition of A into non-empty disjoint subsets induces a unique equivalence relation R where (x, y) in R iff x and y belong to the same partition subset.
Representation Invariance: In modulo arithmetic, the equivalence class [1] modulo 3 contains {..., -5, -2, 1, 4, 7, ...}. Therefore, [1] = [4] = [-2] = [7]. Never treat [1] and [4] as distinct classes; they are different names for the exact same mathematical subset!
See it in action: Explore how integer division remainders create distinct quotient partitions and modular rings in the Relations Properties Explorer.
🔬 VIRTUAL LAB Function Composition
Full Stage ↗
? Quick Concept Check

What is the equivalence class [0] for R = {(a, b) : 5 divides (a - b)} on Z?

Answer: [0] = {..., -10, -5, 0, 5, 10, ...}, all multiples of 5.

02

The Fundamental Theorem of Equivalence Relations (Partitions)

The Fundamental Theorem states that any equivalence relation on a set A partitions A into mutually disjoint equivalence classes whose union is the entire set A. Two equivalence classes [a] and [b] are either identical or disjoint: [a] = [b] iff (a, b) in R, else [a] cap [b] = Phi.

Key Idea
Equivalence classes never partially overlap: [a] cap [b] != Phi implies [a] = [b].
Why It Works
If x in [a] cap [b], then x ~ a and x ~ b; by symmetry and transitivity a ~ b, which forces all elements related to a to also be related to b.
Boundary Trap
Assuming two classes can share a single common element while remaining distinct: they must either be completely identical or disjoint.
Application Note
Z is partitioned by modulo 2 into exactly two disjoint classes: Even Integers cup Odd Integers = Z.
Derivation Trace · The Fundamental Theorem of Equivalence Relations (Partitions)
An equivalence class is like sorting laundry into color-coded bins: every shirt belongs to exactly one bin (whites, darks, colored). No shirt belongs to two bins simultaneously, and putting all bins together gives back all the laundry. The equivalence relation is simply the rule: 'two clothes belong to the same bin'.
Fundamental Theorem Statement: An equivalence relation R on a set A partitions the set into mutually disjoint equivalence classes whose union is A; conversely, any partition of A into non-empty disjoint subsets induces a unique equivalence relation R where (x, y) in R iff x and y belong to the same partition subset.
Representation Invariance: In modulo arithmetic, the equivalence class [1] modulo 3 contains {..., -5, -2, 1, 4, 7, ...}. Therefore, [1] = [4] = [-2] = [7]. Never treat [1] and [4] as distinct classes; they are different names for the exact same mathematical subset!
See it in action: Explore how integer division remainders create distinct quotient partitions and modular rings in the Relations Properties Explorer.
🔬 VIRTUAL LAB Relations Properties
Full Stage ↗
? Quick Concept Check

If [a] and [b] are equivalence classes and [a] cap [b] is non-empty, what can you conclude?

Answer: [a] = [b] (the two classes are completely identical).

03

Congruence Modulo m and Residue Classes Z_m

For integers a, b and positive integer m, a is congruent to b modulo m, written a = b (mod m), if m divides (a - b). This equivalence relation partitions Z into m residue classes: [0], [1], ..., [m - 1].

Key Idea
Residue classes represent the possible remainders when divided by m.
Why It Works
By the Division Algorithm, every integer n has a unique remainder r in {0, 1, ..., m - 1} such that n = q*m + r.
Boundary Trap
Negative modulo arithmetic: -1 mod 3 is +2, not -1 (remainders are non-negative in {0, ..., m-1}).
Application Note
Modulo 3 partitions Z into [0] = {3k}, [1] = {3k + 1}, [2] = {3k + 2}.
Derivation Trace · Congruence Modulo m and Residue Classes Z_m
An equivalence class is like sorting laundry into color-coded bins: every shirt belongs to exactly one bin (whites, darks, colored). No shirt belongs to two bins simultaneously, and putting all bins together gives back all the laundry. The equivalence relation is simply the rule: 'two clothes belong to the same bin'.
Fundamental Theorem Statement: An equivalence relation R on a set A partitions the set into mutually disjoint equivalence classes whose union is A; conversely, any partition of A into non-empty disjoint subsets induces a unique equivalence relation R where (x, y) in R iff x and y belong to the same partition subset.
Representation Invariance: In modulo arithmetic, the equivalence class [1] modulo 3 contains {..., -5, -2, 1, 4, 7, ...}. Therefore, [1] = [4] = [-2] = [7]. Never treat [1] and [4] as distinct classes; they are different names for the exact same mathematical subset!
See it in action: Explore how integer division remainders create distinct quotient partitions and modular rings in the Relations Properties Explorer.
🔬 VIRTUAL LAB Function Composition
Full Stage ↗
? Quick Concept Check

Which residue class modulo 4 does -7 belong to?

Answer: -7 = 4*(-2) + 1, so -7 belongs to [1].

03

Types of Functions: Injective (One-One), Surjective (Onto) & Bijective Mappings

3 concepts · 1.3
3 nodes

How do one-one and onto conditions govern functional mappings, how is injectivity determined graphically and analytically, and how are injections, surjections, and bijections enumerated combinatorially?

A function f: X -> Y maps every element x in X to a unique element y = f(x) in Y. A function is Injective (One-to-One) if distinct elements in the domain map to distinct images in the codomain: x1 != x2 implies f(x1) != f(x2), or contrapositively, f(x1) = f(x2) implies x1 = x2. Graphically, a function is injective if and only if every horizontal line intersects its graph at most once (Horizontal Line Test); analytically, a differentiable function on an interval is injective if its derivative f'(x) is strictly positive or strictly negative throughout (strictly monotonic). A function is Surjective (Onto) if every element in the codomain Y possesses at least one pre-image in domain X: for every y in Y, there exists x in X such that f(x) = y, which holds if and only if Range(f) = Codomain(Y). A function that is both Injective and Surjective is called Bijective (One-to-One Correspondence). For finite sets with |X| = m and |Y| = n: Total functions = n^m; Injections = nPm if m <= n (0 if m > n by the Pigeonhole Principle); Bijections = n! if m = n (0 if m != n); and Surjections = sum_{r=0}^n (-1)^(n-r) * nCr * r^m for m >= n.

01

Injective (One-to-One) Functions: f(x1) = f(x2) => x1 = x2

A function f: X -> Y is Injective (one-one) if distinct elements in X have distinct images in Y: f(x1) = f(x2) implies x1 = x2. Graphically, every horizontal line intersects the curve at most once.

Key Idea
To prove injectivity algebraically: assume f(x1) = f(x2) and deduce x1 = x2. To disprove, find two distinct inputs with identical output.
Why It Works
If a function is strictly increasing (f'(x) > 0) or strictly decreasing, it is guaranteed to be injective.
Boundary Trap
Ignoring the domain: f(x) = x^2 is NOT injective on R, but IS injective on [0, infinity)!
Application Note
f(x) = 2x + 3 on R: 2x1 + 3 = 2x2 + 3 => 2x1 = 2x2 => x1 = x2 (Injective). But f(x) = x^2 on R is NOT injective because f(-2) = f(2) = 4.
Derivation Trace · Injective (One-to-One) Functions: f(x1) = f(x2) => x1 = x2
Think of domain elements as arrows and codomain elements as targets: Injective means no target gets hit by more than one arrow (no collisions). Surjective means every single target gets hit by at least one arrow (no unhit targets). Bijective means every target gets hit by EXACTLY ONE arrow—a perfect one-to-one marriage between sets.
Horizontal Line Test vs Vertical Line Test: The Vertical Line Test determines if a curve is a FUNCTION (at most one intersection per vertical line). The Horizontal Line Test determines if a function is INJECTIVE (at most one intersection per horizontal line). To test surjectivity graphically, verify that every horizontal line y = c (for c in codomain) intersects the graph AT LEAST once.
Codomain Sensitivity: Whether a function is surjective depends ENTIRELY on the specified codomain! For example, f: R -> R defined by f(x) = x^2 is NOT surjective (range [0, infinity) != R). But f: R -> [0, infinity) defined by f(x) = x^2 IS surjective! Always read the specified codomain before concluding onto/into.
See it in action: Drag domain points, reroute mapping arrows, and test the horizontal line scanner on polynomials in the Types of Functions Explorer.
🔬 VIRTUAL LAB Types Of Functions
Full Stage ↗
? Quick Concept Check

Is f: N -> N defined by f(n) = 2n one-one?

Answer: Yes. 2n1 = 2n2 implies n1 = n2.

02

Surjective (Onto) Functions: Range(f) = Codomain(Y)

A function f: X -> Y is Surjective (onto) if every element y in codomain Y has at least one pre-image x in domain X such that f(x) = y. Equivalently, Range(f) = Codomain(Y).

Key Idea
To prove surjectivity: set y = f(x), solve for x in terms of y, and verify that x belongs to domain X for every y in Y.
Why It Works
If any element in the codomain cannot be reached by the mapping, the codomain contains unreachable waste and f is not onto.
Boundary Trap
Assuming codomain is always equal to range: for f: R -> R, f(x) = x^2, Codomain is R but Range is [0, infinity), so f is NOT onto.
Application Note
f: R -> R, f(x) = 2x + 3: set y = 2x + 3 => x = (y - 3)/2. For every real y, x is real. Thus f is surjective.
Derivation Trace · Surjective (Onto) Functions: Range(f) = Codomain(Y)
Think of domain elements as arrows and codomain elements as targets: Injective means no target gets hit by more than one arrow (no collisions). Surjective means every single target gets hit by at least one arrow (no unhit targets). Bijective means every target gets hit by EXACTLY ONE arrow—a perfect one-to-one marriage between sets.
Horizontal Line Test vs Vertical Line Test: The Vertical Line Test determines if a curve is a FUNCTION (at most one intersection per vertical line). The Horizontal Line Test determines if a function is INJECTIVE (at most one intersection per horizontal line). To test surjectivity graphically, verify that every horizontal line y = c (for c in codomain) intersects the graph AT LEAST once.
Codomain Sensitivity: Whether a function is surjective depends ENTIRELY on the specified codomain! For example, f: R -> R defined by f(x) = x^2 is NOT surjective (range [0, infinity) != R). But f: R -> [0, infinity) defined by f(x) = x^2 IS surjective! Always read the specified codomain before concluding onto/into.
See it in action: Drag domain points, reroute mapping arrows, and test the horizontal line scanner on polynomials in the Types of Functions Explorer.
🔬 VIRTUAL LAB Types Of Functions
Full Stage ↗
? Quick Concept Check

Is f: R -> R, f(x) = x^3 onto?

Answer: Yes, because every real number y has a real cube root x = y^(1/3).

03

Bijective Functions and Cardinality Requirements

A function f: X -> Y is Bijective if it is both Injective (one-one) and Surjective (onto). For finite sets, a bijection exists if and only if |X| = |Y|.

Key Idea
A bijection establishes a perfect 1-to-1 correspondence between domain and codomain with zero duplicates and zero leftovers.
Why It Works
Bijectivity is the exact mathematical prerequisite for a function to be invertible.
Boundary Trap
Claiming that a finite set mapping f: A -> A with |A| = n can be one-one without being onto: for finite sets from A to A, one-one implies onto!
Application Note
f: R -> R, f(x) = 3x - 5 is both one-one and onto, hence it is a bijection.
Derivation Trace · Bijective Functions and Cardinality Requirements
Think of domain elements as arrows and codomain elements as targets: Injective means no target gets hit by more than one arrow (no collisions). Surjective means every single target gets hit by at least one arrow (no unhit targets). Bijective means every target gets hit by EXACTLY ONE arrow—a perfect one-to-one marriage between sets.
Horizontal Line Test vs Vertical Line Test: The Vertical Line Test determines if a curve is a FUNCTION (at most one intersection per vertical line). The Horizontal Line Test determines if a function is INJECTIVE (at most one intersection per horizontal line). To test surjectivity graphically, verify that every horizontal line y = c (for c in codomain) intersects the graph AT LEAST once.
Codomain Sensitivity: Whether a function is surjective depends ENTIRELY on the specified codomain! For example, f: R -> R defined by f(x) = x^2 is NOT surjective (range [0, infinity) != R). But f: R -> [0, infinity) defined by f(x) = x^2 IS surjective! Always read the specified codomain before concluding onto/into.
See it in action: Drag domain points, reroute mapping arrows, and test the horizontal line scanner on polynomials in the Types of Functions Explorer.
🔬 VIRTUAL LAB Invertible Functions
Full Stage ↗
? Quick Concept Check

If |A| = 4 and |B| = 5, can there exist a bijective function from A to B?

Answer: No, a bijection between finite sets requires |A| = |B|.

04

Composition of Functions: Pipeline Construction & Preservation Theorems

3 concepts · 1.4
3 nodes

Under what exact domain-range conditions does composite function g o f exist, why is composition generally non-commutative, and what do preservation theorems dictate about injectivity and surjectivity?

Let f: A -> B and g: B -> C be two functions. The Composite Function g o f (read as 'g circle f' or 'g composed with f') is a function from A to C defined by (g o f)(x) = g(f(x)) for all x in A. For g o f to be well-defined, the output of f must be an admissible input for g; that is, the Range of f must be a subset of the Domain of g: Range(f) subseteq Domain(g). Composition of functions satisfies associativity: h o (g o f) = (h o g) o f for all compatible functions f, g, h. However, composition is in general NOT commutative: g o f != f o g (in fact, f o g often cannot even be formed because the domains and codomains may be entirely incompatible). Composition preserves mapping properties in the forward direction: (1) If f and g are both injective, then g o f is injective; (2) If f and g are both surjective, then g o f is surjective; (3) If f and g are both bijective, then g o f is bijective. In the reverse direction (crucial competitive trap): If g o f is injective, it guarantees that f MUST be injective (g need not be injective); if g o f is surjective, it guarantees that g MUST be surjective (f need not be surjective).

01

Function Composition Definition: (g o f)(x) = g(f(x))

Let f: A -> B and g: B -> C. The composite function g o f: A -> C is defined by (g o f)(x) = g(f(x)) for all x in A. Crucially, Range(f) must be a subset of Domain(g).

Key Idea
f acts FIRST on x, and g acts SECOND on the output f(x). Read (g o f) from right to left!
Why It Works
Function composition models multi-stage processing pipelines where the output of stage 1 becomes the input to stage 2.
Boundary Trap
Evaluating from left to right: (g o f)(x) is NOT f(g(x))! The rightmost function f evaluates first.
Application Note
If f(x) = 2x and g(x) = x^2 + 1: (g o f)(x) = g(2x) = (2x)^2 + 1 = 4x^2 + 1. (f o g)(x) = f(x^2 + 1) = 2(x^2 + 1) = 2x^2 + 2.
Derivation Trace · Function Composition Definition: (g o f)(x) = g(f(x))
Picture an industrial assembly line: Machine f takes raw material x and manufactures component f(x). Machine g takes component f(x) and paints it into final product g(f(x)). For the factory to run, Machine f's output specifications must strictly match Machine g's input requirements (Range(f) subset of Domain(g)). The combined automated line is g o f.
Converse Theorems in NCERT: Theorem 1: If g o f is one-one, then f is one-one. Proof sketch: If f(x1) = f(x2), then g(f(x1)) = g(f(x2)) => (g o f)(x1) = (g o f)(x2) => x1 = x2 (since g o f is one-one). Thus f is one-one! Theorem 2: If g o f is onto, then g is onto. Proof sketch: For any z in C, there is x in A such that (g o f)(x) = z => g(f(x)) = z. Thus y = f(x) in B serves as the pre-image for z under g.
Order Matters: In (g o f)(x), the function f ACTS FIRST, and g acts second. Students frequently evaluate f(g(x)) by mistake. Remember: (g o f)(x) = g(f(x)) means 'g of f of x'.
See it in action: Chain functions f(x) and g(x), adjust intermediate domain sliders, and inspect composite domain boundaries in the Function Composition Explorer.
🔬 VIRTUAL LAB Function Composition
Full Stage ↗
? Quick Concept Check

If f(x) = cos(x) and g(x) = 3x^2, what is (g o f)(x)?

Answer: (g o f)(x) = g(cos(x)) = 3 cos^2(x).

02

Non-Commutativity (g o f != f o g) and Associativity of Composition

In general, function composition is NOT commutative: g o f != f o g. However, function composition is ALWAYS associative: h o (g o f) = (h o g) o f whenever the compositions are defined.

Key Idea
Order of functions matters (non-commutative), but grouping order does not (associative).
Why It Works
Both h o (g o f)(x) and (h o g) o f(x) evaluate to h(g(f(x))) for every input x.
Boundary Trap
Assuming g o f = f o g holds in general: they only commute under very special symmetric circumstances.
Application Note
For f(x) = x + 1, g(x) = 2x: (g o f)(x) = 2x + 2, while (f o g)(x) = 2x + 1. They are completely different functions.
Derivation Trace · Non-Commutativity (g o f != f o g) and Associativity of Composition
Picture an industrial assembly line: Machine f takes raw material x and manufactures component f(x). Machine g takes component f(x) and paints it into final product g(f(x)). For the factory to run, Machine f's output specifications must strictly match Machine g's input requirements (Range(f) subset of Domain(g)). The combined automated line is g o f.
Converse Theorems in NCERT: Theorem 1: If g o f is one-one, then f is one-one. Proof sketch: If f(x1) = f(x2), then g(f(x1)) = g(f(x2)) => (g o f)(x1) = (g o f)(x2) => x1 = x2 (since g o f is one-one). Thus f is one-one! Theorem 2: If g o f is onto, then g is onto. Proof sketch: For any z in C, there is x in A such that (g o f)(x) = z => g(f(x)) = z. Thus y = f(x) in B serves as the pre-image for z under g.
Order Matters: In (g o f)(x), the function f ACTS FIRST, and g acts second. Students frequently evaluate f(g(x)) by mistake. Remember: (g o f)(x) = g(f(x)) means 'g of f of x'.
See it in action: Chain functions f(x) and g(x), adjust intermediate domain sliders, and inspect composite domain boundaries in the Function Composition Explorer.
🔬 VIRTUAL LAB Function Composition
Full Stage ↗
? Quick Concept Check

Is (f o g o h)(x) equal to ((f o g) o h)(x)?

Answer: Yes, because function composition is strictly associative.

03

Preservation Theorems: Injectivity and Surjectivity of Composite Maps

Theorem 1: If f: A -> B and g: B -> C are both injective, then g o f is injective. Theorem 2: If f and g are both surjective, then g o f is surjective. Conversely, if g o f is injective, f MUST be injective (g may not be); if g o f is surjective, g MUST be surjective (f may not be).

Key Idea
g o f injective => inner function f is injective. g o f surjective => outer function g is surjective.
Why It Works
If f were not injective, two inputs would collapse to one before g even sees them, making g o f non-injective.
Boundary Trap
Assuming that if g o f is one-one, then g must also be one-one: only the inner function f is guaranteed to be one-one.
Application Note
If g o f is one-one: f(x1) = f(x2) => g(f(x1)) = g(f(x2)) => (g o f)(x1) = (g o f)(x2) => x1 = x2. Hence f is one-one.
Derivation Trace · Preservation Theorems: Injectivity and Surjectivity of Composite Maps
Picture an industrial assembly line: Machine f takes raw material x and manufactures component f(x). Machine g takes component f(x) and paints it into final product g(f(x)). For the factory to run, Machine f's output specifications must strictly match Machine g's input requirements (Range(f) subset of Domain(g)). The combined automated line is g o f.
Converse Theorems in NCERT: Theorem 1: If g o f is one-one, then f is one-one. Proof sketch: If f(x1) = f(x2), then g(f(x1)) = g(f(x2)) => (g o f)(x1) = (g o f)(x2) => x1 = x2 (since g o f is one-one). Thus f is one-one! Theorem 2: If g o f is onto, then g is onto. Proof sketch: For any z in C, there is x in A such that (g o f)(x) = z => g(f(x)) = z. Thus y = f(x) in B serves as the pre-image for z under g.
Order Matters: In (g o f)(x), the function f ACTS FIRST, and g acts second. Students frequently evaluate f(g(x)) by mistake. Remember: (g o f)(x) = g(f(x)) means 'g of f of x'.
See it in action: Chain functions f(x) and g(x), adjust intermediate domain sliders, and inspect composite domain boundaries in the Function Composition Explorer.
🔬 VIRTUAL LAB Function Composition
Full Stage ↗
? Quick Concept Check

If g o f is onto, which function is guaranteed to be onto: f or g?

Answer: The outer function g is guaranteed to be onto.

05

Invertible Functions, Inverse Mapping & Reflection Symmetry across y = x

3 concepts · 1.5
3 nodes

What is the rigorous definition of an invertible function, why is bijectivity both necessary and sufficient for invertibility, and how does the line y = x govern inverse graphs?

A function f: X -> Y is defined to be Invertible if there exists a function g: Y -> X such that g o f = I_X (the identity function on X) and f o g = I_Y (the identity function on Y). When such a function g exists, it is unique and is denoted as f^(-1) (the inverse of f). The Fundamental Theorem of Invertibility establishes that a function f: X -> Y is invertible if and only if f is Bijective (both one-one and onto). If f is not one-one, its inverse would map a single input to multiple outputs, violating the definition of a function; if f is not onto, its inverse would be undefined for unmapped codomain elements. Key algebraic properties of inverses include: (1) Involution: (f^(-1))^(-1) = f; (2) Reversal Law: (g o f)^(-1) = f^(-1) o g^(-1); and (3) Domain-Range Inversion: Dom(f^(-1)) = Range(f) and Range(f^(-1)) = Dom(f). Geometrically, if (a, b) lies on the graph of y = f(x), then (b, a) must lie on the graph of y = f^(-1)(x). Therefore, the graph of y = f^(-1)(x) is the exact bilateral mirror reflection of the graph of y = f(x) across the diagonal line y = x.

01

Invertibility Criteria: Bijectivity and the Identity Composition

A function f: X -> Y is invertible if and only if there exists a function g: Y -> X such that g o f = I_X and f o g = I_Y. This function g is unique and called the inverse of f, denoted f^(-1). A function is invertible if and only if it is a Bijection.

Key Idea
f^(-1) cancels the effect of f: f^(-1)(f(x)) = x and f(f^(-1)(y)) = y.
Why It Works
If f is not one-one, f^(-1) would map one input to multiple outputs (violating function definition). If f is not onto, f^(-1) would have undefined inputs.
Boundary Trap
Confusing inverse function f^(-1)(x) with reciprocal 1/f(x): f^(-1)(x) is NOT 1/f(x)!
Application Note
f: R -> R, f(x) = 4x + 3. Define g(y) = (y - 3)/4. (g o f)(x) = (4x + 3 - 3)/4 = x = I_R. Thus f is invertible with f^(-1)(y) = (y - 3)/4.
Derivation Trace · Invertibility Criteria: Bijectivity and the Identity Composition
An inverse function is an 'undo' button: if f packs an object into a box, f^(-1) unpacks it back to its original state. To find the formula for f^(-1)(x), simply swap the variables x and y and solve for the new y. The geometric reflection across y = x occurs because swapping the roles of input and output swaps the Cartesian axes.
Proving Invertibility: To prove f is invertible in NCERT board examinations, students can either: Method A: Prove f is one-one and onto; or Method B: Propose a candidate function g(y), and explicitly verify that (g o f)(x) = x for all x in X and (f o g)(y) = y for all y in Y. Both methods are fully rigorous.
f^(-1)(x) vs 1/f(x): The notation f^(-1)(x) represents the INVERSE FUNCTION under composition, NEVER the algebraic reciprocal 1/f(x) = (f(x))^(-1). For instance, if f(x) = 2x, f^(-1)(x) = x/2, whereas 1/f(x) = 1/(2x). Only in trigonometric notation does historical ambiguity arise (sin^(-1) x = arcsin x != csc x).
See it in action: Plot functions, drag coordinates, fold the Cartesian plane along y = x, and watch f and f^(-1) overlay in the Invertible Functions Explorer.
🔬 VIRTUAL LAB Function Composition
Full Stage ↗
? Quick Concept Check

What is the condition for a function f: X -> Y to be invertible?

Answer: f must be both one-one and onto (a bijection).

02

Algebraic Protocol for Finding the Inverse Function f^(-1)(x)

To find f^(-1)(x): (1) Set y = f(x); (2) Solve the equation algebraically for x in terms of y, giving x = g(y); (3) Replace y with x to write f^(-1)(x) = g(x).

Key Idea
Solving for x in terms of y reverses the computational input-output flow of the function.
Why It Works
The equation y = f(x) is equivalent to x = f^(-1)(y) by definition of the inverse mapping.
Boundary Trap
Forgetting to swap the variable name back to x in the final answer: write f^(-1)(x) instead of leaving it as g(y).
Application Note
For f(x) = (4x + 3)/(6x - 4) on R - {2/3}: y = (4x + 3)/(6x - 4) => 6xy - 4y = 4x + 3 => x(6y - 4) = 4y + 3 => x = (4y + 3)/(6y - 4). Thus f^(-1)(x) = (4x + 3)/(6x - 4) = f(x).
Derivation Trace · Algebraic Protocol for Finding the Inverse Function f^(-1)(x)
An inverse function is an 'undo' button: if f packs an object into a box, f^(-1) unpacks it back to its original state. To find the formula for f^(-1)(x), simply swap the variables x and y and solve for the new y. The geometric reflection across y = x occurs because swapping the roles of input and output swaps the Cartesian axes.
Proving Invertibility: To prove f is invertible in NCERT board examinations, students can either: Method A: Prove f is one-one and onto; or Method B: Propose a candidate function g(y), and explicitly verify that (g o f)(x) = x for all x in X and (f o g)(y) = y for all y in Y. Both methods are fully rigorous.
f^(-1)(x) vs 1/f(x): The notation f^(-1)(x) represents the INVERSE FUNCTION under composition, NEVER the algebraic reciprocal 1/f(x) = (f(x))^(-1). For instance, if f(x) = 2x, f^(-1)(x) = x/2, whereas 1/f(x) = 1/(2x). Only in trigonometric notation does historical ambiguity arise (sin^(-1) x = arcsin x != csc x).
See it in action: Plot functions, drag coordinates, fold the Cartesian plane along y = x, and watch f and f^(-1) overlay in the Invertible Functions Explorer.
🔬 VIRTUAL LAB Function Composition
Full Stage ↗
? Quick Concept Check

What is the inverse of f(x) = (x - 1)/2?

Answer: y = (x - 1)/2 => 2y = x - 1 => x = 2y + 1. Thus f^(-1)(x) = 2x + 1.

03

Geometric Reflection Symmetry Across the Line y = x

The graph of y = f^(-1)(x) is the exact geometric reflection of the graph of y = f(x) across the diagonal line y = x. If point (a, b) lies on y = f(x), then point (b, a) lies on y = f^(-1)(x).

Key Idea
Swapping the roles of x and y reflects the curve across the 45-degree line y = x.
Why It Works
Reflecting across y = x maps the horizontal coordinate to the vertical coordinate and vice-versa, matching the mapping b = f(a) <=> a = f^(-1)(b).
Boundary Trap
Reflecting across the x-axis or y-axis instead of the line y = x.
Application Note
The graph of y = e^x reflected across y = x is y = ln(x). The graph of y = x^3 reflected across y = x is y = x^(1/3).
Derivation Trace · Geometric Reflection Symmetry Across the Line y = x
An inverse function is an 'undo' button: if f packs an object into a box, f^(-1) unpacks it back to its original state. To find the formula for f^(-1)(x), simply swap the variables x and y and solve for the new y. The geometric reflection across y = x occurs because swapping the roles of input and output swaps the Cartesian axes.
Proving Invertibility: To prove f is invertible in NCERT board examinations, students can either: Method A: Prove f is one-one and onto; or Method B: Propose a candidate function g(y), and explicitly verify that (g o f)(x) = x for all x in X and (f o g)(y) = y for all y in Y. Both methods are fully rigorous.
f^(-1)(x) vs 1/f(x): The notation f^(-1)(x) represents the INVERSE FUNCTION under composition, NEVER the algebraic reciprocal 1/f(x) = (f(x))^(-1). For instance, if f(x) = 2x, f^(-1)(x) = x/2, whereas 1/f(x) = 1/(2x). Only in trigonometric notation does historical ambiguity arise (sin^(-1) x = arcsin x != csc x).
See it in action: Plot functions, drag coordinates, fold the Cartesian plane along y = x, and watch f and f^(-1) overlay in the Invertible Functions Explorer.
🔬 VIRTUAL LAB Invertible Functions
Full Stage ↗
? Quick Concept Check

If (2, 5) lies on the graph of f(x), what point must lie on the graph of f^(-1)(x)?

Answer: The point (5, 2).

06

Binary Operations, Identity Elements, Inverses & Cayley Tables

3 concepts · 1.6
3 nodes

What formal axioms define a binary operation on a set, how are commutativity, associativity, identity, and inverse verified, and how are Cayley tables analyzed visually?

A Binary Operation * on a set A is a function *: A x A -> A. The output *(a, b) is written as a * b, and the requirement that a * b in A for all a, b in A is known as the Closure Property. A binary operation * on A is Commutative if a * b = b * a for all a, b in A; it is Associative if (a * b) * c = a * (b * c) for all a, b, c in A. An element e in A is called an Identity Element for * if a * e = e * a = a for all a in A (e.g., 0 for addition on R, 1 for multiplication on R). If an identity element exists, an element a in A is said to be Invertible with respect to * if there exists an element b in A such that a * b = b * a = e; the element b is the unique inverse of a, denoted as a^(-1). For a finite set A = {a1, a2, ..., an}, a binary operation is completely displayed via an n x n Operation Table (Cayley Table). In a Cayley table: (1) Commutativity is confirmed if and only if the table is symmetric about its main diagonal; (2) The identity element e is identified by locating the row and column that exactly duplicate the top and left header labels; and (3) The inverse of any element x is found by locating the cell containing e in the row of x and reading the corresponding column header. On a finite set of n elements, there are n^(n^2) total binary operations and n^(n(n+1)/2) commutative binary operations.

01

Binary Operation Definition and Closure Property

A binary operation * on a non-empty set A is a function * : A x A -> A. We denote *(a, b) by a * b. Closure requires that for all a, b in A, the result a * b must belong to A.

Key Idea
A binary operation takes any ordered pair of elements from A and outputs a UNIQUE element that stays inside A.
Why It Works
Closure ensures the algebraic system is self-contained under repeated operations.
Boundary Trap
Assuming standard operations are binary operations on any set: division '/' is NOT a binary operation on R because division by zero is undefined.
Application Note
Subtraction '-' is a binary operation on Z because a - b in Z for all a, b in Z. But subtraction is NOT a binary operation on N because 2 - 5 = -3 not in N.
Derivation Trace · Binary Operation Definition and Closure Property
A binary operation is an algebra machine that ingests an ordered pair of numbers and spits out a single number from the same playground (closure). Commutativity means you can switch who stands first without changing the outcome. An identity element is the 'do-nothing' element (like adding 0 or multiplying by 1). An inverse is the 'undo' element that cancels you out back to the do-nothing state.
Key Theorems in NCERT: Theorem 1: If an identity element exists for a binary operation, it is UNIQUE. Theorem 2: If an element is invertible with respect to an associative binary operation, its inverse is UNIQUE. Note that subtraction and division on R are NEITHER commutative NOR associative, and they do not possess identity elements.
Identity Must Work Both Ways: An element e is an identity element if and only if a * e = a AND e * a = a for ALL a in A. If a * e = a holds but e * a != a, e is merely a right identity, NOT a valid identity element! Similarly, inverses must satisfy a * b = b * a = e on both sides.
See it in action: Build custom operation tables, check main-diagonal symmetry, and verify identity rows in the Set Operations Explorer.
🔬 VIRTUAL LAB Function Composition
Full Stage ↗
? Quick Concept Check

Is division '/' a binary operation on the set of positive rational numbers Q+?

Answer: Yes, because the quotient of two positive rational numbers is always a unique positive rational number.

02

Commutativity and Associativity of Binary Operations

An operation * on A is: (1) Commutative if a * b = b * a for all a, b in A; (2) Associative if (a * b) * c = a * (b * c) for all a, b, c in A.

Key Idea
Associativity allows expressions like a * b * c to be written without parentheses.
Why It Works
Commutativity ensures sequence symmetry; associativity ensures grouping independence.
Boundary Trap
Assuming that commutativity implies associativity: on Z, a * b = a - b + ab is commutative if defined symmetrically, but subtraction itself is neither!
Application Note
On Q, define a * b = ab / 2. Commutative: a * b = ab/2 = ba/2 = b * a. Associative: (a * b) * c = (ab/2) * c = abc/4; a * (b * c) = a * (bc/2) = abc/4.
Derivation Trace · Commutativity and Associativity of Binary Operations
A binary operation is an algebra machine that ingests an ordered pair of numbers and spits out a single number from the same playground (closure). Commutativity means you can switch who stands first without changing the outcome. An identity element is the 'do-nothing' element (like adding 0 or multiplying by 1). An inverse is the 'undo' element that cancels you out back to the do-nothing state.
Key Theorems in NCERT: Theorem 1: If an identity element exists for a binary operation, it is UNIQUE. Theorem 2: If an element is invertible with respect to an associative binary operation, its inverse is UNIQUE. Note that subtraction and division on R are NEITHER commutative NOR associative, and they do not possess identity elements.
Identity Must Work Both Ways: An element e is an identity element if and only if a * e = a AND e * a = a for ALL a in A. If a * e = a holds but e * a != a, e is merely a right identity, NOT a valid identity element! Similarly, inverses must satisfy a * b = b * a = e on both sides.
See it in action: Build custom operation tables, check main-diagonal symmetry, and verify identity rows in the Set Operations Explorer.
🔬 VIRTUAL LAB Function Composition
Full Stage ↗
? Quick Concept Check

Is matrix multiplication on n x n matrices commutative?

Answer: No. In general, AB != BA for matrices.

03

Identity Element, Invertible Elements, and Cayley Tables

An element e in A is the Identity for * if a * e = e * a = a for all a in A. An element a in A is Invertible if there exists b in A such that a * b = b * a = e; b is called the inverse of a (a^(-1)). On a finite set, * is visualized via a Cayley table.

Key Idea
Identity element e is UNIQUE. If an inverse exists, it is also UNIQUE.
Why It Works
If e1 and e2 are identities, e1 = e1 * e2 = e2. Uniqueness provides a fixed anchor for the entire algebraic structure.
Boundary Trap
Finding an element that works only on one side (e.g. a * e = a but e * a != a): an identity must work from BOTH left and right!
Application Note
For a * b = ab/2 on Q - {0}: Identity e satisfies a * e = ae/2 = a => e = 2. Inverse of a satisfies a * b = ab/2 = 2 => b = 4/a.
Derivation Trace · Identity Element, Invertible Elements, and Cayley Tables
A binary operation is an algebra machine that ingests an ordered pair of numbers and spits out a single number from the same playground (closure). Commutativity means you can switch who stands first without changing the outcome. An identity element is the 'do-nothing' element (like adding 0 or multiplying by 1). An inverse is the 'undo' element that cancels you out back to the do-nothing state.
Key Theorems in NCERT: Theorem 1: If an identity element exists for a binary operation, it is UNIQUE. Theorem 2: If an element is invertible with respect to an associative binary operation, its inverse is UNIQUE. Note that subtraction and division on R are NEITHER commutative NOR associative, and they do not possess identity elements.
Identity Must Work Both Ways: An element e is an identity element if and only if a * e = a AND e * a = a for ALL a in A. If a * e = a holds but e * a != a, e is merely a right identity, NOT a valid identity element! Similarly, inverses must satisfy a * b = b * a = e on both sides.
See it in action: Build custom operation tables, check main-diagonal symmetry, and verify identity rows in the Set Operations Explorer.
🔬 VIRTUAL LAB Invertible Functions
Full Stage ↗
? Quick Concept Check

What is the identity element for addition '+' on integers Z?

Answer: 0, because a + 0 = 0 + a = a for all integers a.