Loogle!
Result
Found 85 declarations mentioning Matrix.reindex.
- Matrix.reindex π Mathlib.LinearAlgebra.Matrix.Defs
{l : Type u_1} {m : Type u_2} {n : Type u_3} {o : Type u_4} {Ξ± : Type v} (eβ : m β l) (eβ : n β o) : Matrix m n Ξ± β Matrix l o Ξ± - Matrix.reindex_symm π Mathlib.LinearAlgebra.Matrix.Defs
{l : Type u_1} {m : Type u_2} {n : Type u_3} {o : Type u_4} {Ξ± : Type v} (eβ : m β l) (eβ : n β o) : (Matrix.reindex eβ eβ).symm = Matrix.reindex eβ.symm eβ.symm - Matrix.reindex_refl_refl π Mathlib.LinearAlgebra.Matrix.Defs
{m : Type u_2} {n : Type u_3} {Ξ± : Type v} (A : Matrix m n Ξ±) : (Matrix.reindex (Equiv.refl m) (Equiv.refl n)) A = A - Matrix.reindex_trans π Mathlib.LinearAlgebra.Matrix.Defs
{l : Type u_1} {m : Type u_2} {n : Type u_3} {o : Type u_4} {Ξ± : Type v} {lβ : Type u_8} {oβ : Type u_9} (eβ : m β l) (eβ : n β o) (eββ : l β lβ) (eββ : o β oβ) : (Matrix.reindex eβ eβ).trans (Matrix.reindex eββ eββ) = Matrix.reindex (eβ.trans eββ) (eβ.trans eββ) - Matrix.reindex_apply π Mathlib.LinearAlgebra.Matrix.Defs
{l : Type u_1} {m : Type u_2} {n : Type u_3} {o : Type u_4} {Ξ± : Type v} (eβ : m β l) (eβ : n β o) (M : Matrix m n Ξ±) : (Matrix.reindex eβ eβ) M = M.submatrix βeβ.symm βeβ.symm - Matrix.transpose_reindex π Mathlib.LinearAlgebra.Matrix.Defs
{l : Type u_1} {m : Type u_2} {n : Type u_3} {o : Type u_4} {Ξ± : Type v} (eβ : m β l) (eβ : n β o) (M : Matrix m n Ξ±) : ((Matrix.reindex eβ eβ) M).transpose = (Matrix.reindex eβ eβ) M.transpose - Matrix.conjTranspose_reindex π Mathlib.LinearAlgebra.Matrix.ConjTranspose
{l : Type u_1} {m : Type u_2} {n : Type u_3} {o : Type u_4} {Ξ± : Type v} [Star Ξ±] (eβ : m β l) (eβ : n β o) (M : Matrix m n Ξ±) : ((Matrix.reindex eβ eβ) M).conjTranspose = (Matrix.reindex eβ eβ) M.conjTranspose - Matrix.comp_diagonal π Mathlib.Data.Matrix.Block
{m : Type u_2} {n : Type u_3} {R : Type u_13} [Zero R] [DecidableEq m] (d : m β Matrix n n R) : (Matrix.comp m m n n R) (Matrix.diagonal d) = (Matrix.reindex (Equiv.prodComm n m) (Equiv.prodComm n m)) (Matrix.blockDiagonal d) - Matrix.comp_toSquareBlock π Mathlib.Data.Matrix.Block
{m : Type u_2} {n : Type u_3} {R : Type u_13} {Ξ± : Type u_14} {b : m β Ξ±} (M : Matrix m m (Matrix n n R)) (a : Ξ±) : ((Matrix.comp m m n n R) M).toSquareBlock (fun i => b i.1) a = (Matrix.reindex Equiv.prodSubtypeFstEquivSubtypeProd.symm Equiv.prodSubtypeFstEquivSubtypeProd.symm) ((Matrix.comp { a_1 // b a_1 = a } { a_1 // b a_1 = a } n n R) (M.toSquareBlock b a)) - Matrix.reindex_updateCol π Mathlib.LinearAlgebra.Matrix.RowCol
{l : Type u_1} {m : Type u_2} {n : Type u_3} {o : Type u_4} {Ξ± : Type v} [DecidableEq o] [DecidableEq n] (A : Matrix m n Ξ±) (j : n) (c : m β Ξ±) (e : m β l) (f : n β o) : (Matrix.reindex e f) (A.updateCol j c) = ((Matrix.reindex e f) A).updateCol (f j) fun i => c (e.symm i) - Matrix.reindex_updateRow π Mathlib.LinearAlgebra.Matrix.RowCol
{l : Type u_1} {m : Type u_2} {n : Type u_3} {o : Type u_4} {Ξ± : Type v} [DecidableEq l] [DecidableEq m] (A : Matrix m n Ξ±) (i : m) (r : n β Ξ±) (e : m β l) (f : n β o) : (Matrix.reindex e f) (A.updateRow i r) = ((Matrix.reindex e f) A).updateRow (e i) fun i => r (f.symm i) - Matrix.updateCol_reindex π Mathlib.LinearAlgebra.Matrix.RowCol
{l : Type u_1} {m : Type u_2} {n : Type u_3} {o : Type u_4} {Ξ± : Type v} [DecidableEq o] [DecidableEq n] (A : Matrix m n Ξ±) (j : o) (c : l β Ξ±) (e : m β l) (f : n β o) : ((Matrix.reindex e f) A).updateCol j c = (Matrix.reindex e f) (A.updateCol (f.symm j) fun i => c (e i)) - Matrix.updateRow_reindex π Mathlib.LinearAlgebra.Matrix.RowCol
{l : Type u_1} {m : Type u_2} {n : Type u_3} {o : Type u_4} {Ξ± : Type v} [DecidableEq l] [DecidableEq m] (A : Matrix m n Ξ±) (i : l) (r : o β Ξ±) (e : m β l) (f : n β o) : ((Matrix.reindex e f) A).updateRow i r = (Matrix.reindex e f) (A.updateRow (e.symm i) fun j => r (f j)) - Matrix.mulVecLin_reindex π Mathlib.LinearAlgebra.Matrix.ToLin
{R : Type u_1} [CommSemiring R] {k : Type u_2} {l : Type u_3} {m : Type u_4} {n : Type u_5} [Fintype n] [Fintype l] (eβ : k β m) (eβ : l β n) (M : Matrix k l R) : ((Matrix.reindex eβ eβ) M).mulVecLin = β(LinearEquiv.funCongrLeft R R eβ.symm) ββ M.mulVecLin ββ β(LinearEquiv.funCongrLeft R R eβ) - Matrix.toLin'_reindex π Mathlib.LinearAlgebra.Matrix.ToLin
{R : Type u_1} [CommSemiring R] {k : Type u_2} {l : Type u_3} {m : Type u_4} {n : Type u_5} [DecidableEq n] [Fintype n] [Fintype l] [DecidableEq l] (eβ : k β m) (eβ : l β n) (M : Matrix k l R) : Matrix.toLin' ((Matrix.reindex eβ eβ) M) = β(LinearEquiv.funCongrLeft R R eβ.symm) ββ Matrix.toLin' M ββ β(LinearEquiv.funCongrLeft R R eβ) - Matrix.det_reindex_self π Mathlib.LinearAlgebra.Matrix.Determinant.Basic
{m : Type u_1} {n : Type u_2} [DecidableEq n] [Fintype n] [DecidableEq m] [Fintype m] {R : Type v} [CommRing R] (e : m β n) (A : Matrix m m R) : ((Matrix.reindex e e) A).det = A.det - Matrix.abs_det_reindex π Mathlib.LinearAlgebra.Matrix.Determinant.Basic
{m : Type u_1} {n : Type u_2} [DecidableEq n] [Fintype n] [DecidableEq m] [Fintype m] {R : Type u_3} [CommRing R] [LinearOrder R] [IsStrictOrderedRing R] (eβ eβ : m β n) (A : Matrix m m R) : |((Matrix.reindex eβ eβ) A).det| = |A.det| - Matrix.det_reindex π Mathlib.LinearAlgebra.Matrix.Determinant.Basic
{m : Type u_1} {n : Type u_2} [DecidableEq n] [Fintype n] [DecidableEq m] [Fintype m] {R : Type v} [CommRing R] (e e' : m β n) (M : Matrix m m R) : ((Matrix.reindex e e') M).det = ββ(Equiv.Perm.sign (e'.trans e.symm)) * M.det - Matrix.toEquiv_reindexAddEquiv π Mathlib.LinearAlgebra.Matrix.Reindex
{m : Type u_1} {n : Type u_2} {m' : Type u_4} {n' : Type u_5} (R : Type u_9) [Add R] (eβ : m β m') (eβ : n β n') : β(Matrix.reindexAddEquiv R eβ eβ) = Matrix.reindex eβ eβ - Matrix.toEquiv_reindexRingEquiv π Mathlib.LinearAlgebra.Matrix.Reindex
{m : Type u_1} {n : Type u_2} (R : Type u_9) [Fintype m] [Fintype n] [Mul R] [AddCommMonoid R] (e : m β n) : β(Matrix.reindexRingEquiv R e) = Matrix.reindex e e - Matrix.toEquiv_reindexAlgEquiv π Mathlib.LinearAlgebra.Matrix.Reindex
{m : Type u_1} {n : Type u_2} (R : Type u_9) (A : Type u_10) [CommSemiring R] [Fintype n] [Fintype m] [DecidableEq m] [DecidableEq n] [Semiring A] [Algebra R A] (e : m β n) : β(Matrix.reindexAlgEquiv R A e) = Matrix.reindex e e - Matrix.coe_reindexAddEquiv π Mathlib.LinearAlgebra.Matrix.Reindex
{m : Type u_1} {n : Type u_2} {m' : Type u_4} {n' : Type u_5} (R : Type u_9) [Add R] (eβ : m β m') (eβ : n β n') : β(Matrix.reindexAddEquiv R eβ eβ) = β(Matrix.reindex eβ eβ) - Matrix.toEquiv_reindexLinearEquiv π Mathlib.LinearAlgebra.Matrix.Reindex
{m : Type u_1} {n : Type u_2} {m' : Type u_4} {n' : Type u_5} (R : Type u_9) (A : Type u_10) [Semiring R] [AddCommMonoid A] [Module R A] (eβ : m β m') (eβ : n β n') : β(Matrix.reindexLinearEquiv R A eβ eβ) = Matrix.reindex eβ eβ - Matrix.coe_reindexAlgEquiv π Mathlib.LinearAlgebra.Matrix.Reindex
{m : Type u_1} {n : Type u_2} (R : Type u_9) (A : Type u_10) [CommSemiring R] [Fintype n] [Fintype m] [DecidableEq m] [DecidableEq n] [Semiring A] [Algebra R A] (e : m β n) : β(Matrix.reindexAlgEquiv R A e) = β(Matrix.reindex e e) - Matrix.reindexAlgEquiv_apply π Mathlib.LinearAlgebra.Matrix.Reindex
{m : Type u_1} {n : Type u_2} (R : Type u_9) (A : Type u_10) [CommSemiring R] [Fintype n] [Fintype m] [DecidableEq m] [DecidableEq n] [Semiring A] [Algebra R A] (e : m β n) (M : Matrix m m A) : (Matrix.reindexAlgEquiv R A e) M = (Matrix.reindex e e) M - Matrix.coe_reindexRingEquiv π Mathlib.LinearAlgebra.Matrix.Reindex
{m : Type u_1} {n : Type u_2} (R : Type u_9) [Fintype m] [Fintype n] [Mul R] [AddCommMonoid R] (e : m β n) : β(Matrix.reindexRingEquiv R e) = β(Matrix.reindex e e) - Matrix.coe_reindexLinearEquiv π Mathlib.LinearAlgebra.Matrix.Reindex
{m : Type u_1} {n : Type u_2} {m' : Type u_4} {n' : Type u_5} (R : Type u_9) (A : Type u_10) [Semiring R] [AddCommMonoid A] [Module R A] (eβ : m β m') (eβ : n β n') : β(Matrix.reindexLinearEquiv R A eβ eβ) = β(Matrix.reindex eβ eβ) - Matrix.reindexLinearEquiv_apply π Mathlib.LinearAlgebra.Matrix.Reindex
{m : Type u_1} {n : Type u_2} {m' : Type u_4} {n' : Type u_5} (R : Type u_9) (A : Type u_10) [Semiring R] [AddCommMonoid A] [Module R A] (eβ : m β m') (eβ : n β n') (M : Matrix m n A) : (Matrix.reindexLinearEquiv R A eβ eβ) M = (Matrix.reindex eβ eβ) M - Matrix.IsSymm.reindex π Mathlib.LinearAlgebra.Matrix.Symmetric
{Ξ± : Type u_1} {n : Type u_3} {m : Type u_4} {A : Matrix n n Ξ±} (h : A.IsSymm) (f : n β m) : ((Matrix.reindex f f) A).IsSymm - Matrix.isSymm_reindex_iff π Mathlib.LinearAlgebra.Matrix.Symmetric
{Ξ± : Type u_1} {n : Type u_3} {m : Type u_4} {A : Matrix n n Ξ±} (f : n β m) : ((Matrix.reindex f f) A).IsSymm β A.IsSymm - Matrix.adjugate_reindex π Mathlib.LinearAlgebra.Matrix.Adjugate
{m : Type u} {n : Type v} {Ξ± : Type w} [DecidableEq n] [Fintype n] [DecidableEq m] [Fintype m] [CommRing Ξ±] (e : m β n) (A : Matrix m m Ξ±) : ((Matrix.reindex e e) A).adjugate = (Matrix.reindex e e) A.adjugate - Matrix.cramer_reindex π Mathlib.LinearAlgebra.Matrix.Adjugate
{m : Type u} {n : Type v} {Ξ± : Type w} [DecidableEq n] [Fintype n] [DecidableEq m] [Fintype m] [CommRing Ξ±] (e : m β n) (A : Matrix m m Ξ±) (b : n β Ξ±) : ((Matrix.reindex e e) A).cramer b = A.cramer (b β βe) β βe.symm - Matrix.kroneckerMap_diagonal_left π Mathlib.LinearAlgebra.Matrix.Kronecker
{Ξ± : Type u_3} {Ξ² : Type u_5} {Ξ³ : Type u_7} {l : Type u_9} {m : Type u_10} {n : Type u_11} [Zero Ξ±] [Zero Ξ³] [DecidableEq l] (f : Ξ± β Ξ² β Ξ³) (hf : β (b : Ξ²), f 0 b = 0) (a : l β Ξ±) (B : Matrix m n Ξ²) : Matrix.kroneckerMap f (Matrix.diagonal a) B = (Matrix.reindex (Equiv.prodComm m l) (Equiv.prodComm n l)) (Matrix.blockDiagonal fun i => B.map fun b => f (a i) b) - Matrix.one_kronecker π Mathlib.LinearAlgebra.Matrix.Kronecker
{Ξ± : Type u_3} {l : Type u_9} {m : Type u_10} {n : Type u_11} [MulZeroOneClass Ξ±] [DecidableEq l] (B : Matrix m n Ξ±) : Matrix.kroneckerMap (fun x1 x2 => x1 * x2) 1 B = (Matrix.reindex (Equiv.prodComm m l) (Equiv.prodComm n l)) (Matrix.blockDiagonal fun x => B) - Matrix.diagonal_kronecker π Mathlib.LinearAlgebra.Matrix.Kronecker
{Ξ± : Type u_3} {l : Type u_9} {m : Type u_10} {n : Type u_11} [MulZeroClass Ξ±] [DecidableEq l] (a : l β Ξ±) (B : Matrix m n Ξ±) : Matrix.kroneckerMap (fun x1 x2 => x1 * x2) (Matrix.diagonal a) B = (Matrix.reindex (Equiv.prodComm m l) (Equiv.prodComm n l)) (Matrix.blockDiagonal fun i => a i β’ B) - Matrix.kroneckerMap_reindex_left π Mathlib.LinearAlgebra.Matrix.Kronecker
{Ξ± : Type u_3} {Ξ² : Type u_5} {Ξ³ : Type u_7} {l : Type u_9} {m : Type u_10} {n : Type u_11} {l' : Type u_15} {m' : Type u_16} {n' : Type u_17} (f : Ξ± β Ξ² β Ξ³) (el : l β l') (em : m β m') (M : Matrix l m Ξ±) (N : Matrix n n' Ξ²) : Matrix.kroneckerMap f ((Matrix.reindex el em) M) N = (Matrix.reindex (el.prodCongr (Equiv.refl n)) (em.prodCongr (Equiv.refl n'))) (Matrix.kroneckerMap f M N) - Matrix.kroneckerMap_reindex_right π Mathlib.LinearAlgebra.Matrix.Kronecker
{Ξ± : Type u_3} {Ξ² : Type u_5} {Ξ³ : Type u_7} {l : Type u_9} {m : Type u_10} {n : Type u_11} {l' : Type u_15} {m' : Type u_16} {n' : Type u_17} (f : Ξ± β Ξ² β Ξ³) (em : m β m') (en : n β n') (M : Matrix l l' Ξ±) (N : Matrix m n Ξ²) : Matrix.kroneckerMap f M ((Matrix.reindex em en) N) = (Matrix.reindex ((Equiv.refl l).prodCongr em) ((Equiv.refl l').prodCongr en)) (Matrix.kroneckerMap f M N) - Matrix.natCast_kronecker π Mathlib.LinearAlgebra.Matrix.Kronecker
{Ξ± : Type u_3} {l : Type u_9} {m : Type u_10} {n : Type u_11} [NonAssocSemiring Ξ±] [DecidableEq l] (a : β) (B : Matrix m n Ξ±) : Matrix.kroneckerMap (fun x1 x2 => x1 * x2) (βa) B = (Matrix.reindex (Equiv.prodComm m l) (Equiv.prodComm n l)) (Matrix.blockDiagonal fun x => a β’ B) - Matrix.ofNat_kronecker π Mathlib.LinearAlgebra.Matrix.Kronecker
{Ξ± : Type u_3} {l : Type u_9} {m : Type u_10} {n : Type u_11} [NonAssocSemiring Ξ±] [DecidableEq l] (a : β) [a.AtLeastTwo] (B : Matrix m n Ξ±) : Matrix.kroneckerMap (fun x1 x2 => x1 * x2) (OfNat.ofNat a) B = (Matrix.reindex (Equiv.prodComm m l) (Equiv.prodComm n l)) (Matrix.blockDiagonal fun x => OfNat.ofNat a β’ B) - Matrix.kroneckerMap_assocβ π Mathlib.LinearAlgebra.Matrix.Kronecker
{Ξ± : Type u_3} {Ξ² : Type u_5} {Ξ³ : Type u_7} {l : Type u_9} {m : Type u_10} {n : Type u_11} {p : Type u_12} {q : Type u_13} {r : Type u_14} {Ξ΄ : Type u_19} {ΞΎ : Type u_20} {Ο : Type u_21} (f : Ξ± β Ξ² β Ξ³) (g : Ξ³ β Ξ΄ β Ο) (f' : Ξ± β ΞΎ β Ο) (g' : Ξ² β Ξ΄ β ΞΎ) (A : Matrix l m Ξ±) (B : Matrix n p Ξ²) (D : Matrix q r Ξ΄) (h : β (a : Ξ±) (b : Ξ²) (d : Ξ΄), g (f a b) d = f' a (g' b d)) : (Matrix.reindex (Equiv.prodAssoc l n q) (Equiv.prodAssoc m p r)) (Matrix.kroneckerMap g (Matrix.kroneckerMap f A B) D) = Matrix.kroneckerMap f' A (Matrix.kroneckerMap g' B D) - Matrix.kronecker_assoc π Mathlib.LinearAlgebra.Matrix.Kronecker
{Ξ± : Type u_3} {l : Type u_9} {m : Type u_10} {n : Type u_11} {p : Type u_12} {q : Type u_13} {r : Type u_14} [Semigroup Ξ±] (A : Matrix l m Ξ±) (B : Matrix n p Ξ±) (C : Matrix q r Ξ±) : (Matrix.reindex (Equiv.prodAssoc l n q) (Equiv.prodAssoc m p r)) (Matrix.kroneckerMap (fun x1 x2 => x1 * x2) (Matrix.kroneckerMap (fun x1 x2 => x1 * x2) A B) C) = Matrix.kroneckerMap (fun x1 x2 => x1 * x2) A (Matrix.kroneckerMap (fun x1 x2 => x1 * x2) B C) - Matrix.kroneckerMap_reindex π Mathlib.LinearAlgebra.Matrix.Kronecker
{Ξ± : Type u_3} {Ξ² : Type u_5} {Ξ³ : Type u_7} {l : Type u_9} {m : Type u_10} {n : Type u_11} {p : Type u_12} {l' : Type u_15} {m' : Type u_16} {n' : Type u_17} {p' : Type u_18} (f : Ξ± β Ξ² β Ξ³) (el : l β l') (em : m β m') (en : n β n') (ep : p β p') (M : Matrix l m Ξ±) (N : Matrix n p Ξ²) : Matrix.kroneckerMap f ((Matrix.reindex el em) M) ((Matrix.reindex en ep) N) = (Matrix.reindex (el.prodCongr en) (em.prodCongr ep)) (Matrix.kroneckerMap f M N) - Matrix.diagonal_kroneckerTMul π Mathlib.LinearAlgebra.Matrix.Kronecker
(R : Type u_1) {Ξ± : Type u_3} {Ξ² : Type u_5} {l : Type u_9} {m : Type u_10} {n : Type u_11} [CommSemiring R] [AddCommMonoid Ξ±] [AddCommMonoid Ξ²] [Module R Ξ±] [Module R Ξ²] [DecidableEq l] (a : l β Ξ±) (B : Matrix m n Ξ²) : Matrix.kroneckerMap (TensorProduct.tmul R) (Matrix.diagonal a) B = (Matrix.reindex (Equiv.prodComm m l) (Equiv.prodComm n l)) (Matrix.blockDiagonal fun i => B.map fun b => a i ββ[R] b) - Matrix.kroneckerMap_assoc π Mathlib.LinearAlgebra.Matrix.Kronecker
{Ξ± : Type u_3} {Ξ² : Type u_5} {Ξ³ : Type u_7} {l : Type u_9} {m : Type u_10} {n : Type u_11} {p : Type u_12} {q : Type u_13} {r : Type u_14} {Ξ΄ : Type u_19} {ΞΎ : Type u_20} {Ο : Type u_21} {Ο' : Type u_22} (f : Ξ± β Ξ² β Ξ³) (g : Ξ³ β Ξ΄ β Ο) (f' : Ξ± β ΞΎ β Ο') (g' : Ξ² β Ξ΄ β ΞΎ) (A : Matrix l m Ξ±) (B : Matrix n p Ξ²) (D : Matrix q r Ξ΄) (Ο : Ο β Ο') (hΟ : β (a : Ξ±) (b : Ξ²) (d : Ξ΄), Ο (g (f a b) d) = f' a (g' b d)) : ((Matrix.reindex (Equiv.prodAssoc l n q) (Equiv.prodAssoc m p r)).trans Ο.mapMatrix) (Matrix.kroneckerMap g (Matrix.kroneckerMap f A B) D) = Matrix.kroneckerMap f' A (Matrix.kroneckerMap g' B D) - Matrix.kroneckerTMul_assoc π Mathlib.LinearAlgebra.Matrix.Kronecker
(R : Type u_1) {Ξ± : Type u_3} {Ξ² : Type u_5} {Ξ³ : Type u_7} {l : Type u_9} {m : Type u_10} {n : Type u_11} {p : Type u_12} {q : Type u_13} {r : Type u_14} [CommSemiring R] [AddCommMonoid Ξ±] [AddCommMonoid Ξ²] [AddCommMonoid Ξ³] [Module R Ξ±] [Module R Ξ²] [Module R Ξ³] (A : Matrix l m Ξ±) (B : Matrix n p Ξ²) (C : Matrix q r Ξ³) : (Matrix.reindex (Equiv.prodAssoc l n q) (Equiv.prodAssoc m p r)) ((Matrix.kroneckerMap (TensorProduct.tmul R) (Matrix.kroneckerMap (TensorProduct.tmul R) A B) C).map β(TensorProduct.assoc R Ξ± Ξ² Ξ³)) = Matrix.kroneckerMap (TensorProduct.tmul R) A (Matrix.kroneckerMap (TensorProduct.tmul R) B C) - Matrix.inv_reindex π Mathlib.LinearAlgebra.Matrix.NonsingularInverse
{m : Type u} {n : Type u'} {Ξ± : Type v} [Fintype n] [DecidableEq n] [CommRing Ξ±] [Fintype m] [DecidableEq m] (eβ eβ : n β m) (A : Matrix n n Ξ±) : ((Matrix.reindex eβ eβ) A)β»ΒΉ = (Matrix.reindex eβ eβ) Aβ»ΒΉ - Matrix.blockTriangular_reindex_iff π Mathlib.LinearAlgebra.Matrix.Block
{Ξ± : Type u_1} {m : Type u_2} {n : Type u_3} {R : Type v} {M : Matrix m m R} [LT Ξ±] [Zero R] {b : n β Ξ±} {e : m β n} : ((Matrix.reindex e e) M).BlockTriangular b β M.BlockTriangular (b β βe) - Matrix.charpoly_reindex π Mathlib.LinearAlgebra.Matrix.Charpoly.Basic
{R : Type u_1} [CommRing R] {m : Type u_3} {n : Type u_4} [DecidableEq m] [DecidableEq n] [Fintype m] [Fintype n] (e : n β m) (M : Matrix n n R) : ((Matrix.reindex e e) M).charpoly = M.charpoly - Matrix.charmatrix_reindex π Mathlib.LinearAlgebra.Matrix.Charpoly.Basic
{R : Type u_1} [CommRing R] {m : Type u_3} {n : Type u_4} [DecidableEq m] [DecidableEq n] [Fintype m] [Fintype n] (M : Matrix n n R) (e : n β m) : ((Matrix.reindex e e) M).charmatrix = (Matrix.reindex e e) M.charmatrix - LieAlgebra.Basis.equivOfReindex π Mathlib.Algebra.Lie.Basis.Prod
{ΞΉβ : Type u_1} {ΞΉβ : Type u_2} {Lβ : Type u_3} {Lβ : Type u_4} [Finite ΞΉβ] [Finite ΞΉβ] (eΞΉ : ΞΉβ β ΞΉβ) [LieRing Lβ] [LieRing Lβ] {K : Type u_5} [Field K] [CharZero K] [LieAlgebra K Lβ] [FiniteDimensional K Lβ] {Hβ : LieSubalgebra K Lβ} (bβ : LieAlgebra.Basis ΞΉβ Hβ) [LieAlgebra K Lβ] [FiniteDimensional K Lβ] {Hβ : LieSubalgebra K Lβ} (bβ : LieAlgebra.Basis ΞΉβ Hβ) (hA : (Matrix.reindex eΞΉ eΞΉ) bβ.A = bβ.A) [LieAlgebra.IsSimple K Lβ] [LieAlgebra.IsSimple K Lβ] : Lβ βββ Kβ Lβ - Matrix.IsHermitian.reindex π Mathlib.LinearAlgebra.Matrix.Hermitian
{Ξ± : Type u_1} {m : Type u_3} {n : Type u_4} [Star Ξ±] {A : Matrix n n Ξ±} (h : A.IsHermitian) (f : n β m) : ((Matrix.reindex f f) A).IsHermitian - Matrix.isHermitian_reindex_iff π Mathlib.LinearAlgebra.Matrix.Hermitian
{Ξ± : Type u_1} {m : Type u_3} {n : Type u_4} [Star Ξ±] {A : Matrix n n Ξ±} (f : n β m) : ((Matrix.reindex f f) A).IsHermitian β A.IsHermitian - CartanMatrix.D_three' π Mathlib.LinearAlgebra.Matrix.Cartan
: (Matrix.reindex ((β[0, 1]).formPerm β―) ((β[0, 1]).formPerm β―)) (CartanMatrix.D 3) = CartanMatrix.A 3 - RootPairing.Base.map_equiv_cartanMatrix π Mathlib.LinearAlgebra.RootSystem.CartanMatrix
{ΞΉ : Type u_1} {R : Type u_2} {M : Type u_3} {N : Type u_4} [CommRing R] [AddCommGroup M] [Module R M] [AddCommGroup N] [Module R N] {P : RootPairing ΞΉ R M N} (b : P.Base) [P.IsCrystallographic] [CharZero R] {ΞΉβ : Type u_6} {Mβ : Type u_7} {Nβ : Type u_8} [DecidableEq ΞΉβ] [AddCommGroup Mβ] [Module R Mβ] [AddCommGroup Nβ] [Module R Nβ] {Pβ : RootPairing ΞΉβ R Mβ Nβ} [Pβ.IsCrystallographic] (e : P.Equiv Pβ) : (b.map e).cartanMatrix = (Matrix.reindex (b.supportMapEquiv e) (b.supportMapEquiv e)) b.cartanMatrix - LieAlgebra.Basis.cartanMatrix_base_eq π Mathlib.Algebra.Lie.Basis.Base
{K : Type u_1} {L : Type u_2} [Field K] [CharZero K] [LieRing L] [LieAlgebra K L] [FiniteDimensional K L] {H : LieSubalgebra K L} {ΞΉ : Type u_3} [Fintype ΞΉ] (b : LieAlgebra.Basis ΞΉ H) [LieModule.IsTriangularizable K (β₯H) L] [LieAlgebra.IsKilling K L] : b.base.cartanMatrix = (Matrix.reindex b.baseSupportEquiv b.baseSupportEquiv) b.A - Matrix.reindexLieEquiv_apply π Mathlib.Algebra.Lie.Matrix
{R : Type u} [CommRing R] {n : Type w} [DecidableEq n] [Fintype n] {m : Type wβ} [DecidableEq m] [Fintype m] (e : n β m) (M : Matrix n n R) : (Matrix.reindexLieEquiv e) M = (Matrix.reindex e e) M - Matrix.cRank_reindex π Mathlib.LinearAlgebra.Matrix.Rank
{m : Type um} {nβ : Type unβ} {R : Type uR} {mβ : Type um} {n : Type un} [Semiring R] (A : Matrix m n R) (em : m β mβ) (en : n β nβ) : ((Matrix.reindex em en) A).cRank = A.cRank - Matrix.eRank_reindex π Mathlib.LinearAlgebra.Matrix.Rank
{m : Type um} {nβ : Type unβ} {R : Type uR} {mβ : Type um} {n : Type un} [Semiring R] (A : Matrix m n R) (em : m β mβ) (en : n β nβ) : ((Matrix.reindex em en) A).eRank = A.eRank - Matrix.lift_cRank_reindex π Mathlib.LinearAlgebra.Matrix.Rank
{m : Type um} {mβ : Type umβ} {nβ : Type unβ} {R : Type uR} {n : Type un} [Semiring R] (A : Matrix m n R) (em : m β mβ) (en : n β nβ) : Cardinal.lift.{um, max uR umβ} ((Matrix.reindex em en) A).cRank = Cardinal.lift.{umβ, max uR um} A.cRank - Matrix.rank_reindex π Mathlib.LinearAlgebra.Matrix.Rank
{m : Type um} {mβ : Type umβ} {n : Type un} {nβ : Type unβ} {R : Type uR} [Fintype n] [Fintype nβ] [CommSemiring R] (em : m β mβ) (en : n β nβ) (A : Matrix m n R) : ((Matrix.reindex em en) A).rank = A.rank - Continuous.matrix_reindex π Mathlib.Topology.Instances.Matrix
{X : Type u_1} {l : Type u_3} {m : Type u_4} {n : Type u_5} {p : Type u_6} {R : Type u_8} [TopologicalSpace X] [TopologicalSpace R] {A : X β Matrix l n R} (hA : Continuous A) (eβ : l β m) (eβ : n β p) : Continuous fun x => (Matrix.reindex eβ eβ) (A x) - Algebra.traceMatrix_reindex π Mathlib.RingTheory.Trace.Basic
{ΞΊ : Type w} (A : Type u) {B : Type v} [CommRing A] [CommRing B] [Algebra A B] {ΞΊ' : Type u_6} (b : Module.Basis ΞΊ A B) (f : ΞΊ β ΞΊ') : Algebra.traceMatrix A β(b.reindex f) = (Matrix.reindex f f) (Algebra.traceMatrix A βb) - Algebra.PreSubmersivePresentation.jacobiMatrix_reindex π Mathlib.RingTheory.Extension.Presentation.Submersive
{R : Type u} {S : Type v} {ΞΉ : Type w} {Ο : Type t} [CommRing R] [CommRing S] [Algebra R S] (P : Algebra.PreSubmersivePresentation R S ΞΉ Ο) {ΞΉ' : Type u_1} {Ο' : Type u_2} (e : ΞΉ' β ΞΉ) (f : Ο' β Ο) [Fintype Ο'] [DecidableEq Ο'] [Fintype Ο] [DecidableEq Ο] : (P.reindex e f).jacobiMatrix = ((Matrix.reindex f.symm f.symm) P.jacobiMatrix).map β(MvPolynomial.rename βe.symm) - Polynomial.sylvester_comm π Mathlib.RingTheory.Polynomial.Resultant.Basic
{R : Type u_1} [Semiring R] (f g : Polynomial R) (m n : β) : f.sylvester g m n = (Matrix.reindex (finCongr β―) (finSumFinEquiv.symm.trans ((Equiv.sumComm (Fin n) (Fin m)).trans finSumFinEquiv))) (g.sylvester f n m) - Polynomial.toMatrix_sylvesterMap π Mathlib.RingTheory.Polynomial.Resultant.Basic
{m n : β} {R : Type u_1} [CommRing R] (f g : Polynomial R) (hf : f.natDegree β€ m) (hg : g.natDegree β€ n) : (LinearMap.toMatrix ((Polynomial.degreeLT.basis R m).prod (Polynomial.degreeLT.basis R n)) (Polynomial.degreeLT.basis R (m + n))) (f.sylvesterMap g hf hg) = (Matrix.reindex (Equiv.refl (Fin (m + n))) finSumFinEquiv.symm) (f.sylvester g m n) - MvPolynomial.universalFactorizationMapPresentation_jacobiMatrix π Mathlib.RingTheory.Polynomial.UniversalFactorizationRing
(R : Type u_1) [CommRing R] (n m k : β) (hn : n = m + k) : (MvPolynomial.universalFactorizationMapPresentation R n m k hn).jacobiMatrix = -((Matrix.reindex (finCongr β―) (finCongr β―)) ((Polynomial.map ((MvPolynomial.mapAlgHom (Algebra.ofId R (MvPolynomial (Fin n) R))).comp (MvPolynomial.rename Sum.inl)).toRingHom (Polynomial.freeMonic R m)).sylvester (Polynomial.map ((MvPolynomial.mapAlgHom (Algebra.ofId R (MvPolynomial (Fin n) R))).comp (MvPolynomial.rename Sum.inr)).toRingHom (Polynomial.freeMonic R k)) m k)).transpose - CStarMatrix.reindexβ_apply π Mathlib.Analysis.CStarAlgebra.CStarMatrix
{m : Type u_1} {n : Type u_2} {R : Type u_3} {A : Type u_5} {l : Type u_7} {o : Type u_8} [Semiring R] [AddCommMonoid A] [Module R A] {eβ : m β l} {eβ : n β o} {M : CStarMatrix m n A} {i : l} {j : o} : (CStarMatrix.reindexβ R A eβ eβ) M i j = (Matrix.reindex eβ eβ) M i j - CStarMatrix.reindexβ_apply π Mathlib.Analysis.CStarAlgebra.CStarMatrix
{m : Type u_1} {n : Type u_2} {R : Type u_3} {A : Type u_5} [Fintype m] [Fintype n] [Semiring R] [AddCommMonoid A] [Mul A] [Star A] [Module R A] {e : m β n} {M : CStarMatrix m m A} {i j : n} : (CStarMatrix.reindexβ R A e) M i j = (Matrix.reindex e e) M i j - LinearMap.toMatrixOrthonormal_reindex π Mathlib.Analysis.InnerProductSpace.Adjoint
{π : Type u_1} {E : Type u_2} [RCLike π] [NormedAddCommGroup E] [InnerProductSpace π E] {m : Type u_5} {n : Type u_6} [Fintype m] [DecidableEq m] [Fintype n] [DecidableEq n] [FiniteDimensional π E] (vβ : OrthonormalBasis n π E) (e : n β m) (f : E ββ[π] E) : (LinearMap.toMatrixOrthonormal (vβ.reindex e)) f = (Matrix.reindex e e) ((LinearMap.toMatrixOrthonormal vβ) f) - Matrix.reindex_mem_colStochastic π Mathlib.LinearAlgebra.Matrix.Stochastic
{R : Type u_1} {n : Type u_2} [Fintype n] [DecidableEq n] [Semiring R] [PartialOrder R] [IsOrderedRing R] {m : Type u_3} [Fintype m] [DecidableEq m] {M : Matrix n n R} {eβ eβ : n β m} : M β Matrix.colStochastic R n β (Matrix.reindex eβ eβ) M β Matrix.colStochastic R m - Matrix.reindex_mem_rowStochastic π Mathlib.LinearAlgebra.Matrix.Stochastic
{R : Type u_1} {n : Type u_2} [Fintype n] [DecidableEq n] [Semiring R] [PartialOrder R] [IsOrderedRing R] {m : Type u_3} [Fintype m] [DecidableEq m] {M : Matrix n n R} {eβ eβ : n β m} (hM : M β Matrix.rowStochastic R n) : (Matrix.reindex eβ eβ) M β Matrix.rowStochastic R m - Matrix.reindex_mem_colStochastic_iff π Mathlib.LinearAlgebra.Matrix.Stochastic
{R : Type u_1} {n : Type u_2} [Fintype n] [DecidableEq n] [Semiring R] [PartialOrder R] [IsOrderedRing R] {m : Type u_3} [Fintype m] [DecidableEq m] {M : Matrix n n R} {eβ eβ : n β m} : (Matrix.reindex eβ eβ) M β Matrix.colStochastic R m β M β Matrix.colStochastic R n - Matrix.reindex_mem_rowStochastic_iff π Mathlib.LinearAlgebra.Matrix.Stochastic
{R : Type u_1} {n : Type u_2} [Fintype n] [DecidableEq n] [Semiring R] [PartialOrder R] [IsOrderedRing R] {m : Type u_3} [Fintype m] [DecidableEq m] {M : Matrix n n R} {eβ eβ : n β m} : (Matrix.reindex eβ eβ) M β Matrix.rowStochastic R m β M β Matrix.rowStochastic R n - reindex_mem_doublyStochastic π Mathlib.Analysis.Convex.DoublyStochasticMatrix
{R : Type u_1} {n : Type u_2} [Fintype n] [DecidableEq n] [Semiring R] [PartialOrder R] [IsOrderedRing R] {m : Type u_3} [Fintype m] [DecidableEq m] {M : Matrix n n R} {eβ eβ : n β m} (hM : M β doublyStochastic R n) : (Matrix.reindex eβ eβ) M β doublyStochastic R m - reindex_mem_doublyStochastic_iff π Mathlib.Analysis.Convex.DoublyStochasticMatrix
{R : Type u_1} {n : Type u_2} [Fintype n] [DecidableEq n] [Semiring R] [PartialOrder R] [IsOrderedRing R] {m : Type u_3} [Fintype m] [DecidableEq m] {M : Matrix n n R} {eβ eβ : n β m} : (Matrix.reindex eβ eβ) M β doublyStochastic R m β M β doublyStochastic R n - Matrix.IsAdjMatrix.reindex π Mathlib.Combinatorics.SimpleGraph.AdjMatrix
{Ξ± : Type u_1} {V : Type u_2} {W : Type u_3} {A : Matrix V V Ξ±} [Zero Ξ±] [One Ξ±] (h : A.IsAdjMatrix) (f : V β W) : ((Matrix.reindex f f) A).IsAdjMatrix - Matrix.isAdjMatrix_reindex_iff π Mathlib.Combinatorics.SimpleGraph.AdjMatrix
{Ξ± : Type u_1} {V : Type u_2} {W : Type u_3} {A : Matrix V V Ξ±} [Zero Ξ±] [One Ξ±] {f : V β W} : ((Matrix.reindex f f) A).IsAdjMatrix β A.IsAdjMatrix - Matrix.IsAdjMatrix.toGraphReindexIso π Mathlib.Combinatorics.SimpleGraph.AdjMatrix
{Ξ± : Type u_1} {V : Type u_2} {W : Type u_3} (A : Matrix V V Ξ±) [MulZeroOneClass Ξ±] [Nontrivial Ξ±] (h : A.IsAdjMatrix) (f : V β W) : β―.toGraph βg h.toGraph - SimpleGraph.Iso.reindex_adjMatrix π Mathlib.Combinatorics.SimpleGraph.AdjMatrix
(Ξ± : Type u_1) {V : Type u_2} {W : Type u_3} {G : SimpleGraph V} [DecidableRel G.Adj] [Zero Ξ±] [One Ξ±] {H : SimpleGraph W} [DecidableRel H.Adj] (f : G βg H) : (Matrix.reindex βf βf) (SimpleGraph.adjMatrix Ξ± G) = SimpleGraph.adjMatrix Ξ± H - Matrix.IsAdjMatrix.toGraphReindexIso_apply π Mathlib.Combinatorics.SimpleGraph.AdjMatrix
{Ξ± : Type u_1} {V : Type u_2} {W : Type u_3} (A : Matrix V V Ξ±) [MulZeroOneClass Ξ±] [Nontrivial Ξ±] (h : A.IsAdjMatrix) (f : V β W) (aβ : W) : (Matrix.IsAdjMatrix.toGraphReindexIso A h f) aβ = f.symm aβ - Matrix.IsAdjMatrix.toGraphReindexIso_symm_apply π Mathlib.Combinatorics.SimpleGraph.AdjMatrix
{Ξ± : Type u_1} {V : Type u_2} {W : Type u_3} (A : Matrix V V Ξ±) [MulZeroOneClass Ξ±] [Nontrivial Ξ±] (h : A.IsAdjMatrix) (f : V β W) (aβ : V) : (RelIso.symm (Matrix.IsAdjMatrix.toGraphReindexIso A h f)) aβ = f aβ - Matrix.IsTotallyUnimodular.reindex π Mathlib.LinearAlgebra.Matrix.Determinant.TotallyUnimodular
{m : Type u_1} {m' : Type u_2} {n : Type u_3} {n' : Type u_4} {R : Type u_5} [CommRing R] {A : Matrix m n R} (em : m β m') (en : n β n') (hA : A.IsTotallyUnimodular) : ((Matrix.reindex em en) A).IsTotallyUnimodular - Matrix.reindex_isTotallyUnimodular π Mathlib.LinearAlgebra.Matrix.Determinant.TotallyUnimodular
{m : Type u_1} {m' : Type u_2} {n : Type u_3} {n' : Type u_4} {R : Type u_5} [CommRing R] (A : Matrix m n R) (em : m β m') (en : n β n') : ((Matrix.reindex em en) A).IsTotallyUnimodular β A.IsTotallyUnimodular - Matrix.IsHadamard.reindex π Mathlib.LinearAlgebra.Matrix.HadamardMatrix
{m : Type u_1} {n : Type u_2} {R : Type u_3} [Fintype m] [Fintype n] [DecidableEq m] [DecidableEq n] [Semiring R] [StarRing R] {A : Matrix n n R} (eβ eβ : n β m) (hA : A.IsHadamard) : ((Matrix.reindex eβ eβ) A).IsHadamard - NumberField.conj_basisMatrix π Mathlib.NumberTheory.NumberField.EquivReindex
(K : Type u_1) [Field K] [NumberField K] : (NumberField.basisMatrix K).map β(starRingEnd β) = (Matrix.reindex (Equiv.refl (K β+* β)) (Function.Involutive.toPerm NumberField.ComplexEmbedding.conjugate β―)) (NumberField.basisMatrix K)
About
Loogle searches Lean and Mathlib definitions and theorems.
You can use Loogle from within the Lean4 VSCode language extension
using the Loogle command from the command palette. You can also try the
#loogle command from LeanSearchClient,
the CLI version, the Loogle
VS Code extension, the lean.nvim
integration or the Zulip bot.
Usage
Loogle finds definitions and lemmas in various ways:
By constant:
πReal.sin
finds all lemmas whose statement somehow mentions the sine function.By lemma name substring:
π"differ"
finds all lemmas that have"differ"somewhere in their lemma name.By subexpression:
π_ * (_ ^ _)
finds all lemmas whose statements somewhere include a product where the second argument is raised to some power.The pattern can also be non-linear, as in
πReal.sqrt ?a * Real.sqrt ?aIf the pattern has parameters, they are matched in any order. Both of these will find
List.map:
π(?a -> ?b) -> List ?a -> List ?b
πList ?a -> (?a -> ?b) -> List ?bBy main conclusion:
π|- tsum _ = _ * tsum _
finds all lemmas where the conclusion (the subexpression to the right of allβandβ) has the given shape.As before, if the pattern has parameters, they are matched against the hypotheses of the lemma in any order; for example,
π|- _ < _ β tsum _ < tsum _
will findtsum_lt_tsumeven though the hypothesisf i < g iis not the last.You can filter for definitions vs theorems: Using
β’ (_ : Type _)finds all definitions which provide data whileβ’ (_ : Prop)finds all theorems (and definitions of proofs).
If you pass more than one such search filter, separated by commas
Loogle will return lemmas which match all of them. The
search
π Real.sin, "two", tsum, _ * _, _ ^ _, |- _ < _ β _
would find all lemmas which mention the constants Real.sin
and tsum, have "two" as a substring of the
lemma name, include a product and a power somewhere in the type,
and have a hypothesis of the form _ < _ (if
there were any such lemmas). Metavariables (?a) are
assigned independently in each filter.
The #lucky button will directly send you to the
documentation of the first hit.
Source code
You can find the source code for this service at https://github.com/nomeata/loogle. The https://loogle.lean-lang.org/ service is provided by the Lean FRO. Please review the Lean FRO Terms of Use and Privacy Policy.
This is Loogle revision 9f11169 serving mathlib revision ce5dd8c