Sylvester's determinant theorem
ProvedFamousTheorems.sylvester_determinantSylvester's determinant theorem. For an matrix and an matrix over a commutative ring,
A large determinant can be computed as a small one, e.g. (the matrix determinant lemma). It is used in random matrix theory, Fredholm determinants and the analysis of low-rank perturbations.
Formalization note. Mathlib's Matrix.det_one_add_mul_comm.
Preamble
import Mathlib
Formal statement
namespace FamousTheorems
theorem sylvester_determinant {m n α : Type*} [Fintype m] [Fintype n] [DecidableEq m] [DecidableEq n] [CommRing α] (A : Matrix m n α)
(B : Matrix n m α) : (1 + A * B).det = (1 + B * A).det := by sorry
end FamousTheoremsSource
Listed in Mathlib's curated theorem manifests (docs/1000.yaml); formalized in Mathlib as `Matrix.det_one_add_mul_comm`. Proof here reduces to that Mathlib result.