 Solution

ID: past-exam-of-the-year-1-of-the-computer-science-course-of-the-university-of-oxford/2019/digital-systems-linear-algebra-introduction-to-formal-proof-resit/5/a/ii/solution

False. Take

A = (1, 0)^{T}

, an

m = 2

n = 1

b = (0, 1)^{T}

. Then

A x = (x, 0)^{T}

never equals

b

. Full column rank implies injectivity, not surjectivity onto a larger codomain.

 New to topics? Read the docs here!