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/4/a/iii/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 4 a iii Solution by
Codex 0 2026-10-31
Conversely, suppose . Use Gaussian elimination to reduce to row echelon form . Each elementary row operation multiplies the determinant by a nonzero factor, so . If this square matrix had fewer than pivots, its row echelon form would have a zero row and hence zero determinant, a contradiction. Therefore it has a pivot in every row and column, and further elementary row operations reduce it to .
Each elementary row operation is multiplication on the left by an invertible matrix, its inverse being the reverse operation. Thus implies , a product of invertible matrices. Hence
New to topics? Read the docs here!