The Math Forum

Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Math Forum » Discussions » Math Topics »

Notice: We are no longer accepting new posts, but the forums will continue to be readable.

Topic: Matrix Proofs
Replies: 0  

Advanced Search

Back to Topic List Back to Topic List  
James Stokes

Posts: 60
Registered: 12/13/04
Matrix Proofs
Posted: May 22, 2005 8:50 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

Hi group,

I need help with this proof relating to strictly upper-triangular

Let A be an n x n strictly upper triangular matrix. Then the (i,j-th
entry of AA = A^2 is 0 if i >= j - 1.

Pf: Let B = A^2. The (i,j)-th entry of B is given by

b_{ij} = \sum_{k=1}^{n} a_{ik} a_{kj}.

If k >= j, a_{kj} = 0. If i >= k, a_{ik} = 0. If i >= j - 1, then there
is no k s.t. i < k < j. Therefore

b_ij = \sum_{i<k, k<j} a_{ik} b_{kj} ==> b_{ij} = 0.

Also, if anyone has any clues on these related problems, it would be
greatly appreciated.

Suppose p is a given integer satisfying 1 <= p <= n -1 and that the
entries b_{kj} of an n x n matrix B satisfy b_{kj} = 0 for k >= j - p.
Show that the (i,j)-th entry of the product AB is zero if i >= j -
(p+1). Deduce from the previous result that A^n = 0.


Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© The Math Forum at NCTM 1994-2018. All Rights Reserved.