An LDV decomposition of a matrix.

  • Thread starter Thread starter MathematicalPhysicist
  • Start date Start date
  • Tags Tags
    Decomposition Matrix
Click For Summary

Homework Help Overview

The discussion revolves around proving a relationship between matrices in the context of linear algebra, specifically focusing on a decomposition of a symmetric and invertible matrix A into the form A=LDV, where L is a lower triangular matrix, D is a diagonal matrix, and V is an upper triangular matrix. The original poster attempts to establish that V equals the transpose of L.

Discussion Character

  • Exploratory, Mathematical reasoning, Assumption checking

Approaches and Questions Raised

  • Participants explore the properties of triangular matrices and their inverses, questioning the implications of the structure of L and V. There are attempts to manipulate equations involving these matrices to derive the desired relationship. Some participants suggest proving the invertibility of L and V as a necessary step in the argument.

Discussion Status

The discussion is active, with participants providing hints and guidance on how to approach the proof. There is a recognition of the need to show the invertibility of L and V, and some participants are exploring the implications of matrix properties and relationships. Multiple lines of reasoning are being considered, but no consensus has been reached yet.

Contextual Notes

Participants are working under the assumption that A is symmetric and invertible, and they are considering the implications of this on the matrices involved in the decomposition. There is an emphasis on the structure of the matrices, particularly the presence of ones on the diagonal of L and V.

MathematicalPhysicist
Science Advisor
Gold Member
Messages
4,662
Reaction score
372
i need to prove that if A is symmetric and invertible (i.e A^-1 exists), and A=LDV, when L is lower triangular matrix with ones on it's diagonal and V is an upper triangualr matrix also with ones on the diagonal and D is a diagonal matrix then V=L^t.

what i did is:
i know that V^t is an LTM and L^t is an UTM, and that D=D^t, but from i haven't seucceded in getting V=L^t.
 
Physics news on Phys.org
Hint 1: prove that the equation [itex](V^T)^{-1}LD = DL^TV^{-1}[/itex] makes sense, and then that it's true.

Hint 2: If L is lower triangular with 1's on the diagonal, then what of L-1?







Bonus Hint (highlight, only if you're stuck): If X and Y are lower triangular and D is diagonal, what of XYD?
 
from LDV=V^tDL^t and V^-1D^-1L^-1=(L^T)^-1D^-1(V^T)^-1
(V^T)^-1=DL^TV^-1D^-1L^-1
(V^T)^-1LD=DL^TV^-1.

for the second hint i think that it's also an LTM.
and because V is a UTM V^t is an LTM so we have in the last equation in the lhs that we have product of two LTM which is also an LTM, time D which makes another LTM, which in return equals a product of a UTM, so we must have that V=L^T, is this correct?
 
You need to first show that L and V are invertible, otherwise your equations don't even make sense. Once you've done it, it's somewhat less complicated than what you've done, although what you've done is right:

[tex]LDV=V^tDL^t[/tex]
[tex](V^t)^{-1}LDV = DL^t[/tex]
[tex](V^t)^{-1}LD = DL^tV^{-1}[/tex]

You could even do those last two steps in one. V is a UTM, so VT is an LTM. Can you prove that (VT)-1 is also an LTM? L is an LTM, and so is D, so can you prove that the whole left hand side is an LTM? Likewise, can you prove that the whole right hand side is a UTM? This means that both sides are both LTMs and UTMs, so they're diagonals. But D is a diagonal, so you in fact know that (VT)-1L and LTV-1 are both diagonal. What can you say about the entries on the diagonal? Well you know that L and V have 1's on the diagonal, so you can prove that (VT)-1L and LTV-1 have 1's on the diagonal. In short, these matrices are the same, and they are the identity matrix. But if LTV-1 = I, then of course LT = V, as desired.
 
L and V are row equivalent to I, so if they are nxn matrices then they rank is n, and thus they are invertible.
 

Similar threads

  • · Replies 4 ·
Replies
4
Views
1K
Replies
5
Views
2K
  • · Replies 13 ·
Replies
13
Views
4K
Replies
9
Views
2K
  • · Replies 2 ·
Replies
2
Views
4K
  • · Replies 18 ·
Replies
18
Views
3K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 2 ·
Replies
2
Views
3K
Replies
3
Views
2K