MA2001: ace the component, not just read the notes
Your complete guide to National University of Singapore's linear algebra i course. See where the marks are, work real practice questions, and study with an AI tutor that knows MA2001.
Sia generates MA2001 practice questions, walks through systems of linear equations and determinants step by step, and quizzes you on the material the component that weights most heavily.
Worked example
Let A be the 3x3 matrix with rows (1, 2, 3), (2, 4, 7) and (3, 6, 10). What are the rank of A and the dimension of its null space?
Look at the columns before computing anything. The second column is exactly twice the first, so the three columns are not linearly independent and the rank is at most 2.
Apply the rank-nullity theorem. For a matrix with 3 columns, rank plus nullity equals 3, so the nullity is 3 minus 2, which is 1.
Sanity check the answer against the geometry: the transformation collapses R^3 onto a 2-dimensional image, and the 1-dimensional null space is exactly what gets crushed to zero.
The trap: Answering rank 2, nullity 2. The rank-nullity theorem counts columns, not rows: for an m by n matrix, rank plus nullity equals n, the dimension of the domain. With a square matrix the distinction is invisible, which is exactly why it survives until an exam question uses a non-square one. State the theorem with n in it every time you use it. classic slip!
Overview
What MA2001 is, and where it sits
MA2001 is the first linear algebra course in the NUS Department of Mathematics, and it is the version taken by mathematics, statistics and data science majors rather than the service versions taught to engineering or computing students. The distinction matters: MA2001 presents proofs of its results, in the concrete setting of Euclidean space, rather than presenting the results alone.
The stated aim is two-sided. Students are expected to acquire computational facility with vectors and matrices, and geometric intuition about what those computations mean. A student who can row-reduce reliably but cannot say what the rank of a matrix tells you about the underlying transformation has done only half the course.
Structurally the syllabus moves from the concrete to the abstract and back. It opens with systems of linear equations, elimination and matrix inverses, then determinants. Chapter 3 introduces the ideas that make linear algebra a subject rather than a technique: subspaces, linear independence, basis, dimension and rank. Linear transformations follow, with kernel, range and the rank-nullity theorem tying the earlier computation to the new vocabulary. The course closes with inner products and orthogonality, the Gram-Schmidt process, eigenvalues, diagonalisation and similarity, and then applications.
MA2001 sits upstream of a great deal. It is a prerequisite or recommended pairing for Linear Algebra II, multivariable calculus, mathematical analysis, probability, regression analysis, machine learning and the data science and analytics major sequence, so the return on doing it properly is unusually high.
Always treat your own course outline and the exam timetable as authoritative.
Difficulty & time commitment
Is MA2001 hard, and how much time does it take?
MA2001 is manageable if you keep a weekly rhythm and treat the back half as the main event. The pattern is consistent: it starts gently and steepens, and the heaviest assessment is the part that separates grades.
The difficulty curve and the assessment weighting point the same way: the back half is harder and worth more. Front-loading effort there is the highest-return decision in the course.
Is this course for you
Who tends to do well, and who tends to struggle
You will likely do well if
- You are willing to treat Chapter 3 as a new subject rather than a continuation. Subspaces and dimension are where the course actually begins.
- You check your computations against their geometric meaning, since the course explicitly asks for both facility and intuition.
- You can follow a proof and reproduce its structure, not only its conclusion.
- You practise by hand. Row reduction done mentally is faster in an examination than row reduction done by recall of a procedure.
You may struggle if
- You are relying on A-level matrix technique. That covers Chapter 1 and little beyond it.
- You skip the definitions. Linear independence, basis, rank and dimension are defined precisely, and questions turn on the precise definition rather than the intuitive gloss.
- You avoid proofs. They are presented in the concrete setting specifically so that they are followable, which means you are expected to follow them.
- You leave eigenvalues to the end. Chapter 6 is the most reused material in later courses and the least forgiving to rush.
- For every theorem, construct one example and one non-example. The non-example is what tells you which hypothesis is doing the work.
- Keep a running translation table between the three languages of the course: systems of equations, matrices, and transformations of space. Most examination questions are one language dressed as another.
- Do the Gram-Schmidt process by hand enough times that it is a routine rather than a lookup; it appears in later courses as an assumed skill.
- When you compute a rank, say out loud what it implies about the null space. Linking the two is exactly what the rank-nullity questions test.
Syllabus
The 7 topics, chapter by chapter
The exam-weight marker on each topic shows where the marks concentrate. The amber topics carry the highest exam weight.
C1 · Systems of linear equations
Chapter 1Matrices, elementary row operations, Gauss-Jordan elimination and matrix inverses. Mechanical, and the foundation everything else is expressed in. Speed and accuracy here pay off all semester.
C2 · Determinants
Chapter 2Cofactor expansion and the properties of determinants, including what a zero determinant tells you about invertibility and about the system behind the matrix.
C3 · Euclidean n-space
Chapter 3Subspaces, linear independence, basis and dimension, and the rank of a matrix. The abstraction step: the point where the course stops being arithmetic and most students either consolidate or fall behind.
C4 · Linear transformations from R^n to R^m
Chapter 4Kernel and range, and the rank-nullity theorem. This is where the matrix computations of Chapters 1 and 2 acquire a meaning in terms of what a transformation does to space.
C5 · Inner products
Chapter 5Angles and orthogonality, orthonormal bases, and the Gram-Schmidt process for producing one. Geometry re-enters the algebra here.
C6 · Eigenvalues and eigenvectors
Chapter 6Diagonalisation and similarity: finding the basis in which a transformation is simplest to describe. The single most reused idea from this course in later statistics and data science work.
C7 · Applications
Chapter 7Selected applications of the machinery built through the course, showing where linear algebra does work in other fields.
How it's assessed
Assessment structure
A component-by-component weighting breakdown is not published for this course. Rather than estimate one, we publish only what the course itself states. Check your current course outline for the exact percentages.
No component weighting is published for MA2001 by the department, so none is asserted here. Check your own current course outline for this semester's breakdown. What the department does publish is the standard it examines this material to: its advanced placement test for MA2001 is a closed-book two-hour paper with no formula list, helpsheets disallowed, and only non-programmable, non-graphing calculators permitted, with candidates required to answer every question and to lay out their working systematically. Not published for the course itself. The department's placement paper for the same material is closed book with no formula sheet, which is a reasonable guide to the level of recall expected.
How to actually pass it
A weekly rhythm, two checklists, and the traps to avoid
The course rewards consistency over cramming, and practice over re-reading. Here is the loop that works, then what to have nailed before each exam.
The weekly loop
Before the mid-semester checklist
- Gauss-Jordan elimination and matrix inversion, quickly and without slips
- Determinants by cofactor expansion, and their properties
- Subspaces: showing something is or is not one, from the definition
- Linear independence, basis and dimension, and computing the rank of a matrix
Before the final heaviest topics
- Kernel and range of a linear transformation, and the rank-nullity theorem stated with the correct n
- Orthogonality, orthonormal bases and the Gram-Schmidt process
- Eigenvalues and eigenvectors, including when a matrix fails to be diagonalisable
- Similarity, and what it preserves
- The applications covered in the final chapter
The mistakes that cost marks
Stating rank-nullity with the wrong dimension. Rank plus nullity equals the number of columns, the dimension of the domain. Square matrices hide the error; non-square ones expose it, which is why examination questions use them.
Confusing linear independence with orthogonality. Orthogonal non-zero vectors are independent, but independent vectors need not be orthogonal. The implication runs one way only.
Assuming every matrix is diagonalisable. Repeated eigenvalues may not supply enough independent eigenvectors. The interesting examination cases are precisely the ones where diagonalisation fails.
Learning definitions as slogans. A basis is not just 'a set of vectors that spans': it must be independent as well. Marks in this course sit on the full definition.
Formula & concept sheet
The vocabulary and formulas you must own
- Elementary row operation
- Row swap, scaling by a non-zero constant, or adding a multiple of one row to another; the operations that preserve the solution set of a system.
- Gauss-Jordan elimination
- Reducing a matrix to reduced row echelon form, the standard route to solving systems, inverting matrices and reading off rank.
- Matrix inverse
- The matrix undoing a given square matrix; it exists exactly when the determinant is non-zero.
- Determinant
- A scalar computed from a square matrix, zero exactly when the matrix is singular; computed here by cofactor expansion.
- Subspace
- A subset of R^n closed under addition and scalar multiplication and containing the zero vector.
- Linear independence
- No vector in the set is a linear combination of the others; equivalently, only the trivial combination gives zero.
- Basis and dimension
- A basis is an independent spanning set; the dimension is the number of vectors in any basis.
- Rank
- The dimension of the column space, equal to the number of non-zero rows in the reduced row echelon form.
- Kernel and range
- The set mapped to zero by a transformation, and the set of its outputs; their dimensions are the nullity and the rank.
- Rank-nullity theorem
- For a linear transformation from R^n, rank plus nullity equals n.
- Inner product and orthogonality
- The operation defining angle and length in R^n; two vectors are orthogonal when their inner product is zero.
- Orthonormal basis
- A basis of mutually orthogonal unit vectors, in which computation becomes markedly simpler.
- Gram-Schmidt process
- The procedure converting an arbitrary basis into an orthonormal one.
- Eigenvalue and eigenvector
- A scalar and a non-zero vector with Av equal to lambda v: the directions a transformation only stretches.
- Diagonalisation
- Writing a matrix as PDP inverse with D diagonal, possible exactly when there are enough independent eigenvectors.
- Similarity
- Two matrices related by a change of basis; similar matrices represent the same transformation in different coordinates.
Common acronyms: {'term': 'RREF', 'def': 'Reduced row echelon form'} · {'term': 'R^n', 'def': 'Euclidean n-space, the setting for the whole course'} · {'term': 'APC', 'def': 'Advanced Placement Credits, the exemption route for this course'} · {'term': 'H2', 'def': 'The GCE A-Level mathematics level required as the prerequisite'}.
Set texts
The prescribed reading
The syllabus references map straight onto these.
Linear Algebra I
Ma Siu Lun, Victor Tan and Ng Kah Loon.
Elementary Linear Algebra
Howard Anton and Chris Rorres.
Where it fits
Prerequisites, related courses & why it matters
The department states that MA2001 requires GCE A-Level H2 Mathematics or equivalent. Incoming students may sit the department's advanced placement test to be granted exemption and units.
Your MA2001 study toolkit
Study the course with Sia, not just read about it
Each tool already knows MA2001: your syllabus, your texts, and where the marks are. Grouped by how you study, from first contact to exam week.
FAQ
Frequently asked questions
How does MA2001 differ from MA1522 or MA1508E?
They are different first courses in linear algebra for different faculties. MA1522 Linear Algebra for Computing and MA1508E Linear Algebra for Engineering serve computing and engineering students. MA2001 is the mathematics department's version and presents proofs of its results rather than results alone, which is why later mathematics and statistics courses assume it.
What is the prerequisite?
GCE A-Level H2 Mathematics or equivalent. There is also an advanced placement test route: incoming students who pass it are granted exemption and units for the course.
Which chapter causes the most trouble?
Chapter 3. Systems and determinants are procedural, and students often arrive at subspaces, linear independence, basis and dimension expecting more of the same. It is a genuine change in the kind of thinking required, and it is where the course separates.
How much of MA2001 is proof?
Enough that it changes how you study. Proofs are presented in the concrete setting of Euclidean space rather than in full generality, but you are expected to follow and reproduce them, not just apply the results.
Is there a set text?
The department names two recommended texts: Linear Algebra I by Ma Siu Lun, Victor Tan and Ng Kah Loon, and Elementary Linear Algebra by Anton and Rorres.
What comes after MA2001?
A great deal. It feeds Linear Algebra II, multivariable calculus, mathematical analysis, probability and regression, and it appears in the required sequence for the statistics and the data science and analytics majors.
Study MA2001 with Sia
Work through systems of linear equations, determinants, euclidean n-space and the rest of the course with a tutor that knows it and quizzes you on the topics the assessments weight most heavily.
Start studying with Sia
