Relations and Functions - Cheat Sheet
1. Basic Definitions
- Relation: A subset of Cartesian product A x B.
- Function: A relation where each element in domain maps to exactly one element in codomain.
- Domain: Set of all inputs.
- Range: Set of all outputs.
2. Types of Functions
- Injective (One-One): Every element of codomain is mapped at most once.
- Surjective (Onto): Every element of codomain is mapped at least once.
- Bijective: Both one-one and onto.
- Constant Function: f(x) = c.
- Identity Function: f(x) = x.
3. Important Formulas
- No. of relations from A to B = 2^(m x n)
- No. of functions from A to B = n^m (|A| = m, |B| = n)
- Inverse of a function exists only for bijective functions.
4. Graphical Test
- Vertical Line Test: If a vertical line cuts a graph more than once -> not a function.
- Horizontal Line Test: Used to test one-one nature.
5. Function Composition
- (f o g)(x) = f(g(x))
- Defined only if range of g is a subset of domain of f.
6. Inverse Functions
- f^-1(x) exists only for bijective functions.
Relations and Functions - Cheat Sheet
- Swap x and y, then solve for y to find inverse.
7. Common Mistakes
- Not checking domain/range before stating function type.
- Confusing inverse relation with inverse function.
- Ignoring function conditions in composite functions.
8. Shortcut Visual Memory Aids
- Function = Input -> Output (machine)
- Bijective = Both One-One (Injective) + Onto (Surjective)
- If f(a) = f(b) and a = b, then function is One-One