Explanation
Function
A function sends each input to exactly one output. One input can't have two outputs, but two inputs may share an output.
Function: every input has exactly one output
Domain rules
To find the domain, list the dangers. Under a square root, the inside must be at least zero.
In a denominator, not zero. Inside a log, strictly positive.
Then keep only the x that pass every test.
Domain rules: √(u) → u ≥ 0 · 1/u → u ≠ 0 · log(u) → u > 0 · take the intersection
Counting from A (m elements) to B (n)
From a set of m elements to one of n, each input picks freely: n to the m functions. One-one functions use different outputs, a permutation count.
Onto functions must hit every output.
Counting from A (m elements) to B (n): functions nᵐ · one-one n!/(n − m)! (m ≤ n) · onto from 3 to 2: 2³ − 2 = 6
One-one
A one-one function never repeats an output: horizontal lines cut its graph at most once. Onto means every value in the codomain is reached.
Only a function that is both has an inverse.
One-one: f(a) = f(b) ⇒ a = b · onto: range = codomain · inverse exists only if bijective
Composition (f ∘ g)(x) = f(g(x)) · inverse
To compose, feed g's output into f. To invert, write y equals f of x, swap x and y, and solve for y.
The graph of the inverse is the mirror image in the line y equals x.
Composition (f ∘ g)(x) = f(g(x)) · inverse: swap x and y, solve for y
Even f(−x) = f(x) (symmetric in y-axis) · odd…
k| | "Even functions, like x squared and cos x, mirror across the y-axis. Odd functions, like x cubed and sin x, turn into themselves after a half-turn about the origin.
Sine of k x repeats every two pi over k.
Even f(−x) = f(x) (symmetric in y-axis) · odd f(−x) = −f(x) (symmetric about origin) · period of sin kx is 2π/
Worked example
f(x) = 2x + 3 and g(x) = x². f(g(2)) = f(4) = 11.
g(f(2)) = g(7) = 49. So f ∘ g ≠ g ∘ f.