I want to find an $LU$-factorization of the following matrix: \begin{align*} A = \begin{pmatrix} 3 & -6 & 9 \\ -2 & 7 & -2 \\ 0 & 1 & 5 \end{pmatrix} \end{align*} This matrix is invertible (the determinant is $33$), so I should be getting a $LU$ decomposition where $L$ is a lower triangular matrix with only $1s$ on the diagonal. But that's not what I'm getting. Here is what I did: \begin{align*} \begin{pmatrix} 3 & -6 & 9 \\ -2 & 7 & -2 \\ 0 & 1 & 5 \end{pmatrix} & \begin{matrix} \xrightarrow{R_1 \rightarrow 1/3 R_1} \end{matrix} \begin{pmatrix} 1 & -2 & 3 \\ -2 & 7 & -2 \\ 0 & 1 & 5 \end{pmatrix} \begin{matrix} \xrightarrow{R_2 \rightarrow R_2 + 2R_1} \end{matrix} \begin{pmatrix} 1 & -2 & 3 \\ 0 & 3 & 4 \\ 0 & 1 & 5 \end{pmatrix} \\ & \begin{matrix} \xrightarrow{R_2 \rightarrow 1/3 R_2} \end{matrix} \begin{pmatrix} 1 & -2 & 3 \\ 0 & 1 & \frac{4}{3} \\ 0 & 1 & 5 \end{pmatrix} \begin{matrix} \xrightarrow{R_3 \rightarrow R_3 - R_2} \end{matrix} \begin{pmatrix} 1 & -2 & 3 \\ 0 & 1 & \frac{4}{3} \\ 0 & 0 & \frac{11}{3} \end{pmatrix} = U. \end{align*} This matrix is now in echelon form. The elementary matrices corresponding to the operations are: \begin{align*} E_1 & = \begin{pmatrix} \frac{1}{3} & 0 & 0 \\ 0 & 1 & 0 \\ 0 & 0 & 1 \end{pmatrix} \qquad (R_1 \rightarrow 1/3 R_1) \quad E_2 = \begin{pmatrix} 1 & 0 & 0 \\ 2 & 1 & 0 \\ 0 & 0 & 1 \end{pmatrix} \qquad (R_2 \rightarrow R_2 + 2R_1) \\ E_3 &= \begin{pmatrix} 1 & 0 & 0 \\ 0 & \frac{1}{3} & 0 \\ 0 & 0 & 1 \end{pmatrix} \qquad (R_2 \rightarrow 1/3 R_2) \quad E_4 = \begin{pmatrix} 1 & 0 & 0 \\ 0 & 1 & 0 \\ 0 & -1 & 1 \end{pmatrix} \qquad (R_3 \rightarrow R_3 - R_2) \end{align*} Hence we have $E_4 E_3 E_2 E_1 A = U$. Now \begin{align*} E_4 E_3 E_2 E_1 = M = \begin{pmatrix} \frac{1}{3} & 0 & 0 \\ \frac{2}{9} & \frac{1}{3} & 0 \\ - \frac{2}{9} & - \frac{1}{3} & 1 \end{pmatrix} \end{align*} is a lower triangular matrix. Now we can write \begin{align*} A = (E_4 E_3 E_2 E_1)^{-1} U = M^{-1} U = LU, \end{align*} with \begin{align*} M^{-1} = L = \begin{pmatrix} 3 & 0 & 0 \\ -2 & 3 & 0 \\ 0 & 1 & 1 \end{pmatrix} \end{align*} But why does my matrix $L$ not have $1s$ on the diagonal? I thought an $LU$-factorization of an invertible matrix is unique, and that in that case $L$ is an unit lower triangular matrix? Did I overlook something or made a mistake? I haven't interchanged any rows. Please help!
2026-03-25 12:30:35.1774441835
LU-factorization: why can't I get a unit lower triangular matrix?
2.1k Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
2
There are 2 best solutions below
Related Questions in LINEAR-ALGEBRA
- An underdetermined system derived for rotated coordinate system
- How to prove the following equality with matrix norm?
- Alternate basis for a subspace of $\mathcal P_3(\mathbb R)$?
- Why the derivative of $T(\gamma(s))$ is $T$ if this composition is not a linear transformation?
- Why is necessary ask $F$ to be infinite in order to obtain: $ f(v)=0$ for all $ f\in V^* \implies v=0 $
- I don't understand this $\left(\left[T\right]^B_C\right)^{-1}=\left[T^{-1}\right]^C_B$
- Summation in subsets
- $C=AB-BA$. If $CA=AC$, then $C$ is not invertible.
- Basis of span in $R^4$
- Prove if A is regular skew symmetric, I+A is regular (with obstacles)
Related Questions in MATRICES
- How to prove the following equality with matrix norm?
- I don't understand this $\left(\left[T\right]^B_C\right)^{-1}=\left[T^{-1}\right]^C_B$
- Powers of a simple matrix and Catalan numbers
- Gradient of Cost Function To Find Matrix Factorization
- Particular commutator matrix is strictly lower triangular, or at least annihilates last base vector
- Inverse of a triangular-by-block $3 \times 3$ matrix
- Form square matrix out of a non square matrix to calculate determinant
- Extending a linear action to monomials of higher degree
- Eiegenspectrum on subtracting a diagonal matrix
- For a $G$ a finite subgroup of $\mathbb{GL}_2(\mathbb{R})$ of rank $3$, show that $f^2 = \textrm{Id}$ for all $f \in G$
Related Questions in MATRIX-DECOMPOSITION
- Real eigenvalues of a non-symmetric matrix $A$ ?.
- Swapping row $n$ with row $m$ by using permutation matrix
- Block diagonalizing a Hermitian matrix
- $A \in M_n$ is reducible if and only if there is a permutation $i_1, ... , i_n$ of $1,... , n$
- Simplify $x^TA(AA^T+I)^{-1}A^Tx$
- Diagonalize real symmetric matrix
- How to solve for $L$ in $X = LL^T$?
- Q of the QR decomposition is an upper Hessenberg matrix
- Question involving orthogonal matrix and congruent matrices $P^{t}AP=I$
- Singular values by QR decomposition
Related Questions in GAUSSIAN-ELIMINATION
- When solving system's of equation what does t represent in this problem and when/why does it occur?
- What is the relation of between $REF(A)$ and $REF(A^T)$?
- Gauss-Jordan elimination to solve without employing pivoting
- Finding solution for a linear system(see below)
- Solving linear system after Gaussian elimination
- Left-looking Gaussian elimination
- inverse matrix with modulo
- inverse of a $2\times2$ matrix, Gaussian elimination with unknown $x$
- Gauss Jordan inverse matrix, row of all zeros
- Show that if A is strictly diagonal dominant, then a submatrix of A is also strictly diagonal dominant.
Related Questions in LU-DECOMPOSITION
- inverting a matrix using the LU decomposition approach
- LU Factorization. Finding L and A given y, b and U
- Is it okay transposing each matrix elements?
- Why WolframAlpha does LU decomposition with pivoting even when it isn't needed?
- Cost of LU decomposition of a Symmetric Matrix
- LU/LUP decomposition: can some of U's diagonal elements be zero?
- Cost of LU decomposition (time cost)
- Why (which advantages) we use different matrix factorization algorithms?
- What is the computation time of LU-, Cholesky and QR-decomposition?
- How SVD for the frobenius norm has been calculated?
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
In the framework of the Gaussian elimination procedure, you get $L$ with all $1$s on the diagonal by never truly rescaling rows. You rescale them in the intermediate step before you add them to another row, but then you "scale them back" so that you're only changing the row that you actually added to. You can always perform Gaussian elimination in this way. (By contrast, you may not always be able to perform Gaussian elimination without exchanging rows to obtain your next pivot, so an $LU$ decomposition may not always exist.)