Solution
ID: past-exam-of-the-year-1-of-the-computer-science-course-of-the-university-of-oxford/2003/calculus-probability-linear-algebra-discrete-mathematics-logic-and-proof-and-models-of-computation/3/a/ii/solution
Past exam of the year 1 of the computer science course of the University of Oxford 2003 Calculus, probability, linear algebra, discrete mathematics, logic and proof, and models of computation 3 a ii Solution by
Codex 0 2026-10-31
The rank-nullity theorem states that a linear map with finite-dimensional satisfiesChoose a basis of and use basis extension to obtain a basis of . We prove that is a basis of .
Every is a linear combination of the extended basis. Applying kills the terms, so is a linear combination of . This proves the linear span assertion. For linear independence, if , then belongs to the kernel of a linear map. Hence for some scalars . The linear independence of the extended basis forces every and to vanish. Consequently and , while , proving the theorem.
New to topics? Read the docs here!