Fermi
·
Concept Library
·
Courses
·
Books
·
Problems
·
Simulations
·
Math Wiki
·
High School
Fermi
›
Problems
Kunze Linear Algebra
· Problem 1.6.7
Systems of Linear Equations
Mathematics — Methods · matrix-invertibility
Problem
Let
A
A
A
be an
n
×
n
n \times n
n
×
n
(square) matrix. Prove the following two statements: (a) If
A
A
A
is invertible and
A
B
=
0
AB = 0
A
B
=
0
for some
n
×
n
n \times n
n
×
n
matrix
B
B
B
, then
B
=
0
B = 0
B
=
0
. (b) If
A
A
A
is not invertible, then there exists an
n
×
n
n \times n
n
×
n
matrix
B
B
B
such that
A
B
=
0
AB = 0
A
B
=
0
but
B
≠
0
B \neq 0
B
=
0
.
Related theory
S Matrix And T Matrix
Browse the problem library