JEE · Mathematics

Sets and Relations

Understand sets, set operations and relations, determine relation properties, and recognise when a relation is an equivalence relation.

Subject
Mathematics
Syllabus unit
Sets, Relations and Functions
  • Listed in both JEE Main 2026 and JEE Advanced 2026
  • Equivalence relation requires all three properties, never two
  • No invented weightage, question counts or trend percentages

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.

Syllabus mapping

  • Unit
    Sets, Relations and Functions
    Topics
    Set representation, union, intersection, complement, power set, Relations, types of relations, equivalence relations, Cartesian product of finite sets (explicit Advanced wording), De Morgan's laws (explicit Advanced wording), Domain and codomain of a relation

What this chapter contains and why it matters

  • Question
    What is the chapter about?
    Direct answer
    Set representation and operations, and relation properties up to equivalence relations, for both the JEE Main 2026 and JEE Advanced 2026 Mathematics syllabus.
  • Question
    What is the central method choice?
    Direct answer
    Fix the universe and representation, then perform the required set operation or test the relation for reflexivity, symmetry and transitivity.
  • Question
    Where do most mistakes begin?
    Direct answer
    Treating A\B and B\A as equal, taking a complement without declaring the universal set, and calling a relation equivalence before all three tests pass.
  • Question
    What should come before this chapter?
    Direct answer
    No Functions knowledge is assumed; basic symbolic notation, equality and inequality, logical statements and ordered pairs are sufficient.
  • Question
    What comes after it?
    Direct answer
    Functions builds directly on sets and relations; Probability uses set-based reasoning further along the syllabus.

Official JEE documents define content scope. They do not publish chapter weightage, so none is asserted here.

Official JEE syllabus mapping for Sets and Relations

  • Concept group
    Set representation and operations
    JEE Main 2026
    Explicitly includes set representation, union, intersection, complement and power set.
    JEE Advanced 2026
    Explicitly includes finite and infinite sets, set algebra, intersection, complement, difference and symmetric difference.
    Preparation note
    Both papers cover core set operations; treat symmetric difference as explicit Advanced-wording detail.
  • Concept group
    Cartesian product
    JEE Main 2026
    Not named as an individually explicit Main syllabus bullet.
    JEE Advanced 2026
    Explicitly includes Cartesian products of finite sets.
    Preparation note
    Do not describe Cartesian product as an explicit Main bullet even though it is used to define relations.
  • Concept group
    De Morgan's laws
    JEE Main 2026
    Not named as an individually explicit Main syllabus bullet.
    JEE Advanced 2026
    Explicitly listed.
    Preparation note
    Keep this distinction visible when teaching complements of unions and intersections.
  • Concept group
    Relations and equivalence relations
    JEE Main 2026
    Explicitly includes relations, types of relations and equivalence relations.
    JEE Advanced 2026
    Explicitly includes relations, domain and codomain, and equivalence relations.
    Preparation note
    Test reflexive, symmetric and transitive separately for every relation question in either paper.

Sources: JEE Main 2026 syllabus and JEE Advanced 2026 syllabus, linked in the sources section below.

Before this chapter

Concepts in this chapter

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.

2. Select the correct set operation

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.

3. Identify the relation as pairs or as a rule

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.

4. Test reflexive, symmetric and transitive separately

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.

Method selector

  • Question signal
    Membership or set-algebra question
    First model
    Element-wise reasoning or a named identity
  • Question signal
    Venn-style finite question
    First model
    Partition the universe before counting
  • Question signal
    Relation given by pairs
    First model
    Inspect ordered pairs directly
  • Question signal
    Relation given by a rule
    First model
    Prove each required property algebraically
  • Question signal
    Equivalence question
    First model
    Test reflexive, symmetric and transitive separately

Worked reasoning: parity relation on a finite set

Testing all three properties 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.

  • Reflexive: every integer has the same parity as itself.
  • Symmetric: if a has the same parity as b, then b has the same parity as a.
  • Transitive: if a and b have the same parity, and b and c have the same parity, then a and c have the same parity.

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.

Formula and theorem records

  • Record
    De Morgan 1
    Statement
    (A ∪ B)ᶜ = Aᶜ ∩ Bᶜ
    Conditions
    Complements taken relative to the same universal set
    Use when
    Negating a union
    Trap
    Changing the universal set midway through the problem
  • Record
    De Morgan 2
    Statement
    (A ∩ B)ᶜ = Aᶜ ∪ Bᶜ
    Conditions
    Same universal set
    Use when
    Negating an intersection
    Trap
    Confusing union and intersection
  • Record
    Difference
    Statement
    A \ B = A ∩ Bᶜ
    Conditions
    Complement relative to the declared universal set U
    Use when
    Rewriting differences
    Trap
    Forgetting the direction of the difference
  • Record
    Symmetric difference
    Statement
    A Δ B = (A\B) ∪ (B\A)
    Conditions
    Standard set definition
    Use when
    Advanced set algebra
    Trap
    Treating common elements of A and B as included
  • Record
    Cartesian product size
    Statement
    |A × B| = |A| × |B|
    Conditions
    A and B finite
    Use when
    Counting ordered pairs
    Trap
    Using it for infinite cardinalities without further context

Every record's validity condition must stay adjacent to the statement when this table is displayed.

Common mistakes and what they actually indicate

  • Treating A \ B and B \ A as equal.

    Execution error

    Why 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 gap

    Why 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 error

    Why 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 error

    Why 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 gap

    Why 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 error

    Why 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

Sets and Relations — questions

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.

Sources and provenance

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

  • Written by: unassigned. Ideal author type: Mathematics education editor.
  • Academically reviewed by: unassigned. Reviewer specialisation: algebra, discrete mathematics and JEE Mathematics. Minimum qualification: postgraduate qualification in Mathematics, Applied Mathematics or equivalent.
  • Review scope: notation, relation definitions, De Morgan conditions, equivalence proofs, scope labels and the worked example.