Scribd Logo
Upload

Welcome to Scribd!

  • 475 views

    2.5 Equivalent Matrices. Hazen A. Mole

    Uploaded by

    Nad DeYn
    This document defines and discusses the concept of equivalent matrices. It states that two matrices A and B are equivalent if B can be obtained from A through a finite sequence of elementary row or column operations. It proves several properties of equivalent matrices, including that equivalence is reflexive, symmetric, and transitive. It also proves that any non-zero matrix is equivalent to a matrix in reduced row echelon form.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd

    2.5 Equivalent Matrices. Hazen A. Mole

    Uploaded by

    Nad DeYn
    475 views18 pages
    This document defines and discusses the concept of equivalent matrices. It states that two matrices A and B are equivalent if B can be obtained from A through a finite sequence of elementary row or column operations. It proves several properties of equivalent matrices, including that equivalence is reflexive, symmetric, and transitive. It also proves that any non-zero matrix is equivalent to a matrix in reduced row echelon form.

    Copyright

    © © All Rights Reserved

    Available Formats

    PPTX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document defines and discusses the concept of equivalent matrices. It states that two matrices A and B are equivalent if B can be obtained from A through a finite sequence of elementary row or column operations. It proves several properties of equivalent matrices, including that equivalence is reflexive, symmetric, and transitive. It also proves that any non-zero matrix is equivalent to a matrix in reduced row echelon form.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Download as pptx, pdf, or txt
    475 views18 pages

    2.5 Equivalent Matrices. Hazen A. Mole

    Uploaded by

    Nad DeYn
    This document defines and discusses the concept of equivalent matrices. It states that two matrices A and B are equivalent if B can be obtained from A through a finite sequence of elementary row or column operations. It proves several properties of equivalent matrices, including that equivalence is reflexive, symmetric, and transitive. It also proves that any non-zero matrix is equivalent to a matrix in reduced row echelon form.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Download as pptx, pdf, or txt
    You are on page 1of 18

    EQUIVALENT MATRICES

    PREPARED BY:
    Hazen A. Mole
    We have thus far considered A to be row (column)
    equivalent to B if B results from A by a finite sequence of
    elementary row (column) operations. A natural extension of
    this idea is that of considering B to arise from A by a finite
    sequence of elementary row or elementary column operations.

    This leads to the notion of equivalence of matrices.


    Definition 2.5

    If A and B are two m x n matrices, then A is


    equivalent to B if we obtained B from A by a finite
    sequence of elementary row or elementary column
    operations.
    As we have seen in the case of row
    equivalence, we can show that;

    (a) Every matrix is equivalent to itself


    (b) If B is equivalent to A, then A is equivalent to
    B
    (c) if C is equivalent to B, and B is equivalent to
    A, then C is equivalent to A.
    In view of (b), both statements “A is equivalent
    to B” and “B is equivalent to A” can be replaced
    by “A and B are equivalent.”

    We can also show that if two matrices are row


    equivalent, then they are equivalent.
    Theorem2.12

    If A is any nonzero m x n matrix, then A is equivalent


    to a partitioned matrix of the form
    •  

    Here is the r x n – r zero matrix, similarly, is the m – r x r


    zero matrix, etc.
    Proof:
    •By  Theorem 2.2. A is row equivalent to a matrix B that is
    in reduced row echelon form. Using elementary column
    operations of type 1, we get B to be equivalent to a
    matrix C of the form.
    •  
    Where r is the number of nonzero rows in B. By
    elementary column operations of type III, C is equivalent
    to a matrix D of the form.
    •Of  course, in Theorem 2.12, r may equal m, in which case
    there will not be any zero rows at the bottom of the
    matrix.
    Recall from Section 2.1 that we introduced the following
    notation for elementary column operations:

     Interchange columns i and j :


     Replace column i by k times column i : k
     Replace column j by k times column i + column j :
    k+
    Let

    •  

    • To find a matrix of the form described in Theorem 2.12,


    which is equivalent to A, we proceed as follows. Apply
    ˗1 + to obtain
    Apply
    •   ˗1 +
    Apply 1 +
    Apply
    •   ˗1 +
    Apply ˗1 +
    •Apply
      ˗ Apply ˗1 +
    •  
    Apply ˗1 + Apply ˗3 +
    •  
    Apply 2+ Apply 1 +

    ˗1 + = this is the matrix desired.


    The following theorem gives another useful way to
    look at the equivalence of matrices.

    • Theorem 2.13
    Two m x n matrices A and B are equivalent if
    and only if B = P A Q for some nonsingular
    matrices P and Q.
    • Theorem
      2.14
    An n x n matrix A is nonsingular if and only if A is
    equivalent to ,.
    • Proof
    If A is equivalent to , then arises from A by a sequence
    of elementary row or elementary column operations.
    Thus there exist elementary matrices …, …, such that

    = … A …
    •  

    • Let … = P and … = Q. Then = PAQ, where P and Q are


    nonsingular. It then follows that A= , and since and
    are nonsingular, A is nonsingular.

    • Conversely, if A is nonsingular, then it follows that A is


    row equivalent to . Hence A is equivalent to

    You might also like