Linear Algebra - Proofs involving Inverses

Click For Summary
SUMMARY

This discussion focuses on two proof problems involving matrix inverses in linear algebra. The first proof establishes that if an nxn matrix A is not invertible, there exists a non-zero matrix B such that AB = 0. The second proof demonstrates that for an m x n matrix A and an n x m matrix B, where n < m, the product AB is not invertible. Key concepts include the relationship between singular matrices and their non-zero vectors, which are crucial for understanding the proofs presented.

PREREQUISITES
  • Understanding of matrix operations and properties
  • Familiarity with the concepts of invertible and singular matrices
  • Knowledge of vector spaces and their dimensions
  • Basic proficiency in linear algebra proofs
NEXT STEPS
  • Study the properties of singular matrices in linear algebra
  • Learn about the implications of the Rank-Nullity Theorem
  • Explore the concept of matrix rank and its relationship to invertibility
  • Investigate the construction of non-zero matrices that satisfy specific conditions
USEFUL FOR

Students and educators in mathematics, particularly those studying linear algebra, as well as anyone involved in mathematical proofs related to matrix theory.

descendency
Messages
39
Reaction score
0
Two fairly simple proof problems. . . why aren't they simpler? :(

Homework Statement


Let A be an nxn matrix...
If A is not invertible then there exists an nxn matrix B such that AB = 0, B != 0. (not equal to)


Homework Equations


None really.


The Attempt at a Solution


Obviously, when A is the zero matrix, AB = 0.

If we call A the coefficient matrix in the system of equations Ax = 0, then x = x1B1 + x2B2 + ... + xnBn, where B = [B1|B2|...|Bn].

I can't seem to explain why that works. Is it obvious enough just to say that or is there a step of explanation I have left out?

--------------------------------------------------------------------------------

Homework Statement


If A is an m x n matrix, B is an n x m matrix and n < m, then AB is not invertible.


Homework Equations





The Attempt at a Solution


Obviously, A and B are not square and are therefore not invertible. Does that fact really matter? The product of invertible matrices is invertible, but is the product of non invertible matrices also non invertible?
 
Physics news on Phys.org
Well, what i would say is that: We know that an invertible matrix is nonsingular,moreover, a matrix is invertible if and only if it is non-singular. So, since here A is supposed to be non-invertible, it means that A is singular. What this means is that: There exists some non-zero vector, call it b such that Ab=0.
Extrapolating from this, we can argue that, there will be some non-zero vectors, call them

\arrow B_1, B_2,...B_n such that A*B_i=0, for all i=1,2,...n.

So, if we built our matrix B=[B_1,B_2,...,B_n]

We have actuall proven that AB=0. Where as we can clearly see B is not the zero matrix.
 
How can I guarrantee that B is not zero?
 
You know there is a vector Ab=0 with b not equal to zero, as sutupidmath said. You also seem to know the column space of a matrix represents it's range. So build a matrix whose column space is only multiples of b.
 
Thanks everyone. Think I have it now.
 

Similar threads

  • · Replies 10 ·
Replies
10
Views
2K
  • · Replies 20 ·
Replies
20
Views
3K
  • · Replies 25 ·
Replies
25
Views
3K
  • · Replies 8 ·
Replies
8
Views
3K
Replies
9
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
Replies
15
Views
2K
  • · Replies 7 ·
Replies
7
Views
1K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 13 ·
Replies
13
Views
2K