Scribd Logo
Upload

Welcome to Scribd!

  • 56 views

    The Rank of A Matrix: Geometria Lingotto

    Uploaded by

    maxkaaya
    This document discusses the rank of a matrix and the Rouché-Capelli theorem. It defines the rank of a matrix as the dimension of its column space. The Rouché-Capelli theorem states that a linear system has solutions if and only if the rank of the system's matrix equals the rank of the augmented matrix, and that the number of free parameters is equal to the number of columns minus the original matrix's rank. Examples are provided to demonstrate calculating a matrix's rank and applying the Rouché-Capelli theorem.

    Copyright:

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

    The Rank of A Matrix: Geometria Lingotto

    Uploaded by

    maxkaaya
    56 views3 pages
    This document discusses the rank of a matrix and the Rouché-Capelli theorem. It defines the rank of a matrix as the dimension of its column space. The Rouché-Capelli theorem states that a linear system has solutions if and only if the rank of the system's matrix equals the rank of the augmented matrix, and that the number of free parameters is equal to the number of columns minus the original matrix's rank. Examples are provided to demonstrate calculating a matrix's rank and applying the Rouché-Capelli theorem.

    Original Title

    En LeLing8

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document discusses the rank of a matrix and the Rouché-Capelli theorem. It defines the rank of a matrix as the dimension of its column space. The Rouché-Capelli theorem states that a linear system has solutions if and only if the rank of the system's matrix equals the rank of the augmented matrix, and that the number of free parameters is equal to the number of columns minus the original matrix's rank. Examples are provided to demonstrate calculating a matrix's rank and applying the Rouché-Capelli theorem.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    56 views3 pages

    The Rank of A Matrix: Geometria Lingotto

    Uploaded by

    maxkaaya
    This document discusses the rank of a matrix and the Rouché-Capelli theorem. It defines the rank of a matrix as the dimension of its column space. The Rouché-Capelli theorem states that a linear system has solutions if and only if the rank of the system's matrix equals the rank of the augmented matrix, and that the number of free parameters is equal to the number of columns minus the original matrix's rank. Examples are provided to demonstrate calculating a matrix's rank and applying the Rouché-Capelli theorem.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 3

    Geometria Lingotto.

    LeLing8: Rank and Theorem of Rouche-Capelli.


    C

    ontents:
    The rank of a matrix.
    The theorem of Rouche-Capelli.
    R

    ecommended exercises: Geoling 11.


    The rank of a matrix
    We have seen that an inhomogeneous linear system (A|B) encodes the problem of ex-
    pressing a column B as a linear combination of the columns of the matrix A. Thus the
    system (A|B) is consistent i C
    A
    = L(A
    1
    , , A
    n
    ) = L(A
    1
    , , A
    n
    , B).
    Recall that associated to a matrix M M
    n,m
    are two very important subspaces
    denoted by R
    M
    and C
    M
    , and thus dened:
    R
    M
    := L(R
    1
    , R
    2
    , , R
    n
    ) ,
    C
    M
    := L(C
    1
    , C
    2
    , , C
    m
    )
    R
    M
    is a subspace of of the vector space R
    m
    of row vectors with m entries, hence
    R
    M
    is said the row space of M.
    Quite similarly, C
    M
    is a subspace of C
    n
    , the vector space of column vectors with n
    components, so C
    M
    is called column space of M.
    Denition 0.1. Let M be a matrix. The rank
    C
    (M) of M is the dimension of the
    column space C
    M
    , i.e.
    C
    (M) := dim(C
    M
    ) .
    Proposition 0.2. A linear system (A|B) is consistent if and only if
    C
    (A) =
    C
    (A|B).
    Proof. A system is compatible i C
    A
    = L(A
    1
    , , A
    n
    ) = L(A
    1
    , , A
    n
    , B) = C
    (A|B)
    .
    Therefore, a system is compatible if and only if
    C
    (A) = (A|B). 2
    Letting
    R
    (M) denote the dimension of the row space of M, we can state the Rank
    theorem:
    Ingegneria dellAutoveicolo, LeLing8 1 Geometria
    0.1 Calculating the rank Geometria Lingotto.
    Theorem 0.3. The row space and the column space of a matrix M have the same
    dimension,

    R
    (M) =
    C
    (M),
    called the rank of M, and denoted by (M).
    The proof is very easy once we have familiarised with matrix calculus, so we postpone
    it to later on.
    0.1 Calculating the rank
    The rank (A) is easy to compute. Just think of A as the matrix associated to a
    homogeneous system and use Gaus method. The rank is then the number of non-zero
    rows.
    Example 0.4. Lets compute the rank of A =
    _
    _
    1 5 1
    2 1 1
    3 6 2
    _
    _
    :
    _
    _
    1 5 1
    2 1 1
    3 6 2
    _
    _
    R
    2
    2R
    1

    _
    _
    1 5 1
    0 9 1
    3 6 2
    _
    _
    R
    3
    3R
    1

    _
    _
    1 5 1
    0 9 1
    0 9 1
    _
    _
    R
    2
    /9

    _
    _
    1 5 1
    0 1 1/9
    0 9 1
    _
    _
    and eventually we have
    _
    _
    1 5 1
    0 1 1/9
    0 0 0
    _
    _
    by R
    3
    + 9R
    2
    . Thus the rank equals 2.
    Notice that above it is not necessary to nish the method. The rank of
    _
    _
    1 5 1
    0 9 1
    0 9 1
    _
    _
    is is indeed two, because we can discard the last row given it is equal to the one above
    it.
    Gaus method allows to calculate the rank because elementary row operations do
    not alter the rank; otherwise said, equivalent matrices have the same rank. Hence the
    method simply produces an equivalent matrix whose rank is easily determined as the
    number of non-zero rows.
    The theorem of Rouche-Capelli
    Theorem 0.5. (Rouche-Capelli) Let A be a matrix with m rows and n columns.
    Ingegneria dellAutoveicolo, LeLing8 2 Geometria
    0.1 Calculating the rank Geometria Lingotto.
    (i) The linear system (A|B) has solutions if and only if
    (A) = (A|B) .
    (ii) Moreover, if the system (A|B) is consistent, the number of free parameters is
    n (A). If so, one writes that there exist
    n(A)
    solutions.
    Proof. Part (i) is a consequence of the Rank theorem and of Proposition 0.2. Part
    (ii) follows from the fact that the solutions arise from the homogeneous system associated
    to A, and by Gauss-Jordan elimination n (A) is the number of columns relative to
    the free parameters. 2
    Example 0.6. Consider S =
    _

    _
    x + 2y + 3z + 4w = 0
    4x + 6y + 7z + 8w = 0
    5x + 8y + 10z + 12w = 0
    10x + 16y + 20z + 24w = 0
    . It is solved by
    _
    _
    _
    _
    2z + 4w

    5
    2
    z 4w
    z
    w
    _
    _
    _
    _
    Thus the rank of A is 2 = 4 (A). The system has then
    2
    solutions.
    Example 0.7. The matrix A =
    _
    _
    1 5 1 2
    2 1 1 1
    3 6 2 1
    _
    _
    is equivalent to A =
    _
    _
    1 0 4/9 0
    0 1 1/9 0
    0 0 0 1
    _
    _
    .
    Therefore (A) = 3 and the homogeneous system relative to A has
    1
    solutions.
    Important remark: If a subspace W is dened as the solution set of a homogeneous
    system whose matrix A has n columns, then dim(W) = n (A).
    Ingegneria dellAutoveicolo, LeLing8 3 Geometria

    You might also like