The matrix determinant lemma
ProvedFamousTheorems.matrix_determinant_lemmaThe matrix determinant lemma. Let be an invertible matrix over a commutative ring, and let be column vectors. Then
The lemma computes the determinant after a rank-one update of a matrix. It is the determinant counterpart of the Sherman–Morrison formula and is widely used in statistics, numerical linear algebra and the matrix-tree theorem.
Formalization note. Mathlib's Matrix.det_add_replicateCol_mul_replicateRow. The column and the row are Matrix.replicateCol ι u and Matrix.replicateRow ι v for a one-element index type , so is the determinant of a matrix.
Preamble
import Mathlib
Formal statement
namespace FamousTheorems
theorem matrix_determinant_lemma {m ι α : Type*} [Fintype m] [DecidableEq m] [CommRing α] [Unique ι] {A : Matrix m m α}
(hA : IsUnit A.det) (u v : m → α) :
(A + Matrix.replicateCol ι u * Matrix.replicateRow ι v).det =
A.det * (1 + Matrix.replicateRow ι v * A⁻¹ * Matrix.replicateCol ι u).det := by sorry
end FamousTheoremsSource
Listed in Mathlib's curated theorem manifests (docs/1000.yaml); formalized in Mathlib as `Matrix.det_add_replicateCol_mul_replicateRow`. Proof here reduces to that Mathlib result.