Reflexive, Symmetric, Transitive & Beyond — Every NCERT Solution Explained
Exercise 1.1
Types of relations — reflexive, symmetric, transitive, equivalence
Exercise 1.2
Types of functions — one-one, onto, bijective
Exercise 1.3
Composition of functions; invertible functions
Miscellaneous
Mixed relations, functions and invertibility proofs
4 exercise files · 61 total questions
\(R \text{ equivalence} \iff R \text{ reflexive, symmetric, transitive}\)\(f:A\to B \text{ one-one} \iff f(x_1)=f(x_2)\Rightarrow x_1=x_2\)\(f:A\to B \text{ onto} \iff \forall y\in B,\ \exists x\in A: f(x)=y\)\(f \text{ invertible} \iff f \text{ is bijective}\)\((g\circ f)(x) = g(f(x))\)Step 1 — For relations: check reflexive (every a~a), symmetric (a~b⇒b~a), transitive (a~b,b~c⇒a~c) one at a time; never assume all three from one. Step 2 — For functions: prove one-one by assuming f(x1)=f(x2) and deriving x1=x2. Step 3 — Prove onto by taking arbitrary y in codomain and solving for x in domain. Step 4 — Invertibility: confirm bijective first, then construct f⁻¹ algebraically and verify f∘f⁻¹=I.
Get in Touch
Questions, feedback, or suggestions?
We'd love to hear from you.