Show that if all the row sums of a matrix A belong to C (nxm) are

  • Context: Graduate 
  • Thread starter Thread starter bernoli123
  • Start date Start date
  • Tags Tags
    Matrix Row Sums
Click For Summary
SUMMARY

If all the row sums of a matrix A (of size n x m) are zero, then A is singular. This conclusion is supported by the fact that the equation Ax = 0, where x is a vector of ones, indicates that the rows of A are linearly dependent. A Gauss-Jordan elimination on a singular matrix will yield one or more rows of zeroes. Additionally, proving A is singular can be approached by assuming A is not singular and testing for linear independence or using determinants to factor out a zero.

PREREQUISITES
  • Understanding of linear algebra concepts, particularly matrix theory
  • Familiarity with Gauss-Jordan elimination method
  • Knowledge of determinants and their properties
  • Basic understanding of linear systems of equations
NEXT STEPS
  • Study the properties of singular matrices in linear algebra
  • Learn about the Gauss-Jordan elimination process in detail
  • Explore the concept of linear independence and dependence in vector spaces
  • Investigate the role of determinants in matrix theory and their applications
USEFUL FOR

Students and professionals in mathematics, particularly those studying linear algebra, as well as educators looking to deepen their understanding of matrix properties and singularity.

bernoli123
Messages
11
Reaction score
0
show that if all the row sums of a matrix A belong to C (nxm) are zeroes, then A is singular.
Hint. Observe that Ax=0 for x=[1 1 ...1]T
 
Physics news on Phys.org


A singular matrix is one whose rows are linearly dependent. A Gauss-Jordan elimination on a singular matrix will leave you with one or more lines full of zeroes.

Another way to look at it: suppose your matrix A is a representation of some linear system of equations (each row would correspond to one equation). If you have less equations than unknowns, you can solve by choosing arbitrary values for these "orphan" unknowns. Meaning you have infinite solutions (or no solutions at all).

There's many different ways to prove that a matrix is singular given those conditions. One of them could be assuming that A in NOT singular and then testing for linear independence. Another way could be using determinants: you could factor out a 0 and cancel every cofactor in the expansion.

If the general form nxm gives you trouble, try working it out for a 2x2 and then expand on that.
 


thank you very much
 

Similar threads

Undergrad Row space, Column space, Null space & Left null space
  • · Replies 8 ·
Replies
8
Views
3K
MHB Does Commutativity Hold for Matrices A and B with a Specific Matrix C?
  • · Replies 3 ·
Replies
3
Views
2K
Undergrad Uniqueness of reduced row echelon form (proof verification)
  • · Replies 4 ·
Replies
4
Views
3K
Undergrad Matrix diagonalization algorithm
  • · Replies 5 ·
Replies
5
Views
3K
MHB 5.3 Show that a square matrix with a zero row is not invertible.
  • · Replies 3 ·
Replies
3
Views
2K
Undergrad Getting eigenvalues of an arbitrary matrix with programming
  • · Replies 1 ·
Replies
1
Views
2K
MHB Check the statements about a 4x5 matrix with rank 2.
  • · Replies 9 ·
Replies
9
Views
5K
Undergrad Proof concerning the Four Fundamental Spaces
  • · Replies 14 ·
Replies
14
Views
3K
Python Partial pivoting in getting the reduced row echelon form of a matrix
  • · Replies 2 ·
Replies
2
Views
2K
MHB Row echelon form : Can the first column contain only zeros?
  • · Replies 14 ·
Replies
14
Views
3K