Loogle!
Result
Found 290 declarations mentioning Matrix.transpose. Of these, only the first 200 are shown.
- Matrix.transpose 📋 Mathlib.LinearAlgebra.Matrix.Defs
{m : Type u_2} {n : Type u_3} {α : Type v} (M : Matrix m n α) : Matrix n m α - Matrix.transpose_involutive 📋 Mathlib.LinearAlgebra.Matrix.Defs
(n : Type u_3) (α : Type v) : Function.Involutive Matrix.transpose - Matrix.transpose_injective 📋 Mathlib.LinearAlgebra.Matrix.Defs
{m : Type u_2} {n : Type u_3} {α : Type v} : Function.Injective Matrix.transpose - Matrix.transpose_apply 📋 Mathlib.LinearAlgebra.Matrix.Defs
{m : Type u_2} {n : Type u_3} {α : Type v} (M : Matrix m n α) (i : n) (j : m) : M.transpose i j = M j i - Matrix.transpose_transpose 📋 Mathlib.LinearAlgebra.Matrix.Defs
{m : Type u_2} {n : Type u_3} {α : Type v} (M : Matrix m n α) : M.transpose.transpose = M - Matrix.col_def 📋 Mathlib.LinearAlgebra.Matrix.Defs
{m : Type u_2} {n : Type u_3} {α : Type v} (A : Matrix m n α) : A.col = fun j => A.transpose j - Matrix.col_transpose 📋 Mathlib.LinearAlgebra.Matrix.Defs
{m : Type u_2} {n : Type u_3} {α : Type v} (A : Matrix m n α) : A.transpose.col = A.row - Matrix.row_transpose 📋 Mathlib.LinearAlgebra.Matrix.Defs
{m : Type u_2} {n : Type u_3} {α : Type v} (A : Matrix m n α) : A.transpose.row = A.col - Matrix.transpose_inj 📋 Mathlib.LinearAlgebra.Matrix.Defs
{m : Type u_2} {n : Type u_3} {α : Type v} {A B : Matrix m n α} : A.transpose = B.transpose ↔ A = B - Matrix.transpose_map 📋 Mathlib.LinearAlgebra.Matrix.Defs
{m : Type u_2} {n : Type u_3} {α : Type v} {β : Type w} {f : α → β} {M : Matrix m n α} : M.transpose.map f = (M.map f).transpose - Matrix.transpose_neg 📋 Mathlib.LinearAlgebra.Matrix.Defs
{m : Type u_2} {n : Type u_3} {α : Type v} [Neg α] (M : Matrix m n α) : (-M).transpose = -M.transpose - Matrix.transpose_submatrix 📋 Mathlib.LinearAlgebra.Matrix.Defs
{l : Type u_1} {m : Type u_2} {n : Type u_3} {o : Type u_4} {α : Type v} (A : Matrix m n α) (r : l → m) (c : o → n) : (A.submatrix r c).transpose = A.transpose.submatrix c r - Matrix.transpose_zero 📋 Mathlib.LinearAlgebra.Matrix.Defs
{m : Type u_2} {n : Type u_3} {α : Type v} [Zero α] : Matrix.transpose 0 = 0 - Matrix.transpose_mem_matrix_iff 📋 Mathlib.LinearAlgebra.Matrix.Defs
{m : Type u_2} {n : Type u_3} {α : Type v} {S : Set α} {M : Matrix m n α} : M.transpose ∈ S.matrix ↔ M ∈ S.matrix - Matrix.transpose_eq_zero 📋 Mathlib.LinearAlgebra.Matrix.Defs
{m : Type u_2} {n : Type u_3} {α : Type v} [Zero α] {M : Matrix m n α} : M.transpose = 0 ↔ M = 0 - Matrix.of_col 📋 Mathlib.LinearAlgebra.Matrix.Defs
{m : Type u_2} {n : Type u_3} {α : Type v} (f : m → n → α) : (Matrix.of f).transpose.col = f - Matrix.transpose_smul 📋 Mathlib.LinearAlgebra.Matrix.Defs
{m : Type u_2} {n : Type u_3} {α : Type v} {R : Type u_8} [SMul R α] (c : R) (M : Matrix m n α) : (c • M).transpose = c • M.transpose - Matrix.col_eq_transpose 📋 Mathlib.LinearAlgebra.Matrix.Defs
{m : Type u_2} {n : Type u_3} {α : Type v} (A : Matrix m n α) : A.col = Matrix.of.symm A.transpose - Matrix.transpose_add 📋 Mathlib.LinearAlgebra.Matrix.Defs
{m : Type u_2} {n : Type u_3} {α : Type v} [Add α] (M N : Matrix m n α) : (M + N).transpose = M.transpose + N.transpose - Matrix.transpose_sub 📋 Mathlib.LinearAlgebra.Matrix.Defs
{m : Type u_2} {n : Type u_3} {α : Type v} [Sub α] (M N : Matrix m n α) : (M - N).transpose = M.transpose - N.transpose - 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.diag_transpose 📋 Mathlib.Data.Matrix.Diagonal
{n : Type u_3} {α : Type v} (A : Matrix n n α) : A.transpose.diag = A.diag - Matrix.diagonal_transpose 📋 Mathlib.Data.Matrix.Diagonal
{n : Type u_3} {α : Type v} [DecidableEq n] [Zero α] (v : n → α) : (Matrix.diagonal v).transpose = Matrix.diagonal v - Matrix.transpose_eq_diagonal 📋 Mathlib.Data.Matrix.Diagonal
{n : Type u_3} {α : Type v} [DecidableEq n] [Zero α] {M : Matrix n n α} {v : n → α} : M.transpose = Matrix.diagonal v ↔ M = Matrix.diagonal v - Matrix.transpose_one 📋 Mathlib.Data.Matrix.Diagonal
{n : Type u_3} {α : Type v} [DecidableEq n] [Zero α] [One α] : Matrix.transpose 1 = 1 - Matrix.transpose_natCast 📋 Mathlib.Data.Matrix.Diagonal
{n : Type u_3} {α : Type v} [DecidableEq n] [AddMonoidWithOne α] (d : ℕ) : (↑d).transpose = ↑d - Matrix.transpose_eq_one 📋 Mathlib.Data.Matrix.Diagonal
{n : Type u_3} {α : Type v} [DecidableEq n] [Zero α] [One α] {M : Matrix n n α} : M.transpose = 1 ↔ M = 1 - Matrix.transpose_intCast 📋 Mathlib.Data.Matrix.Diagonal
{n : Type u_3} {α : Type v} [DecidableEq n] [AddGroupWithOne α] (d : ℤ) : (↑d).transpose = ↑d - Matrix.transpose_eq_natCast 📋 Mathlib.Data.Matrix.Diagonal
{n : Type u_3} {α : Type v} [DecidableEq n] [AddMonoidWithOne α] {M : Matrix n n α} {d : ℕ} : M.transpose = ↑d ↔ M = ↑d - Matrix.transpose_eq_intCast 📋 Mathlib.Data.Matrix.Diagonal
{n : Type u_3} {α : Type v} [DecidableEq n] [AddGroupWithOne α] {M : Matrix n n α} {d : ℤ} : M.transpose = ↑d ↔ M = ↑d - Matrix.transpose_ofNat 📋 Mathlib.Data.Matrix.Diagonal
{n : Type u_3} {α : Type v} [DecidableEq n] [AddMonoidWithOne α] (d : ℕ) [d.AtLeastTwo] : (OfNat.ofNat d).transpose = OfNat.ofNat d - Matrix.transpose_eq_ofNat 📋 Mathlib.Data.Matrix.Diagonal
{n : Type u_3} {α : Type v} [DecidableEq n] [AddMonoidWithOne α] {M : Matrix n n α} {d : ℕ} [d.AtLeastTwo] : M.transpose = OfNat.ofNat d ↔ M = OfNat.ofNat d - Matrix.transpose_vecMulVec 📋 Mathlib.Data.Matrix.Mul
{m : Type u_2} {n : Type u_3} {α : Type v} [CommMagma α] (w : m → α) (v : n → α) : (Matrix.vecMulVec w v).transpose = Matrix.vecMulVec v w - Matrix.mulVec_transpose 📋 Mathlib.Data.Matrix.Mul
{m : Type u_2} {n : Type u_3} {α : Type v} [NonUnitalCommSemiring α] [Fintype m] (A : Matrix m n α) (x : m → α) : A.transpose.mulVec x = Matrix.vecMul x A - Matrix.vecMul_transpose 📋 Mathlib.Data.Matrix.Mul
{m : Type u_2} {n : Type u_3} {α : Type v} [NonUnitalCommSemiring α] [Fintype n] (A : Matrix m n α) (x : n → α) : Matrix.vecMul x A.transpose = A.mulVec x - Matrix.mulVec_one 📋 Mathlib.Data.Matrix.Mul
{m : Type u_2} {n : Type u_3} {α : Type v} [NonAssocSemiring α] [Fintype n] (A : Matrix m n α) : A.mulVec 1 = ∑ j, A.transpose j - Matrix.transpose_mul 📋 Mathlib.Data.Matrix.Mul
{l : Type u_1} {m : Type u_2} {n : Type u_3} {α : Type v} [AddCommMonoid α] [CommMagma α] [Fintype n] (M : Matrix m n α) (N : Matrix n l α) : (M * N).transpose = N.transpose * M.transpose - Matrix.dotProduct_transpose_mulVec 📋 Mathlib.Data.Matrix.Mul
{m : Type u_2} {n : Type u_3} {α : Type v} [NonUnitalCommSemiring α] [Fintype m] [Fintype n] (A : Matrix m n α) (x : n → α) (y : m → α) : x ⬝ᵥ A.transpose.mulVec y = y ⬝ᵥ A.mulVec x - Matrix.dotProduct_vecMul_transpose 📋 Mathlib.Data.Matrix.Mul
{m : Type u_2} {n : Type u_3} {α : Type v} [NonUnitalCommSemiring α] [Fintype m] [Fintype n] (A : Matrix m n α) (x : n → α) (y : m → α) : Matrix.vecMul x A.transpose ⬝ᵥ y = Matrix.vecMul y A ⬝ᵥ x - Matrix.mulVec_eq_sum 📋 Mathlib.Data.Matrix.Mul
{m : Type u_2} {n : Type u_3} {α : Type v} [NonUnitalNonAssocSemiring α] [Fintype n] (v : n → α) (M : Matrix m n α) : M.mulVec v = ∑ i, MulOpposite.op (v i) • M.transpose i - Matrix.mulVec_vecMul 📋 Mathlib.Data.Matrix.Mul
{m : Type u_2} {n : Type u_3} {o : Type u_4} {α : Type v} [NonUnitalCommSemiring α] [Fintype n] [Fintype o] (A : Matrix m n α) (B : Matrix o n α) (x : o → α) : A.mulVec (Matrix.vecMul x B) = (A * B.transpose).mulVec x - Matrix.vecMul_mulVec 📋 Mathlib.Data.Matrix.Mul
{m : Type u_2} {n : Type u_3} {o : Type u_4} {α : Type v} [NonUnitalCommSemiring α] [Fintype m] [Fintype n] (A : Matrix m n α) (B : Matrix m o α) (x : n → α) : Matrix.vecMul (A.mulVec x) B = Matrix.vecMul x (A.transpose * B) - Matrix.mul_mul_apply 📋 Mathlib.Data.Matrix.Mul
{n : Type u_3} {α : Type v} [NonUnitalSemiring α] [Fintype n] (A B C : Matrix n n α) (i j : n) : (A * B * C) i j = A i ⬝ᵥ B.mulVec (C.transpose j) - Matrix.submatrix_mul_transpose_submatrix 📋 Mathlib.Data.Matrix.Mul
{m : Type u_2} {n : Type u_3} {α : Type v} [Fintype m] [Fintype n] [AddCommMonoid α] [Mul α] (e : m ≃ n) (M : Matrix m n α) : M.submatrix id ⇑e * M.transpose.submatrix (⇑e) id = M * M.transpose - Matrix.transpose_multiset_sum 📋 Mathlib.Data.Matrix.Basic
{m : Type u_2} {n : Type u_3} {α : Type u_8} [AddCommMonoid α] (s : Multiset (Matrix m n α)) : s.sum.transpose = (Multiset.map Matrix.transpose s).sum - Matrix.transpose_sum 📋 Mathlib.Data.Matrix.Basic
{m : Type u_2} {n : Type u_3} {α : Type u_8} [AddCommMonoid α] {ι : Type u_11} (s : Finset ι) (M : ι → Matrix m n α) : (∑ i ∈ s, M i).transpose = ∑ i ∈ s, (M i).transpose - Matrix.transpose_list_sum 📋 Mathlib.Data.Matrix.Basic
{m : Type u_2} {n : Type u_3} {α : Type u_8} [AddMonoid α] (l : List (Matrix m n α)) : l.sum.transpose = (List.map Matrix.transpose l).sum - Matrix.transposeAddEquiv_apply 📋 Mathlib.Data.Matrix.Basic
(m : Type u_2) (n : Type u_3) (α : Type u_8) [Add α] (M : Matrix m n α) : (Matrix.transposeAddEquiv m n α) M = M.transpose - Matrix.transpose_pow 📋 Mathlib.Data.Matrix.Basic
{m : Type u_2} {α : Type u_8} [CommSemiring α] [Fintype m] [DecidableEq m] (M : Matrix m m α) (k : ℕ) : (M ^ k).transpose = M.transpose ^ k - Matrix.transpose_list_prod 📋 Mathlib.Data.Matrix.Basic
{m : Type u_2} {α : Type u_8} [CommSemiring α] [Fintype m] [DecidableEq m] (l : List (Matrix m m α)) : l.prod.transpose = (List.map Matrix.transpose l).reverse.prod - Matrix.transposeAlgEquiv_apply 📋 Mathlib.Data.Matrix.Basic
(m : Type u_2) (R : Type u_4) (α : Type u_8) [CommSemiring R] [CommSemiring α] [Fintype m] [DecidableEq m] [Algebra R α] (a✝ : Matrix m m α) : (Matrix.transposeAlgEquiv m R α) a✝ = MulOpposite.op a✝.transpose - AlgEquiv.mopMatrix_apply 📋 Mathlib.Data.Matrix.Basic
{m : Type u_2} {R : Type u_4} {α : Type u_8} [Fintype m] [DecidableEq m] [CommSemiring R] [Semiring α] [Algebra R α] (M : Matrix m m αᵐᵒᵖ) : AlgEquiv.mopMatrix M = MulOpposite.op (M.transpose.map MulOpposite.unop) - Matrix.transposeRingEquiv_apply 📋 Mathlib.Data.Matrix.Basic
(m : Type u_2) (α : Type u_8) [AddCommMonoid α] [CommMagma α] [Fintype m] (a✝ : Matrix m m α) : (Matrix.transposeRingEquiv m α) a✝ = MulOpposite.op a✝.transpose - RingEquiv.mopMatrix_apply 📋 Mathlib.Data.Matrix.Basic
{m : Type u_2} [Fintype m] {α : Type u_11} [Mul α] [AddCommMonoid α] (M : Matrix m m αᵐᵒᵖ) : RingEquiv.mopMatrix M = MulOpposite.op (M.transpose.map MulOpposite.unop) - Matrix.transposeAlgEquiv_symm_apply 📋 Mathlib.Data.Matrix.Basic
(m : Type u_2) (R : Type u_4) (α : Type u_8) [CommSemiring R] [CommSemiring α] [Fintype m] [DecidableEq m] [Algebra R α] (a✝ : (Matrix m m α)ᵐᵒᵖ) : (Matrix.transposeAlgEquiv m R α).symm a✝ = (MulOpposite.unop a✝).transpose - AlgEquiv.mopMatrix_symm_apply 📋 Mathlib.Data.Matrix.Basic
{m : Type u_2} {R : Type u_4} {α : Type u_8} [Fintype m] [DecidableEq m] [CommSemiring R] [Semiring α] [Algebra R α] (M : (Matrix m m α)ᵐᵒᵖ) : AlgEquiv.mopMatrix.symm M = (MulOpposite.unop M).transpose.map MulOpposite.op - Matrix.transposeRingEquiv_symm_apply 📋 Mathlib.Data.Matrix.Basic
(m : Type u_2) (α : Type u_8) [AddCommMonoid α] [CommMagma α] [Fintype m] (a✝ : (Matrix m m α)ᵐᵒᵖ) : (Matrix.transposeRingEquiv m α).symm a✝ = (MulOpposite.unop a✝).transpose - RingEquiv.mopMatrix_symm_apply 📋 Mathlib.Data.Matrix.Basic
{m : Type u_2} [Fintype m] {α : Type u_11} [Mul α] [AddCommMonoid α] (M : (Matrix m m α)ᵐᵒᵖ) : RingEquiv.mopMatrix.symm M = (MulOpposite.unop M).transpose.map MulOpposite.op - Matrix.transpose_single 📋 Mathlib.Data.Matrix.Basis
{m : Type u_2} {n : Type u_3} {α : Type u_7} [DecidableEq m] [DecidableEq n] [Zero α] (i : m) (j : n) (a : α) : (Matrix.single i j a).transpose = Matrix.single j i a - Matrix.comp_map_transpose 📋 Mathlib.Data.Matrix.Composition
{I : Type u_1} {J : Type u_2} {K : Type u_3} {L : Type u_4} {R : Type u_5} (M : Matrix I J (Matrix K L R)) : (Matrix.comp I J L K R) (M.map fun x => x.transpose) = ((Matrix.comp J I K L R) M.transpose).transpose - Matrix.comp_transpose 📋 Mathlib.Data.Matrix.Composition
{I : Type u_1} {J : Type u_2} {K : Type u_3} {L : Type u_4} {R : Type u_5} (M : Matrix I J (Matrix K L R)) : (Matrix.comp J I K L R) M.transpose = ((Matrix.comp I J L K R) (M.map fun x => x.transpose)).transpose - Matrix.transpose_comp 📋 Mathlib.Data.Matrix.Composition
{I : Type u_1} {J : Type u_2} {K : Type u_3} {L : Type u_4} {R : Type u_5} (M : Matrix I J (Matrix K L R)) : ((Matrix.comp I J K L R) M).transpose = (Matrix.comp J I L K R) (M.transpose.map fun x => x.transpose) - Matrix.comp_symm_transpose 📋 Mathlib.Data.Matrix.Composition
{I : Type u_1} {J : Type u_2} {K : Type u_3} {L : Type u_4} {R : Type u_5} (M : Matrix (I × K) (J × L) R) : (Matrix.comp J I L K R).symm M.transpose = (((Matrix.comp I J K L R).symm M).map fun x => x.transpose).transpose - Matrix.conjTranspose_eq_transpose_of_trivial 📋 Mathlib.LinearAlgebra.Matrix.ConjTranspose
{m : Type u_2} {n : Type u_3} {α : Type v} [Star α] [TrivialStar α] (A : Matrix m n α) : A.conjTranspose = A.transpose - Matrix.conjTranspose_transpose 📋 Mathlib.LinearAlgebra.Matrix.ConjTranspose
{m : Type u_2} {n : Type u_3} {α : Type v} [Star α] (M : Matrix m n α) : M.conjTranspose.transpose = M.map star - Matrix.transpose_conjTranspose 📋 Mathlib.LinearAlgebra.Matrix.ConjTranspose
{m : Type u_2} {n : Type u_3} {α : Type v} [Star α] (M : Matrix m n α) : M.transpose.conjTranspose = M.map star - Matrix.conjTranspose_transpose_eq_transpose_conjTranspose 📋 Mathlib.LinearAlgebra.Matrix.ConjTranspose
{m : Type u_2} {n : Type u_3} {α : Type v} [Star α] (M : Matrix m n α) : M.transpose.conjTranspose = M.conjTranspose.transpose - Matrix.map_vecMulVec_star 📋 Mathlib.LinearAlgebra.Matrix.ConjTranspose
{m : Type u_2} {n : Type u_3} {α : Type v} [Mul α] [StarMul α] (w : m → α) (v : n → α) : (Matrix.vecMulVec w v).map star = (Matrix.vecMulVec (star v) (star w)).transpose - Matrix.blockDiag_transpose 📋 Mathlib.Data.Matrix.Block
{m : Type u_2} {n : Type u_3} {o : Type u_4} {α : Type u_11} (M : Matrix (m × o) (n × o) α) (k : o) : M.transpose.blockDiag k = (M.blockDiag k).transpose - Matrix.blockDiagonal_transpose 📋 Mathlib.Data.Matrix.Block
{m : Type u_2} {n : Type u_3} {o : Type u_4} {α : Type u_11} [DecidableEq o] [Zero α] (M : o → Matrix m n α) : (Matrix.blockDiagonal M).transpose = Matrix.blockDiagonal fun k => (M k).transpose - Matrix.blockDiag'_transpose 📋 Mathlib.Data.Matrix.Block
{o : Type u_4} {m' : o → Type u_7} {n' : o → Type u_8} {α : Type u_11} (M : Matrix ((i : o) × m' i) ((i : o) × n' i) α) (k : o) : M.transpose.blockDiag' k = (M.blockDiag' k).transpose - Matrix.blockDiagonal'_transpose 📋 Mathlib.Data.Matrix.Block
{o : Type u_4} {m' : o → Type u_7} {n' : o → Type u_8} {α : Type u_11} [DecidableEq o] [Zero α] (M : (i : o) → Matrix (m' i) (n' i) α) : (Matrix.blockDiagonal' M).transpose = Matrix.blockDiagonal' fun k => (M k).transpose - Matrix.fromBlocks_transpose 📋 Mathlib.Data.Matrix.Block
{l : Type u_1} {m : Type u_2} {n : Type u_3} {o : Type u_4} {α : Type u_11} (A : Matrix n l α) (B : Matrix n m α) (C : Matrix o l α) (D : Matrix o m α) : (Matrix.fromBlocks A B C D).transpose = Matrix.fromBlocks A.transpose C.transpose B.transpose D.transpose - Matrix.transpose_replicateCol 📋 Mathlib.LinearAlgebra.Matrix.RowCol
{m : Type u_2} {α : Type v} {ι : Type u_6} (v : m → α) : (Matrix.replicateCol ι v).transpose = Matrix.replicateRow ι v - Matrix.transpose_replicateRow 📋 Mathlib.LinearAlgebra.Matrix.RowCol
{m : Type u_2} {α : Type v} {ι : Type u_6} (v : m → α) : (Matrix.replicateRow ι v).transpose = Matrix.replicateCol ι v - Matrix.updateCol_transpose 📋 Mathlib.LinearAlgebra.Matrix.RowCol
{m : Type u_2} {n : Type u_3} {α : Type v} {M : Matrix m n α} {i : m} {b : n → α} [DecidableEq m] : M.transpose.updateCol i b = (M.updateRow i b).transpose - Matrix.updateRow_transpose 📋 Mathlib.LinearAlgebra.Matrix.RowCol
{m : Type u_2} {n : Type u_3} {α : Type v} {M : Matrix m n α} {j : n} {c : m → α} [DecidableEq n] : M.transpose.updateRow j c = (M.updateCol j c).transpose - Matrix.replicateCol_vecMul 📋 Mathlib.LinearAlgebra.Matrix.RowCol
{m : Type u_2} {n : Type u_3} {α : Type v} {ι : Type u_6} [Fintype m] [NonUnitalNonAssocSemiring α] (M : Matrix m n α) (v : m → α) : Matrix.replicateCol ι (Matrix.vecMul v M) = (Matrix.replicateRow ι v * M).transpose - Matrix.replicateRow_mulVec 📋 Mathlib.LinearAlgebra.Matrix.RowCol
{m : Type u_2} {n : Type u_3} {α : Type v} {ι : Type u_6} [Fintype n] [NonUnitalNonAssocSemiring α] (M : Matrix m n α) (v : n → α) : Matrix.replicateRow ι (M.mulVec v) = (M * Matrix.replicateCol ι v).transpose - Matrix.tail_transpose 📋 Mathlib.LinearAlgebra.Matrix.Notation
{α : Type u} {n : ℕ} {m' : Type uₘ} (A : Matrix m' (Fin n.succ) α) : Matrix.vecTail (Matrix.of.symm A.transpose) = Matrix.transpose (Matrix.vecTail ∘ A) - Matrix.transpose_empty_cols 📋 Mathlib.LinearAlgebra.Matrix.Notation
{α : Type u} {m' : Type uₘ} (A : Matrix (Fin 0) m' α) : A.transpose = Matrix.of fun x => ![] - Matrix.transpose_empty_rows 📋 Mathlib.LinearAlgebra.Matrix.Notation
{α : Type u} {m' : Type uₘ} (A : Matrix m' (Fin 0) α) : A.transpose = Matrix.of ![] - Matrix.cons_transpose 📋 Mathlib.LinearAlgebra.Matrix.Notation
{α : Type u} {m : ℕ} {n' : Type uₙ} (v : n' → α) (A : Matrix (Fin m) n' α) : (Matrix.of (Matrix.vecCons v A)).transpose = Matrix.of fun i => Matrix.vecCons (v i) (A.transpose i) - Matrix.head_transpose 📋 Mathlib.LinearAlgebra.Matrix.Notation
{α : Type u} {n : ℕ} {m' : Type uₘ} (A : Matrix m' (Fin n.succ) α) : Matrix.vecHead (Matrix.of.symm A.transpose) = Matrix.vecHead ∘ Matrix.of.symm A - Matrix.mulVecLin_transpose 📋 Mathlib.LinearAlgebra.Matrix.ToLin
{R : Type u_1} [CommSemiring R] {m : Type u_4} {n : Type u_5} [Fintype m] (M : Matrix m n R) : M.transpose.mulVecLin = M.vecMulLinear - Matrix.vecMulLinear_transpose 📋 Mathlib.LinearAlgebra.Matrix.ToLin
{R : Type u_1} [CommSemiring R] {m : Type u_4} {n : Type u_5} [Fintype n] (M : Matrix m n R) : M.transpose.vecMulLinear = M.mulVecLin - LinearMap.toMatrixAlgEquiv_transpose_apply 📋 Mathlib.LinearAlgebra.Matrix.ToLin
{R : Type u_1} [CommSemiring R] {n : Type u_4} [Fintype n] [DecidableEq n] {M₁ : Type u_5} [AddCommMonoid M₁] [Module R M₁] (v₁ : Module.Basis n R M₁) (f : M₁ →ₗ[R] M₁) (j : n) : ((LinearMap.toMatrixAlgEquiv v₁) f).transpose j = ⇑(v₁.repr (f (v₁ j))) - LinearMap.toMatrixAlgEquiv_transpose_apply' 📋 Mathlib.LinearAlgebra.Matrix.ToLin
{R : Type u_1} [CommSemiring R] {n : Type u_4} [Fintype n] [DecidableEq n] {M₁ : Type u_5} [AddCommMonoid M₁] [Module R M₁] (v₁ : Module.Basis n R M₁) (f : M₁ →ₗ[R] M₁) (j : n) : ((LinearMap.toMatrixAlgEquiv v₁) f).transpose j = ⇑(v₁.repr (f (v₁ j))) - LinearMap.toMatrix_transpose_apply 📋 Mathlib.LinearAlgebra.Matrix.ToLin
{R : Type u_1} [CommSemiring R] {m : Type u_3} {n : Type u_4} [Fintype n] [Finite m] [DecidableEq n] {M₁ : Type u_5} {M₂ : Type u_6} [AddCommMonoid M₁] [AddCommMonoid M₂] [Module R M₁] [Module R M₂] (v₁ : Module.Basis n R M₁) (v₂ : Module.Basis m R M₂) (f : M₁ →ₗ[R] M₂) (j : n) : ((LinearMap.toMatrix v₁ v₂) f).transpose j = ⇑(v₂.repr (f (v₁ j))) - LinearMap.toMatrix_transpose_apply' 📋 Mathlib.LinearAlgebra.Matrix.ToLin
{R : Type u_1} [CommSemiring R] {m : Type u_3} {n : Type u_4} [Fintype n] [Finite m] [DecidableEq n] {M₁ : Type u_5} {M₂ : Type u_6} [AddCommMonoid M₁] [AddCommMonoid M₂] [Module R M₁] [Module R M₂] (v₁ : Module.Basis n R M₁) (v₂ : Module.Basis m R M₂) (f : M₁ →ₗ[R] M₂) (j : n) : ((LinearMap.toMatrix v₁ v₂) f).transpose j = ⇑(v₂.repr (f (v₁ j))) - Matrix.Nonsingular.of_transpose 📋 Mathlib.LinearAlgebra.Matrix.SemiringInverse
{n : Type u_1} {R : Type u_3} [Fintype n] [DecidableEq n] [CommSemiring R] {A : Matrix n n R} : A.transpose.Nonsingular → A.Nonsingular - Matrix.Nonsingular.transpose 📋 Mathlib.LinearAlgebra.Matrix.SemiringInverse
{n : Type u_1} {R : Type u_3} [Fintype n] [DecidableEq n] [CommSemiring R] {A : Matrix n n R} : A.Nonsingular → A.transpose.Nonsingular - Matrix.nonsingular_transpose_iff 📋 Mathlib.LinearAlgebra.Matrix.SemiringInverse
{n : Type u_1} {R : Type u_3} [Fintype n] [DecidableEq n] [CommSemiring R] {A : Matrix n n R} : A.transpose.Nonsingular ↔ A.Nonsingular - Matrix.IsDetpBalanced.of_transpose 📋 Mathlib.LinearAlgebra.Matrix.SemiringInverse
{n : Type u_1} {R : Type u_3} [Fintype n] [DecidableEq n] [CommSemiring R] {A : Matrix n n R} {a b : R} : A.transpose.IsDetpBalanced a b → A.IsDetpBalanced a b - Matrix.IsDetpBalanced.transpose 📋 Mathlib.LinearAlgebra.Matrix.SemiringInverse
{n : Type u_1} {R : Type u_3} [Fintype n] [DecidableEq n] [CommSemiring R] {A : Matrix n n R} {a b : R} : A.IsDetpBalanced a b → A.transpose.IsDetpBalanced a b - Matrix.detp_transpose 📋 Mathlib.LinearAlgebra.Matrix.SemiringInverse
{n : Type u_1} {R : Type u_3} [Fintype n] [DecidableEq n] [CommSemiring R] (s : ℤˣ) (A : Matrix n n R) : Matrix.detp s A.transpose = Matrix.detp s A - Matrix.isDetpBalanced_transpose_iff 📋 Mathlib.LinearAlgebra.Matrix.SemiringInverse
{n : Type u_1} {R : Type u_3} [Fintype n] [DecidableEq n] [CommSemiring R] {A : Matrix n n R} {a b : R} : A.transpose.IsDetpBalanced a b ↔ A.IsDetpBalanced a b - Matrix.adjp_transpose 📋 Mathlib.LinearAlgebra.Matrix.SemiringInverse
{n : Type u_1} {R : Type u_3} [Fintype n] [DecidableEq n] [CommSemiring R] (s : ℤˣ) (A : Matrix n n R) : Matrix.adjp s A.transpose = (Matrix.adjp s A).transpose - Matrix.det_transpose 📋 Mathlib.LinearAlgebra.Matrix.Determinant.Basic
{n : Type u_2} [DecidableEq n] [Fintype n] {R : Type v} [CommRing R] (M : Matrix n n R) : M.transpose.det = M.det - Matrix.det_eq_zero_of_not_linearIndependent_cols 📋 Mathlib.LinearAlgebra.Matrix.Determinant.Basic
{m : Type u_1} [DecidableEq m] [Fintype m] {R : Type v} [CommRing R] [IsDomain R] {A : Matrix m m R} (hA : ¬LinearIndependent R fun i => A.transpose i) : A.det = 0 - Matrix.IsSymm.transpose 📋 Mathlib.LinearAlgebra.Matrix.Symmetric
{α : Type u_1} {n : Type u_3} {A : Matrix n n α} (h : A.IsSymm) : A.transpose.IsSymm - Matrix.isSymm_transpose_iff 📋 Mathlib.LinearAlgebra.Matrix.Symmetric
{α : Type u_1} {n : Type u_3} {A : Matrix n n α} : A.transpose.IsSymm ↔ A.IsSymm - Matrix.IsSymm.eq 📋 Mathlib.LinearAlgebra.Matrix.Symmetric
{α : Type u_1} {n : Type u_3} {A : Matrix n n α} (h : A.IsSymm) : A.transpose = A - Matrix.instDecidableIsSymmOfEqTranspose 📋 Mathlib.LinearAlgebra.Matrix.Symmetric
{α : Type u_1} {n : Type u_3} (A : Matrix n n α) [Decidable (A.transpose = A)] : Decidable A.IsSymm - Matrix.isSymm_add_transpose_self 📋 Mathlib.LinearAlgebra.Matrix.Symmetric
{α : Type u_1} {n : Type u_3} [AddCommSemigroup α] (A : Matrix n n α) : (A + A.transpose).IsSymm - Matrix.isSymm_transpose_add_self 📋 Mathlib.LinearAlgebra.Matrix.Symmetric
{α : Type u_1} {n : Type u_3} [AddCommSemigroup α] (A : Matrix n n α) : (A.transpose + A).IsSymm - Matrix.IsSymm.fromBlocks 📋 Mathlib.LinearAlgebra.Matrix.Symmetric
{α : Type u_1} {n : Type u_3} {m : Type u_4} {A : Matrix m m α} {B : Matrix m n α} {C : Matrix n m α} {D : Matrix n n α} (hA : A.IsSymm) (hBC : B.transpose = C) (hD : D.IsSymm) : (Matrix.fromBlocks A B C D).IsSymm - Matrix.isSymm_mul_transpose_self 📋 Mathlib.LinearAlgebra.Matrix.Symmetric
{α : Type u_1} {n : Type u_3} [Fintype n] [NonUnitalCommSemiring α] (A : Matrix n n α) : (A * A.transpose).IsSymm - Matrix.isSymm_transpose_mul_self 📋 Mathlib.LinearAlgebra.Matrix.Symmetric
{α : Type u_1} {n : Type u_3} [Fintype n] [NonUnitalCommSemiring α] (A : Matrix n n α) : (A.transpose * A).IsSymm - Matrix.isSymm_fromBlocks_iff 📋 Mathlib.LinearAlgebra.Matrix.Symmetric
{α : Type u_1} {n : Type u_3} {m : Type u_4} {A : Matrix m m α} {B : Matrix m n α} {C : Matrix n m α} {D : Matrix n n α} : (Matrix.fromBlocks A B C D).IsSymm ↔ A.IsSymm ∧ B.transpose = C ∧ C.transpose = B ∧ D.IsSymm - Matrix.isSymm_comp_iff 📋 Mathlib.LinearAlgebra.Matrix.Symmetric
{α : Type u_1} {n : Type u_3} {m : Type u_4} {A : Matrix m m (Matrix n n α)} : ((Matrix.comp m m n n α) A).IsSymm ↔ A.transpose = A.map fun x => x.transpose - Matrix.adjugate_transpose 📋 Mathlib.LinearAlgebra.Matrix.Adjugate
{n : Type v} {α : Type w} [DecidableEq n] [Fintype n] [CommRing α] (A : Matrix n n α) : A.adjugate.transpose = A.transpose.adjugate - Matrix.cramer_transpose_apply 📋 Mathlib.LinearAlgebra.Matrix.Adjugate
{n : Type v} {α : Type w} [DecidableEq n] [Fintype n] [CommRing α] (A : Matrix n n α) (b : n → α) (i : n) : A.transpose.cramer b i = (A.updateRow i b).det - Matrix.cramer_transpose_row_self 📋 Mathlib.LinearAlgebra.Matrix.Adjugate
{n : Type v} {α : Type w} [DecidableEq n] [Fintype n] [CommRing α] (A : Matrix n n α) (i : n) : A.transpose.cramer (A i) = Pi.single i A.det - Matrix.mul_adjugate_apply 📋 Mathlib.LinearAlgebra.Matrix.Adjugate
{n : Type v} {α : Type w} [DecidableEq n] [Fintype n] [CommRing α] (A : Matrix n n α) (i j k : n) : A i k * A.adjugate k j = A.transpose.cramer (Pi.single k (A i k)) j - Matrix.adjugate_def 📋 Mathlib.LinearAlgebra.Matrix.Adjugate
{n : Type v} {α : Type w} [DecidableEq n] [Fintype n] [CommRing α] (A : Matrix n n α) : A.adjugate = Matrix.of fun i => A.transpose.cramer (Pi.single i 1) - Matrix.isUnit_transpose 📋 Mathlib.LinearAlgebra.Matrix.Invertible
{n : Type u_2} {α : Type u_3} [Fintype n] [DecidableEq n] [CommSemiring α] (A : Matrix n n α) : IsUnit A.transpose ↔ IsUnit A - Matrix.invertibleOfInvertibleTranspose 📋 Mathlib.LinearAlgebra.Matrix.Invertible
{n : Type u_2} {α : Type u_3} [Fintype n] [DecidableEq n] [CommSemiring α] (A : Matrix n n α) [Invertible A.transpose] : Invertible A - Matrix.invertibleTranspose 📋 Mathlib.LinearAlgebra.Matrix.Invertible
{n : Type u_2} {α : Type u_3} [Fintype n] [DecidableEq n] [CommSemiring α] (A : Matrix n n α) [Invertible A] : Invertible A.transpose - Matrix.transposeInvertibleEquivInvertible 📋 Mathlib.LinearAlgebra.Matrix.Invertible
{n : Type u_2} {α : Type u_3} [Fintype n] [DecidableEq n] [CommSemiring α] (A : Matrix n n α) : Invertible A.transpose ≃ Invertible A - Matrix.transpose_invOf 📋 Mathlib.LinearAlgebra.Matrix.Invertible
{n : Type u_2} {α : Type u_3} [Fintype n] [DecidableEq n] [CommSemiring α] (A : Matrix n n α) [Invertible A] [Invertible A.transpose] : (⅟A).transpose = ⅟A.transpose - Matrix.transposeInvertibleEquivInvertible_apply 📋 Mathlib.LinearAlgebra.Matrix.Invertible
{n : Type u_2} {α : Type u_3} [Fintype n] [DecidableEq n] [CommSemiring α] (A : Matrix n n α) [Invertible A.transpose] : A.transposeInvertibleEquivInvertible inst✝ = A.invertibleOfInvertibleTranspose - Matrix.transposeInvertibleEquivInvertible_symm_apply 📋 Mathlib.LinearAlgebra.Matrix.Invertible
{n : Type u_2} {α : Type u_3} [Fintype n] [DecidableEq n] [CommSemiring α] (A : Matrix n n α) [Invertible A] : A.transposeInvertibleEquivInvertible.symm inst✝ = A.invertibleTranspose - Matrix.trace_transpose 📋 Mathlib.LinearAlgebra.Matrix.Trace
{n : Type u_3} {R : Type u_6} [Fintype n] [AddCommMonoid R] (A : Matrix n n R) : A.transpose.trace = A.trace - Matrix.trace_transpose_mul 📋 Mathlib.LinearAlgebra.Matrix.Trace
{m : Type u_2} {n : Type u_3} {R : Type u_6} [Fintype m] [Fintype n] [AddCommMonoid R] [Mul R] (A : Matrix m n R) (B : Matrix n m R) : (A.transpose * B.transpose).trace = (A * B).trace - Matrix.kroneckerMap_transpose 📋 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} (f : α → β → γ) (A : Matrix l m α) (B : Matrix n p β) : Matrix.kroneckerMap f A.transpose B.transpose = (Matrix.kroneckerMap f A B).transpose - Matrix.isUnit_det_transpose 📋 Mathlib.LinearAlgebra.Matrix.NonsingularInverse
{n : Type u'} {α : Type v} [Fintype n] [DecidableEq n] [CommRing α] (A : Matrix n n α) (h : IsUnit A.det) : IsUnit A.transpose.det - Matrix.transpose_nonsing_inv 📋 Mathlib.LinearAlgebra.Matrix.NonsingularInverse
{n : Type u'} {α : Type v} [Fintype n] [DecidableEq n] [CommRing α] (A : Matrix n n α) : A⁻¹.transpose = A.transpose⁻¹ - Matrix.det_smul_inv_vecMul_eq_cramer_transpose 📋 Mathlib.LinearAlgebra.Matrix.NonsingularInverse
{n : Type u'} {α : Type v} [Fintype n] [DecidableEq n] [CommRing α] (A : Matrix n n α) (b : n → α) (h : IsUnit A.det) : A.det • Matrix.vecMul b A⁻¹ = A.transpose.cramer b - Matrix.BlockTriangular.transpose 📋 Mathlib.LinearAlgebra.Matrix.Block
{α : Type u_1} {m : Type u_2} {R : Type v} {M : Matrix m m R} {b : m → α} [LT α] [Zero R] : M.BlockTriangular b → M.transpose.BlockTriangular (⇑OrderDual.toDual ∘ b) - Matrix.blockTriangular_transpose_iff 📋 Mathlib.LinearAlgebra.Matrix.Block
{α : Type u_1} {m : Type u_2} {R : Type v} {M : Matrix m m R} [LT α] [Zero R] {b : m → αᵒᵈ} : M.transpose.BlockTriangular b ↔ M.BlockTriangular (⇑OrderDual.ofDual ∘ b) - Matrix.charpoly_transpose 📋 Mathlib.LinearAlgebra.Matrix.Charpoly.Basic
{R : Type u_1} [CommRing R] {n : Type u_4} [DecidableEq n] [Fintype n] (M : Matrix n n R) : M.transpose.charpoly = M.charpoly - Matrix.charmatrix_transpose 📋 Mathlib.LinearAlgebra.Matrix.Charpoly.Basic
{R : Type u_1} [CommRing R] {n : Type u_4} [DecidableEq n] [Fintype n] (M : Matrix n n R) : M.transpose.charmatrix = M.charmatrix.transpose - Module.Basis.coePiBasisFun.toMatrix_eq_transpose 📋 Mathlib.LinearAlgebra.Matrix.Basis
{ι : Type u_1} {R : Type u_5} [CommSemiring R] [Finite ι] : (Pi.basisFun R ι).toMatrix = Matrix.transpose - Module.Basis.toMatrix_transpose_apply 📋 Mathlib.LinearAlgebra.Matrix.Basis
{ι : Type u_1} {ι' : Type u_2} {R : Type u_5} {M : Type u_6} [CommSemiring R] [AddCommMonoid M] [Module R M] (e : Module.Basis ι R M) (v : ι' → M) (j : ι') : (e.toMatrix v).transpose j = ⇑(e.repr (v j)) - Matrix.Nondegenerate.transpose 📋 Mathlib.LinearAlgebra.Matrix.Nondegenerate
{m : Type u_1} {n : Type u_2} {R : Type u_3} [CommSemiring R] {M : Matrix m n R} [Finite m] [Finite n] : M.Nondegenerate → M.transpose.Nondegenerate - Matrix.SeparatingLeft.separatingRight_transpose 📋 Mathlib.LinearAlgebra.Matrix.Nondegenerate
{m : Type u_1} {n : Type u_2} {R : Type u_3} [CommSemiring R] {M : Matrix m n R} [Finite m] [Finite n] : M.SeparatingLeft → M.transpose.SeparatingRight - Matrix.SeparatingRight.separatingLeft_transpose 📋 Mathlib.LinearAlgebra.Matrix.Nondegenerate
{m : Type u_1} {n : Type u_2} {R : Type u_3} [CommSemiring R] {M : Matrix m n R} [Finite m] [Finite n] : M.SeparatingRight → M.transpose.SeparatingLeft - Matrix.nondegenerate_transpose_iff 📋 Mathlib.LinearAlgebra.Matrix.Nondegenerate
{m : Type u_1} {n : Type u_2} {R : Type u_3} [CommSemiring R] {M : Matrix m n R} [Finite m] [Finite n] : M.transpose.Nondegenerate ↔ M.Nondegenerate - Matrix.separatingLeft_transpose_iff 📋 Mathlib.LinearAlgebra.Matrix.Nondegenerate
{m : Type u_1} {n : Type u_2} {R : Type u_3} [CommSemiring R] {M : Matrix m n R} [Finite m] [Finite n] : M.transpose.SeparatingLeft ↔ M.SeparatingRight - Matrix.separatingRight_transpose_iff 📋 Mathlib.LinearAlgebra.Matrix.Nondegenerate
{m : Type u_1} {n : Type u_2} {R : Type u_3} [CommSemiring R] {M : Matrix m n R} [Finite m] [Finite n] : M.transpose.SeparatingRight ↔ M.SeparatingLeft - Matrix.SpecialLinearGroup.coe_transpose 📋 Mathlib.LinearAlgebra.Matrix.SpecialLinearGroup
{n : Type u} [DecidableEq n] [Fintype n] {R : Type v} [CommRing R] (A : Matrix.SpecialLinearGroup n R) : ↑A.transpose = (↑A).transpose - Matrix.isAdjointPair_equiv 📋 Mathlib.LinearAlgebra.Matrix.SesquilinearForm
{R : Type u_1} {n : Type u_11} [CommRing R] [Fintype n] (J A₁ A₂ : Matrix n n R) [DecidableEq n] (P : Matrix n n R) (h : IsUnit P) : (P.transpose * J * P).IsAdjointPair (P.transpose * J * P) A₁ A₂ ↔ J.IsAdjointPair J (P * A₁ * P⁻¹) (P * A₂ * P⁻¹) - LinearMap.toMatrix₂_mul_basis_toMatrix 📋 Mathlib.LinearAlgebra.Matrix.SesquilinearForm
{R : Type u_1} {M₁ : Type u_6} {M₂ : Type u_7} {n : Type u_11} {m : Type u_12} {n' : Type u_13} {m' : Type u_14} [CommSemiring R] [AddCommMonoid M₁] [Module R M₁] [AddCommMonoid M₂] [Module R M₂] [Fintype n] [Fintype m] [DecidableEq m] [DecidableEq n] (b₁ : Module.Basis n R M₁) (b₂ : Module.Basis m R M₂) [Fintype n'] [Fintype m'] [DecidableEq n'] [DecidableEq m'] (c₁ : Module.Basis n' R M₁) (c₂ : Module.Basis m' R M₂) (B : M₁ →ₗ[R] M₂ →ₗ[R] R) : (b₁.toMatrix ⇑c₁).transpose * (LinearMap.toMatrix₂ b₁ b₂) B * b₂.toMatrix ⇑c₂ = (LinearMap.toMatrix₂ c₁ c₂) B - LinearMap.mul_toMatrix₂ 📋 Mathlib.LinearAlgebra.Matrix.SesquilinearForm
{R : Type u_1} {M₁ : Type u_6} {M₂ : Type u_7} {M₁' : Type u_8} {n : Type u_11} {m : Type u_12} {n' : Type u_13} [CommSemiring R] [AddCommMonoid M₁] [Module R M₁] [AddCommMonoid M₂] [Module R M₂] [Fintype n] [Fintype m] [DecidableEq m] [DecidableEq n] (b₁ : Module.Basis n R M₁) (b₂ : Module.Basis m R M₂) [AddCommMonoid M₁'] [Module R M₁'] (b₁' : Module.Basis n' R M₁') [Fintype n'] [DecidableEq n'] (B : M₁ →ₗ[R] M₂ →ₗ[R] R) (M : Matrix n' n R) : M * (LinearMap.toMatrix₂ b₁ b₂) B = (LinearMap.toMatrix₂ b₁' b₂) (B ∘ₗ (Matrix.toLin b₁' b₁) M.transpose) - LinearMap.toMatrix₂_comp 📋 Mathlib.LinearAlgebra.Matrix.SesquilinearForm
{R : Type u_1} {M₁ : Type u_6} {M₂ : Type u_7} {M₁' : Type u_8} {n : Type u_11} {m : Type u_12} {n' : Type u_13} [CommSemiring R] [AddCommMonoid M₁] [Module R M₁] [AddCommMonoid M₂] [Module R M₂] [Fintype n] [Fintype m] [DecidableEq m] [DecidableEq n] (b₁ : Module.Basis n R M₁) (b₂ : Module.Basis m R M₂) [AddCommMonoid M₁'] [Module R M₁'] (b₁' : Module.Basis n' R M₁') [Fintype n'] [DecidableEq n'] (B : M₁ →ₗ[R] M₂ →ₗ[R] R) (f : M₁' →ₗ[R] M₁) : (LinearMap.toMatrix₂ b₁' b₂) (B ∘ₗ f) = ((LinearMap.toMatrix b₁' b₁) f).transpose * (LinearMap.toMatrix₂ b₁ b₂) B - Matrix.toLinearMap₂_compl₁₂ 📋 Mathlib.LinearAlgebra.Matrix.SesquilinearForm
{R : Type u_1} {M₁ : Type u_6} {M₂ : Type u_7} {M₁' : Type u_8} {M₂' : Type u_9} {n : Type u_11} {m : Type u_12} {n' : Type u_13} {m' : Type u_14} [CommSemiring R] [AddCommMonoid M₁] [Module R M₁] [AddCommMonoid M₂] [Module R M₂] [Fintype n] [Fintype m] [DecidableEq m] [DecidableEq n] (b₁ : Module.Basis n R M₁) (b₂ : Module.Basis m R M₂) [AddCommMonoid M₁'] [Module R M₁'] [AddCommMonoid M₂'] [Module R M₂'] (b₁' : Module.Basis n' R M₁') (b₂' : Module.Basis m' R M₂') [Fintype n'] [Fintype m'] [DecidableEq n'] [DecidableEq m'] (M : Matrix n m R) (P : Matrix n n' R) (Q : Matrix m m' R) : ((Matrix.toLinearMap₂ b₁ b₂) M).compl₁₂ ((Matrix.toLin b₁' b₁) P) ((Matrix.toLin b₂' b₂) Q) = (Matrix.toLinearMap₂ b₁' b₂') (P.transpose * M * Q) - LinearMap.mul_toMatrix₂_mul 📋 Mathlib.LinearAlgebra.Matrix.SesquilinearForm
{R : Type u_1} {M₁ : Type u_6} {M₂ : Type u_7} {M₁' : Type u_8} {M₂' : Type u_9} {n : Type u_11} {m : Type u_12} {n' : Type u_13} {m' : Type u_14} [CommSemiring R] [AddCommMonoid M₁] [Module R M₁] [AddCommMonoid M₂] [Module R M₂] [Fintype n] [Fintype m] [DecidableEq m] [DecidableEq n] (b₁ : Module.Basis n R M₁) (b₂ : Module.Basis m R M₂) [AddCommMonoid M₁'] [Module R M₁'] [AddCommMonoid M₂'] [Module R M₂'] (b₁' : Module.Basis n' R M₁') (b₂' : Module.Basis m' R M₂') [Fintype n'] [Fintype m'] [DecidableEq n'] [DecidableEq m'] (B : M₁ →ₗ[R] M₂ →ₗ[R] R) (M : Matrix n' n R) (N : Matrix m m' R) : M * (LinearMap.toMatrix₂ b₁ b₂) B * N = (LinearMap.toMatrix₂ b₁' b₂') (B.compl₁₂ ((Matrix.toLin b₁' b₁) M.transpose) ((Matrix.toLin b₂' b₂) N)) - LinearMap.toMatrix₂_compl₁₂ 📋 Mathlib.LinearAlgebra.Matrix.SesquilinearForm
{R : Type u_1} {M₁ : Type u_6} {M₂ : Type u_7} {M₁' : Type u_8} {M₂' : Type u_9} {n : Type u_11} {m : Type u_12} {n' : Type u_13} {m' : Type u_14} [CommSemiring R] [AddCommMonoid M₁] [Module R M₁] [AddCommMonoid M₂] [Module R M₂] [Fintype n] [Fintype m] [DecidableEq m] [DecidableEq n] (b₁ : Module.Basis n R M₁) (b₂ : Module.Basis m R M₂) [AddCommMonoid M₁'] [Module R M₁'] [AddCommMonoid M₂'] [Module R M₂'] (b₁' : Module.Basis n' R M₁') (b₂' : Module.Basis m' R M₂') [Fintype n'] [Fintype m'] [DecidableEq n'] [DecidableEq m'] (B : M₁ →ₗ[R] M₂ →ₗ[R] R) (l : M₁' →ₗ[R] M₁) (r : M₂' →ₗ[R] M₂) : (LinearMap.toMatrix₂ b₁' b₂') (B.compl₁₂ l r) = ((LinearMap.toMatrix b₁' b₁) l).transpose * (LinearMap.toMatrix₂ b₁ b₂) B * (LinearMap.toMatrix b₂' b₂) r - LinearMap.mul_toMatrix' 📋 Mathlib.LinearAlgebra.Matrix.SesquilinearForm
{n : Type u_11} {m : Type u_12} {n' : Type u_13} {R : Type u_16} [CommSemiring R] [Fintype n] [Fintype m] [DecidableEq n] [DecidableEq m] [Fintype n'] [DecidableEq n'] (B : (n → R) →ₗ[R] (m → R) →ₗ[R] R) (M : Matrix n' n R) : M * (LinearMap.toMatrix₂' R) B = (LinearMap.toMatrix₂' R) (B ∘ₗ Matrix.toLin' M.transpose) - LinearMap.toMatrix₂'_comp 📋 Mathlib.LinearAlgebra.Matrix.SesquilinearForm
{n : Type u_11} {m : Type u_12} {n' : Type u_13} {R : Type u_16} [CommSemiring R] [Fintype n] [Fintype m] [DecidableEq n] [DecidableEq m] [Fintype n'] [DecidableEq n'] (B : (n → R) →ₗ[R] (m → R) →ₗ[R] R) (f : (n' → R) →ₗ[R] n → R) : (LinearMap.toMatrix₂' R) (B ∘ₗ f) = (LinearMap.toMatrix' f).transpose * (LinearMap.toMatrix₂' R) B - Matrix.toLinearMap₂'_comp 📋 Mathlib.LinearAlgebra.Matrix.SesquilinearForm
{n : Type u_11} {m : Type u_12} {n' : Type u_13} {m' : Type u_14} {R : Type u_16} [CommSemiring R] [Fintype n] [Fintype m] [DecidableEq n] [DecidableEq m] [Fintype n'] [Fintype m'] [DecidableEq n'] [DecidableEq m'] (M : Matrix n m R) (P : Matrix n n' R) (Q : Matrix m m' R) : ((Matrix.toLinearMap₂' R) M).compl₁₂ (Matrix.toLin' P) (Matrix.toLin' Q) = (Matrix.toLinearMap₂' R) (P.transpose * M * Q) - LinearMap.mul_toMatrix₂'_mul 📋 Mathlib.LinearAlgebra.Matrix.SesquilinearForm
{n : Type u_11} {m : Type u_12} {n' : Type u_13} {m' : Type u_14} {R : Type u_16} [CommSemiring R] [Fintype n] [Fintype m] [DecidableEq n] [DecidableEq m] [Fintype n'] [Fintype m'] [DecidableEq n'] [DecidableEq m'] (B : (n → R) →ₗ[R] (m → R) →ₗ[R] R) (M : Matrix n' n R) (N : Matrix m m' R) : M * (LinearMap.toMatrix₂' R) B * N = (LinearMap.toMatrix₂' R) (B.compl₁₂ (Matrix.toLin' M.transpose) (Matrix.toLin' N)) - LinearMap.toMatrix₂'_compl₁₂ 📋 Mathlib.LinearAlgebra.Matrix.SesquilinearForm
{n : Type u_11} {m : Type u_12} {n' : Type u_13} {m' : Type u_14} {R : Type u_16} [CommSemiring R] [Fintype n] [Fintype m] [DecidableEq n] [DecidableEq m] [Fintype n'] [Fintype m'] [DecidableEq n'] [DecidableEq m'] (B : (n → R) →ₗ[R] (m → R) →ₗ[R] R) (l : (n' → R) →ₗ[R] n → R) (r : (m' → R) →ₗ[R] m → R) : (LinearMap.toMatrix₂' R) (B.compl₁₂ l r) = (LinearMap.toMatrix' l).transpose * (LinearMap.toMatrix₂' R) B * LinearMap.toMatrix' r - QuadraticForm.toMatrix_comp 📋 Mathlib.LinearAlgebra.QuadraticForm.Basic
{R : Type u_3} {N : Type u_5} {P : Type u_6} {n : Type w} [Fintype n] [DecidableEq n] [CommRing R] [Invertible 2] [AddCommGroup N] [Module R N] (b : Module.Basis n R N) {m : Type w} [DecidableEq m] [Fintype m] [AddCommGroup P] [Module R P] (b' : Module.Basis m R P) (Q : QuadraticForm R P) (f : N →ₗ[R] P) : QuadraticForm.toMatrix b (QuadraticMap.comp Q f) = ((LinearMap.toMatrix b b') f).transpose * QuadraticForm.toMatrix b' Q * (LinearMap.toMatrix b b') f - QuadraticForm.toMatrix'_comp 📋 Mathlib.LinearAlgebra.QuadraticForm.Basic
{R : Type u_3} {n : Type w} [Fintype n] [DecidableEq n] [CommRing R] [Invertible 2] {m : Type w} [DecidableEq m] [Fintype m] (Q : QuadraticForm R (m → R)) (f : (n → R) →ₗ[R] m → R) : QuadraticForm.toMatrix' (QuadraticMap.comp Q f) = (LinearMap.toMatrix' f).transpose * Q.toMatrix' * LinearMap.toMatrix' f - QuadraticForm.QuadraticMap.toMatrix'_comp 📋 Mathlib.LinearAlgebra.QuadraticForm.Basic
{R : Type u_3} {n : Type w} [Fintype n] [DecidableEq n] [CommRing R] [Invertible 2] {m : Type w} [DecidableEq m] [Fintype m] (Q : QuadraticForm R (m → R)) (f : (n → R) →ₗ[R] m → R) : QuadraticForm.toMatrix' (QuadraticMap.comp Q f) = (LinearMap.toMatrix' f).transpose * Q.toMatrix' * LinearMap.toMatrix' f - Matrix.toLin_transpose 📋 Mathlib.LinearAlgebra.Matrix.Dual
{K : Type u_1} {V₁ : Type u_2} {V₂ : Type u_3} {ι₁ : Type u_4} {ι₂ : Type u_5} [CommSemiring K] [AddCommGroup V₁] [Module K V₁] [AddCommGroup V₂] [Module K V₂] [Fintype ι₁] [Fintype ι₂] [DecidableEq ι₁] [DecidableEq ι₂] {B₁ : Module.Basis ι₁ K V₁} {B₂ : Module.Basis ι₂ K V₂} (M : Matrix ι₁ ι₂ K) : (Matrix.toLin B₁.dualBasis B₂.dualBasis) M.transpose = Module.Dual.transpose ((Matrix.toLin B₂ B₁) M) - LinearMap.toMatrix_transpose 📋 Mathlib.LinearAlgebra.Matrix.Dual
{K : Type u_1} {V₁ : Type u_2} {V₂ : Type u_3} {ι₁ : Type u_4} {ι₂ : Type u_5} [CommSemiring K] [AddCommGroup V₁] [Module K V₁] [AddCommGroup V₂] [Module K V₂] [Fintype ι₁] [Fintype ι₂] [DecidableEq ι₁] [DecidableEq ι₂] {B₁ : Module.Basis ι₁ K V₁} {B₂ : Module.Basis ι₂ K V₂} (u : V₁ →ₗ[K] V₂) : (LinearMap.toMatrix B₂.dualBasis B₁.dualBasis) (Module.Dual.transpose u) = ((LinearMap.toMatrix B₁ B₂) u).transpose - Matrix.vandermonde_transpose_mul_vandermonde 📋 Mathlib.LinearAlgebra.Vandermonde
{R : Type u_1} [CommRing R] {n : ℕ} (v : Fin n → R) (i j : Fin n) : ((Matrix.vandermonde v).transpose * Matrix.vandermonde v) i j = ∑ k, v k ^ (↑i + ↑j) - Matrix.vandermonde_mul_vandermonde_transpose 📋 Mathlib.LinearAlgebra.Vandermonde
{R : Type u_1} [CommRing R] {n : ℕ} (v w : Fin n → R) (i j : Fin n) : (Matrix.vandermonde v * (Matrix.vandermonde w).transpose) i j = ∑ k, (v i * w j) ^ ↑k - Matrix.isNilpotent_transpose_iff 📋 Mathlib.RingTheory.Finiteness.Nilpotent
{R : Type u_1} [CommSemiring R] {ι : Type u_3} [DecidableEq ι] [Fintype ι] {A : Matrix ι ι R} : IsNilpotent A.transpose ↔ IsNilpotent A - Matrix.isAdjointPair_equiv' 📋 Mathlib.LinearAlgebra.Matrix.BilinearForm
{R₂ : Type u_3} [CommRing R₂] {n : Type u_5} [Fintype n] (J A A' : Matrix n n R₂) [DecidableEq n] (P : Matrix n n R₂) (h : IsUnit P) : (P.transpose * J * P).IsAdjointPair (P.transpose * J * P) A A' ↔ J.IsAdjointPair J (P * A * P⁻¹) (P * A' * P⁻¹) - LinearMap.BilinForm.toMatrix_mul_basis_toMatrix 📋 Mathlib.LinearAlgebra.Matrix.BilinearForm
{R₁ : Type u_1} {M₁ : Type u_2} [CommSemiring R₁] [AddCommMonoid M₁] [Module R₁ M₁] {n : Type u_5} {o : Type u_6} [Fintype n] [Fintype o] [DecidableEq n] (b : Module.Basis n R₁ M₁) [DecidableEq o] (c : Module.Basis o R₁ M₁) (B : LinearMap.BilinForm R₁ M₁) : (b.toMatrix ⇑c).transpose * (LinearMap.BilinForm.toMatrix b) B * b.toMatrix ⇑c = (LinearMap.BilinForm.toMatrix c) B - LinearMap.BilinForm.mul_toMatrix 📋 Mathlib.LinearAlgebra.Matrix.BilinearForm
{R₁ : Type u_1} {M₁ : Type u_2} [CommSemiring R₁] [AddCommMonoid M₁] [Module R₁ M₁] {n : Type u_5} [Fintype n] [DecidableEq n] (b : Module.Basis n R₁ M₁) (B : LinearMap.BilinForm R₁ M₁) (M : Matrix n n R₁) : M * (LinearMap.BilinForm.toMatrix b) B = (LinearMap.BilinForm.toMatrix b) (B.compLeft ((Matrix.toLin b b) M.transpose)) - LinearMap.BilinForm.toMatrix_compLeft 📋 Mathlib.LinearAlgebra.Matrix.BilinearForm
{R₁ : Type u_1} {M₁ : Type u_2} [CommSemiring R₁] [AddCommMonoid M₁] [Module R₁ M₁] {n : Type u_5} [Fintype n] [DecidableEq n] (b : Module.Basis n R₁ M₁) (B : LinearMap.BilinForm R₁ M₁) (f : M₁ →ₗ[R₁] M₁) : (LinearMap.BilinForm.toMatrix b) (B.compLeft f) = ((LinearMap.toMatrix b b) f).transpose * (LinearMap.BilinForm.toMatrix b) B - Matrix.toBilin_comp 📋 Mathlib.LinearAlgebra.Matrix.BilinearForm
{R₁ : Type u_1} {M₁ : Type u_2} [CommSemiring R₁] [AddCommMonoid M₁] [Module R₁ M₁] {n : Type u_5} {o : Type u_6} [Fintype n] [Fintype o] [DecidableEq n] (b : Module.Basis n R₁ M₁) {M₂' : Type u_7} [AddCommMonoid M₂'] [Module R₁ M₂'] (c : Module.Basis o R₁ M₂') [DecidableEq o] (M : Matrix n n R₁) (P Q : Matrix n o R₁) : ((Matrix.toBilin b) M).comp ((Matrix.toLin c b) P) ((Matrix.toLin c b) Q) = (Matrix.toBilin c) (P.transpose * M * Q) - LinearMap.BilinForm.mul_toMatrix_mul 📋 Mathlib.LinearAlgebra.Matrix.BilinearForm
{R₁ : Type u_1} {M₁ : Type u_2} [CommSemiring R₁] [AddCommMonoid M₁] [Module R₁ M₁] {n : Type u_5} {o : Type u_6} [Fintype n] [Fintype o] [DecidableEq n] (b : Module.Basis n R₁ M₁) {M₂' : Type u_7} [AddCommMonoid M₂'] [Module R₁ M₂'] (c : Module.Basis o R₁ M₂') [DecidableEq o] (B : LinearMap.BilinForm R₁ M₁) (M : Matrix o n R₁) (N : Matrix n o R₁) : M * (LinearMap.BilinForm.toMatrix b) B * N = (LinearMap.BilinForm.toMatrix c) (B.comp ((Matrix.toLin c b) M.transpose) ((Matrix.toLin c b) N)) - LinearMap.BilinForm.toMatrix_comp 📋 Mathlib.LinearAlgebra.Matrix.BilinearForm
{R₁ : Type u_1} {M₁ : Type u_2} [CommSemiring R₁] [AddCommMonoid M₁] [Module R₁ M₁] {n : Type u_5} {o : Type u_6} [Fintype n] [Fintype o] [DecidableEq n] (b : Module.Basis n R₁ M₁) {M₂' : Type u_7} [AddCommMonoid M₂'] [Module R₁ M₂'] (c : Module.Basis o R₁ M₂') [DecidableEq o] (B : LinearMap.BilinForm R₁ M₁) (l r : M₂' →ₗ[R₁] M₁) : (LinearMap.BilinForm.toMatrix c) (B.comp l r) = ((LinearMap.toMatrix c b) l).transpose * (LinearMap.BilinForm.toMatrix b) B * (LinearMap.toMatrix c b) r - LinearMap.BilinForm.mul_toMatrix' 📋 Mathlib.LinearAlgebra.Matrix.BilinearForm
{R₁ : Type u_1} [CommSemiring R₁] {n : Type u_5} [Fintype n] [DecidableEq n] (B : LinearMap.BilinForm R₁ (n → R₁)) (M : Matrix n n R₁) : M * LinearMap.BilinForm.toMatrix' B = LinearMap.BilinForm.toMatrix' (B.compLeft (Matrix.toLin' M.transpose)) - LinearMap.BilinForm.toMatrix'_compLeft 📋 Mathlib.LinearAlgebra.Matrix.BilinearForm
{R₁ : Type u_1} [CommSemiring R₁] {n : Type u_5} [Fintype n] [DecidableEq n] (B : LinearMap.BilinForm R₁ (n → R₁)) (f : (n → R₁) →ₗ[R₁] n → R₁) : LinearMap.BilinForm.toMatrix' (B.compLeft f) = (LinearMap.toMatrix' f).transpose * LinearMap.BilinForm.toMatrix' B - Matrix.toBilin'_comp 📋 Mathlib.LinearAlgebra.Matrix.BilinearForm
{R₁ : Type u_1} [CommSemiring R₁] {n : Type u_5} {o : Type u_6} [Fintype n] [Fintype o] [DecidableEq n] [DecidableEq o] (M : Matrix n n R₁) (P Q : Matrix n o R₁) : (Matrix.toBilin' M).comp (Matrix.toLin' P) (Matrix.toLin' Q) = Matrix.toBilin' (P.transpose * M * Q) - LinearMap.BilinForm.mul_toMatrix'_mul 📋 Mathlib.LinearAlgebra.Matrix.BilinearForm
{R₁ : Type u_1} [CommSemiring R₁] {n : Type u_5} {o : Type u_6} [Fintype n] [Fintype o] [DecidableEq n] [DecidableEq o] (B : LinearMap.BilinForm R₁ (n → R₁)) (M : Matrix o n R₁) (N : Matrix n o R₁) : M * LinearMap.BilinForm.toMatrix' B * N = LinearMap.BilinForm.toMatrix' (B.comp (Matrix.toLin' M.transpose) (Matrix.toLin' N)) - LinearMap.BilinForm.toMatrix'_comp 📋 Mathlib.LinearAlgebra.Matrix.BilinearForm
{R₁ : Type u_1} [CommSemiring R₁] {n : Type u_5} {o : Type u_6} [Fintype n] [Fintype o] [DecidableEq n] [DecidableEq o] (B : LinearMap.BilinForm R₁ (n → R₁)) (l r : (o → R₁) →ₗ[R₁] n → R₁) : LinearMap.BilinForm.toMatrix' (B.comp l r) = (LinearMap.toMatrix' l).transpose * LinearMap.BilinForm.toMatrix' B * LinearMap.toMatrix' r - Matrix.transpose_hadamard 📋 Mathlib.LinearAlgebra.Matrix.Hadamard
{α : Type u_1} {m : Type u_2} {n : Type u_3} [Mul α] (A B : Matrix m n α) : (A.hadamard B).transpose = A.transpose.hadamard B.transpose - Matrix.sum_hadamard_eq 📋 Mathlib.LinearAlgebra.Matrix.Hadamard
{α : Type u_1} {m : Type u_2} {n : Type u_3} (A B : Matrix m n α) [Fintype m] [Fintype n] [NonUnitalSemiring α] : ∑ i, ∑ j, A.hadamard B i j = (A * B.transpose).trace - Matrix.dotProduct_vecMul_hadamard 📋 Mathlib.LinearAlgebra.Matrix.Hadamard
{α : Type u_1} {m : Type u_2} {n : Type u_3} (A B : Matrix m n α) [Fintype m] [Fintype n] [NonUnitalSemiring α] [DecidableEq m] [DecidableEq n] (v : m → α) (w : n → α) : Matrix.vecMul v (A.hadamard B) ⬝ᵥ w = (Matrix.diagonal v * A * (B * Matrix.diagonal w).transpose).trace - Matrix.transpose_zpow 📋 Mathlib.LinearAlgebra.Matrix.ZPow
{n' : Type u_1} [DecidableEq n'] [Fintype n'] {R : Type u_2} [CommRing R] (A : Matrix n' n' R) (n : ℤ) : (A ^ n).transpose = A.transpose ^ n - Matrix.IsHermitian.transpose 📋 Mathlib.LinearAlgebra.Matrix.Hermitian
{α : Type u_1} {n : Type u_4} [Star α] {A : Matrix n n α} (h : A.IsHermitian) : A.transpose.IsHermitian - Matrix.isHermitian_transpose_iff 📋 Mathlib.LinearAlgebra.Matrix.Hermitian
{α : Type u_1} {n : Type u_4} [Star α] {A : Matrix n n α} : A.transpose.IsHermitian ↔ A.IsHermitian - Matrix.conjTranspose_comp 📋 Mathlib.LinearAlgebra.Matrix.Hermitian
{α : Type u_1} [Star α] {I : Type u_5} {J : Type u_6} {K : Type u_7} {L : Type u_8} (M : Matrix I J (Matrix K L α)) : ((Matrix.comp I J K L α) M).conjTranspose = (Matrix.comp J I L K α) (M.transpose.map fun x => x.conjTranspose) - Matrix.vec_transpose 📋 Mathlib.LinearAlgebra.Matrix.Vec
{m : Type u_1} {n : Type u_2} {R : Type u_3} (A : Matrix m n R) : A.transpose.vec = A.vec ∘ Prod.swap - Matrix.vec_dotProduct_vec 📋 Mathlib.LinearAlgebra.Matrix.Vec
{m : Type u_2} {n : Type u_3} {R : Type u_1} [AddCommMonoid R] [Mul R] [Fintype m] [Fintype n] (A B : Matrix m n R) : A.vec ⬝ᵥ B.vec = (A.transpose * B).trace - Matrix.kronecker_mulVec_vec 📋 Mathlib.LinearAlgebra.Matrix.Vec
{l : Type u_1} {m : Type u_2} {n : Type u_4} {p : Type u_5} {R : Type u_3} [NonUnitalCommSemiring R] [Fintype m] [Fintype n] (A : Matrix l m R) (X : Matrix m n R) (B : Matrix p n R) : (Matrix.kroneckerMap (fun x1 x2 => x1 * x2) B A).mulVec X.vec = (A * X * B.transpose).vec - Matrix.vec_vecMul_kronecker 📋 Mathlib.LinearAlgebra.Matrix.Vec
{l : Type u_2} {m : Type u_1} {n : Type u_4} {p : Type u_5} {R : Type u_3} [NonUnitalCommSemiring R] [Fintype m] [Fintype n] (A : Matrix m l R) (X : Matrix m n R) (B : Matrix n p R) : Matrix.vecMul X.vec (Matrix.kroneckerMap (fun x1 x2 => x1 * x2) B A) = (A.transpose * X * B).vec - Matrix.kronecker_mulVec_vec_of_commute 📋 Mathlib.LinearAlgebra.Matrix.Vec
{l : Type u_1} {m : Type u_2} {n : Type u_4} {p : Type u_5} {R : Type u_3} [NonUnitalSemiring R] [Fintype m] [Fintype n] (A : Matrix l m R) (X : Matrix m n R) (B : Matrix p n R) (hB : ∀ (x : R) (i : p) (j : n), Commute x (B i j)) : (Matrix.kroneckerMap (fun x1 x2 => x1 * x2) B A).mulVec X.vec = (A * X * B.transpose).vec - Matrix.vec_vecMul_kronecker_of_commute 📋 Mathlib.LinearAlgebra.Matrix.Vec
{l : Type u_2} {m : Type u_1} {n : Type u_4} {p : Type u_5} {R : Type u_3} [NonUnitalSemiring R] [Fintype m] [Fintype n] (A : Matrix m l R) (X : Matrix m n R) (B : Matrix n p R) (hA : ∀ (x : R) (i : m) (j : l), Commute (A i j) x) : Matrix.vecMul X.vec (Matrix.kroneckerMap (fun x1 x2 => x1 * x2) B A) = (A.transpose * X * B).vec - Matrix.PosDef.transpose 📋 Mathlib.LinearAlgebra.Matrix.PosDef
{n : Type u_2} {R' : Type u_4} [CommRing R'] [PartialOrder R'] [StarRing R'] {M : Matrix n n R'} (hM : M.PosDef) : M.transpose.PosDef - Matrix.PosSemidef.transpose 📋 Mathlib.LinearAlgebra.Matrix.PosDef
{n : Type u_2} {R' : Type u_4} [CommRing R'] [PartialOrder R'] [StarRing R'] {M : Matrix n n R'} (hM : M.PosSemidef) : M.transpose.PosSemidef - Matrix.posSemidef_transpose_iff 📋 Mathlib.LinearAlgebra.Matrix.PosDef
{n : Type u_2} {R' : Type u_4} [CommRing R'] [PartialOrder R'] [StarRing R'] {M : Matrix n n R'} : M.transpose.PosSemidef ↔ M.PosSemidef - Matrix.PosDef.transpose_iff 📋 Mathlib.LinearAlgebra.Matrix.PosDef
{n : Type u_2} {R' : Type u_4} [CommRing R'] [PartialOrder R'] [StarRing R'] {M : Matrix n n R'} : M.transpose.PosDef ↔ M.PosDef - Matrix.isSimplyLaced_transpose 📋 Mathlib.LinearAlgebra.Matrix.Cartan
{ι : Type u_1} (A : Matrix ι ι ℤ) : A.transpose.IsSimplyLaced ↔ A.IsSimplyLaced - CartanMatrix.A_transpose 📋 Mathlib.LinearAlgebra.Matrix.Cartan
(n : ℕ) : (CartanMatrix.A n).transpose = CartanMatrix.A n - CartanMatrix.B_transpose 📋 Mathlib.LinearAlgebra.Matrix.Cartan
(n : ℕ) : (CartanMatrix.B n).transpose = CartanMatrix.C n - CartanMatrix.C_transpose 📋 Mathlib.LinearAlgebra.Matrix.Cartan
(n : ℕ) : (CartanMatrix.C n).transpose = CartanMatrix.B n - CartanMatrix.D_transpose 📋 Mathlib.LinearAlgebra.Matrix.Cartan
(n : ℕ) : (CartanMatrix.D n).transpose = CartanMatrix.D n - CartanMatrix.E_transpose 📋 Mathlib.LinearAlgebra.Matrix.Cartan
(n : ℕ) : (CartanMatrix.E n).transpose = CartanMatrix.E n - CartanMatrix.E₆_transpose 📋 Mathlib.LinearAlgebra.Matrix.Cartan
: (CartanMatrix.E 6).transpose = CartanMatrix.E 6 - CartanMatrix.E₇_transpose 📋 Mathlib.LinearAlgebra.Matrix.Cartan
: (CartanMatrix.E 7).transpose = CartanMatrix.E 7 - CartanMatrix.E₈_transpose 📋 Mathlib.LinearAlgebra.Matrix.Cartan
: (CartanMatrix.E 8).transpose = CartanMatrix.E 8
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