Matrix.schurTriangulationAux
defimported Lean
This is LinearMap.SchurTriangulationAux adapted for matrices in the Euclidean space.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Matrix in open scoped InnerProductSpace in open Module in variable [RCLike ๐] [IsAlgClosed ๐] [Fintype n] [DecidableEq n] [LinearOrder n] (A : Matrix n n ๐) in noncomputable def Matrix.schurTriangulationAux : OrthonormalBasis n ๐ (EuclideanSpace ๐ n) ร UpperTriangular n ๐
- Defined in
- Physlib, `Matrix.schurTriangulationAux`
- Lean proof
- By Gordon Hsu, from github.com/leanprover-community/physlib at
e411c6e89692(Copyright (c) 2025 Gordon Hsu. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.34.1.Matrix.schurTriangulationAux← Matrix.schurTriangulationAux (Physlib/Mathematics/ForMathlib/SchurTriangulation.lean:239): verbatim
- Verified
- 09 Oct 2026
- Axioms
- none listed
- Built on 5
- Matrix.UpperTriangularThe subtype of upper triangular matrices.
- LinearMap.SchurTriangulationAux.ofDon't use this definition directly. This is the key algorithm behind
Matrix.schur_triangulation. - LinearMap.SchurTriangulationAuxDon't use this definition directly. Instead, use
Matrix.schurTriangulationBasis,Matrix.schurTriangulationUnitary, andโฆ - LinearOrder.toTotalPreorderEvery
LinearOrderis aTotalPreorder. - TotalPreorderA total preorder: a preorder where
โคis total (complete). This is weaker thanLinearOrderโ it does NOT require antisymmetry orโฆ
- Used by 2
- Matrix.schurTriangulationBasisThe change of basis that induces the upper triangular form
A.schurTriangulationof a matrixAover an algebraically closed field. - Matrix.schurTriangulationThe upper triangular form induced by
A.schurTriangulationUnitaryto which a matrixAover an algebraically closed field is unitarilyโฆ
- Matrix.schurTriangulationBasisThe change of basis that induces the upper triangular form
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Matrix in open scoped InnerProductSpace in open Module in variable [RCLike ๐] [IsAlgClosed ๐] [Fintype n] [DecidableEq n] [LinearOrder n] (A : Matrix n n ๐) in /-- This is `LinearMap.SchurTriangulationAux` adapted for matrices in the Euclidean space. -/ noncomputable def Matrix.schurTriangulationAux : OrthonormalBasis n ๐ (EuclideanSpace ๐ n) ร UpperTriangular n ๐ := let f := toEuclideanLin A let โจd, hd, b, hutโฉ := LinearMap.SchurTriangulationAux.of f let e : Fin d โo n := Fintype.orderIsoFinOfCardEq n (finrank_euclideanSpace.symm.trans hd) let b' := b.reindex e let B := LinearMap.toMatrixOrthonormal b' f suffices B.IsUpperTriangular from โจb', B, thisโฉ fun i j (hji : j < i) => calc LinearMap.toMatrixOrthonormal b' f i j _ = LinearMap.toMatrixOrthonormal b f (e.symm i) (e.symm j) := by rw [f.toMatrixOrthonormal_reindex] rfl _ = 0 := hut (e.symm.lt_iff_lt.mpr hji)