Relations

Before functions, before graphs, before calculus — there is the humble idea of a relation. Every time you say "x is the father of y" or "x is greater than y", you are silently picking out some ordered pairs and ignoring the rest. JEE Main expects you to formalise that intuition and count the possibilities precisely.

Definition: A relation R from a set A to a set B is any subset of the Cartesian product A x B. If the ordered pair (a, b) belongs to R, we write aRb and read it as "a is related to b".

Definition: The Cartesian product A x B is the set of all ordered pairs (a, b) where a comes from A and b comes from B.

What "any subset" really means

The power of the definition lies in the word "any". A relation does not need a formula. It does not need a pattern. It can be the empty subset (no element of A is related to anything — the void relation), or the full A x B (every a relates to every b — the universal relation), or anything in between. The only requirement is that R consists of ordered pairs whose first entry is from A and second entry is from B.

So if A = {1, 2} and B = {p, q}, then A x B = {(1,p), (1,q), (2,p), (2,q)}. Each of these four pairs is either "in" R or "out" of R — like a four-bit switch. That gives 2^4 = 16 possible relations from A to B, from the empty relation up to all of A x B.

Why it matters: This single combinatorial fact — "each pair is in or out" — is the engine behind almost every counting question on relations in JEE. Internalise it once, and the formulas below stop feeling like memorisation.

Domain, range and codomain

Definition: The domain of a relation R is the set of all first coordinates of the pairs that appear in R.

Definition: The range of R is the set of all second coordinates that appear in R.

Definition: The codomain of R is the entire target set B, whether or not every element of B actually shows up.

The distinction between range and codomain trips up many aspirants. Range is what is achieved; codomain is what is available. Range is always a subset of codomain, but the two are equal only when R is "onto" in the function sense. For example, if A = {1, 2, 3}, B = {a, b, c, d}, and R = {(1,a), (2,a), (3,b)}, then the domain is {1, 2, 3}, the range is {a, b}, and the codomain is {a, b, c, d}.

The counting formulas you must own

For a relation from A to B with |A| = m and |B| = n:

• |A x B| = mn
• Total number of relations from A to B = 2^(mn)
• Total number of relations on a single set A with |A| = n = 2^(n^2) (because we count subsets of A x A, and |A x A| = n^2)

These follow from the same "each pair: in or out" idea applied to mn or n^2 pairs respectively.

A worked counting example

Question: Let A = {1, 2, 3} and B = {x, y}. How many relations from A to B contain the pair (1, x) but do not contain (2, y)?

Solution:
Step 1: |A x B| = 3 x 2 = 6. The six pairs are (1,x), (1,y), (2,x), (2,y), (3,x), (3,y).
Step 2: We force (1,x) IN and (2,y) OUT — two pairs are fixed. The remaining 6 - 2 = 4 pairs are free.
Step 3: Each of the 4 free pairs is independently in or out, giving 2^4 = 16 relations.
Conclusion: There are 16 such relations.

The same "freeze some pairs, count the rest" trick handles almost every JEE counting question on relations.

Relations versus functions

Every function from A to B is a relation, but not every relation is a function. A relation is a function when each element of the domain A appears as the first coordinate of exactly one ordered pair. Many JEE questions sneak in this filter: "how many functions" instead of "how many relations". The counting answer changes from 2^(mn) to n^m, because each of the m elements of A must independently choose one of the n elements of B.

Real-world example: In an Indian census database, "x lives in district y" is a relation between people and districts. Each person lives in exactly one district, so this particular relation is also a function. But "x has visited district y" is only a relation — one person can map to many districts — so the function-counting formula no longer applies.

Common misconception: Students often confuse domain with the entire set A. If A = {1, 2, 3} but R = {(1, a), (1, b)}, the domain of R is just {1}, not {1, 2, 3}. The set A is sometimes called the co-domain of the first coordinate or simply "the set from which R is drawn", but the domain is the actual collection of first coordinates that appear in R.

Why JEE loves this topic

Relations are the foundation on which functions, equivalence classes, and partial orders rest. By forcing you to count subsets of A x A, JEE quietly trains you in combinatorics, binary thinking, and careful reading. A typical paper asks: "If A has 3 elements, how many reflexive relations are there on A?" The answer uses the same in-or-out idea: 3 reflexive pairs (1,1), (2,2), (3,3) are forced IN, and the other 9 - 3 = 6 pairs are free, giving 2^6 = 64.

Every NEET aspirant who has ever opened NCERT Class 11 Chapter 10 has seen the same diagram — two homologous chromosomes lying side by side, with a cross-shaped link between non-sister chromatids. That little X is called a chiasma, and the event that produces it — crossing over — is arguably the single most important reason you do not look like a clone of one of your parents. Master this stage and you have unlocked half of all NEET questions on meiosis.

Definition: Meiosis is a special type of cell division in diploid (2n) reproductive cells that produces four haploid (n) daughter cells, each genetically distinct from the parent, and is essential for sexual reproduction.
Definition: Crossing over is the reciprocal exchange of genetic material between non-sister chromatids of homologous chromosomes during Prophase I of meiosis.
Definition: A chiasma (plural: chiasmata) is the visible X-shaped point at which two non-sister chromatids remain attached after crossing over has taken place.

The five sub-stages of Prophase I — memorise the order

Prophase I of meiosis I is long and elaborate. NCERT splits it into five sub-stages, in this fixed order: Leptotene → Zygotene → Pachytene → Diplotene → Diakinesis. NEET examiners love to test "which event happens in which sub-stage", so the mapping matters.

• Leptotene: chromosomes start condensing and become visible as thin threads.
• Zygotene: synapsis begins — homologous chromosomes pair up, forming the synaptonemal complex. Each pair is now called a bivalent or tetrad (four chromatids in close apposition).
• Pachytene: crossing over occurs. This is the headline event.
• Diplotene: the synaptonemal complex dissolves, homologues begin to separate, and the chiasmata become visible as the X-shaped points of crossover.
• Diakinesis: chromosomes condense fully, chiasmata terminalise (slide to the ends), and the cell is ready for metaphase I.

The classic NEET trap: "When does crossing over occur?" Answer — Pachytene. "When are chiasmata first seen?" Answer — Diplotene. The events are sequential, not simultaneous. Mix them up and you lose a one-mark question every time.

The molecular machinery — what NCERT actually expects

Crossing over is not a random tangle; it is a precisely orchestrated, enzyme-catalysed exchange. The key players NCERT names are:

• Recombination nodules — protein assemblies that sit at specific points along the paired homologues and mark the sites where crossover will happen.
• Recombinase enzyme — the enzyme that cuts and rejoins the DNA strands so that a stretch from one chromatid is welded onto its non-sister partner, and vice versa.
• The synaptonemal complex — a ladder-like protein structure that holds the homologues in perfect register so that the cut-and-paste is reciprocal (each chromatid loses what the other gains, no DNA is lost overall).

Note carefully: crossing over happens between non-sister chromatids of homologous chromosomes, not between sister chromatids of the same chromosome (which would change nothing — sisters are identical) and not between non-homologous chromosomes (which would be a translocation, a chromosomal mutation).

The significance of meiosis — the two big functions

NCERT puts these in bold and so does NEET.

1. Maintenance of chromosome number across generations

Without meiosis, gametes would carry the same chromosome number as somatic cells (2n), and after fertilisation the zygote would be 4n. The next generation would be 8n, then 16n, and the genome would balloon out of control within a few generations. Meiosis halves the chromosome number in gametes (2n → n), and fertilisation restores it (n + n = 2n). This is why humans always stay at 46 chromosomes generation after generation.

2. Generation of genetic variation

This is the engine of evolution. Meiosis creates variation in two independent ways:

• Crossing over (Pachytene of Prophase I) — physically shuffles maternal and paternal alleles between homologous chromosomes. After crossing over, no chromatid is purely "from mom" or "from dad" any more; each is a mosaic.
• Independent assortment (Metaphase I) — each bivalent orients on the spindle independently, so any combination of maternal and paternal chromosomes can end up in a daughter cell. With 23 human bivalents, that alone gives 2^23 ≈ 8.4 million combinations, before crossing over multiplies the figure further.

The product: every sperm or egg you make is genetically unique. Siblings are not clones precisely because of this combinatorial machinery.

Where and when does meiosis occur?

In animals, meiosis happens in the gamete mother cells (spermatogonia and oogonia) during gametogenesis, producing sperm and ova. In plants, it happens in spore mother cells during sporogenesis, producing microspores (which become pollen) and megaspores (which become the embryo sac). In both cases the starting cell is diploid; the four products are haploid.

Why it matters: Roughly 4–5 NEET questions every year come from meiosis — many target the exact sub-stage of an event, the names of the molecular players, or the calculation of variation. Knowing crossing over = Pachytene and chiasmata = Diplotene alone has fetched students an easy mark in NEET 2020, 2022 and 2023.

Real-world example: The reason a brother and sister born to the same Indian parents can look strikingly different — one tall with curly hair, the other short with straight hair — is meiosis. Each parent's spermatogonia and oogonia underwent crossing over and independent assortment, producing gametes with countless allele combinations. The genetic lottery that meiosis runs is what makes every child (except identical twins) a one-of-a-kind individual.

Common misconception: "Crossing over occurs in mitosis too." No. Mitosis produces genetically identical daughter cells; there is no homologue pairing, no synaptonemal complex, no chiasmata. Crossing over is strictly a meiosis-I, Pachytene event.

A second misconception: "Crossing over creates new genes." It does not. It rearranges existing alleles into new combinations. The creation of brand-new alleles requires mutation, a different process altogether.

Question: In a human spermatogonium undergoing meiosis, name (a) the sub-stage where homologues pair, (b) the sub-stage where crossing over occurs, (c) the sub-stage where chiasmata are first clearly visible, and (d) the structure that holds the homologues together during synapsis.

Solution:
Step 1: Pairing of homologues = synapsis = Zygotene.
Step 2: Crossing over = Pachytene.
Step 3: Chiasmata first clearly visible = Diplotene.
Step 4: The structure of synapsis = synaptonemal complex.
Conclusion: Zygotene → Pachytene → Diplotene is the consecutive order, and the synaptonemal complex is the protein scaffold that makes the precision of crossing over possible.

Equivalence relations look abstract on the page but they are really just a clean way of saying "split a set into baskets where the things in the same basket are treated as the same". Once you see them through that lens — partitions, not pairs — JEE Main questions on this chapter become much faster.

Definition: A relation R on a set A is an equivalence relation if it is reflexive (aRa for every a), symmetric (aRb implies bRa), and transitive (aRb and bRc imply aRc).

Definition: An equivalence class of a, written [a], is the set of all elements of A that are related to a. Two elements are in the same class precisely when they are R-related.

Definition: A partition of a set A is a collection of non-empty subsets of A such that every element of A belongs to exactly one of these subsets (the subsets are mutually disjoint and their union is A).

The fundamental theorem you must internalise

Every equivalence relation on a set A produces a partition of A into equivalence classes, and conversely every partition of A defines an equivalence relation (declare aRb iff a and b are in the same block). This is one of the most important "moral" results in Class 12 Relations and Functions, and JEE Main repeatedly tests it in disguised forms — most often by asking you to count equivalence relations on a small set.

The reason the partition picture is so useful is that two equivalence classes are either identical or disjoint — they never partially overlap. So counting equivalence relations on a finite set becomes the same as counting partitions of that set, which is much easier than wrestling with ordered pairs.

The classic congruence-modulo-5 example

Define a relation R on the set of integers Z by: a R b if and only if (a − b) is divisible by 5.

Reflexive: for any integer a, a − a = 0, and 0 is divisible by 5. So aRa.

Symmetric: if 5 | (a − b), then 5 | −(a − b) = (b − a). So bRa.

Transitive: if 5 | (a − b) and 5 | (b − c), then 5 | [(a − b) + (b − c)] = (a − c). So aRc.

All three checks pass, so R is an equivalence relation. The equivalence classes are determined by the remainder when an integer is divided by 5:

[0] = {…, −10, −5, 0, 5, 10, …} — integers leaving remainder 0
[1] = {…, −9, −4, 1, 6, 11, …} — integers leaving remainder 1
[2] = {…, −8, −3, 2, 7, 12, …} — integers leaving remainder 2
[3] = {…, −7, −2, 3, 8, 13, …} — integers leaving remainder 3
[4] = {…, −6, −1, 4, 9, 14, …} — integers leaving remainder 4

Every integer belongs to exactly one of these five classes. This is the partition of Z corresponding to "congruence modulo 5", written Z/5Z or simply Z_5. The same idea is the bedrock of modular arithmetic used later in Number Theory and even in cryptography. JEE writes this relation as a R b iff a is equivalent to b (mod 5).

A counting question of the JEE Main flavour

Question: How many equivalence relations on A = {1, 2, 3} contain the pair (1, 2)?

Solution:
Step 1: Reframe the problem. An equivalence relation on A corresponds uniquely to a partition of A. Saying that the relation contains (1, 2) means that 1 and 2 sit in the same block of the partition.
Step 2: List all partitions of {1, 2, 3} where 1 and 2 are together.

• Partition P1: blocks {1, 2} and {3}. Two blocks total.
• Partition P2: block {1, 2, 3}. One block.
  Step 3: No other partition keeps 1 and 2 in the same block — once you separate them, the condition fails.
  Conclusion: There are exactly 2 equivalence relations on A that contain (1, 2).

Notice how the partition view collapsed a complicated counting question into a quick two-line check. If you had instead tried to list ordered pairs by hand and verify reflexivity, symmetry and transitivity for each candidate, you could have spent ten minutes — and still missed cases.

A look-up table you should know cold (Bell numbers)

The total number of equivalence relations on a set with n elements is the Bell number B_n. JEE Main expects you to know at least the first five:

If a question asks "how many equivalence relations on {1, 2, 3, 4} contain (1, 2)?", note that you are partitioning {1, 2, 3, 4} with 1 and 2 forced into the same block — equivalent to partitioning a 3-element set {[12], 3, 4}, which gives B_3 = 5.

Why it matters

Equivalence relations sit at the centre of Class 12 Relations and Functions, and at least one JEE Main question almost every year is built on this theme — sometimes pure counting, sometimes verification of the three properties on a relation defined on R, Z, or N. They also reappear at the start of group theory, linear algebra (cosets, quotient spaces) and topology in BTech, so the time invested now pays off well beyond the entrance exam.

Real-world example: When the Indian Railways categorises every train in the country by gauge (broad gauge, metre gauge, narrow gauge), it is implicitly using an equivalence relation on the set of all railway lines. Two lines are "equivalent" if they have the same gauge. This relation is reflexive (every line has the same gauge as itself), symmetric (if line X has the same gauge as line Y, then Y has the same as X), and transitive. The equivalence classes are exactly the gauge categories. The fact that a broad-gauge coach can be moved onto any broad-gauge track — but not a metre-gauge track — is the partition at work in real engineering.

Common misconception: "If a relation is reflexive and symmetric, it must be transitive too." This is wrong, and JEE Main loves to test it. Consider A = {1, 2, 3} and R = {(1,1),(2,2),(3,3),(1,2),(2,1),(2,3),(3,2)}. This is reflexive and symmetric — but (1, 2) and (2, 3) are both in R, yet (1, 3) is not, so transitivity fails. You must check all three properties independently. Reflexive + symmetric is not enough.

Cover the answer, recall, then check. 11 cards on relations for JEE Main.

Q1. Define a relation from A to B.
A1. Any subset of the Cartesian product A×B. A relation ON A is a subset of A×A.

Q2. Total number of relations on a set with n elements?
A2. 2^(n²), since A×A has n² ordered pairs and each is in or out.

Q3. Conditions for reflexive, symmetric, transitive.
A3. Reflexive: (a,a)∈R ∀a. Symmetric: (a,b)∈R ⇒ (b,a)∈R. Transitive: (a,b),(b,c)∈R ⇒ (a,c)∈R.

Q4. What is an equivalence relation?
A4. A relation that is reflexive, symmetric AND transitive. It partitions the set into disjoint equivalence classes.

Q5. Number of reflexive relations on an n-element set?
A5. 2^(n²−n). The n diagonal pairs (a,a) are forced in; the remaining n²−n pairs are free.

Q6. Number of symmetric relations on an n-element set?
A6. 2^(n(n+1)/2).

Q7. Number of equivalence relations on a set = ?
A7. The Bell number Bₙ (= number of partitions). B₁=1, B₂=2, B₃=5, B₄=15.

Q8. Is the empty relation on a non-empty set reflexive?
A8. No. It is symmetric and transitive (vacuously) but NOT reflexive, so it is not an equivalence relation.

Q9. Define antisymmetric.
A9. (a,b)∈R and (b,a)∈R ⇒ a=b. (Partial orders are reflexive, antisymmetric, transitive.)

Q10. Inverse of a relation R?
A10. R⁻¹ = {(b,a) : (a,b)∈R}. Domain(R⁻¹)=Range(R) and Range(R⁻¹)=Domain(R).

Q11. On ℤ, is R = {(a,b): a−b is divisible by m} an equivalence relation?
A11. Yes — congruence mod m is reflexive, symmetric, transitive; classes are the m residue classes.

Relations bridge sets and functions, and in JEE Main they appear as a "counting" or "classify the relation" question (about 1 question every couple of years, often merged with functions). The frequently-tested skill is deciding which of reflexive / symmetric / transitive a given relation satisfies, or counting relations of a certain type.

The core idea

A relation from A to B is a subset of A×B; a relation on A is a subset of A×A. Since A×A has n² pairs, there are 2^(n²) relations in all. Special properties restrict which pairs must appear.

Key results

Type	Defining condition	Count on n-set
All relations	any subset of A×A	2^(n²)
Reflexive	(a,a)∈R for all a	2^(n²−n)
Symmetric	(a,b)⇒(b,a)	2^(n(n+1)/2)
Equivalence	refl + symm + trans	Bell number Bₙ

Equivalence relation = reflexive + symmetric + transitive; it partitions the set into disjoint equivalence classes. Congruence mod m on ℤ is the classic example.

Exam Tricks & Tips

• 🎯 To DISPROVE a property, one counterexample pair is enough — hunt for it before attempting a proof.
• 🎯 Reflexive count 2^(n²−n): the n diagonal pairs are fixed, the rest are free. Derive it rather than memorising if you forget.
• 🎯 The empty relation on a non-empty set is symmetric and transitive but not reflexive — a favourite trap.
• 🎯 A relation can be symmetric AND antisymmetric simultaneously (e.g. the identity relation) — they are not opposites.
• 🎯 For "is it transitive?", check every chain a→b→c; missing (a,c) even once kills transitivity.
• ❌ Common mistake: assuming symmetric + transitive ⇒ reflexive. False — the empty relation is a counterexample.

Expected exam pattern

Either a single-statement classification ("R defined by … is: reflexive only / equivalence / …") or a count ("number of symmetric relations on {1,2,3}"). Difficulty is low–medium; the trap is careless property-checking, not hard algebra.

Quick recap

2^(n²) relations total; reflexive 2^(n²−n); symmetric 2^(n(n+1)/2). Equivalence = R+S+T and partitions the set. Disprove with one counterexample; beware the empty-relation trap.