University College London · FACULTY OF MATHEMATICS

MATH0005 Algebra 1

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

MATH0005 Overview

Algebra 1
— reduce the system, expose the structure and justify every conclusion
  • 15 UCL credits
  • Term 1, 2026/27
  • FHEQ Level 4
  • In-person module

MATH0005 Algebra 1 is UCL's introduction to linear algebra, the language used to describe vectors, matrices, linear equations and transformations. The module begins with matrix arithmetic and multiplication, then uses augmented matrices and row reduced echelon form to classify solution sets and calculate inverses.

  • Solution structure Use augmented RREF to separate contradiction, unique solution and free-variable families.
  • Basis discipline Prove both independence and spanning, and retrieve pivot columns from the original matrix.
  • Map viewpoint Treat matrices as linear maps whose coordinates change when the basis changes.
  • Spectral reasoning Pair each eigenvector column with its eigenvalue and verify AP=PD.
Why read this guide

What you get in the full MATH0005 Exam Bible

  1. 8 chapters, 47 pages — every examinable topic
  2. 22 original practice questions, each with a model answer in the term 3 exam format
  3. 8 worked examples, solved the way MATH0005 marks
  4. 11 computed figures, redrawn from the course’s own numbers
  5. Exam-morning plan for the term 3 exam (75%) — 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.

MATH0005 · 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 MATH0005 is assessed

ComponentWeightFormat
term 3 exam75%In-person exam in the Term 3 assessment period. Standard duration is two hours. Calculators, notes and textbooks are not permitted.
January midsessional exam10%In-person exam in the first week of Term 2, with the same published rules and difficulty as the main exams.
coursework (problems solved in tutorials)10%Tutorial problem work submitted and discussed through the module's coursework process.
online quizzes3%Four quizzes, each contributing 0.75% of the module mark.
tutorial presentation2%The module page states that taking part receives the full component credit.

The official UCL catalogue publishes 85% Exam and 15% Coursework. The module page supplies the five component weights shown here, which reconcile to those category totals.

Term 3 exam 75%Mid 10%CW 10%Exam 85%, coursework 15%
The bar encodes every published component weight and shows how the two exam components and three coursework components reconcile to the official category totals.
Other students are asking · MATH0005

What other students are asking about MATH0005

Where can I find lecture notes or study guides for MATH0005 at ucl?
The MATH0005 study guide in AskSia Library covers Algebra 1 in 8 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 MATH0005, and how much is it worth?
Yes. In the offering this AskSia Library guide is built from, term 3 exam carries 75% of the MATH0005 mark; the full split is term 3 exam 75%, January midsessional exam 10%, coursework (problems solved in tutorials) 10%, online quizzes 3%, tutorial presentation 2%.
What does MATH0005 cover on linear systems, rref and inverses?
In AskSia Library's MATH0005 guide, the Linear Systems, RREF and Inverses chapter explains augmented matrices, legal row operations, solution classification, free variables and inverse construction.
What does MATH0005 cover on subspaces, span and independence?
In AskSia Library's MATH0005 guide, the Subspaces, Span and Independence chapter explains closure tests, generating sequences, dependence relations and basis conditions.
What does MATH0005 cover on bases, dimension and rank?
In AskSia Library's MATH0005 guide, the Bases, Dimension and Rank chapter explains dimension, null and column spaces, pivot columns, row rank and rank-nullity.
Weights, dates and every chapter are set out with their sources further down this page.
Current dates · verify in LMS

Current MATH0005 dates

DateItemControl
Week beginning 11 January 2027January midsessional examStudents are instructed to be in London for the full first week of Term 2.
26 April to 11 June 2027Term 3 examination periodThe exact main-exam date is published separately in the personal timetable.

Dates are as published in the MATH0005 exams page for 2026/27. Confirm exact deadlines and submission settings in the live LMS.

Contents · every chapter, one map

What MATH0005 covers

Eight connected chapters move from matrix arithmetic and systems to subspaces, maps, spectral methods and orthogonal geometry.

01

Matrix Operations and Multiplication

Compatible dimensions, row-column products, linear combinations, transpose and composition.

Matrix Operations and Multiplication establishes the objects and rules used throughout linear algebra. A matrix has a fixed number of rows and columns, and that shape controls which additions and products are legal.

  • Matrix dimensions
  • Entrywise operations
  • Row-column products
  • Linear combinations
  • Transpose identities
  • Identity matrices
In the full guide: 4 pages · 2 practice questions · 1 figure
02

Linear Systems, RREF and Inverses

Augmented matrices, legal row operations, solution classification, free variables and inverse construction.

Linear Systems, RREF and Inverses uses elementary row operations to expose the complete structure of a system. An augmented matrix records coefficients and constants together.

  • Augmented matrices
  • Elementary row operations
  • Reduced echelon form
  • Solution classification
  • Free variables
  • Fundamental solutions
In the full guide: 5 pages · 2 practice questions · 1 figure
03

Subspaces, Span and Independence

Closure tests, generating sequences, dependence relations and basis conditions.

Subspaces, Span and Independence distinguishes three related questions. A subspace must contain zero and remain closed under every linear combination of its members.

  • Subspace closure
  • Homogeneous constraints
  • Linear combinations
  • Spanning sequences
  • Dependence relations
  • Basis tests
In the full guide: 4 pages · 2 practice questions · 1 figure
04

Bases, Dimension and Rank

Dimension, null and column spaces, pivot columns, row rank and rank-nullity.

Bases, Dimension and Rank turns a spanning and independence argument into a numerical invariant. Every basis of a finite-dimensional subspace has the same number of vectors, called its dimension.

  • Basis size
  • Dimension
  • Fundamental solutions
  • Column rank
  • Row space
  • Rank-nullity
In the full guide: 5 pages · 2 practice questions · 1 figure
05

Linear Maps and Coordinate Change

Kernels, images, representation matrices, basis coordinates and similarity.

Linear Maps and Coordinate Change treats a matrix as a representation of a transformation rather than only an array. A linear map preserves addition and scalar multiplication, so its action on a basis determines its action on every vector.

  • Linear maps
  • Kernel and image
  • Representation matrices
  • Coordinate vectors
  • Basis matrices
  • Map composition
In the full guide: 4 pages · 2 practice questions · 1 figure
06

Eigenvalues, Diagonalisation and Determinants

Characteristic polynomials, eigenspaces, multiplicity, determinants and diagonal form.

Eigenvalues, Diagonalisation and Determinants identifies directions on which a linear map acts by simple scaling. A nonzero vector v is an eigenvector when Av=lambda v.

  • Determinant rules
  • Characteristic polynomial
  • Eigenvalues
  • Eigenspaces
  • Algebraic multiplicity
  • Geometric multiplicity
In the full guide: 5 pages · 2 practice questions · 1 figure
07

Inner Products, Geometry and Projections

Lengths, angles, orthogonality, projection and residual checks.

Inner Products, Geometry and Projections adds metric geometry to vector spaces. The dot product defines length and, for nonzero real vectors, the angle between directions. A zero dot product identifies orthogonality.

  • Real dot product
  • Complex dot product
  • Vector length
  • Angles
  • Orthogonality
  • Projection
In the full guide: 4 pages · 2 practice questions · 1 figure
08

Gram-Schmidt and the Spectral Theorem

Orthogonalisation, orthogonal matrices, symmetric operators and orthonormal eigenbases.

Gram-Schmidt and the Spectral Theorem joins orthogonal geometry to spectral structure.

  • Gram-Schmidt
  • Projection subtraction
  • Orthonormal bases
  • Orthogonal matrices
  • Symmetric matrices
  • Spectral theorem
In the full guide: 5 pages · 2 practice questions · 1 figure

From there it develops subspaces, span, linear independence, bases and dimension. These ideas meet in rank-nullity, which accounts for the directions a matrix preserves in its image and the directions it sends to zero.

The later material treats matrices as linear maps.

Coordinate vectors show how the same underlying vector can have different numerical descriptions in different bases, while similarity records one operator under a basis change. Eigenvectors identify directions that a map only scales, determinants detect invertibility and volume change, and diagonalisation replaces a coupled transformation with independent scalar actions when a full eigenbasis exists.

Inner products then add length and angle, enabling projections, Gram-Schmidt orthogonalisation and the spectral theorem for real symmetric matrices.

Assessment is split across a heavily weighted Term 3 exam, a January midsessional and three coursework elements. Both exams are in person and last two hours under the published standard conditions. Calculators, notes and textbooks are not permitted.

The current exam advice emphasises justification: when a question asks for a reason, state the result you are using and connect its hypotheses to the data. This guide therefore treats a proof sentence and an independent structural check as part of every complete solution.

Worked example · free

Project a vector onto a line and verify the residual

Q [8 marks]. Project v=(3,1,2) onto u=(1,2,0), then find the residual and its distance from the line spanned by u. The displayed points are an original AskSia practice allocation, not an official UCL marking scheme.
The vector (3,1,2) splits into projection (1,2,0) along the grey line and residual (2,-1,2), whose right-angle marker records their zero dot product.The vector (3,1,2) splits into projection (1,2,0) along the grey line and residual (2,-1,2), whose right-angle marker records their zero dot product.proj=(1,2,0)r=(2,-1,2)v=(3,1,2)v = projected component + orthogonal residual
The vector (3,1,2) splits into projection (1,2,0) along the grey line and residual (2,-1,2), whose right-angle marker records their zero dot product.
  • 2Compute v dot u=5 and u dot u=5, so the projection coefficient is 1.
  • 2The projection is (1,2,0), and the residual v minus the projection is (2,-1,2).
  • 2Check (2,-1,2) dot (1,2,0)=0, proving the residual is perpendicular to the line.
  • 2The distance is the residual length sqrt(4+1+4)=3, and projection plus residual reconstructs v.
The projection is (1,2,0), the orthogonal residual is (2,-1,2), and the distance to the line is 3. The displayed points are an original practice allocation, not an official UCL marking scheme.
Sia tip — After projecting, dot the residual with the target direction and reconstruct the original vector before accepting the answer.
Glossary

Key terms

Augmented matrix
A coefficient matrix with the system's constant column appended for simultaneous row reduction.
Row reduced form
The unique echelon form whose pivots are one and are the only nonzero entries in their columns.
Null space
The subspace of all input vectors mapped to zero by a matrix or linear map.
Column space
The subspace spanned by a matrix's columns, equal to the image of its matrix map.
Linear independence
The property that only the all-zero coefficient combination of a sequence equals zero.
Basis
A linearly independent sequence that spans the stated vector space or subspace.
Dimension
The number of vectors in any basis of a finite-dimensional space.
Rank
The dimension of a matrix's column space, equal to the number of pivot columns.
Linear map
A function that preserves vector addition and scalar multiplication.
Coordinate vector
The coefficient column that represents a vector relative to an ordered basis.
Eigenvalue
A scalar by which a linear map scales a corresponding nonzero eigenvector.
Eigenspace
The null space of lambda I minus A for a specified eigenvalue lambda.
Projection
The component of a vector lying in a chosen direction or subspace.
Orthonormal basis
A basis whose vectors have unit length and are mutually orthogonal.
FAQ

MATH0005 FAQ

How difficult is this module?

The published materials do not provide a difficulty rating. They do show a broad chain of dependent ideas, from RREF and bases to eigenvectors and orthogonality, and an 85% combined exam weighting. The practical challenge is keeping definitions, computation and justification connected under closed-resource, calculator-free conditions.

What is the assessment structure?

The term 3 exam contributes 75%, the January midsessional exam 10%, tutorial-problem coursework 10%, online quizzes 3%, and the tutorial presentation 2%. The two exams total the catalogue's 85% Exam category, while the remaining components total its 15% Coursework category.

What are the exam conditions?

The current page states that MATH0005 exams are in person and last two hours under standard conditions. Calculators are not allowed, and students cannot bring notes or textbooks. Any approved reasonable adjustment can change an individual student's time, and the live paper controls its own detailed instructions.

When is the midsessional exam?

The module page places the midsessional in the first week of Term 2, beginning 11 January 2027, and instructs students to be in London for that entire week. The exact personal timetable remains the operational source for time and location.

Which past papers should I use?

Start with the 2025/26 main exam, midsessional and sample paper, all of which are provided with solutions. The module warns that the syllabus changed significantly in 2025/26, so earlier papers should be used only for the specific questions identified as relevant on the current Moodle page.

How much justification should I write?

When a question asks for justification, state the mathematical result you are using and explain how its hypotheses fit the problem. The module says theorem numbers are unnecessary, but a bare answer or an unexplained theorem name can lose marks. A short structural check strengthens the conclusion.

What should I revise first?

Begin with matrix dimensions, row reduction and complete solution sets. Then practise subspace tests, basis extraction and rank-nullity before moving to coordinate change and eigenvectors. Finish with determinants, projection, Gram-Schmidt and symmetric matrices, while continuing mixed retrieval of earlier methods.

Chapter questions

Questions students ask in each MATH0005 chapter

Why does multiplication order matter?
The rightmost factor acts on the input first, so changing the order changes the composition. The products may have different dimensions, and even when both exist their row-column pairings differ. A dimension check explains legality, while a simple example shows that equality cannot be assumed. Chapter 01 · Matrix Operations and Multiplication
How do I tell how many solutions exist?
Read the augmented RREF. A row ending in a nonzero constant after all coefficient entries are zero is a contradiction, so there is no solution. Without a contradiction, free variables give infinitely many solutions, and no free variables give one solution. Chapter 02 · Linear Systems, RREF and Inverses
What is the fastest way to reject a subspace?
Test the zero vector first. A condition with a nonzero constant often fails immediately. Otherwise find one pair of members whose sum leaves the set or one member whose scalar multiple leaves it, and display the counterexample explicitly. Chapter 03 · Subspaces, Span and Independence
Why use original columns for the column space?
Row operations preserve linear relations needed to identify pivot positions, but they change the actual columns through left multiplication. Therefore the RREF tells you which positions to choose, while the basis vectors themselves must come from the original matrix. Chapter 04 · Bases, Dimension and Rank
How do I build a standard matrix?
Apply the linear map to each standard basis vector of the domain and place those output vectors as columns in order. Linearity then guarantees that multiplying this matrix by any coordinate column reproduces the map's action on the corresponding vector. Chapter 05 · Linear Maps and Coordinate Change
Do repeated eigenvalues prevent diagonalisation?
Not automatically. A repeated eigenvalue is compatible with diagonalisation when its eigenspace has enough independent vectors. Compare geometric multiplicity with algebraic multiplicity and check whether the total number of independent eigenvectors reaches the matrix dimension. Chapter 06 · Eigenvalues, Diagonalisation and Determinants
Why is projection order important?
Projecting v onto u produces a vector in the line spanned by u and divides by u dot u. Reversing the order targets a different line and uses a different denominator. State the target direction before substituting numbers. Chapter 07 · Inner Products, Geometry and Projections
What does a zero residual mean?
It means the current input vector already lies in the span of the earlier vectors, so the original sequence is dependent at that stage. There is no new direction to normalise, and dividing by the residual length would be invalid. Chapter 08 · Gram-Schmidt and the Spectral Theorem
Study strategy

How to study for the exam

Study MATH0005 through dependencies and error checks. First make row operations automatic: write every operation, preserve parameter cases and express solution sets as a particular vector plus null-space directions. Next connect subspace, span and independence to basis construction, then use pivot counts and free variables to reconcile rank-nullity.

For linear maps, label domain, codomain and every coordinate basis before multiplying. Build eigenvalue answers in a fixed order: characteristic polynomial, roots, eigenspace bases, eigenvector count, then diagonal form if the basis criterion is met. In geometry, derive projection coefficients from the orthogonality condition and verify residuals by dot products.

Apply Gram-Schmidt one residual at a time, testing cross dot products before normalising. Use the 2025/26 current-syllabus practice papers for mixed timing, but write fresh solutions from a blank page and compare methods only after finishing. Keep an error log by cause, such as reversed factor order, lost zero-parameter case, RREF columns used for the image, basis label omitted, eigenpair mismatch or projection reversed.

In the final week, alternate one two-hour mixed set with short theorem-statement drills. End every answer with the requested conclusion and one defining structural check.

Study MATH0005 with AI

Your AI Mathematics tutor for MATH0005

Stuck on a hard MATH0005 question? Sia is AskSia’s AI Mathematics tutor — ask any MATH0005 Algebra 1 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 MATH0005 tutor, unlimited, worked the way the exam marks it
The full 47-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