Here are well-structured notes for Relation and Function from Class 12 Mathematics:
Relation and Function - Class 12 Notes
1. Cartesian Product of Sets
If A and B are two non-empty sets, their Cartesian product is denoted as:
A×B={(a,b) ∣ a∈A,b∈B}A \times B = \{ (a, b) \ | \ a \in A, b \in B \}
• If A has m elements and B has n elements, then: ∣A×B∣=m×n|A \times B| = m
\times n
• If either A or B is empty, then A×B=∅A \times B = \emptyset.
2. Relation
A relation from set A to set B is a subset of A×BA \times B.
It is represented as R ⊆ A × B.
Types of Relations:
1. Empty Relation: No element of A is related to any element of B. (R = ∅)
2. Universal Relation: Every element of A is related to every element of B. (R = A × B)
3. Reflexive Relation: (a,a)∈R(a, a) \in R for all a∈Aa \in A.
4. Symmetric Relation: If (a,b)∈R(a, b) \in R, then (b,a)∈R(b, a) \in R.
5. Transitive Relation: If (a,b)∈R(a, b) \in R and (b,c)∈R(b, c) \in R, then (a,c)∈R(a, c)
\in R.
6. Equivalence Relation: A relation that is Reflexive, Symmetric, and Transitive.
3. Function (Mapping)
A function f from A to B is a special relation where each element of A has a unique image
in B.
f:A→Bsuch that for every a∈A, there exists a unique b∈B.f: A \to B \quad \text{such that for
every } a \in A, \text{ there exists a unique } b \in B.
• Domain (A): Set of all inputs.
• Co-domain (B): Set of all possible outputs.
• Range: Set of actual outputs (a subset of B).
Types of Functions
1. One-One (Injective):
If f(a1)=f(a2)⇒a1=a2f(a_1) = f(a_2) \Rightarrow a_1 = a_2, then ff is one-one (injective).
2. Onto (Surjective):
If Range = Co-domain, every element of B has at least one pre-image in A.
3. One-One & Onto (Bijective):
If a function is both Injective and Surjective, it is called Bijective Function.
4. Many-One Function:
If two or more elements of A map to the same element in B.
4. Composition of Functions
If f: A → B and g: B → C, then the composition of f and g is defined as:
(g∘f)(x)=g(f(x))(g \circ f)(x) = g(f(x))
The function g(f(x)) maps A to C.
Properties of Composition:
• Associative: (h∘g)∘f=h∘(g∘f)(h \circ g) \circ f = h \circ (g \circ f)
• Not necessarily commutative: f∘g≠g∘ff \circ g \neq g \circ f in general.
5. Invertible Function
A function f: A → B is invertible if there exists another function g: B → A such that:
g(f(x))=xfor all x∈A.g(f(x)) = x \quad \text{for all } x \in A.
• Only bijective functions are invertible.
• The inverse is denoted as f−1(x)f^{-1}(x).
6. Binary Operations
A binary operation ∗ on a set A is a function:
∗:A×A→A\ast: A \times A \to A
Properties of Binary Operations
1. Closure: If a,b∈A⇒a∗b∈Aa, b \in A \Rightarrow a \ast b \in A.
2. Associativity: (a∗b)∗c=a∗(b∗c)(a \ast b) \ast c = a \ast (b \ast c).
3. Identity Element: There exists an element e in A such that a∗e=e∗a=aa \ast e = e
\ast a = a.
4. Inverse Element: For each a∈Aa \in A, there exists an a−1a^{-1} such that
a∗a−1=ea \ast a^{-1} = e.
Important Notes
• A function is a relation, but a relation may not be a function.
• Inverse exists only for bijective functions.
• Composition follows associative property but not necessarily commutative
property.
These notes provide a concise yet thorough understanding of Relations and Functions for
Class 12. Let me know if you need further explanation on any topic!
