1. Fix the underlying set or universal set first
Every set operation depends on a declared universe.
Identify the underlying set, or the universal set for a complement, before converting a description into explicit elements or conditions.
JEE · Mathematics
Understand sets, set operations and relations, determine relation properties, and recognise when a relation is an equivalence relation.
Content status: draft. Verified academic content for this page has not been loaded yet, so the page is excluded from search indexing and the sitemap.
In short
Sets describe collections of objects. Relations describe which ordered pairs of objects satisfy a chosen condition.
Solve these questions by first fixing the universe and representation, then performing the required set operation or testing the relation separately for reflexivity, symmetry and transitivity.
Official JEE documents define content scope. They do not publish chapter weightage, so none is asserted here.
Sources: JEE Main 2026 syllabus and JEE Advanced 2026 syllabus, linked in the sources section below.
Every set operation depends on a declared universe.
Identify the underlying set, or the universal set for a complement, before converting a description into explicit elements or conditions.
Union, intersection, difference and complement are distinct operations with distinct traps.
For set questions, select union, intersection, difference or complement based on the wording, and keep the declared universal set fixed throughout a complement calculation.
A relation from A to B is any subset of A × B; a relation on A is a subset of A × A.
For relation questions, identify the ordered pairs directly when the relation is given explicitly, or identify the defining rule when it is given by a condition.
Never infer equivalence from only two of the three conditions.
Reflexive requires (a,a) in R for every a in A. Symmetric requires that (a,b) in R implies (b,a) in R. Transitive requires that (a,b) and (b,c) in R imply (a,c) in R. All three must be verified independently before calling a relation an equivalence relation.
Problem: on A = {1,2,3,4}, define aRb when a and b have the same parity. Determine whether R is an equivalence relation. A has two odd and two even elements.
Method choice: the relation is rule-defined, so test all three equivalence conditions rather than inspecting individual pairs only.
Therefore R is an equivalence relation. Its equivalence classes are {1,3} and {2,4}. Validity check: the classes are disjoint and together cover A.
Every record's validity condition must stay adjacent to the statement when this table is displayed.
Treating A \ B and B \ A as equal.
Execution errorWhy it happens
Set difference depends on order; A \ B contains elements in A but not in B, which is generally a different set from B \ A.
How it is corrected
Rewrite the difference as A ∩ Bᶜ relative to the declared universal set and check direction before simplifying.
Taking a complement without declaring the universal set U.
Knowledge gapWhy it happens
A complement is only defined relative to a declared universal set; without it the complement is ambiguous.
How it is corrected
State the universal set explicitly before computing any complement.
Checking symmetry only for one pair instead of the general case.
Execution errorWhy it happens
Symmetry must hold for every pair in the relation, not just one example pair.
How it is corrected
Prove symmetry algebraically for an arbitrary pair (a,b) in R, not for a single numeric example.
Assuming reflexive from the existence of some diagonal pairs.
Decision / selection errorWhy it happens
Reflexivity requires (a,a) in R for every a in A, not merely for some elements.
How it is corrected
Check the diagonal pair for every element of A before concluding reflexivity.
Confusing symmetric with transitive.
Knowledge gapWhy it happens
Symmetric concerns reversing a single pair; transitive concerns chaining two pairs into a third. They are independent conditions.
How it is corrected
State each definition separately and verify each with its own argument.
Calling a relation an equivalence relation before all three tests pass.
Decision / selection errorWhy it happens
An equivalence relation requires reflexive, symmetric and transitive together; passing two conditions is not sufficient.
How it is corrected
Complete and record all three checks before naming the relation an equivalence relation.
FAQ
Straight answers about how Rank Sarthi fits into serious exam preparation.
A relation that is reflexive, symmetric and transitive, all three verified together, is an equivalence relation.
A set is a well-defined collection of distinct objects. A relation from A to B is a subset of the Cartesian product A × B, describing which ordered pairs satisfy a chosen condition.
(A ∪ B)ᶜ = Aᶜ ∩ Bᶜ and (A ∩ B)ᶜ = Aᶜ ∪ Bᶜ, with all complements taken relative to the same declared universal set. These are explicit JEE Advanced 2026 syllabus wording.
Reflexive when (a,a) is in R for every a in A; symmetric when (a,b) in R implies (b,a) in R; transitive when (a,b) and (b,c) in R imply (a,c) in R.
Use verified NTA or JEE Advanced questions only after matching year, paper and question. Do not show chapter frequency or PYQ totals without an audited dataset.
Contributor requirements for this page