Study guide
3.1 Function Concepts, Domain, Range & Inverses
Bocconi Admission Test Online Bocconi Test for Bachelor Programs
Track your progress as you read
Finished sections get a check mark.
1 Chapter 1: Exam Structure, Scoring Mechanics & Test Strategy
1.1 Test Architecture, Timing & the Sequential Test Interface 1.2 Scoring System, Penalty Mathematics & Strategic Answering
2 Chapter 2: Mathematics — Algebra, Equations & Inequalities
2.1 Algebraic Expressions, Polynomials, Powers & Radicals 2.2 Linear & Quadratic Equations and Systems 2.3 Linear & Quadratic Inequalities and Sign Charts 2.4 Equations and Inequalities with Absolute Values
3 Chapter 3: Mathematics — Functions, Exponents & Logarithms
3.1 Function Concepts, Domain, Range & Inverses 3.2 Composition of Functions & Transformations 3.3 Exponential Functions, Properties & Equations 3.4 Logarithmic Functions, Laws & Equations
4 Chapter 4: Mathematics — Geometry, Analytic Geometry & Trigonometry
4.1 Plane Geometry: Polygons, Circles & Area Theorems 4.2 Analytic Geometry: Lines, Slopes & Distances in the Cartesian Plane 4.3 Conic Sections: Circles & Parabolas in the Coordinate Plane 4.4 Trigonometric Functions, Identities & Right-Triangle Applications
5 Chapter 5: Mathematics — Combinatorics, Probability, Statistics & Set Theory
5.1 Set Theory, Operations & Venn Diagrams 5.2 Combinatorics: Permutations, Combinations & Factorials 5.3 Probability Theory: Independent Events, Conditional Probability & Bayes' Basics 5.4 Descriptive Statistics: Central Tendency, Dispersion & Frequency Distributions
6 Chapter 6: Reading Comprehension — Business, Economic & Academic Analysis
6.1 Main Idea, Text Structure & Passage Mapping 6.2 Explicit Information Retrieval & Detail Verification 6.3 Inference, Implicit Meaning & Authorial Purpose 6.4 Tone, Rhetorical Devices & Vocabulary in Academic Context
7 Chapter 7: Numerical Reasoning — Charts, Tables & Data Interpretation
7.1 Data Tables & Multi-Series Matrices 7.2 Graphical Interpretation: Bar, Line, Pie & Composite Charts 7.3 Percentage Calculations, Changes & Financial Metrics 7.4 Ratios, Proportions, Rates & Weighted Averages
8 Chapter 8: Logic & Critical Thinking — Formal & Deductive Reasoning
8.1 Propositional Logic, Truth Tables & Logical Connectives 8.2 Conditional Reasoning, Contrapositives & Modus Ponens/Tollens 8.3 Syllogisms, Quantifiers & Venn Logic
9 Chapter 9: Critical Thinking — Argument Analysis, Assumptions & the Official Item Types
9.1 Argument Components, Premises & Unstated Assumptions 9.2 Strengthening, Weakening & Flaw Identification 9.3 Constraint Deduction Drills: Ordering, Arrangement & Assignment 9.4 The Two Official Critical-Thinking Item Types: Data Propositions & Deducibility
3.1 Function Concepts, Domain, Range & Inverses
Key Takeaways Explain This Topic AI
A relation f : X → Y f: X \to Y f : X → Y is a function if and only if every element x ∈ X x \in X x ∈ X is mapped to exactly one output y ∈ Y y \in Y y ∈ Y , verified graphically by the Vertical Line Test.
The natural domain in real analysis excludes values causing division by zero, negative radicands under even-index radicals, and non-positive arguments inside logarithms.
A function is invertible if and only if it is bijective (both injective and surjective); on real intervals, injectivity is established when the graph satisfies the Horizontal Line Test.
To construct the inverse function f − 1 ( x ) f^{-1}(x) f − 1 ( x ) , swap variables in y = f ( x ) y = f(x) y = f ( x ) to x = f ( y ) x = f(y) x = f ( y ) and solve for y y y , with the fundamental domain-range transposition: Dom ( f − 1 ) = Ran ( f ) \text{Dom}(f^{-1}) = \text{Ran}(f) Dom ( f − 1 ) = Ran ( f ) and Ran ( f − 1 ) = Dom ( f ) \text{Ran}(f^{-1}) = \text{Dom}(f) Ran ( f − 1 ) = Dom ( f ) .
The Cartesian graph of y = f − 1 ( x ) y = f^{-1}(x) y = f − 1 ( x ) is the exact reflection of y = f ( x ) y = f(x) y = f ( x ) across the line of identity y = x y = x y = x , meaning that each point ( a , b ) (a, b) ( a , b ) on f f f corresponds to ( b , a ) (b, a) ( b , a ) on f − 1 f^{-1} f − 1 .
Last updated: September 2026
3.1 Function Concepts, Domain, Range & Inverses
On the Bocconi Admission Test, functions form the algebraic architecture underlying higher-level calculus, optimization, and economic modeling. A solid grasp of function definitions, operational restrictions, and invertibility conditions enables candidates to solve multi-step problems in under 90 seconds without a calculator.
1. Mathematical Definition of a Function
A binary relation R R R between two sets X X X and Y Y Y is a subset of their Cartesian product: R ⊆ X × Y R \subseteq X \times Y R ⊆ X × Y . A relation is classified as a function f : X → Y f: X \to Y f : X → Y if and only if it satisfies the strict condition of deterministic single-valued mapping: ∀ x ∈ X , ∃ ! y ∈ Y such that ( x , y ) ∈ f [ commonly written y = f ( x ) ] \forall x \in X, \quad \exists! \, y \in Y \quad \text{such that} \quad (x, y) \in f \quad [\text{commonly written } y = f(x)] ∀ x ∈ X , ∃ ! y ∈ Y such that ( x , y ) ∈ f [ commonly written y = f ( x )]
Here, X X X is the domain (input set), Y Y Y is the codomain (target set), and the unique element y ∈ Y y \in Y y ∈ Y associated with x x x is the image of x x x under f f f .
The Vertical Line Test (VLT)
In Cartesian coordinates, a geometric curve represents y y y as a function of x x x if and only if every vertical line x = c x = c x = c (for c ∈ X c \in X c ∈ X ) intersects the curve at most once .
A circle x 2 + y 2 = r 2 x^2 + y^2 = r^2 x 2 + y 2 = r 2 fails the VLT because vertical lines with − r < x < r -r < x < r − r < x < r intersect the curve twice ( y = ± r 2 − x 2 y = \pm \sqrt{r^2 - x^2} y = ± r 2 − x 2 ); hence, it is a relation, not a function.
Isolating the positive square root y = + r 2 − x 2 y = +\sqrt{r^2 - x^2} y = + r 2 − x 2 yields a legitimate function representing the upper semicircle.
2. Determining Natural Domains
When a function formula y = f ( x ) y = f(x) y = f ( x ) is specified without an explicit domain, candidates must determine its natural domain (or maximal domain): the largest subset of R \mathbb{R} R for which the algebraic expression evaluates to a real number. In the Bocconi syllabus, domain restrictions arise from three non-negotiable algebraic operations:
Algebraic Form Restriction Condition Mathematical Justification
Rational Fraction P ( x ) Q ( x ) \frac{P(x)}{Q(x)} Q ( x ) P ( x ) Q ( x ) ≠ 0 Q(x) \neq 0 Q ( x ) = 0 Division by zero is undefined in R \mathbb{R} R .
Even-Index Radical g ( x ) 2 k \sqrt[2k]{g(x)} 2 k g ( x ) g ( x ) ≥ 0 g(x) \ge 0 g ( x ) ≥ 0 Even roots of negative numbers are non-real (complex).
Odd-Index Radical g ( x ) 2 k + 1 \sqrt[2k+1]{g(x)} 2 k + 1 g ( x ) No radical restriction Odd roots of negative numbers are real: − 8 3 = − 2 \sqrt[3]{-8} = -2 3 − 8 = − 2 .
Logarithmic Expression log b ( g ( x ) ) \log_b(g(x)) lo g b ( g ( x )) g ( x ) > 0 g(x) > 0 g ( x ) > 0 and b > 0 , b ≠ 1 b > 0, b \neq 1 b > 0 , b = 1 Powers of positive bases are strictly positive.
Compound Domain Example
Determine the natural domain of the compound function: f ( x ) = 16 − x 2 ln ( x + 1 ) + 1 x − 3 f(x) = \frac{\sqrt{16 - x^2}}{\ln(x + 1)} + \frac{1}{x - 3} f ( x ) = ln ( x + 1 ) 16 − x 2 + x − 3 1
To find the admissible domain D \mathcal{D} D , we establish the system of simultaneous inequalities:
Even radical condition: 16 − x 2 ≥ 0 ⟺ x 2 ≤ 16 ⟺ − 4 ≤ x ≤ 4 16 - x^2 \ge 0 \iff x^2 \le 16 \iff -4 \le x \le 4 16 − x 2 ≥ 0 ⟺ x 2 ≤ 16 ⟺ − 4 ≤ x ≤ 4 .
Logarithm argument condition: x + 1 > 0 ⟺ x > − 1 x + 1 > 0 \iff x > -1 x + 1 > 0 ⟺ x > − 1 .
Denominator non-zero conditions:
ln ( x + 1 ) ≠ 0 ⟺ x + 1 ≠ e 0 = 1 ⟺ x ≠ 0 \ln(x + 1) \neq 0 \iff x + 1 \neq e^0 = 1 \iff x \neq 0 ln ( x + 1 ) = 0 ⟺ x + 1 = e 0 = 1 ⟺ x = 0 .
x − 3 ≠ 0 ⟺ x ≠ 3 x - 3 \neq 0 \iff x \neq 3 x − 3 = 0 ⟺ x = 3 .
Intersecting these sets on the real number line: D = [ − 4 , 4 ] ∩ ( − 1 , ∞ ) ∖ { 0 , 3 } = ( − 1 , 0 ) ∪ ( 0 , 3 ) ∪ ( 3 , 4 ] \mathcal{D} = [-4, 4] \cap (-1, \infty) \setminus \{0, 3\} = (-1, 0) \cup (0, 3) \cup (3, 4] D = [ − 4 , 4 ] ∩ ( − 1 , ∞ ) ∖ { 0 , 3 } = ( − 1 , 0 ) ∪ ( 0 , 3 ) ∪ ( 3 , 4 ]
3. Codomain vs. Range (Image)
The codomain Y Y Y is the formal set into which all outputs must fall (typically R \mathbb{R} R unless restricted). The range (or image set) Ran ( f ) \text{Ran}(f) Ran ( f ) is the set of values actually attained by f f f : Ran ( f ) = { y ∈ Y ∣ ∃ x ∈ Dom ( f ) , f ( x ) = y } \text{Ran}(f) = \{y \in Y \mid \exists x \in \text{Dom}(f), \, f(x) = y\} Ran ( f ) = { y ∈ Y ∣ ∃ x ∈ Dom ( f ) , f ( x ) = y }
Finding the Range Algebraically
To find the range of a function y = f ( x ) y = f(x) y = f ( x ) , solve the equation for x x x in terms of y y y , and determine the values of y y y that produce valid x ∈ Dom ( f ) x \in \text{Dom}(f) x ∈ Dom ( f ) .
Example: Find the range of the homographic function f ( x ) = 2 x − 5 x + 3 f(x) = \frac{2x - 5}{x + 3} f ( x ) = x + 3 2 x − 5 defined on R ∖ { − 3 } \mathbb{R} \setminus \{-3\} R ∖ { − 3 } .
Set y = 2 x − 5 x + 3 y = \frac{2x - 5}{x + 3} y = x + 3 2 x − 5 and isolate x x x : y ( x + 3 ) = 2 x − 5 ⟹ y x + 3 y = 2 x − 5 ⟹ x ( y − 2 ) = − 3 y − 5 ⟹ x = − 3 y − 5 y − 2 y(x + 3) = 2x - 5 \implies yx + 3y = 2x - 5 \implies x(y - 2) = -3y - 5 \implies x = \frac{-3y - 5}{y - 2} y ( x + 3 ) = 2 x − 5 ⟹ y x + 3 y = 2 x − 5 ⟹ x ( y − 2 ) = − 3 y − 5 ⟹ x = y − 2 − 3 y − 5
The expression for x x x is well-defined for all y ∈ R y \in \mathbb{R} y ∈ R except where the denominator vanishes: y − 2 = 0 ⟺ y = 2 y - 2 = 0 \iff y = 2 y − 2 = 0 ⟺ y = 2 . Furthermore, substituting x = − 3 x = -3 x = − 3 yields − 3 ( y − 2 ) = − 3 y − 5 ⟹ − 3 y + 6 = − 3 y − 5 ⟹ 6 = − 5 -3(y - 2) = -3y - 5 \implies -3y + 6 = -3y - 5 \implies 6 = -5 − 3 ( y − 2 ) = − 3 y − 5 ⟹ − 3 y + 6 = − 3 y − 5 ⟹ 6 = − 5 (impossible). Hence, the range is: Ran ( f ) = R ∖ { 2 } \text{Ran}(f) = \mathbb{R} \setminus \{2\} Ran ( f ) = R ∖ { 2 }
4. Mapping Classifications: Injective, Surjective & Bijective
Understanding structural mappings is essential for determining whether an inverse function exists:
Injective (One-to-One): A function f : X → Y f: X \to Y f : X → Y is injective if distinct domain elements map to distinct images: ∀ x 1 , x 2 ∈ X , f ( x 1 ) = f ( x 2 ) ⟹ x 1 = x 2 \forall x_1, x_2 \in X, \quad f(x_1) = f(x_2) \implies x_1 = x_2 ∀ x 1 , x 2 ∈ X , f ( x 1 ) = f ( x 2 ) ⟹ x 1 = x 2
Geometric Test (Horizontal Line Test - HLT): Every horizontal line y = k y = k y = k intersects the graph of an injective function at most once . Any function that is strictly increasing or strictly decreasing across an interval is guaranteed to be injective on that interval.
Surjective (Onto): A function f : X → Y f: X \to Y f : X → Y is surjective if every element of the codomain is mapped to by at least one element of the domain: ∀ y ∈ Y , ∃ x ∈ X such that f ( x ) = y ⟺ Ran ( f ) = Y \forall y \in Y, \quad \exists x \in X \quad \text{such that} \quad f(x) = y \iff \text{Ran}(f) = Y ∀ y ∈ Y , ∃ x ∈ X such that f ( x ) = y ⟺ Ran ( f ) = Y
Geometric Test: Every horizontal line y = k y = k y = k (for k ∈ Y k \in Y k ∈ Y ) intersects the graph at least once .
Bijective (One-to-One Correspondence): A function is bijective if and only if it is both injective and surjective . Every horizontal line y = k y = k y = k intersects the graph exactly once . Bijectivity is the necessary and sufficient condition for invertibility.
5. The Inverse Function f − 1 ( x ) f^{-1}(x) f − 1 ( x )
If f : X → Y f: X \to Y f : X → Y is bijective, there exists a unique inverse function f − 1 : Y → X f^{-1}: Y \to X f − 1 : Y → X defined such that: ( f − 1 ∘ f ) ( x ) = x , ∀ x ∈ X and ( f ∘ f − 1 ) ( y ) = y , ∀ y ∈ Y (f^{-1} \circ f)(x) = x, \quad \forall x \in X \qquad \text{and} \qquad (f \circ f^{-1})(y) = y, \quad \forall y \in Y ( f − 1 ∘ f ) ( x ) = x , ∀ x ∈ X and ( f ∘ f − 1 ) ( y ) = y , ∀ y ∈ Y
The Fundamental Swap of Domain and Range
Because f − 1 f^{-1} f − 1 reverses the direction of mapping: Dom ( f − 1 ) = Ran ( f ) and Ran ( f − 1 ) = Dom ( f ) \text{Dom}(f^{-1}) = \text{Ran}(f) \qquad \text{and} \qquad \text{Ran}(f^{-1}) = \text{Dom}(f) Dom ( f − 1 ) = Ran ( f ) and Ran ( f − 1 ) = Dom ( f )
Four-Step Algebraic Algorithm for Inversion
Establish Domains: Write y = f ( x ) y = f(x) y = f ( x ) and explicitly record Dom ( f ) \text{Dom}(f) Dom ( f ) and Ran ( f ) \text{Ran}(f) Ran ( f ) .
Swap Variables: Exchange x x x and y y y to reflect the mapping across y = x y = x y = x : x = f ( y ) x = f(y) x = f ( y ) .
Solve for y y y : Manipulate the equation algebraically to isolate y y y in terms of x x x .
State the Inverse: Replace y y y with f − 1 ( x ) f^{-1}(x) f − 1 ( x ) and restrict its domain to Dom ( f − 1 ) = Ran ( f ) \text{Dom}(f^{-1}) = \text{Ran}(f) Dom ( f − 1 ) = Ran ( f ) .
Worked Example 1: Inverting a Homographic Function
Consider f ( x ) = a x + b c x + d f(x) = \frac{ax + b}{cx + d} f ( x ) = c x + d a x + b with a d − b c ≠ 0 ad - bc \neq 0 a d − b c = 0 and c ≠ 0 c \neq 0 c = 0 .
Set x = a y + b c y + d x = \frac{ay + b}{cy + d} x = cy + d a y + b .
Multiply out: x ( c y + d ) = a y + b ⟹ c x y + d x = a y + b x(cy + d) = ay + b \implies cxy + dx = ay + b x ( cy + d ) = a y + b ⟹ c x y + d x = a y + b .
Group y y y terms: y ( c x − a ) = − d x + b ⟹ y = − d x + b c x − a y(cx - a) = -dx + b \implies y = \frac{-dx + b}{cx - a} y ( c x − a ) = − d x + b ⟹ y = c x − a − d x + b .
Thus, the general inverse of a homographic function is: f − 1 ( x ) = − d x + b c x − a f^{-1}(x) = \frac{-dx + b}{cx - a} f − 1 ( x ) = c x − a − d x + b
Bocconi Exam Shortcut: When a = − d a = -d a = − d , the function is self-inverse (an involution ), satisfying f − 1 ( x ) = f ( x ) f^{-1}(x) = f(x) f − 1 ( x ) = f ( x ) . For instance, f ( x ) = 3 x + 1 2 x − 3 f(x) = \frac{3x + 1}{2x - 3} f ( x ) = 2 x − 3 3 x + 1 satisfies f ( f ( x ) ) = x f(f(x)) = x f ( f ( x )) = x directly without calculation!
Worked Example 2: Inverting a Restricted Quadratic
Find the inverse of f ( x ) = 2 x 2 − 12 x + 23 f(x) = 2x^2 - 12x + 23 f ( x ) = 2 x 2 − 12 x + 23 defined on the restricted domain [ 3 , ∞ ) [3, \infty) [ 3 , ∞ ) .
Step 1: Determine the Range. Complete the square: f ( x ) = 2 ( x 2 − 6 x ) + 23 = 2 ( x − 3 ) 2 − 18 + 23 = 2 ( x − 3 ) 2 + 5 f(x) = 2(x^2 - 6x) + 23 = 2(x - 3)^2 - 18 + 23 = 2(x - 3)^2 + 5 f ( x ) = 2 ( x 2 − 6 x ) + 23 = 2 ( x − 3 ) 2 − 18 + 23 = 2 ( x − 3 ) 2 + 5
For x ≥ 3 x \ge 3 x ≥ 3 , ( x − 3 ) 2 ≥ 0 (x - 3)^2 \ge 0 ( x − 3 ) 2 ≥ 0 , meaning the minimum occurs at the vertex ( 3 , 5 ) (3, 5) ( 3 , 5 ) . Hence, Ran ( f ) = [ 5 , ∞ ) \text{Ran}(f) = [5, \infty) Ran ( f ) = [ 5 , ∞ ) .
Step 2: Swap Variables and Solve for y y y . x = 2 ( y − 3 ) 2 + 5 ⟹ x − 5 = 2 ( y − 3 ) 2 ⟹ ( y − 3 ) 2 = x − 5 2 x = 2(y - 3)^2 + 5 \implies x - 5 = 2(y - 3)^2 \implies (y - 3)^2 = \frac{x - 5}{2} x = 2 ( y − 3 ) 2 + 5 ⟹ x − 5 = 2 ( y − 3 ) 2 ⟹ ( y − 3 ) 2 = 2 x − 5
Taking the square root yields y − 3 = ± x − 5 2 y - 3 = \pm \sqrt{\frac{x - 5}{2}} y − 3 = ± 2 x − 5 . Since the original domain was x ≥ 3 x \ge 3 x ≥ 3 , the new range must satisfy y ≥ 3 y \ge 3 y ≥ 3 . We must select the positive branch: y = 3 + x − 5 2 y = 3 + \sqrt{\frac{x - 5}{2}} y = 3 + 2 x − 5
Thus, f − 1 ( x ) = 3 + x − 5 2 f^{-1}(x) = 3 + \sqrt{\frac{x - 5}{2}} f − 1 ( x ) = 3 + 2 x − 5 with domain [ 5 , ∞ ) [5, \infty) [ 5 , ∞ ) .
6. Geometric Symmetry Across y = x y = x y = x
The graph of y = f − 1 ( x ) y = f^{-1}(x) y = f − 1 ( x ) is the mirror image of y = f ( x ) y = f(x) y = f ( x ) across the line of identity y = x y = x y = x .
If point ( a , b ) (a, b) ( a , b ) lies on the graph of f f f , then ( b , a ) (b, a) ( b , a ) lies on the graph of f − 1 f^{-1} f − 1 .
Intersection Rule: If f ( x ) f(x) f ( x ) is a strictly increasing function, any points of intersection between f f f and f − 1 f^{-1} f − 1 must lie on the line y = x y = x y = x . Therefore, rather than solving the complex equation f ( x ) = f − 1 ( x ) f(x) = f^{-1}(x) f ( x ) = f − 1 ( x ) , candidates can simply solve the much faster linear equation: f ( x ) = x f(x) = x f ( x ) = x
7. Common Bocconi Traps & Exam Strategies
Confusing Notation: f − 1 ( x ) f^{-1}(x) f − 1 ( x ) denotes the functional inverse under composition, never the reciprocal: 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 .
Omitting Branch Restrictions: Inverting even-degree polynomials ( x 2 , x 4 x^2, x^4 x 2 , x 4 ) over their full domain is impossible because they fail the Horizontal Line Test. When an interval restriction is specified, always verify that the ± \pm ± sign in the inverse matches the restricted domain.
Assuming Semicircle Domain is Full R \mathbb{R} R : When dealing with functions such as f ( x ) = 9 − x 2 f(x) = \sqrt{9 - x^2} f ( x ) = 9 − x 2 , the domain is strictly [ − 3 , 3 ] [-3, 3] [ − 3 , 3 ] and range is [ 0 , 3 ] [0, 3] [ 0 , 3 ] .