[Precalculus · Core Concepts ②] Injective, Surjective & Bijective Functions: The Horizontal Line Test, Identity & Constant Functions, and Inverse Invariance

 

Precalculus · Core Concepts ②

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

💡 "Not every function is granted the right to travel backwards (The Inverse)."

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.

🔗 Direct Bridges to Advanced Calculus & Modern Algebra:
  • 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.

📌 [Concept 1] Injective Function (One-to-One / Injection)
$x_1 \ne x_2 \implies f(x_1) \ne f(x_2)$
• Contrapositive: $f(x_1) = f(x_2) \implies x_1 = x_2$
• 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.
🌟 [Concept 2] Bijective Function (One-to-One Correspondence / Bijection)
(1) Injective & (2) Surjective (Range = Codomain)
• Condition 1: $x_1 \ne x_2 \implies f(x_1) \ne f(x_2)$
• 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!
💡 [Logic Check] Is "A Bijective Function is Injective" Always True? & Canonical Counterexamples

"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.

⚠️ However, the converse proposition "If a function is injective, it is bijective" is FALSE!
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.
📏 [Graphical Verification: Vertical Line Test vs. Horizontal Line Test]
• Vertical Line Test ($x = k$): Determines whether a relation is a valid function (intersects at at most 1 point).
• 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

🪞 Identity Function ($I$)
$I(x) = x$   (Domain and Codomain match: $X \to X$)
• Acts as an invariant mirror, returning every input unchanged.
• 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).
🎯 Constant Function
$f(x) = c$   ($c$ is constant, Range cardinality = 1)
• Collapses every input in domain X into a single fixed output in codomain Y.
• 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:

Function Category Total Count Formula Prerequisite Condition Selection Mechanism
All Functions $m^n$ No restrictions Every element in X independently chooses from m choices
Injective Functions $_m\mathrm{P}_n$ $n \le m$ Successive choices exclude prior outputs: $m(m-1)\cdots$
Bijective Functions $n!$ $n = m$ required Permuting n elements across equal sets ($n\mathrm{P}_n$)
Constant Functions $m$ No restrictions Selecting 1 target value from codomain Y for all inputs
Diagnostic Clinic

⚠️ 4 Common Misconceptions to Overcome Before Exams

❌ Misconception 1: "If a function is injective, does an inverse function automatically exist?"
⭕ Reality: False! It must be strictly bijective.
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.
❌ Misconception 2: "Can quadratic functions never be bijective?"
⭕ Reality: Restricting the domain to one side of the vertex yields a bijection!
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.
❌ Misconception 3: "Must an identity function strictly be expressed by the algebraic formula $f(x) = x$?"
⭕ Reality: Any rule mapping elements to themselves within the domain acts as an identity function!
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.
❌ Misconception 4: "Is a piecewise function bijective if each separate branch is injective?"
⭕ Reality: The boundary must have zero vertical gaps and zero range overlap!
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

✏️ [Problem 1] Injective Function Counts with Fixed Conditions

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$

💡 Yul's Pro-Tip: Injective functions are permutations $_m\mathrm{P}_n$! When a value is fixed, remove it from codomain Y and permute the remaining elements.
👉 Reveal Answer & Step-by-Step Solution
[Answer] (1) 60, (2) 12

(1) Injective Function Count:
Choosing and ordering 3 distinct outputs from 5 options:
$_5\mathrm{P}_3 = 5 \times 4 \times 3 = \mathbf{60}$

(2) Injective Functions with $f(1) = 2$:
• Element $1$ is fixed to $2$ (1 option).
• Remaining domain elements $\{2, 3\}$ choose distinct values from the remaining 4 codomain elements $\{1, 3, 4, 5\}$.
$_4\mathrm{P}_2 = 4 \times 3 = \mathbf{12}$
✏️ [Problem 2] Absolute Value Function Bijection Parameter Range

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.

💡 Yul's Pro-Tip: Split into linear branches ($x \ge 1, x < 1$). Since the function is already continuous at $x = 1$, both branches must have slopes of the same sign ($m_1 \times m_2 > 0$)!
👉 Reveal Answer & Step-by-Step Solution
[Answer] $1 < a < 5$

1) Split by absolute value argument:
• $x \ge 1$: $f(x) = (a - 3)(x - 1) + 2x + 5 = (a - 1)x - a + 8 \implies m_1 = a - 1$
• $x < 1$: $f(x) = -(a - 3)(x - 1) + 2x + 5 = (5 - a)x + a + 2 \implies m_2 = 5 - a$
2) Evaluating $x = 1$ gives $f(1) = 7$ on both branches, guaranteeing continuity.
3) For a continuous piecewise linear curve over $\mathbb{R}$ to be bijective, it must be strictly increasing or strictly decreasing everywhere:
$m_1 \times m_2 > 0 \implies (a - 1)(5 - a) > 0 \implies (a - 1)(a - 5) < 0$
Thus, $\mathbf{1 < a < 5}$
✏️ [Problem 3] Quadratic Bijection on a Self-Mapping Interval ($X \to X$)

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$.

💡 Yul's Pro-Tip: For an increasing interval of a parabola to be a bijection from $X$ to $X$: (1) minimum endpoint must satisfy $f(k) = k$, and (2) $k$ must be on or to the right of axis $x = 1$!
👉 Reveal Answer & Step-by-Step Solution
[Answer] 5

1) Parabola axis of symmetry: $f(x) = (x - 1)^2 - 11 \implies x = 1$.
For $f(x)$ to be one-to-one on $[k, \infty)$, we require $k \ge 1$.
2) Since $f(x)$ is strictly increasing for $x \ge k$, the range is $[f(k), \infty)$.
For range to equal codomain $[k, \infty)$, we must have $f(k) = k$.
3) $k^2 - 2k - 10 = k \implies k^2 - 3k - 10 = 0 \implies (k - 5)(k + 2) = 0$.
Since $k \ge 1$, we conclude $k = \mathbf{5}$
✏️ [Problem 4] Number of Valid Domains for an Identity Function

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.

💡 Yul's Pro-Tip: An identity function requires $f(x) = x$ for all elements in domain X. Solve the cubic equation $x^3 - 8x = x$ to find eligible roots!
👉 Reveal Answer & Step-by-Step Solution
[Answer] 7

1) $f(x) = x \implies x^3 - 8x = x \implies x^3 - 9x = 0$.
$x(x - 3)(x + 3) = 0 \implies x = -3, 0, 3$.
2) Any domain $X$ must be formed exclusively from these 3 real solutions.
Therefore, $X$ is any non-empty subset of $\{-3, 0, 3\}$.
3) Total subsets: $2^3 - 1 = 8 - 1 = \mathbf{7}$
✏️ [Problem 5] Comprehensive Count of Function Archetypes

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$.

💡 Yul's Pro-Tip: Total functions = $n^n$, bijective functions = $n!$, constant functions = $n$!
👉 Reveal Answer & Step-by-Step Solution
[Answer] 236

1) Total functions: $p = 4^4 = 256$
2) Bijective functions: $q = 4! = 4 \times 3 \times 2 \times 1 = 24$
3) Constant functions: $r = |Y| = 4$
4) Evaluation: $p - q + r = 256 - 24 + 4 = \mathbf{236}$
🌿 Words from Yul
"The privilege of reversing arrows is the true structural beauty of a bijection."

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

Popular posts from this blog

Authentic Reference Models Beyond Basic Rulers

[Math Column]Studying Alongside Dedicated Peers: Becoming Each Other’s Lifelong Catalyst

[High School Math] Coordinate Geometry: 15 Essential Practice Problems on Section Formulas (Internal & External Division)