Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedPipeline-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-30
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Normalised LU and LDU factorisations with nonzero pivots are unique

Statement

Let F be a field, let n≥1, and let A∈Mn(F).

  1. Suppose A=LU=L′U′, where L,L′ are unit lower triangular and U,U′ are upper triangular with nonzero diagonal. Then L=L′ and U=U′.
  2. Suppose A=LDU=L′D′U′, where L,L′ are unit lower triangular, D,D′ are diagonal with nonzero diagonal entries, and U,U′ are unit upper triangular. Then L=L′, D=D′, and U=U′.

Facts & Assumptions

Given: A field F, a natural number n≥1, a matrix A∈Mn(F), and two factorisations of A of the shapes named in the statement.

[L1]

A normalised LU factorisation is A=LU with L unit lower triangular and U upper triangular; an LDU factorisation is A=LDU with L unit lower triangular, D diagonal, and U unit upper triangular (A normalised LU factorisation has a unit lower-triangular L and an upper-triangular U, An LDU factorisation has unit lower-triangular L, diagonal D, and unit upper-triangular U).

[L2]

Matrix multiplication is the product convention used throughout (Rectangular matrix multiplication and the identity matrix In, including zero-sized shapes).

Proof

technique · induction on the matrix size
1.1L1L2induction

For claim 1, the first row of A equals the first row of both U and U′, because the first rows of L and L′ are (1,0,…,0). Hence the first rows of U and U′ agree, in particular u00=u00′≠0. Then the first-column equations are ai0=ℓi0u00=ℓi0′u00′ for i>0, so ℓi0=ℓi0′. Subtracting the common first-column outer product leaves two factorizations of the same trailing principal block by unit lower and upper triangular matrices of size n−1 with nonzero diagonal. Induction gives equality of the trailing blocks, hence L=L′ and U=U′.

2.1step 1.1L1L2algebra

For claim 2, put V:=DU and V′:=D′U′. Because D,D′ are diagonal and U,U′ are unit upper triangular, V,V′ are upper triangular and their diagonals are exactly the diagonals of D,D′, so they are nonzero. The factorisations A=LV=L′V′ are therefore of the kind handled in step 1.1, which gives L=L′ and V=V′. Taking diagonals of V=V′ yields D=D′, and then DU=D′U′ forces U=U′.

3.1step 1.1step 2.1discharge-induction∎

Steps 1.1 and 2.1 prove claims 1 and 2. The nonzero-pivot hypothesis is essential: without it, a zero row of the upper factor leaves lower-triangular multipliers undetermined.

Depends on

Used by

Dependency tree · two levels

6 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources