Back to ShikshaPal ExplainerClass 12 / Math
ShikshaPal
Class 12 · Math

Relations and Functions

Relations and functions form the foundational language of mathematics, extending the concepts you learned in Class 11.

Feynman Lens

Start with the simplest version: this lesson is about Relations and Functions. If you can explain the core idea to a friend using everyday language, examples, and one clear reason why it matters, you have moved from memorising to understanding.

Relations and functions form the foundational language of mathematics, extending the concepts you learned in Class 11. Think of a relation as any connection between two sets of objects, while a function is a special type of relation where each input has exactly one output—like a vending machine that always gives the same product for the same button. This chapter explores how to determine when a relation qualifies as a function, how to verify if functions have inverses, and what properties make functions invertible.

Understanding Relations and Functions

A relation from set A to set B is simply a collection of ordered pairs (a, b) where a ∈ A and b ∈ B. Imagine a class roster: the relation might connect student names to their roll numbers. Not every student-number pair appears—that's the nature of relations.

A function f: A → B is a special relation where each element in A (the domain) connects to exactly one element in B (the codomain). The set of all actual outputs is called the range, which may be smaller than the codomain. Here's the key analogy: if a relation were a group chat where one person can message multiple people, a function would be a one-way delivery system where each letter arrives at exactly one address.

Building from Class 11

In Class 11, you studied functions like f(x) = x², f(x) = sin(x), and polynomial functions. You learned about domain and range. Now we ask: Can we reverse these functions? If f takes us from A to B, does f⁻¹ exist to take us back from B to A?

The answer depends on two properties:

When both properties hold, the function is bijective, and its inverse exists.

Key Concepts and Techniques

Types of Functions

Verifying Inverse Existence

For f: A → B to have an inverse f⁻¹: B → A:

  1. Check if f is bijective (one-one and onto)
  2. If yes, then f⁻¹(f(x)) = x and f(f⁻¹(y)) = y for all x ∈ A, y ∈ B

Operations on Functions

Real-World Connections

The function concept appears everywhere: temperature conversion (°C ↔ °F), medical dosage as a function of body weight, or economic models where output depends on input factors. Understanding invertibility matters when you need to reverse a process—decoding a message, finding original prices before markup, or calculating medication concentration from observed effects.

Connections to Other Topics

Socratic Questions

  1. If a function f is one-one but not onto, why doesn't the inverse f⁻¹ exist as a function from the codomain back to the domain? What would you need to do to make it exist?
  1. Consider the function f(x) = x² on the domain of all real numbers. Why is it not invertible? How does restricting the domain to [0, ∞) change this situation?
  1. When you compose two functions f and g to get f ∘ g, does the order matter? That is, is f ∘ g always equal to g ∘ f? Can you provide examples to support your reasoning?
  1. In the context of trigonometric functions like sin(x), which are not one-one over their entire domain, how do mathematicians create inverse functions? What domain restrictions are necessary, and why?
  1. If you know that f(3) = 7 and f⁻¹(7) = 3, what does this tell you about the relationship between the domain of f and the range of f⁻¹?

Term / Concept
Relation (set-theoretic)
tap to flip
A relation R from set A to set B is any subset of A × B; it is a collection of ordered pairs (a, b).
Term / Concept
Function f: A → B
tap to flip
A relation in which every element of A (domain) is paired with exactly one element of B (codomain).
Term / Concept
One-one (Injective)
tap to flip
f is one-one if f(x₁) = f(x₂) ⇒ x₁ = x₂; distinct inputs give distinct outputs.
Term / Concept
Onto (Surjective)
tap to flip
f: A → B is onto if every y ∈ B is the image of some x ∈ A, i.e. range = codomain.
Term / Concept
Bijective Function
tap to flip
A function that is both one-one and onto; bijective ⇔ invertible.
Term / Concept
Equivalence Relation
tap to flip
A relation that is reflexive, symmetric, and transitive; it partitions the set into equivalence classes.
Term / Concept
Composition (g ∘ f)
tap to flip
(g ∘ f)(x) = g(f(x)); apply f first, then g. In general g ∘ f ≠ f ∘ g.
Term / Concept
Inverse f⁻¹
tap to flip
If f: A → B is bijective, f⁻¹: B → A satisfies f⁻¹(f(x)) = x and f(f⁻¹(y)) = y.
8 cards — click any card to flip
Let f: ℝ → ℝ be defined by f(x) = 3x − 5. Which statement is true?
  • A f is many-one and onto
  • B f is one-one but not onto
  • C f is one-one and onto (bijective)
  • D f is neither one-one nor onto
Which of the following functions f: ℝ → ℝ is NOT one-one?
  • A f(x) = 2x + 1
  • B f(x) = x²
  • C f(x) = x³
  • D f(x) = eˣ
Let f: {1,2,3} → {1,2,3} with f(1)=2, f(2)=3, f(3)=1. What is (f ∘ f)(1)?
  • A 1
  • B 2
  • C 4
  • D 3
On the set ℤ of integers, define R = {(a, b) : a − b is divisible by 5}. R is:
  • A An equivalence relation
  • B Reflexive and symmetric only
  • C Symmetric and transitive only
  • D Only reflexive
If f: ℝ → ℝ is f(x) = 2x + 3, what is f⁻¹(x)?
  • A (x + 3)/2
  • B 2x − 3
  • C (x − 3)/2
  • D 3x − 2
0 / 5