University College London · FACULTY OF ECONOMICS

ECON0006 Introduction to Mathematics for Economics

- one subject, every graph, every model, every mark
10 Chapters45-page Bible
Our own words - no uploaded lecturer files
Updated for this semester
The Complete Exam Bible · T1 2026/27

ECON0006 Overview

Introduction to Mathematics for Economics
— set up the objects, show the method and test the conclusion
  • 15 UCL credits
  • University College London
  • Term 1 2026/27
  • In-person study
  • Level 4

ECON0006 Introduction to Mathematics for Economics is the Term 1 mathematics module for students who need to move from strong school-level preparation toward the methods used in later economics study. Its four connected themes are calculus and optimisation, linear algebra, dynamical systems and probability.

  • Assessment Coursework activity contributes 20%; the January written final contributes 80%.
  • Core habit State the domain, dimensions, timing or support before calculating.
  • Exam format Prepare for four technique-focused problems and two reasoning-focused problems.
  • Software boundary Explore with Mathematica during term, then reproduce the reasoning by hand.
  • Final check Verify by substitution, bounds or a second route before interpreting the result.
ECON0006 · University College London
An independent, AskSia-authored study guide. AskSia is not affiliated with, endorsed by, or sponsored by University College London; the course code and name are used for identification only.
Assessment

How ECON0006 is assessed

ComponentWeightFormat
Coursework Portfolio20%Term 1 portfolio of problem sets, study logs, tutorial submissions, forum activity and active participation.
January Exam80%Two-hour in-person closed-book written final with six problems: four technique-focused and two reasoning-focused. Mathematica is not used.

The 20% and 80% weights are stated in the current UCL module pages and agree with the official UCL module catalogue.

Assessment structure

Coursework 20%January Exam 80%Published component weights total 100%

Regular Term 1 activity contributes one fifth of the module result; the written January final contributes four fifths.

Current dates · verify in LMS

Current ECON0006 dates

DateItemControl
18 November 2026Problem Set 1 early deadlineThe current Term 1 page gives 17:00 UK time.
16 December 2026Problem Set 2 early deadlineThe current Term 1 page gives 17:30 UK time.

Dates are as published in the Current Term 1 2026/27 Moodle page. Confirm exact deadlines and submission settings in the live LMS.

Contents · every chapter, one map

What ECON0006 covers

Ten chapters follow the current Term 1 sequence from sets and optimisation to matrices, dynamics, probability and networks, with every method tied to an economic interpretation.

01

Sets, Functions and Unconstrained Optima

Week 1. Domains, derivatives, integration, feasible intervals, stationary points, curvature and boundary checks.

Sets, Functions and Unconstrained Optima establishes the module's answer discipline. A mathematical choice needs a domain, a function and a requested object.

  • Open and closed intervals
  • Economic functions and graphs
  • Derivative direction
  • First-order candidates
  • Second-order classification
  • Boundary optima
02

Vectors, Matrices and Linear Systems

Week 2. Vector operations, matrix dimensions, simultaneous equations, elimination, inverses and quadratic forms.

Vectors, Matrices and Linear Systems expresses linked economic conditions in compact form. Ordered components, dimensions and row-column roles are part of the meaning, not optional labels.

  • Vector addition
  • Scalar multiplication
  • Dot products and norms
  • Matrix dimensions
  • Systems of equations
  • Gaussian elimination
03

Eigenvalues and Spectral Methods

Week 3. Preserved directions, eigenvalue interpretation, spectral representations, matrix powers and optimisation links.

Eigenvalues and Spectral Methods focuses on directions preserved by a linear transformation. An eigenvector remains on its original line, while its eigenvalue records scaling and possible reversal.

  • Preserved directions
  • Eigenvalue scaling
  • Direct substitution checks
  • Independent eigenvectors
  • Spectral representation
  • Matrix powers
04

Constrained Optimisation

Week 4. Feasible sets, Lagrangian reasoning, local classification, inequality boundaries and linear programming.

Constrained Optimisation replaces unrestricted movement with a feasible region. Equality constraints create curves or surfaces, inequalities create regions, and corners may defeat a smooth tangency argument.

  • Feasible regions
  • Equality constraints
  • Constraint gradients
  • Lagrangian reasoning
  • Inequality boundaries
  • Corner solutions
05

Comparative Statics

Week 5. Implicit differentiation, parameter responses, systems of equations and envelope reasoning.

Comparative Statics traces how an optimum or equilibrium changes when an external parameter moves.

  • Defining conditions
  • Implicit differentiation
  • Endogenous responses
  • Parameter shocks
  • Systems of equations
  • Sign assumptions
06

Dynamic Equations and Linear Systems

Week 6. Difference equations, differential equations, stationary states, systems and numerical paths.

Dynamic Equations and Linear Systems follows states through discrete or continuous time. A law of motion, initial information and time convention determine a path.

  • Discrete-time states
  • Continuous-time change
  • Linear difference equations
  • Linear differential equations
  • Stationary states
  • Local stability
07

Boundary Value Problems

Week 10. Second-order equations, path families, independent conditions and boundary versus initial values.

Boundary Value Problems uses conditions at endpoints or other specified locations to select one path from a family generated by a higher-order equation. The equation's order indicates how much independent information is required.

  • Second-order equations
  • Path families
  • Free constants
  • Independent conditions
  • Initial values
  • Boundary values
08

Nonlinear Dynamics

Week 7. Local linearisation, stationary-state stability, small parameters and perturbation reasoning.

Nonlinear Dynamics studies local behaviour when a system's response changes across the state space. Linearisation around a stationary state gives a simpler comparison model for small deviations.

  • Nonlinear state rules
  • Reference states
  • Local linearisation
  • Stability neighbourhoods
  • Small parameters
  • Perturbation order
09

Conditional Probability and Expectation

Week 8. Densities, moments, multivariable integration, conditioning, noisy equations and expected solutions.

Conditional Probability and Expectation turns uncertainty into weighted calculation. A continuous density needs a support, nonnegativity and total area one before it can define probabilities.

  • Probability support
  • Density normalisation
  • Moments and means
  • Joint distributions
  • Conditional probability
  • Conditional expectation
10

Synthetic Data and Networks

Week 9. Synthetic generation, noisy dynamics, random networks, node and edge definitions, and replication.

Synthetic Data and Networks examines controlled random generation and interacting structures. A synthetic dataset needs a declared distribution, dependence pattern, parameters and replication plan.

  • Data-generating processes
  • Random variation
  • Replication
  • Node semantics
  • Directed and undirected edges
  • Degree counts

The teaching sequence begins with sets, functions, derivatives, integration and unconstrained choice, then develops vectors, matrices, simultaneous equations, eigenvalues and constrained optimisation. Later weeks track parameter changes, difference and differential equations, nonlinear stability, random variables, noisy systems, synthetic data and networks.

The module is deliberately calculational.

Its materials emphasise motivating a technique, practising it repeatedly and exploring variations actively. Mathematica supports that exploration by plotting functions, checking solutions and generating new versions of a problem. The final examination, however, is a two-hour in-person closed-book written paper without Mathematica.

The dedicated exam page describes six problems: four primarily test use of mathematical tools and two place more weight on understanding and reasoning. Code interpretation, pseudo-code or graphs produced from code may still appear, so software activity must always be translated into a written method.

Assessment combines a 20% Coursework Portfolio with an 80% January Exam.

The portfolio rewards regular engagement through problem sets, study logs, tutorial submissions, forum activity and active participation. The current summative overview places the final at the start of Term 2. Two dedicated pages contain a conflicting Term 3 phrase, so the exact date should be taken from the live UCL timetable rather than inferred here.

The guide uses one consistent answer routine.

Define the mathematical object and its domain, apply the method with dimensions or time indices visible, verify the result by substitution, bounds or a second route, and close with its economic meaning. Later-week formula-rich notes are not present in the captured material, so those chapters focus on supported concepts and auditable procedures instead of inventing notation or mark schemes.

Worked example · free

Maximise a quadratic utility on its feasible interval

Q [6 marks]. Let u(s)=6s-s² for s in [0,6]. Find the maximiser and maximum value, including the boundary check. The mark allocation for this practice question is not official university assessment guidance; it was written for revision.
The curve plots the original utility u(s)=6s-s²; its highest point occurs at s=3, where the slope changes from positive to negative.The curve plots the original utility u(s)=6s-s²; its highest point occurs at s=3, where the slope changes from positive to negative.3maximumchoiceutility
The curve plots the original utility u(s)=6s-s²; its highest point occurs at s=3, where the slope changes from positive to negative.
  • 2Differentiate to obtain u'(s)=6-2s and solve u'(s)=0, giving the interior candidate s=3.
  • 1Use u''(s)=-2 to classify the candidate as a local maximum.
  • 3Compare u(0)=0, u(3)=9 and u(6)=0, so the global maximum is 9 at s=3.
The feasible choice s=3 maximises utility at 9 on [0,6]. The displayed weighting is an original practice aid, not a UCL marking scheme.
Sia tip — Write the interval beside the derivative so the boundary candidates remain visible.
Glossary

Key terms

Feasible set
The collection of choices that satisfy every restriction in a mathematical problem.
Stationary point
An interior point where the first derivative or gradient is zero.
Hessian matrix
The matrix of second partial derivatives used to study local curvature.
Gaussian elimination
A sequence of equivalent row operations used to simplify and diagnose a linear system.
Eigenvector
A nonzero vector whose direction is preserved by a linear transformation.
Eigenvalue
The scalar that records how a corresponding eigenvector is stretched, compressed or reversed.
Binding constraint
A restriction met as an equality at the selected feasible choice.
Comparative statics
The study of how a solution changes when an external parameter changes.
Stationary state
A dynamic state that reproduces itself under the stated law of motion.
Boundary value
A condition imposed at an endpoint or another specified location of a path.
Linearisation
A local linear approximation to a nonlinear system around a reference state.
Probability density
A nonnegative function whose accumulated area gives probabilities and totals one over its support.
Conditional expectation
A probability-weighted average calculated after specified information is known.
Random network
A network generated by a stated probabilistic rule for nodes, links or link weights.
FAQ

ECON0006 FAQ

How difficult is this module?

The published materials do not provide a difficulty rating. They show a broad calculational sequence and warn that the work is not suitable for postponement until the holiday revision period. Regular by-hand practice, active tutorials and frequent exploration in Mathematica are therefore central to keeping pace.

What is the assessment structure?

The Coursework Portfolio contributes 20% and the January Exam contributes 80%, giving a published total of 100%. The portfolio combines several forms of regular Term 1 activity. The final is the dominant component, but the module page describes steady portfolio work and tutorial participation as preparation for its problem types.

What is the January Exam format?

The dedicated page describes a two-hour in-person written paper with six problems. Four focus on using mathematical tools and techniques, while two emphasise understanding and reasoning. The paper is closed book, and the captured material does not publish item-level marks, a calculator policy or a formula-sheet rule.

Will I use Mathematica in the final?

No. The exam page says Mathematica is not used in the final. It also says questions may ask you to interpret code, provide pseudo-code or interpret graphs produced from code. Revision should therefore connect software exploration to calculations and explanations that can be written by hand.

Are past papers included here?

No past or sample final paper is present in the captured folder. A Week 1 page says a sample exam will be provided later, while the tutorial sheets and problem sets are link-only. The practice in this guide is original and follows published topic and question-type descriptions without reproducing unavailable stems.

What should I revise first?

Begin with domains, derivatives, boundary checks, vector operations and matrix dimensions because those habits control later methods. Continue through constrained choice and parameter responses, then study dynamic paths and local stability. Finish with density normalisation, conditional reasoning and network definitions, while revisiting mixed problems throughout.

How do problem sets support the final?

The module describes the problem sets as exam-type assignments and says the final follows the same broad format as tutorial sheets and problem sets. Use them to practise complete written solutions: setup, calculation, verification and interpretation. Follow current Moodle submission instructions because dates and access windows are operational details.

Chapter questions

Questions students ask in each ECON0006 chapter

Why check endpoints after differentiating?
An interior first-order condition cannot detect a maximum located at the edge of a closed feasible interval. Endpoint values belong in the global comparison whenever those endpoints are included. Chapter 01 · Sets, Functions and Unconstrained Optima
Why do matrix dimensions matter?
They determine whether an operation is defined and how rows and columns align. A product with mismatched inner dimensions is not a valid matrix calculation. Chapter 02 · Vectors, Matrices and Linear Systems
Can an eigenvalue be negative?
Yes. A negative eigenvalue keeps the vector on the same line while reversing its orientation and scaling its magnitude. Direction preservation concerns the line, not the arrow's sign. Chapter 03 · Eigenvalues and Spectral Methods
Why can an unconstrained optimum be irrelevant?
It may lie outside the feasible region. A constrained answer must discard that point and compare valid boundary, corner and interior candidates instead. Feasibility is part of the solution, not an optional check. Chapter 04 · Constrained Optimisation
Why differentiate the whole system?
Endogenous variables move together. Holding one fixed calculates only a partial channel and may reverse or omit the actual equilibrium response. Differentiate every equilibrium condition before solving the response system. Chapter 05 · Comparative Statics
What is the difference between difference and differential equations?
Difference equations advance a state across discrete periods, while differential equations describe an instantaneous rate of change in continuous time. Their notation and data requirements must remain distinct. Chapter 06 · Dynamic Equations and Linear Systems
How many conditions does a higher-order problem need?
The equation's order indicates the expected number of independent pieces of information, but the conditions must also be compatible and genuinely independent. Check that each condition adds a distinct restriction. Chapter 07 · Boundary Value Problems
Why can local stability differ from global stability?
Nonlinear terms can change direction or create other stationary states away from the reference point. A nearby return result does not control the entire state space. Chapter 08 · Nonlinear Dynamics
Can a density exceed one?
Yes. A density is probability per unit and may exceed one over a narrow region. Its integrated probability over an event must remain between zero and one. Chapter 09 · Conditional Probability and Expectation
Why repeat a random simulation?
One realisation contains sampling variation. Repetition reveals the distribution of a statistic and separates a recurring model pattern from an unusual draw. Report both the repeated pattern and its uncertainty. Chapter 10 · Synthetic Data and Networks
Study strategy

How to study for the exam

Study ECON0006 through repeated short calculations rather than one long reading pass. Start each session by writing the object and its domain: a function on an interval, a vector with ordered components, a state indexed by time or a density on a support. Solve one example by hand, verify it independently, then vary one assumption in Mathematica and explain what changed without relying on the screen.

Keep an error log organised by cause: infeasible candidate, reversed derivative sign, dimension mismatch, inconsistent row, stationary point called stable, local approximation used globally, density not normalised or network edge counted twice. Rework each error with fresh numbers or a new diagram. As the January exam approaches, alternate technique and reasoning problems.

Technique practice should make derivatives, component operations, substitution and support checks fluent. Reasoning practice should state assumptions, distinguish local from global claims and translate results into the economic model. Use the live tutorial and problem-set materials for the current operational details, because the captured folder does not include their bodies or item-level marks.

Study ECON0006 with AI

Your AI Economics tutor for ECON0006

Stuck on a hard ECON0006 question? Sia is AskSia’s AI Economics tutor — ask any ECON0006 Introduction to Mathematics for Economics 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.

A+Everything unlocked
Unlocks this Bible + all 32 of your subjects at University College London, plus 1,000+ more Bibles across the AskSia library.
Sia - your ECON0006 tutor, unlimited, worked the way the exam marks it
The full 45-page Bible + practice bank with worked solutions
Chrome extension - sync your LMS so Sia knows your deadlines
Bilingual EN / Chinese on every Bible and every Sia answer
$0.99 Trial
30-day money-back · cancel in one tap · how it works