Study guide
6.4 Function Composition, Invertibility & Inverse Functions
FTCE Mathematics 6-12 026
Track your progress as you read
Finished sections get a check mark.
1 Chapter 1: Exam Overview & Rational Number Systems
1.1 FTCE Mathematics 6-12 Overview, Interface & Test-Taking Strategies 1.2 Rational Numbers, Representations & Multi-Step Operations
2 Chapter 2: Real Number Approximations & Proportional Reasoning
2.1 Irrational Numbers, Radical Estimation & Scientific Notation 2.2 Ratios, Rates, Proportions & Dimensional Analysis 2.3 Percent Applications, Financial Models & Depreciation
3 Chapter 3: Algebraic Expressions & Polynomial Operations
3.1 Polynomial Arithmetic, Factoring Strategies & Special Products 3.2 Radical Operations, Rational Expressions & Equations 3.3 Field Properties, Exponent Laws & Literal Equations
4 Chapter 4: Linear Relationships, Systems & Inequalities
4.1 Linear Equations, Slope Concepts & Line Forms 4.2 Systems of Linear Equations & Real-World Applications 4.3 Single & Systems of Linear Inequalities on the Coordinate Plane 4.4 Absolute Value Equations & Inequalities in One and Two Variables
5 Chapter 5: Quadratic Equations, Functions & Complex Numbers
5.1 Quadratic Equations, Discriminant & Complex Number Arithmetic 5.2 Quadratic Functions: Vertex, Axis, Intercepts & Concavity 5.3 Quadratic Inequalities in One/Two Variables & Optimization
6 Chapter 6: Function Foundations, Transformations & Inverses
6.1 Function Definitions, Relations, Domain, Range & Notation 6.2 Function Families, Key Graphical Behaviors & Even/Odd Symmetry 6.3 Shifting, Scaling & Reflecting Functions Across Representations 6.4 Function Composition, Invertibility & Inverse Functions
7 Chapter 7: Geometric Foundations, Angles & Deductive Proofs
7.1 Angle Relationships, Parallel Lines & Transversals 7.2 Triangle Sum, Exterior Angles & Polygon Angle Formulas 7.3 Formal Proof Methods, CPCTC & Quadrilateral Properties
8 Chapter 8: Congruence, Similarity & Geometric Transformations
8.1 Triangle Congruence (SSS, SAS, ASA, AAS, HL) & Similarity (AA, SAS, SSS) 8.2 Rigid Motions: Translations, Reflections, Rotations & Symmetry 8.3 Dilations, Scale Factors & Proportional Reasoning in Geometry
9 Chapter 9: Coordinate Geometry & 3D Spatial Measurement
9.1 Distance, Midpoint, Slope Criteria & Coordinate Proofs 9.2 Perimeter, Area, Surface Area & Volume of 2D and 3D Figures 9.3 Cross Sections of 3D Figures & Solids of Revolution
10 Chapter 10: Circle Theorems & Geometric Constructions
10.1 Central, Inscribed, Tangent & Chord Angles and Arcs 10.2 Intersecting Chords, Secant/Tangent Lengths, Arc Length & Sector Area 10.3 Euclidean Constructions with Compass and Straightedge
11 Chapter 11: Conic Sections & Coordinate Modeling
11.1 Circles and Parabolas: Geometric Definitions, Equations & Modeling 11.2 Ellipses and Hyperbolas: Foci, Axes, Asymptotes & Real-World Applications
12 Chapter 12: Trigonometric Foundations & Oblique Triangles
12.1 Right-Triangle Trigonometry, Pythagorean Theorem & Special Triangles 12.2 The Unit Circle, Radian Measure & Exact Trigonometric Values 12.3 Law of Sines (Ambiguous Case), Law of Cosines & Oblique Triangle Area
13 Chapter 13: Trigonometric Functions, Polar & Parametric Systems
13.1 Graphs of the Six Trigonometric Functions & Periodic Modeling 13.2 Polar Coordinates, Polar-Rectangular Conversion & Polar Graphs 13.3 Parametric Equations, Elimination of Parameters & Projectile Motion
14 Chapter 14: Descriptive Statistics & Data Distributions
14.1 Measures of Central Tendency, Dispersion & Resistant Statistics 14.2 Univariate Displays (Histograms, Boxplots, Stemplots) & Distribution Shapes 14.3 Normal Distribution Properties, Empirical Rule & Standard Normal Z-Scores
15 Chapter 15: Statistical Studies, Bivariate Data & Linear Regression
15.1 Statistical Study Design, Random Sampling Techniques & Sources of Bias 15.2 Survey Sampling, Margin of Error & Population Estimation 15.3 Scatterplots, Correlation Coefficient r, Linear Regression & Residuals
16 Chapter 16: Probability Theory, Two-Way Tables & Expected Value
16.1 Fundamental Counting Principle, Permutations & Combinations 16.2 Addition Rule, Multiplication Rule, Independent Events & Conditional Probability 16.3 Two-Way Frequency Tables, Law of Large Numbers & Expected Value of Random Variables
17 Chapter 17: Precalculus: Polynomial, Rational & Transcendental Functions
17.1 Fundamental Theorem of Algebra, Remainder/Factor Theorems & Polynomial Roots 17.2 Rational Functions, Domain Restrictions, Holes & Asymptotes 17.3 Exponential & Logarithmic Functions, Base e & Logarithmic Properties
18 Chapter 18: Sequences, Series, Binomial Theorem & Vectors
18.1 Arithmetic & Geometric Sequences, Finite Sums & Infinite Series Convergence 18.2 Binomial Theorem, Pascal's Triangle & General Term Determination 18.3 Vector Representations, Operations, Magnitude, Direction & Dot Product
19 Chapter 19: Differential Calculus Foundations
19.1 Limits, One-Sided Limits, Indeterminate Forms & Continuity 19.2 Derivative Definition, Power, Product, Quotient & Transcendental Rules 19.3 Chain Rule, Tangent Line Equations & Rates of Change
20 Chapter 20: Applications of Derivatives & Integral Calculus
20.1 First & Second Derivative Tests, Extrema, Concavity & Optimization 20.2 Antiderivatives, Indefinite Integrals & Integration by U-Substitution 20.3 Fundamental Theorem of Calculus, Net Signed Area & Geometric Applications
21 Chapter 21: Mathematical Representations, Progressions & Tools
21.1 Concrete-Representational-Abstract (CPA) Progressions & Concept Continuity 21.2 The Rule of Four: Translating Among Representations to Support Fluency 21.3 Manipulatives, Dynamic Software & Technology in Secondary Mathematics
22 Chapter 22: Assessment, Error Analysis & Misconception Remediation
22.1 Student Misconceptions & Error Analysis Across Core Secondary Domains 22.2 Evaluating Validity of Student Mathematical Arguments & Reasonableness Checks 22.3 Formative Assessment Formats, Data-Driven Differentiation & Tiered Tasks
6.4 Function Composition, Invertibility & Inverse Functions
Key Takeaways Explain This Topic AI
Function composition (f o g)(x) = f(g(x)) evaluates the inner function g(x) first and passes the output to the outer function f; composition is generally non-commutative (f o g != g o f).
The domain of a composite function (f o g)(x) is the restricted set of all x in the domain of g such that g(x) belongs to the domain of f: Dom(f o g) = {x in Dom(g) | g(x) in Dom(f)}.
A function f possesses an inverse function f^(-1) if and only if f is bijective (one-to-one and onto), which can be verified graphically via the horizontal line test.
Non-injective functions can be rendered invertible by restricting their domain to a monotonic interval, such as restricting quadratic functions to one side of their vertex axis of symmetry.
The graphs of f and f^(-1) are reflections of each other across the identity line y = x, with domain and range swapped: Dom(f^(-1)) = Ran(f) and Ran(f^(-1)) = Dom(f).
Last updated: September 2026
- 6.4 Function Composition, Invertibility & Inverse Functions
- 1. The Algebra of Function Composition
Function composition is the operational process of combining two functions by using the output of one function as the input of another. Formally, given two functions g : X → Y g: X \to Y g : X → Y and f : Y → Z f: Y \to Z f : Y → Z , the composite function f ∘ g f \circ g f ∘ g (read " f f f composed with g g g " or " f f f of g g g ") is defined by: ( f ∘ g ) ( x ) = f ( g ( x ) ) (f \circ g)(x) = f(g(x)) ( f ∘ g ) ( x ) = f ( g ( x ))
In this operational pipeline, the independent variable x x x is processed first by the inner function g g g , generating an intermediate value g ( x ) g(x) g ( x ) . This intermediate output is then processed by the outer function f f f to produce the final output f ( g ( x ) ) f(g(x)) f ( g ( x )) .
Function composition possesses distinct algebraic properties that secondary educators must emphasize:
Non-Commutativity: Function composition is generally not commutative : ( f ∘ g ) ( x ) ≠ ( g ∘ f ) ( x ) (f \circ g)(x) \neq (g \circ f)(x) ( f ∘ g ) ( x ) = ( g ∘ f ) ( x ) For example, let f ( x ) = 2 x + 5 f(x) = 2x + 5 f ( x ) = 2 x + 5 and g ( x ) = x 2 g(x) = x^2 g ( x ) = x 2 . Then: ( f ∘ g ) ( x ) = f ( g ( x ) ) = f ( x 2 ) = 2 x 2 + 5 (f \circ g)(x) = f(g(x)) = f(x^2) = 2x^2 + 5 ( f ∘ g ) ( x ) = f ( g ( x )) = f ( x 2 ) = 2 x 2 + 5 ( g ∘ f ) ( x ) = g ( f ( x ) ) = g ( 2 x + 5 ) = ( 2 x + 5 ) 2 = 4 x 2 + 20 x + 25 (g \circ f)(x) = g(f(x)) = g(2x + 5) = (2x + 5)^2 = 4x^2 + 20x + 25 ( g ∘ f ) ( x ) = g ( f ( x )) = g ( 2 x + 5 ) = ( 2 x + 5 ) 2 = 4 x 2 + 20 x + 25 The two resulting expressions are manifestly unequal for almost all real numbers x x x .
Associativity: Function composition is associative whenever the respective compositions are defined: [ f ∘ ( g ∘ h ) ] ( x ) = [ ( f ∘ g ) ∘ h ] ( x ) [f \circ (g \circ h)](x) = [(f \circ g) \circ h](x) [ f ∘ ( g ∘ h )] ( x ) = [( f ∘ g ) ∘ h ] ( x )
Identity Element: The identity function I ( x ) = x I(x) = x I ( x ) = x serves as the identity element under composition: ( f ∘ I ) ( x ) = ( I ∘ f ) ( x ) = f ( x ) (f \circ I)(x) = (I \circ f)(x) = f(x) ( f ∘ I ) ( x ) = ( I ∘ f ) ( x ) = f ( x ) .
2. Rigorous Determination of Composite Function Domains
The domain of a composite function is one of the most frequently miscalculated concepts on the FTCE examination. A common student error is simplifying the composite algebraic expression first and determining the domain solely from the resulting formula. This practice frequently overlooks hidden domain restrictions imposed by the inner function.
Formally, the domain of ( f ∘ g ) ( x ) (f \circ g)(x) ( f ∘ g ) ( x ) is the set of all inputs x x x in the domain of g g g whose corresponding outputs g ( x ) g(x) g ( x ) belong to the domain of f f f : dom ( f ∘ g ) = { x ∈ dom ( g ) ∣ g ( x ) ∈ dom ( f ) } \operatorname{dom}(f \circ g) = \{x \in \operatorname{dom}(g) \mid g(x) \in \operatorname{dom}(f)\} dom ( f ∘ g ) = { x ∈ dom ( g ) ∣ g ( x ) ∈ dom ( f )}
Systematic Two-Tiered Domain Protocol
To determine dom ( f ∘ g ) \operatorname{dom}(f \circ g) dom ( f ∘ g ) :
Condition 1 (Inner Domain): Find the natural domain of g ( x ) g(x) g ( x ) . The input x x x must satisfy x ∈ dom ( g ) x \in \operatorname{dom}(g) x ∈ dom ( g ) .
Condition 2 (Outer Compatibility): Determine what inputs are permissible for f f f . If u ∈ dom ( f ) u \in \operatorname{dom}(f) u ∈ dom ( f ) requires u ∈ S u \in S u ∈ S , then enforce the inequality or restriction g ( x ) ∈ S g(x) \in S g ( x ) ∈ S . Solve this constraint for x x x .
Condition 3 (Set Intersection): The final domain is the intersection of the solutions from Condition 1 and Condition 2: dom ( f ∘ g ) = Condition 1 ∩ Condition 2 \operatorname{dom}(f \circ g) = \text{Condition 1} \cap \text{Condition 2} dom ( f ∘ g ) = Condition 1 ∩ Condition 2
Worked Composite Domain Exemplar
Let f ( x ) = 3 x − 5 f(x) = \frac{3}{x - 5} f ( x ) = x − 5 3 and g ( x ) = 2 x + 1 x − 2 g(x) = \frac{2x + 1}{x - 2} g ( x ) = x − 2 2 x + 1 . Find the natural domain of ( f ∘ g ) ( x ) (f \circ g)(x) ( f ∘ g ) ( x ) .
Step 1: Inner function restriction. The inner function is g ( x ) = 2 x + 1 x − 2 g(x) = \frac{2x + 1}{x - 2} g ( x ) = x − 2 2 x + 1 . The denominator cannot equal zero: x − 2 ≠ 0 ⟹ x ≠ 2 x - 2 \neq 0 \implies x \neq 2 x − 2 = 0 ⟹ x = 2
Thus, dom ( g ) = { x ∈ R ∣ x ≠ 2 } \operatorname{dom}(g) = \{x \in \mathbb{R} \mid x \neq 2\} dom ( g ) = { x ∈ R ∣ x = 2 } .
Step 2: Outer function restriction on the inner output. The outer function is f ( u ) = 3 u − 5 f(u) = \frac{3}{u - 5} f ( u ) = u − 5 3 . The outer domain requires that its input cannot equal 5 5 5 : u ≠ 5 u \neq 5 u = 5 . Therefore, the output of g ( x ) g(x) g ( x ) cannot equal 5 5 5 : g ( x ) ≠ 5 ⟹ 2 x + 1 x − 2 ≠ 5 g(x) \neq 5 \implies \frac{2x + 1}{x - 2} \neq 5 g ( x ) = 5 ⟹ x − 2 2 x + 1 = 5
Solve the boundary equation 2 x + 1 x − 2 = 5 \frac{2x + 1}{x - 2} = 5 x − 2 2 x + 1 = 5 : 2 x + 1 = 5 ( x − 2 ) ⟹ 2 x + 1 = 5 x − 10 ⟹ 11 = 3 x ⟹ x = 11 3 2x + 1 = 5(x - 2) \implies 2x + 1 = 5x - 10 \implies 11 = 3x \implies x = \frac{11}{3} 2 x + 1 = 5 ( x − 2 ) ⟹ 2 x + 1 = 5 x − 10 ⟹ 11 = 3 x ⟹ x = 3 11
Thus, x ≠ 11 3 x \neq \frac{11}{3} x = 3 11 .
Step 3: Intersect the domain conditions. Combining both conditions, x x x must not equal 2 2 2 and x x x must not equal 11 3 \frac{11}{3} 3 11 : dom ( f ∘ g ) = ( − ∞ , 2 ) ∪ ( 2 , 11 3 ) ∪ ( 11 3 , ∞ ) \operatorname{dom}(f \circ g) = \left(-\infty, 2\right) \cup \left(2, \frac{11}{3}\right) \cup \left(\frac{11}{3}, \infty\right) dom ( f ∘ g ) = ( − ∞ , 2 ) ∪ ( 2 , 3 11 ) ∪ ( 3 11 , ∞ )
Caution
If a candidate simplifies ( f ∘ g ) ( x ) (f \circ g)(x) ( f ∘ g ) ( x ) algebraically before finding the domain: ( f ∘ g ) ( x ) = 3 2 x + 1 x − 2 − 5 = 3 ( x − 2 ) ( 2 x + 1 ) − 5 ( x − 2 ) = 3 x − 6 − 3 x + 11 (f \circ g)(x) = \frac{3}{\frac{2x + 1}{x - 2} - 5} = \frac{3(x - 2)}{(2x + 1) - 5(x - 2)} = \frac{3x - 6}{-3x + 11} ( f ∘ g ) ( x ) = x − 2 2 x + 1 − 5 3 = ( 2 x + 1 ) − 5 ( x − 2 ) 3 ( x − 2 ) = − 3 x + 11 3 x − 6 Looking only at the simplified denominator − 3 x + 11 ≠ 0 ⟹ x ≠ 11 / 3 -3x + 11 \neq 0 \implies x \neq 11/3 − 3 x + 11 = 0 ⟹ x = 11/3 , the candidate would completely fail to exclude x = 2 x = 2 x = 2 . At x = 2 x = 2 x = 2 , g ( 2 ) g(2) g ( 2 ) is undefined, so the pipeline breaks at the very first step!
3. Invertibility, Injectivity & Domain Restrictions
An inverse function reverses the action of the original function. If f f f maps an input x x x to an output y y y , then its inverse f − 1 f^{-1} f − 1 maps y y y back to x x x .
The Bijectivity Requirement & Horizontal Line Test (HLT)
A function f : X → Y f: X \to Y f : X → Y possesses an inverse function f − 1 : Y → X f^{-1}: Y \to X f − 1 : Y → X if and only if f f f is a bijection :
Injective (One-to-One): Every distinct input produces a distinct output: x 1 ≠ x 2 ⟹ f ( x 1 ) ≠ f ( x 2 ) , or equivalently f ( x 1 ) = f ( x 2 ) ⟹ x 1 = x 2 x_1 \neq x_2 \implies f(x_1) \neq f(x_2), \quad \text{or equivalently} \quad f(x_1) = f(x_2) \implies x_1 = x_2 x 1 = x 2 ⟹ f ( x 1 ) = f ( x 2 ) , or equivalently f ( x 1 ) = f ( x 2 ) ⟹ x 1 = x 2
Surjective (Onto): Every element in the codomain Y Y Y is realized as an output for some x ∈ X x \in X x ∈ X : ran ( f ) = Y \operatorname{ran}(f) = Y ran ( f ) = Y .
Geometrically, a function graphed on the Cartesian plane is one-to-one if and only if it passes the Horizontal Line Test (HLT) : every horizontal line y = c y = c y = c intersects the graph at most once . If any horizontal line intersects the graph at two or more points, multiple domain inputs produce the identical output value c c c , which means reversing the mapping would yield multiple outputs for a single input, violating the vertical line test for f − 1 f^{-1} f − 1 .
Restricting Domains to Create Invertible Branches
Many fundamental parent functions (such as quadratics, even polynomials, absolute value, and trigonometric functions) fail the Horizontal Line Test over their full natural domains. To define an inverse function, secondary mathematicians restrict the domain to a subset where the function is strictly monotonic (strictly increasing or strictly decreasing), thereby making it one-to-one while preserving the entire range.
The Quadratic Parent f ( x ) = x 2 f(x) = x^2 f ( x ) = x 2 : Fails HLT on ( − ∞ , ∞ ) (-\infty, \infty) ( − ∞ , ∞ ) because f ( − 2 ) = f ( 2 ) = 4 f(-2) = f(2) = 4 f ( − 2 ) = f ( 2 ) = 4 . By restricting the domain to [ 0 , ∞ ) [0, \infty) [ 0 , ∞ ) , the function becomes strictly increasing and one-to-one, yielding the well-known inverse f − 1 ( x ) = x f^{-1}(x) = \sqrt{x} f − 1 ( x ) = x on [ 0 , ∞ ) [0, \infty) [ 0 , ∞ ) . Alternatively, restricting the domain to ( − ∞ , 0 ] (-\infty, 0] ( − ∞ , 0 ] yields the negative branch inverse f − 1 ( x ) = − x f^{-1}(x) = -\sqrt{x} f − 1 ( x ) = − x .
General Quadratic Vertex Rule: For any parabola f ( x ) = a ( x − h ) 2 + k f(x) = a(x - h)^2 + k f ( x ) = a ( x − h ) 2 + k , the axis of symmetry is x = h x = h x = h . Restricting the domain to [ h , ∞ ) [h, \infty) [ h , ∞ ) or ( − ∞ , h ] (-\infty, h] ( − ∞ , h ] isolates a one-to-one branch that admits an inverse.
4. Algebraic Construction and Properties of Inverse Functions
The inverse function is denoted by f − 1 ( x ) f^{-1}(x) f − 1 ( x ) .
Warning
Secondary teachers must explicitly warn students that the superscript − 1 -1 − 1 in f − 1 ( x ) f^{-1}(x) f − 1 ( x ) denotes functional inverse , NOT a numerical exponent: f − 1 ( x ) ≠ 1 f ( x ) = [ f ( x ) ] − 1 f^{-1}(x) \neq \frac{1}{f(x)} = [f(x)]^{-1} f − 1 ( x ) = f ( x ) 1 = [ f ( x ) ] − 1 The expression 1 f ( x ) \frac{1}{f(x)} f ( x ) 1 is the multiplicative reciprocal, whereas f − 1 ( x ) f^{-1}(x) f − 1 ( x ) undoes the operation of f f f .
Fundamental Cancellation Properties
A function f f f and its inverse f − 1 f^{-1} f − 1 satisfy the Inverse Function Composition Identities : f ( f − 1 ( x ) ) = x for all x ∈ dom ( f − 1 ) = ran ( f ) f(f^{-1}(x)) = x \quad \text{for all } x \in \operatorname{dom}(f^{-1}) = \operatorname{ran}(f) f ( f − 1 ( x )) = x for all x ∈ dom ( f − 1 ) = ran ( f ) f − 1 ( f ( x ) ) = x for all x ∈ dom ( f ) f^{-1}(f(x)) = x \quad \text{for all } x \in \operatorname{dom}(f) f − 1 ( f ( x )) = x for all x ∈ dom ( f )
To prove algebraically that two candidate functions f f f and g g g are inverses of each other, one must verify that both ( f ∘ g ) ( x ) = x (f \circ g)(x) = x ( f ∘ g ) ( x ) = x and ( g ∘ f ) ( x ) = x (g \circ f)(x) = x ( g ∘ f ) ( x ) = x .
Domain-Range Duality & Geometric Reflection across y = x y = x y = x
Because the inverse function interchanges the roles of independent and dependent variables: dom ( f − 1 ) = ran ( f ) and ran ( f − 1 ) = dom ( f ) \operatorname{dom}(f^{-1}) = \operatorname{ran}(f) \quad \text{and} \quad \operatorname{ran}(f^{-1}) = \operatorname{dom}(f) dom ( f − 1 ) = ran ( f ) and ran ( f − 1 ) = dom ( f )
If ( a , b ) (a, b) ( a , b ) is a point on the graph of y = f ( x ) y = f(x) y = f ( x ) , then ( b , a ) (b, a) ( b , a ) is the corresponding point on the graph of y = f − 1 ( x ) y = f^{-1}(x) y = f − 1 ( x ) . Geometrically, the graph of f − 1 f^{-1} f − 1 is the reflection of the graph of f f f across the diagonal identity line y = x y = x y = x .
Systematic Algebraic Inversion Algorithm
To derive the algebraic formula for f − 1 ( x ) f^{-1}(x) f − 1 ( x ) :
Set y = f ( x ) y = f(x) y = f ( x ) .
Interchange the variable symbols x x x and y y y (reflecting the coordinates across y = x y = x y = x ).
Solve the resulting equation explicitly for y y y in terms of x x x .
Replace y y y with f − 1 ( x ) f^{-1}(x) f − 1 ( x ) and state any domain restrictions inherited from ran ( f ) \operatorname{ran}(f) ran ( f ) .
Worked Linear Fractional (Möbius) Inversion
Find the inverse function of f ( x ) = 4 x − 3 2 x + 5 f(x) = \frac{4x - 3}{2x + 5} f ( x ) = 2 x + 5 4 x − 3 . State its domain and range.
Step 1: Determine domain and range of f f f .
Domain of f f f : 2 x + 5 ≠ 0 ⟹ x ≠ − 5 / 2 2x + 5 \neq 0 \implies x \neq -5/2 2 x + 5 = 0 ⟹ x = − 5/2 .
Range of f f f : The horizontal asymptote is the ratio of leading coefficients: y = 4 2 = 2 y = \frac{4}{2} = 2 y = 2 4 = 2 . Thus, ran ( f ) = { y ∈ R ∣ y ≠ 2 } \operatorname{ran}(f) = \{y \in \mathbb{R} \mid y \neq 2\} ran ( f ) = { y ∈ R ∣ y = 2 } .
Step 2: Swap variables and solve for y y y . x = 4 y − 3 2 y + 5 x = \frac{4y - 3}{2y + 5} x = 2 y + 5 4 y − 3
Multiply both sides by ( 2 y + 5 ) (2y + 5) ( 2 y + 5 ) : x ( 2 y + 5 ) = 4 y − 3 ⟹ 2 x y + 5 x = 4 y − 3 x(2y + 5) = 4y - 3 \implies 2xy + 5x = 4y - 3 x ( 2 y + 5 ) = 4 y − 3 ⟹ 2 x y + 5 x = 4 y − 3
Collect all terms containing y y y on one side and terms without y y y on the opposite side: 2 x y − 4 y = − 5 x − 3 2xy - 4y = -5x - 3 2 x y − 4 y = − 5 x − 3
Factor out y y y : y ( 2 x − 4 ) = − ( 5 x + 3 ) y(2x - 4) = -(5x + 3) y ( 2 x − 4 ) = − ( 5 x + 3 )
Divide by ( 2 x − 4 ) (2x - 4) ( 2 x − 4 ) : y = − 5 x − 3 2 x − 4 = 5 x + 3 4 − 2 x y = \frac{-5x - 3}{2x - 4} = \frac{5x + 3}{4 - 2x} y = 2 x − 4 − 5 x − 3 = 4 − 2 x 5 x + 3
Step 3: State the inverse function and verify duality. f − 1 ( x ) = 5 x + 3 4 − 2 x , x ≠ 2 f^{-1}(x) = \frac{5x + 3}{4 - 2x}, \quad x \neq 2 f − 1 ( x ) = 4 − 2 x 5 x + 3 , x = 2
Notice that dom ( f − 1 ) = { x ∈ R ∣ x ≠ 2 } \operatorname{dom}(f^{-1}) = \{x \in \mathbb{R} \mid x \neq 2\} dom ( f − 1 ) = { x ∈ R ∣ x = 2 } , which matches ran ( f ) \operatorname{ran}(f) ran ( f ) perfectly! Furthermore, the horizontal asymptote of f − 1 ( x ) f^{-1}(x) f − 1 ( x ) is 5 − 2 = − 5 2 \frac{5}{-2} = -\frac{5}{2} − 2 5 = − 2 5 , meaning ran ( f − 1 ) = { y ∈ R ∣ y ≠ − 5 / 2 } \operatorname{ran}(f^{-1}) = \{y \in \mathbb{R} \mid y \neq -5/2\} ran ( f − 1 ) = { y ∈ R ∣ y = − 5/2 } , which matches dom ( f ) \operatorname{dom}(f) dom ( f ) !