Theorems · Theorem · linear algebra
LDL.diag_eq_lowerInv_conj
∀ {𝕜 : Type u_1} [inst : RCLike 𝕜] {n : Type u_2} [inst_1 : LinearOrder n] [inst_2 : WellFoundedLT n]
[inst_3 : LocallyFiniteOrderBot n] {S : Matrix n n 𝕜} [inst_4 : Fintype n] (hS : S.PosDef),
LDL.diag hS = LDL.lowerInv hS * S * (LDL.lowerInv hS).conjTransposeInverse statement of LDL decomposition: we can conjugate a positive definite matrix by some lower triangular matrix and get a diagonal matrix.
- Defined in
- Mathlib.Analysis.Matrix.LDL
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 229 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites38
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coeproof · cited by 62,936
- LinearOrderstatement and proof · cited by 8,572
- Fintypestatement and proof · cited by 7,736
- Matrixstatement and proof · cited by 4,303
- RCLikestatement and proof · cited by 2,829
- Inner.innerproof · cited by 1,089
- Star.starproof · cited by 1,082
- starRingEndproof · cited by 671
- Matrix.extproof · cited by 540
- WellFoundedLTstatement and proof · cited by 491
- Matrix.transposeproof · cited by 389
- LocallyFiniteOrderBotstatement and proof · cited by 286
Cited by1
Results whose statement or proof uses this declaration.
- LDL.lower_conj_diagproof · cited by 0