Appearance
Functions, Relations & Functional Equations
Axiomatic Definition
A function $f: A \to B$ is a binary relation that associates each element $x \in A$ with exactly one element $f(x) \in B$. $A$ is the domain, $B$ is the codomain, and $f(A) = \{f(x) : x \in A\} \subseteq B$ is the range.
1. Classification of Mappings
- Injective (One-to-One):
. (Geometrically: Any horizontal line intersects the graph at most once; derivative or strictly monotonic). - Surjective (Onto):
. - Bijective (Invertible): Both injective and surjective
Inverse function exists uniquely.
2. Parity, Periodicity & Transformations
Even and Odd Functions
- Even:
Symmetric about the -axis; . - Odd:
Symmetric about the origin (rotation by ); .
Periodicity
A function
- If
has period , then has period . - If
, then . - If
, then .
3. Classical Functional Equations
Cauchy's Classical Functional Equations (for continuous $f$)
$$\begin{aligned} f(x + y) &= f(x) + f(y) \implies f(x) = k x \\ f(x + y) &= f(x) f(y) \implies f(x) = a^x = e^{k x} \\ f(x y) &= f(x) + f(y) \implies f(x) = k \ln x \\ f(x y) &= f(x) f(y) \implies f(x) = x^n \end{aligned}$$
Polynomial Identity
If