Scribd Logo
Upload

Welcome to Scribd!

  • 5K views

    Inverse of A Matrix To The NTH Power Is The NTH Power of The Inverse of The Matrix: Proof

    Uploaded by

    sankofakanian
    A Proof that the Inverse of a matrix to the nth power is the nth Power of the Inverse of the Matrix.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd

    Inverse of A Matrix To The NTH Power Is The NTH Power of The Inverse of The Matrix: Proof

    Uploaded by

    sankofakanian
    5K views3 pages
    A Proof that the Inverse of a matrix to the nth power is the nth Power of the Inverse of the Matrix.

    Original Title

    Inverse of a matrix to the nth power Is the nth Power of the Inverse of the Matrix: Proof

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    A Proof that the Inverse of a matrix to the nth power is the nth Power of the Inverse of the Matrix.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    5K views3 pages

    Inverse of A Matrix To The NTH Power Is The NTH Power of The Inverse of The Matrix: Proof

    Uploaded by

    sankofakanian
    A Proof that the Inverse of a matrix to the nth power is the nth Power of the Inverse of the Matrix.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 3
    At a glance
    Powered by AI
    The proof shows that the inverse of a matrix to the nth power is equal to the nth power of the inverse of the matrix using mathematical induction.

    The proof starts by showing the base case P(1) is true, then assumes P(k) is true to show P(k+1) is true by rewriting (AA-1)^k+1 in terms of A and A^-1 using the properties of matrices.

    To show P(k+1) is true, the proof rewrites (AA-1)^k+1 as A^(k+1)A^(-k-1) which proves the inductive step.

    Page 1 of 3

    Inverse of a matrix to the nth power Is the nth Power of the Inverse of the Matrix: Proof
    by Sankofakanian

    n n -1 -1 n
    If A is invertible, then A is invertible and ( A ) = (A ) for n = 0,1,2,...
    proof:

    -1 1 1 1 -1
    • Let P(1): (AA ) = I = A A . P(1) is true.
    -1 k k -k
    • Let k be any natural number. If P(k): (AA ) = A A is true then we must prove that
    -1 k+1 k+1 -k-1
    P(k+1): (AA ) = A A is also true. That would mean that
    -1 k+1 k -k -1
    (AA ) = A A (AA ).

    -1
    To ease our work, lets put a subscript i from {1,..,n} on each A and A depending on the
    -1 -1 k -1 k+1
    position of AA in the product (AA ) . Following this we can write (AA ) as

    -1 k -1 -1 -1
    (AA ) = (A1A1 )(A2A2 )...(AkAk ) and
    -1 k+1 -1 -1 -1 -1
    (AA ) = (A1A1 )(A2A2 )...(AkAk )(AA )
    -1 -1 -1 -1 -1
    = A1(A1 A2A2 ... A k-1AkAk )(AA )
    k-1 -1 -1
    = (A1I Ak )(AA )
    -1 k+1 -1 k-2 -1 -1
    (AA ) = (A1(A2 A1 )I A k)(AA )

    Now, Since A1 = A2 = A, we have


    -1 k+1 2 -1 k-2 -1 -1
    (AA ) = (A A 1 I Ak )(AA )

    -1 k-2 k-2 -1
    Moreover, because A1 I = I A1 we have
    -1 k+1 2 k-2 -1 -1 -1 2 k-2 -2 -1 -1 -1 -1
    (AA ) = (A I A 1 Ak )(AA ) = (A I A )(AA ) since Ak = A 1 = A

    Now
    2 k-2 -2 -1 2 k-2 -2 2 k-2 -2 -2 -2
    (A I A )(AA ) = A I A I = A I I A since A I = I A
    2 k-2 -1 -2 2 k-2 -1 -2 k-2 k-2
    = A I AA A = A A I A A since I A = A I
    2 k-2 -2 -1 3 k-2 -3
    (A I A )(AA ) = A I A
    Now we will pursue the same process of rewriting by induction.
    -1 j e j-e -e
    To do so Let Q(j): (AA ) = A I A be true for any 0 =< e =< j . We want to prove

    http://www.scribd.com/full/31221377?access_key=key-a60g164r0xzgtihybqm
    Page 2 of 3

    that
    e j+1-e -e
    Q(j+1): A I A is true for any 0 =< e =< j+1 and
    -1 k+1 e k+1-e -e
    (AA ) = A I A is true for any 0 =< e =< k+1.
    Hence for e = k+1 we have
    -1 k+1 k+1 0 -k-1 k+1 -k-1
    (AA ) = A I A = A A
    which proves that P(k+1) is true.
    Therefore by mathematical induction, P(n) is true for any natural number n and
    -1 n n -n
    (AA ) = A A
    n -n -n n n
    Now since A A = I = A A , A is invertible and by Laws of Exponent (Appendix :Th 1.4.7)
    -n n -1 -1 n
    and A = (A ) = (A )

    http://www.scribd.com/full/31221377?access_key=key-a60g164r0xzgtihybqm
    Page 3 of 3

    Appendix
    1
    Theorem 1.4.7

    2
    Theorem 1.4.8

    1 H. Anton, C. Rorres . Elementary Linear Algebra, Ninth Edition


    2 H. Anton, C. Rorres . Elementary Linear Algebra, Ninth Edition

    http://www.scribd.com/full/31221377?access_key=key-a60g164r0xzgtihybqm

    You might also like