ECON10071 Advanced Mathematics
ECON10071 Overview
- The University of Manchester
- Semester 1 2026/27
- 12 chapters
- Mathematics
ECON10071 Advanced Mathematics develops the mathematical language used to describe multivariate economic relationships and solve optimisation problems.
- Assessment Two examinations contribute 30% and 70%.
- Calculus Differentiate symbolically before evaluating at a point.
- Optimisation Necessary conditions produce candidates, not automatic maxima.
- Linear algebra Dimensions, determinant and rank control legal conclusions.
- Final move Interpret the classification in the economic setting.
What you get in the full ECON10071 Exam Bible
- 12 chapters, 38 pages — every examinable topic, week by week
- 30 original practice questions, each with a model answer in the Final examination format
- 12 worked examples, solved the way ECON10071 marks
- 12 computed figures, redrawn from the course’s own numbers
- Exam-morning plan for the Final examination (70%) — what to revise last, where marks are lost
Free on this page: assessment table, chapter map, one worked example, key terms, FAQ. The rest is in the full exam bible.
How ECON10071 is assessed
| Component | Weight | Format |
|---|---|---|
| Mid-term examination | 30% | Online 60-minute examination in Möbius. The dated instruction deck states four compulsory questions covering Weeks 2 to 6. |
| Final examination | 70% | In-person, closed-book, 90-minute examination in the January examination period. |
What other students are asking about ECON10071
- Where can I find lecture notes or study guides for ECON10071 at manchester?
- The ECON10071 study guide in AskSia Library covers Advanced Mathematics in 12 chapters, with the assessment table, a chapter-by-chapter topic map, key terms and a worked example, free to read on this page.
- Is there a final exam in ECON10071, and how much is it worth?
- Yes. In the offering this AskSia Library guide is built from, Final examination carries 70% of the ECON10071 mark; the full split is Mid-term examination 30%, Final examination 70%.
- What does ECON10071 cover on partial and mixed derivatives?
- In AskSia Library's ECON10071 guide, the Partial and Mixed Derivatives chapter explains first partials, mixed effects, evaluation points and marginal interpretation.
- What does ECON10071 cover on chain rules and implicit differentiation?
- In AskSia Library's ECON10071 guide, the Chain Rules and Implicit Differentiation chapter explains composite paths, total differentials and level-curve slopes.
- What does ECON10071 cover on homogeneous functions and scaling?
- In AskSia Library's ECON10071 guide, the Homogeneous Functions and Scaling chapter explains joint input scaling, degree, returns to scale and Euler checks.
Current ECON10071 dates
| Date | Item | Control |
|---|---|---|
| 9 to 10 November 2026 | Mid-term examination availability | The assessment provides one continuous hour after opening and closes at the fixed final time. |
| 14 to 31 January 2027 | Final examination period | The exact personal examination date is not stated on the module page. |
Dates are as published in the Semester 1 2026/27 module page and midterm instruction deck. Confirm exact deadlines and submission settings in the live LMS.
What ECON10071 covers
Twelve connected chapters move from multivariate functions and calculus through constrained optimisation to matrix systems, rank, definiteness and concave programming.
Multivariate Functions and Level Curves
Domains, surfaces, level sets and economic contour interpretation.Multivariate Functions and Level Curves establish the geometric language for the module. A function maps admissible input bundles to an output, while the domain records every bundle for which the expression and economic interpretation are valid.
- Domains of multivariate functions
- Graphs as surfaces
- Level sets and level curves
- Economic contour interpretation
- Nested contour ordering
- Input and output labels
Partial and Mixed Derivatives
First partials, mixed effects, evaluation points and marginal interpretation.Partial and Mixed Derivatives extend familiar calculus rules to functions with several inputs. A first partial changes one variable while holding the others fixed, so its notation describes the experiment being measured.
- First partial derivatives
- Held-fixed inputs
- Product and chain rules
- Mixed partial derivatives
- Evaluation points
- Marginal interpretation
Chain Rules and Implicit Differentiation
Composite paths, total differentials and level-curve slopes.Chain Rules and Implicit Differentiation track output change when several inputs move together. The chain rule adds every dependency path, while a total differential gives the local linear effect of small simultaneous input changes.
- Composite dependency paths
- Multivariate chain rule
- Total differentials
- Local approximations
- Implicit level equations
- Nonzero denominator condition
Homogeneous Functions and Scaling
Joint input scaling, degree, returns to scale and Euler checks.Homogeneous Functions and Scaling analyse what happens when every input changes proportionally. A degree r function multiplies output by tʳ when all inputs are multiplied by t.
- Joint input scaling
- Degree of homogeneity
- Monomial exponent sums
- Common degree across sums
- Returns to scale
- Euler consistency check
Feasible Sets and Types of Optimum
Binding constraints, interior and boundary points, local and global claims.Feasible Sets and Types of Optimum separate admissible choices from attractive but impossible ones. Every candidate must satisfy all equality, inequality and non-negativity restrictions. Binding constraints hold with equality; slack constraints do not.
- Objective and choice variables
- Feasible sets
- Binding and slack constraints
- Interior and boundary points
- Local and global maxima
- Existence of optima
Unconstrained Stationary Points
First-order candidates, counterexamples and global algebraic proofs.Unconstrained Stationary Points begin with a necessary condition: an interior local maximum of a differentiable objective has zero first partial derivatives.
- Gradient equations
- Stationary candidates
- Necessary conditions
- False converse
- Local classification
- Global algebraic bounds
Equality-Constrained Optimisation
Lagrangians, tangency, multiple constraints and existence.Equality-Constrained Optimisation restricts choices to a curve or surface. At a regular optimum, the objective and constraint gradients are parallel, and the Lagrangian expresses that tangency with a multiplier.
- Constraint tangency
- Lagrangian construction
- Multiplier equations
- Feasibility conditions
- Multiple equality constraints
- Existence and classification
Inequality Constraints and Kuhn-Tucker
Active sets, complementary slackness, multiplier signs and comparative statics.Inequality Constraints and Kuhn-Tucker allow an optimum to be interior or on a boundary. The conditions combine stationarity, primal feasibility, multiplier signs and complementary slackness.
- Inequality orientation
- Primal feasibility
- Dual feasibility
- Complementary slackness
- Active-set cases
- Multiplier comparative statics
Matrix Operations and Transposes
Dimensions, products, identity matrices, powers and transpose order.Matrix Operations and Transposes organise economic quantities by rows and columns. Addition is entrywise and requires identical dimensions.
- Matrix dimensions
- Entrywise addition
- Row-column multiplication
- Noncommutativity
- Identity matrices
- Transpose of a product
Determinants, Inverses and Linear Systems
Invertibility, unique solutions, singular systems and comparative changes.Determinants, Inverses and Linear Systems connect a square coefficient matrix to the existence of a unique solution. A nonzero determinant permits an inverse and gives x=A inverse b.
- Two-by-two determinants
- Matrix inverses
- Unique solutions
- Singular systems
- Consistency checks
- Comparative right-hand-side changes
Rank and Solution Structure
Dependence, augmented rank, consistency and free parameters.Rank and Solution Structure measure how much independent information remains in a matrix. Row reduction reveals pivot positions and therefore rank. For a linear system, equality of coefficient and augmented ranks gives consistency.
- Linear dependence
- Pivot positions
- Coefficient rank
- Augmented rank
- Consistency theorem
- Free parameter count
Definiteness and Concave Programming
Quadratic forms, principal minors, Hessians and global sufficiency.Definiteness and Concave Programming connect matrix signs to optimisation curvature. A symmetric matrix defines a quadratic form, with each cross-term coefficient split across two equal off-diagonal entries.
- Symmetric quadratic forms
- Cross-term coefficients
- Leading principal minors
- Positive definiteness
- Negative definiteness
- Concave-program sufficiency
The module begins with functions of several variables, level curves, partial derivatives, chain rules, total differentials, implicit differentiation and homogeneous functions. Those ideas support the later analysis of objective functions, feasible sets, stationary points and constraints.
The optimisation block distinguishes local from global claims and interior from boundary choices.
Unconstrained first-order conditions generate candidates but do not prove a maximum. Equality constraints introduce the Lagrange method, while inequalities require Kuhn-Tucker conditions, multiplier signs and complementary slackness.
Concavity and convexity then explain when a candidate is globally decisive and when a multiplier can be read as a local value of relaxing a resource constraint.
The linear-algebra block turns arrays of economic quantities into matrix operations, transposes and products. Determinants and inverses solve full-rank systems; rank and augmented rank distinguish unique, nonexistent and infinite solution sets.
Quadratic forms and Hessian definiteness connect matrix signs back to curvature and optimisation. Throughout the module, the strongest answers state the domain and constraints, show the method, verify the candidate and interpret what the mathematical result means in the economic setting.
Worked example · free
Classify and solve a constrained maximum
- 2Write L=ln(x)+ln(y)+λ(10−x−y) and derive the two choice conditions plus feasibility.
- 3Equating both marginal conditions gives x=y; the constraint then gives x=5 and y=5.
- 2Strict concavity of the objective on the linear feasible set proves that the candidate is the unique global maximum.
Key terms
- Level curve
- A set of input bundles that all produce the same output value.
- Partial derivative
- The rate of change in one input direction while the other inputs remain fixed.
- Total differential
- A local linear approximation to output change from simultaneous small input changes.
- Homogeneous function
- A function whose output scales by a fixed power when every input scales proportionally.
- Feasible set
- The collection of choices that satisfy every restriction in an optimisation problem.
- Stationary point
- A point at which every first partial derivative of the objective is zero.
- Lagrangian
- An expression combining an objective with constraints through multipliers.
- Complementary slackness
- A Kuhn-Tucker condition requiring each multiplier times its constraint slack to equal zero.
- Matrix rank
- The number of linearly independent rows or columns in a matrix.
- Determinant
- A scalar that tests invertibility for a square matrix and captures its signed volume scaling.
- Quadratic form
- A scalar expression written as a vector transpose times a matrix times the vector.
- Negative definite
- A matrix classification producing a negative quadratic form for every nonzero vector.
ECON10071 FAQ
How difficult is this module?
The official course information gives no difficulty rating. The published structure shows a mathematics-intensive module in which a 70% closed-book final follows multivariate calculus, optimisation and linear algebra. The practical challenge is not formula recall alone: each solution must preserve domains, feasibility, matrix dimensions and the proof needed for a local or global claim.
What is the assessment structure?
The mid-term examination contributes 30% and the final examination contributes 70%, so the numeric rows total 100%. The midterm is online in Möbius and lasts 60 minutes. The final is in person, closed book and lasts 90 minutes during the January examination period.
What is the midterm format?
The dated instruction deck states four compulsory questions covering material taught in Weeks 2 to 6 inclusive. Answers are entered in Möbius, and incorrect syntax may lose marks. Once opened, the attempt gives one continuous hour, but the fixed closing time can shorten an attempt that begins late.
What is the final examination format?
The current course page states a 90-minute, closed-book, in-person final in the January examination period. It does not publish section names, question count, permitted aids or a final marking breakdown. Prepare the taught methods and follow the live paper instructions rather than assuming a structure.
How should I practise Möbius syntax?
Use explicit multiplication, brackets around full numerators and denominators, correct function names and the requested decimal precision. Keep exact fractions where appropriate and preview the expression before submitting. Syntax practice should accompany the mathematics because a correctly reasoned expression can still be marked wrong if it is entered differently from what you intend.
What should I revise first?
Begin with domains, level curves and partial derivatives, then chain rules and implicit slopes. Move to feasibility and stationary points before constrained optimisation. Finish with matrix products, systems, rank and definiteness. In every topic, practise the same closing routine: verify conditions, classify the result and explain the economic meaning.
Questions students ask in each ECON10071 chapter
- How is a level curve different from a graph?
- The graph shows output as height above the input plane, while a level curve stays in the input plane and connects bundles with one constant output. A family of contours summarises multiple horizontal slices of the surface. Chapter 01 · Multivariate Functions and Level Curves
- What does holding another input fixed mean?
- Treat every other input and parameter as a constant during differentiation. Terms containing only those fixed symbols have derivative zero, while their values remain as coefficients in terms that also contain the changing input. Chapter 02 · Partial and Mixed Derivatives
- When should I use a multivariate chain rule?
- Use it when an output depends on intermediate inputs that themselves depend on a changing parameter. Add the contribution along every path and evaluate all partial derivatives at the same current input bundle. Chapter 03 · Chain Rules and Implicit Differentiation
- How do I test a sum of terms?
- Scale every input by the same positive factor, simplify each term and compare the powers of that factor. The full function is homogeneous only if one common power factors from every term. Chapter 04 · Homogeneous Functions and Scaling
- Can a boundary point have slack expenditure?
- Yes. A non-negativity restriction can bind while the resource inequality remains strict. Boundary status refers to the edge of the entire feasible set, not only to the most prominent budget line. Chapter 05 · Feasible Sets and Types of Optimum
- Does a zero gradient prove a maximum?
- No. It is a necessary condition for an interior differentiable optimum, but stationary points can be minima or saddles. A curvature, path, comparison or global bounding argument is still required. Chapter 06 · Unconstrained Stationary Points
- Why is the unconstrained gradient not zero at a constrained optimum?
- The objective may still rise in an infeasible direction. At a regular constrained optimum, its gradient is instead parallel to the constraint gradient, so no feasible tangent movement improves the objective. Chapter 07 · Equality-Constrained Optimisation
- What does complementary slackness require?
- For each inequality, the multiplier times its slack equals zero. Therefore a slack restriction must have a zero multiplier, while a positive multiplier can occur only when the corresponding restriction binds. Chapter 08 · Inequality Constraints and Kuhn-Tucker
- Why does multiplication order matter?
- Rows of the first factor are paired with columns of the second. Reversing the factors changes those pairings, can produce a different result and may make the product undefined when dimensions no longer conform. Chapter 09 · Matrix Operations and Transposes
- Does a zero determinant mean no solution?
- No. It means the coefficient matrix is singular and cannot give a unique inverse solution. The equations can be inconsistent, giving no solution, or dependent, giving infinitely many solutions. Chapter 10 · Determinants, Inverses and Linear Systems
- How does rank determine the number of solutions?
- Equal coefficient and augmented ranks give consistency. If that rank equals the number of unknowns, the solution is unique; if smaller, free parameters remain and infinitely many solutions exist. Chapter 11 · Rank and Solution Structure
- How is a cross term placed in a symmetric matrix?
- A term 2kxy is generated by the two equal products a12xy and a21yx, so each off-diagonal entry is k. Forgetting the split doubles the cross effect and changes the determinant. Chapter 12 · Definiteness and Concave Programming
How to study for the exam
Study the module as a sequence of proof obligations. For calculus, state the domain and what is held fixed, differentiate symbolically, then evaluate. For optimisation, draw or describe the feasible set before selecting unconstrained, Lagrange or Kuhn-Tucker conditions. Keep every feasibility equation and multiplier sign visible, and add a curvature, comparison or bounding argument before using the words local or global.
For matrices, predict dimensions, compute one entry independently and test determinant or rank before claiming uniqueness. Alternate short Möbius entry drills with handwritten derivations so syntax never replaces reasoning.
Build an error log with categories such as early substitution, omitted chain path, discarded boundary case, reversed multiplier sign, illegal matrix product, singular inverse and incorrect cross-term coefficient. In the final revision week, solve mixed sets from a blank page and close every answer with the domain, classification, units or economic meaning that makes the number useful.
Your AI Mathematics tutor for ECON10071
Stuck on a hard ECON10071 question? Sia is AskSia’s AI Mathematics tutor — ask any ECON10071 Advanced Mathematics question and get a clear, step-by-step explanation grounded in how the course is actually taught and assessed. Read this whole study guide free, then take your hardest questions to Sia.