[Precalculus · Core Concepts ②] Injective, Surjective & Bijective Functions: The Horizontal Line Test, Identity & Constant Functions, and Inverse Invariance
Injective, Surjective & Bijective Functions, Identity & Constant Functions: The Horizontal Line Test & The Gateway to Inverses
Horizontal line test, range-codomain matching, subset containment proofs, permutation counting rules & criteria for inverse existence
In Part 1, we defined a function as "a rule assigning exactly one output arrow from domain X to codomain Y." In this module, we examine whether those arrows can be reversed cleanly from the perspective of target set Y without ambiguity or abandonment.
Establishing this rigorous taxonomy is the absolute prerequisite for composite function restrictions, invertible mappings, and monotonic curve modeling in higher calculus.
- Existence of Inverse Functions: A bijective mapping (one-to-one correspondence) is the single necessary and sufficient condition for defining an inverse function $f^{-1}$.
- Monotonic Behavior in Calculus: Derivatives satisfying $f'(x) \ge 0$ (or $f'(x) \le 0$) without sign oscillation correspond directly to injective curves that pass the horizontal line test.
- Fixed-Point Analysis: The identity function $I(x) = x$ serves as the foundational reflection axis ($y = x$) for finding symmetric equilibrium points and self-inverses.
1. Injective vs. Bijective Functions: The Definitive Distinction
While their names sound similar, set-theoretically they belong to a strict hierarchy: satisfying one condition versus satisfying two simultaneous conditions.
• Significance: Distinct domain inputs always yield distinct codomain outputs (no shared targets).
• Note: It is entirely permissible for unmapped elements to remain in codomain Y.
• Condition 2: $f(X) = Y$ (every element of codomain Y receives an incoming arrow).
• Significance: A flawless 1:1 pairing with zero leftovers. Reversing the arrows yields a valid function ⟹ The necessary and sufficient condition for inverse invertibility!
"If a function is bijective, it is necessarily injective" is 100% always true.
By definition, a bijection requires both injectivity and surjectivity. Set-theoretically, {Bijective Functions} ⊂ {Injective Functions} holds as a strict subset relation.
The distinguishing factor is whether the codomain contains unchosen elements.
• Counterexample 1 (Discrete Set — Even Number Mapping):
Consider $f: \mathbb{N} \to \mathbb{N}$ defined by $f(x) = 2x$, where both domain and codomain are the set of natural numbers $\mathbb{N}$.
- For $x_1 \ne x_2$, $2x_1 \ne 2x_2$ holds, so f is strictly injective.
- However, the odd numbers in codomain $\mathbb{N}$ ($1, 3, 5, \dots$) receive no arrows whatsoever.
- Hence, $\text{Range} \ne \text{Codomain}$, and f fails to be bijective!
• Counterexample 2 (Continuous Set — Exponential Curve):
Consider $g: \mathbb{R} \to \mathbb{R}$ defined by $g(x) = 2^x$, with domain and codomain over all real numbers $\mathbb{R}$.
- As a strictly increasing curve, it passes the horizontal line test and is injective.
- But its range is limited to positive reals ($y > 0$). Negative numbers and zero receive no arrows.
- Over the codomain of all real numbers $\mathbb{R}$, g fails to be bijective.
• Horizontal Line Test ($y = c$): Determines whether a function is injective.
- Intersects every horizontal line at at most 1 point ⟹ Injective (One-to-One) (strictly increasing or strictly decreasing curves).
- Intersects any horizontal line at 2 or more points ⟹ Not Injective (e.g., standard parabola $y = x^2$ intersects $y = 1$ twice).
2. Canonical Archetypes: Identity & Constant Functions
• Always satisfies the criteria of a bijective function.
• Composition Property: For any compatible function $f$, $f \circ I = I \circ f = f$ (serves as the identity element of function composition).
• Appears graphically as a horizontal line parallel to the x-axis.
• Its range contains exactly one element $\{c\}$; it can never be injective for domains with $|X| \ge 2$.
3. Counting Formulas: Permutations & Combinations
When counting functions from finite domain $X$ ($|X| = n$) to codomain $Y$ ($|Y| = m$), focus on whether selection choices diminish or remain constant:
⚠️ 4 Common Misconceptions to Overcome Before Exams
In our earlier example $f(x) = 2x$ over natural numbers, the unassigned odd numbers in the codomain prevent reversing arrows. If odd inputs are fed into the inverse, they have nowhere to point, which breaks the definition of a function.
While $f(x) = (x - 2)^2 + 1$ over all reals is a full parabola that fails the horizontal line test, restricting the domain to $x \ge 2$ and codomain to $y \ge 1$ produces a strictly increasing curve that passes the test, enabling an inverse square-root mapping.
For example, $f(x) = x^3$ has a cubic formula, but evaluated on the discrete domain $X = \{-1, 0, 1\}$, $f(-1) = -1$, $f(0) = 0$, and $f(1) = 1$. Over this restricted domain, it functions as a valid identity function.
Even if both branches have positive slopes (both strictly increasing), if a jump discontinuity occurs at boundary $x = k$, the intervening interval in codomain Y remains uncovered. This breaks the condition $\text{Range} = \text{Codomain}$.
5. Model Exam Problems
For domain $X = \{1, 2, 3\}$ and codomain $Y = \{1, 2, 3, 4, 5\}$, compute the following:
(1) The total number of injective functions from $X$ to $Y$
(2) The number of injective functions satisfying $f(1) = 2$
Find the range of real constant $a$ such that $f(x) = (a - 3)|x - 1| + 2x + 5$ defined over all real numbers $\mathbb{R}$ is a bijective function.
For set $X = \{x \mid x \ge k\}$, find constant $k$ such that $f(x) = x^2 - 2x - 10$ defines a bijective function from $X$ to $X$.
Given $f(x) = x^3 - 8x$, find the number of non-empty domains $X$ such that $f: X \to X$ acts as an identity function.
For sets $X = \{1, 2, 3, 4\}$ and $Y = \{a, b, c, d\}$, let:
• $p =$ total number of functions from $X$ to $Y$
• $q =$ total number of bijective functions from $X$ to $Y$
• $r =$ total number of constant functions from $X$ to $Y$
Compute the value of $p - q + r$.
When the two pillars—uniqueness from the horizontal line test and complete coverage through Range = Codomain—align, mathematics unlocks the gateway to inverse transformations.
In our next installment, we explore these principles in our competitive workbook: [Precalculus · Practice Lab ②] 15 Benchmark Problem Archetypes in Bijective Inverses & Function Permutations.

Comments
Post a Comment