A function is a rule that maps inputs to outputs
x ↦ x² (maps x to x squared)
f(x) = x² (function named f)
f: X → Y (function from set X to set Y)
These requirements distinguish functions from general relations!
Domain: ℝ (all real numbers)
Codomain: ℝ (all real numbers)
Range: ℝ≥0 = {r | r ∈ ℝ, r ≥ 0} (only non-negative reals)
Range ≠ Codomain in this case!
The codomain includes negative numbers, but the range doesn't achieve them.
R_f = {(x, y) | x ∈ domain(f), y = f(x)}
This is a subset of domain(f) × codomain(f)
R_sq = {(x, y) | x, y ∈ ℝ, y = x²}
When you plot f as a graph, you're actually plotting R_f on coordinate axes!
Each point (x, y) on the graph represents the relationship y = f(x).
By convention, we take the positive square root
Since 5² = (-5)² = 25, we choose √25 = 5 (not -5)
Different inputs → Different outputs
If x₁ ≠ x₂, then f(x₁) ≠ f(x₂)
✓ f(x) = 3x + 5 (linear functions are injective)
✗ f(x) = 7x² (f(5) = f(-5) = 175)
Range = Codomain
Every element in codomain has a pre-image
✓ f(x) = -7x + 10 (with codomain ℝ)
✗ f(x) = 5x² + 3 (can't reach values < 3)
BOTH Injective AND Surjective
Perfect pairing between domain and codomain
| Property | Symbol | Meaning | Test |
|---|---|---|---|
| Injective | 1-1 | Different inputs → Different outputs | If x₁ ≠ x₂ then f(x₁) ≠ f(x₂) |
| Surjective | onto | Range = Codomain | Every y has pre-image x |
| Bijective | 1-1 & onto | Perfect pairing | Both injective and surjective |
Problem: Two sacks of marbles - are they equal in number?
Count each sack individually (tedious, error-prone)
Pull one marble from each sack at the same time:
Bijections are the ONLY way to prove equal cardinality!
This is how we compare the "sizes" of infinite sets like ℕ, ℤ, ℚ, and ℝ.
Question: Are there as many lines as points in ℝ²?
Must verify it's truly a bijection. Example: two points determine a unique line, BUT many point-pairs determine the SAME line, so point-pairs → lines is NOT a bijection.
For the function f(x) = 2x - 3 with domain ℝ and codomain ℝ:
Determine if the following functions are injective:
For each function with codomain ℝ, determine if it's surjective:
Which of the following functions f: ℝ → ℝ are bijective?