Examples with Finite Sets
You'll learn: How to identify injective, surjective, and bijective functions through concrete examples using small finite sets.
Why Finite Sets Are Perfect for Practice
Working with finite sets lets you see every element and trace exactly where each one goes. You can check function properties by brute force—just verify every single mapping. This builds intuition before tackling infinite cases.
Concrete Examples
Example 1: Injective but Not Surjective
Let A = {1, 2, 3} and B = {a, b, c, d}. Define f(1) = a, f(2) = c, f(3) = d.
- Injective? Yes—no two inputs map to the same output.
- Surjective? No—element b is never hit.
- Bijective? No (must be both).
Think of it like assigned parking: every person (input) has their own spot (output), but some spots remain empty.
Example 2: Surjective but Not Injective
Let C = {1, 2, 3, 4} and D = {x, y}. Define g(1) = x, g(2) = y, g(3) = x, g(4) = y.
- Injective? No—both 1 and 3 map to x.
- Surjective? Yes—every element of D is reached.
- Bijective? No.
Like theater seats: everyone finds a seat, but some seats have multiple people (impossible in reality, but mathematically valid).
Example 3: Bijective
Let E = {red, blue} and F = {α, β}. Define h(red) = α, h(blue) = β.
- Injective? Yes—distinct inputs go to distinct outputs.
- Surjective? Yes—every output is used.
- Bijective? Yes! A perfect one-to-one correspondence.
This creates a perfect pairing. You could define h⁻¹ mapping back: h⁻¹(α) = red, h⁻¹(β) = blue.
Key Takeaway: With finite sets, you can verify function properties by exhaustive checking—injective means no collisions, surjective means no gaps, and bijective means perfect matching with equal cardinalities.