RELATIONS AND FUNCTIONS
Properties of Relations
A relation on a set A is a subset of the Cartesian product A × A. Some important
properties are:
1. Reflexivity: A relation R on A is reflexive if (a, a) ∈ R for all a ∈ A.
2. Symmetry: A relation R on A is symmetric if (a, b) ∈ R implies (b, a) ∈ R.
3. Transitivity: A relation R on A is transitive if (a, b) ∈ R and (b, c) ∈ R implies (a, c)
∈ R.
4. Anti-symmetry: If (a, b) ∈ R and (b, a) ∈ R, then a = b.
Solved Example: Properties of Relations
Example: Let A = {1, 2, 3} and R = {(1,1), (2,2), (3,3), (1,2), (2,1)}. Check if R is
reflexive, symmetric, and transitive.
Solution:
- Reflexive: Since (1,1), (2,2), and (3,3) are present, R is reflexive.
- Symmetric: Since (1,2) and (2,1) are in R, R is symmetric.
- Transitive: (1,2) and (2,1) exist, but (1,1) is already in R, so R is transitive.
Thus, R is reflexive, symmetric, and transitive.
Equivalence Relation
A relation is an equivalence relation if it is reflexive, symmetric, and transitive. Such
a relation partitions the set into equivalence classes.
Solved Example: Equivalence Relation
Example: Define R on set of integers Z as aRb if a ≡ b (mod 3). Prove R is an
equivalence relation.
Solution:
- Reflexive: a ≡ a (mod 3) is always true.
- Symmetric: If a ≡ b (mod 3), then b ≡ a (mod 3).
- Transitive: If a ≡ b (mod 3) and b ≡ c (mod 3), then a ≡ c (mod 3).
Thus, R is an equivalence relation.
Functions: Domain and Range
A function f: A → B assigns each element of A to exactly one element in B.
Domain: The set A (input values).
Range: The set of values that f(x) attains in B.
Solved Example: Domain and Range
Example: Consider f(x) = x² where f: R → R. Find the domain and range.
Solution:
- Domain: All real numbers, R.
- Range: Since x² is always non-negative, Range = [0, ∞).
One-to-One and Onto Functions
A function is one-to-one (injective) if different inputs have different outputs.
A function is onto (surjective) if every element in the codomain is mapped by some
element in the domain.
Solved Example: One-to-One and Onto Functions
Example: Consider f(x) = 2x + 3 where f: R → R. Check injectivity and surjectivity.
Solution:
- Injective: If f(a) = f(b), then 2a + 3 = 2b + 3. Cancelling gives a = b, so f is injective.
- Surjective: Any y in R, solving y = 2x + 3 gives x = (y-3)/2, which is in R. Thus, f is
onto.
Composite and Inverse Functions
The composite of two functions f and g is (f ∘ g)(x) = f(g(x)).
A function f has an inverse f⁻¹ if it is both one-to-one and onto, satisfying f(f⁻¹(x)) =
x.
Solved Example: Composite and Inverse Functions
Example: Let f(x) = 2x + 1 and g(x) = x². Find (f ∘ g)(x) and (g ∘ f)(x).
Solution:
- (f ∘ g)(x) = f(g(x)) = f(x²) = 2x² + 1.
- (g ∘ f)(x) = g(f(x)) = g(2x + 1) = (2x + 1)² = 4x² + 4x + 1.