Maths WorkshopMaths problems with full solutions
Exercise 1359Topology › Topology of Mn(ℝ) › Density and closuresL3Added 6 Nov 2026

Matrices with an LU factorisation

#LU decomposition#leading principal minors#density

Statement

Show that the set of matrices A∈Mn(R)A\in M_n(\mathbb{R}) admitting a factorisation A=LUA=LU with LL unit lower triangular and UU upper triangular contains an open dense subset of Mn(R)M_n(\mathbb{R}).

Hint

Show that if all the leading principal minors of AA are nonzero, then AA has an LU factorisation (induction on nn, adding a last row and column).

Show solutionHide solution

Solution

The open dense set. Let Δk(A)\Delta_k(A) be the k×kk\times k leading principal minor (top-left k×kk\times k block). The product p=Δ1⋯Δnp=\Delta_1\cdots\Delta_n is a polynomial with p(I)=1≠0p(I)=1\ne0, so Ω={p≠0}\Omega=\{p\ne0\} is open and dense. We show every A∈ΩA\in\Omega has an LU factorisation.

Induction on nn. For n=1n=1, A=(a)=(1)⋅(a)A=(a)=(1)\cdot(a). Assume the claim for n−1n-1 and write
A=(A′bcTd),A=\begin{pmatrix}A'&b\\c^T&d\end{pmatrix},
with A′A' of size n−1n-1 and all leading minors of A′A' nonzero (they are Δ1,…,Δn−1\Delta_1,\dots,\Delta_{n-1} of AA). By induction A′=L′U′A'=L'U' with L′L' unit lower triangular. Since det⁡A′=det⁡U′≠0\det A'=\det U'\ne0, U′U' is invertible, and L′L' is invertible too.

Constructing the factors. Look for
L=(L′0vT1),U=(U′u0δ).L=\begin{pmatrix}L'&0\\v^T&1\end{pmatrix},\qquad U=\begin{pmatrix}U'&u\\0&\delta\end{pmatrix}.
Then LU=(L′U′L′uvTU′vTu+δ)LU=\begin{pmatrix}L'U'&L'u\\v^TU'&v^Tu+\delta\end{pmatrix}. To match AA we need
L′u=b (⇒u=L′−1b),vTU′=cT (⇒vT=cTU′−1),δ=d−vTu.L'u=b\ (\Rightarrow u=L'^{-1}b),\qquad v^TU'=c^T\ (\Rightarrow v^T=c^TU'^{-1}),\qquad\delta=d-v^Tu.
All three are solvable, so A=LUA=LU (and δ=det⁡A/det⁡A′≠0\delta=\det A/\det A'\ne0).

Remark. The condition is not necessary: (0100)\begin{pmatrix}0&1\\0&0\end{pmatrix} has an LU factorisation with L=IL=I. It fails for some invertible matrices, like (0110)\begin{pmatrix}0&1\\1&0\end{pmatrix} (if it were LULU, L=(10ℓ1)L=\begin{pmatrix}1&0\\\ell&1\end{pmatrix} and U=(u11u120u22)U=\begin{pmatrix}u_{11}&u_{12}\\0&u_{22}\end{pmatrix} would give u11=0u_{11}=0 and then ℓu11=1\ell u_{11}=1, impossible). This is why pivoting is needed in practice. Lesson. Genericity statements often come from "no pivot vanishes".