Proving Square Matrix of Order n Has LU-Factorization

In summary: A. Now, let's define two new matrices B and C as follows: B = A - λI and C = I. Since λ is an eigenvalue of A, we have Bx = (A - λI)x = Ax - λx = 0. Also, since <x,x> = 1, we have Cx = Ix = x. Now, we can write A = B + λI = C + B. It is easy to see that B is a lower triangular matrix and C is an upper triangular matrix. Therefore, A can be written as the product of a lower triangular matrix and an upper triangular matrix,
  • #1
borjstalker
2
0

Homework Statement



Hi, I have a question: Prove that a square matrix of order n has an LU-factorization if and only if the origin is not contained in the numerical range.


Homework Equations



The numerical range is found using the Euclidean inner scalar product <Ax,x> where <x,x>=1 and. The numerical range is A(W)=(<Ax,x> such that <x,x> =1 for all x reals)

The Attempt at a Solution



I tried considering the 2x2 matrix case but got stuck.:) Thanks in advance!
 
Physics news on Phys.org
  • #2




Thank you for your question. I am happy to help you prove this statement. Let's start by defining what an LU-factorization is. An LU-factorization of a square matrix A is a decomposition of A into the product of a lower triangular matrix L and an upper triangular matrix U, such that A = LU. Now, let's also define the numerical range of a matrix A. The numerical range of A, denoted as A(W), is the set of all possible values that can be obtained by taking the inner scalar product <Ax,x>, where x is a real vector and <x,x> = 1. In other words, the numerical range is the collection of all possible eigenvalues of A.

Now, to prove that a square matrix A of order n has an LU-factorization if and only if the origin is not contained in the numerical range, we need to prove two statements: (1) If A has an LU-factorization, then the origin is not contained in the numerical range. (2) If the origin is not contained in the numerical range, then A has an LU-factorization.

Let's start with statement (1). If A has an LU-factorization, then A = LU, where L is lower triangular and U is upper triangular. Now, let's assume that the origin is contained in the numerical range of A. This means that there exists a vector x such that <Ax,x> = 0 and <x,x> = 1. Substituting A = LU, we get <LUx,x> = 0. Since L and U are both triangular matrices, we can write this as <Ux,Lx> = 0. But this means that Ux and Lx are orthogonal, which implies that Ux = 0 or Lx = 0. But since U is upper triangular, Ux = 0 can only happen if x = 0, which contradicts our assumption that <x,x> = 1. Similarly, Lx = 0 can only happen if x = 0, which again contradicts our assumption. Therefore, our assumption that the origin is contained in the numerical range must be false, and hence, the origin is not contained in the numerical range.

Now, let's prove statement (2). If the origin is not contained in the numerical range of A, then there exists a vector x such that <Ax,x> = λ and
 

1. What is a square matrix of order n?

A square matrix of order n is a matrix with n rows and n columns, meaning it has the same number of rows and columns. It is usually denoted by the letter A and written as An x n.

2. What is an LU-factorization?

An LU-factorization is a decomposition of the original matrix into the product of a lower triangular matrix (L) and an upper triangular matrix (U). The LU-factorization is useful for solving systems of linear equations and for calculating determinants and inverses of matrices.

3. How do you prove that a square matrix of order n has an LU-factorization?

To prove that a square matrix of order n has an LU-factorization, you must show that the matrix can be decomposed into an upper triangular matrix (U) and a lower triangular matrix (L) such that A = LU. This can be done using various methods, such as Gaussian elimination or Crout's method.

4. Can every square matrix of order n be LU-factorized?

Yes, every square matrix of order n can be LU-factorized. This is known as the LU-factorization theorem, which states that every invertible square matrix has an LU-factorization. However, not all matrices have a unique LU-factorization.

5. What is the significance of LU-factorization in linear algebra?

LU-factorization is significant in linear algebra because it allows for easier computation of things like determinants, inverses, and solutions to systems of linear equations. It also simplifies matrix operations and makes them more efficient. Additionally, LU-factorization can be used in algorithms for solving problems in various fields, such as engineering and computer science.

Similar threads

  • Calculus and Beyond Homework Help
Replies
5
Views
1K
  • Calculus and Beyond Homework Help
Replies
16
Views
4K
  • Calculus and Beyond Homework Help
Replies
3
Views
548
  • Calculus and Beyond Homework Help
Replies
3
Views
1K
  • Calculus and Beyond Homework Help
Replies
3
Views
3K
  • Calculus and Beyond Homework Help
Replies
1
Views
9K
  • Calculus and Beyond Homework Help
Replies
3
Views
2K
  • Calculus and Beyond Homework Help
Replies
2
Views
5K
  • Calculus and Beyond Homework Help
Replies
3
Views
1K
  • Calculus and Beyond Homework Help
Replies
12
Views
2K
Back
Top