Loogle!
Result
Found 168 declarations mentioning Matrix.of.
- Matrix.of 📋 Mathlib.LinearAlgebra.Matrix.Defs
{m : Type u_2} {n : Type u_3} {α : Type v} : (m → n → α) ≃ Matrix m n α - Matrix.of_apply 📋 Mathlib.LinearAlgebra.Matrix.Defs
{m : Type u_2} {n : Type u_3} {α : Type v} (f : m → n → α) (i : m) (j : n) : Matrix.of f i j = f i j - Matrix.of_row 📋 Mathlib.LinearAlgebra.Matrix.Defs
{m : Type u_2} {n : Type u_3} {α : Type v} (f : m → n → α) : (Matrix.of f).row = f - 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.of_symm_apply 📋 Mathlib.LinearAlgebra.Matrix.Defs
{m : Type u_2} {n : Type u_3} {α : Type v} (f : Matrix m n α) (i : m) (j : n) : Matrix.of.symm f i j = f i j - Matrix.row_eq_self 📋 Mathlib.LinearAlgebra.Matrix.Defs
{m : Type u_2} {n : Type u_3} {α : Type v} (A : Matrix m n α) : A.row = Matrix.of.symm A - 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.of_zero 📋 Mathlib.LinearAlgebra.Matrix.Defs
{m : Type u_2} {n : Type u_3} {α : Type v} [Zero α] : Matrix.of 0 = 0 - Set.matrix_eq_pi 📋 Mathlib.LinearAlgebra.Matrix.Defs
{m : Type u_2} {n : Type u_3} {α : Type v} {S : Set α} : S.matrix = ⇑Matrix.of.symm ⁻¹' Set.univ.pi fun x => Set.univ.pi fun x => S - Matrix.of_symm_zero 📋 Mathlib.LinearAlgebra.Matrix.Defs
{m : Type u_2} {n : Type u_3} {α : Type v} [Zero α] : Matrix.of.symm 0 = 0 - Matrix.neg_of 📋 Mathlib.LinearAlgebra.Matrix.Defs
{m : Type u_2} {n : Type u_3} {α : Type v} [Neg α] (f : m → n → α) : -Matrix.of f = Matrix.of (-f) - Matrix.ofArray_eq_of_getD 📋 Mathlib.LinearAlgebra.Matrix.Defs
{R : Type u_5} [Zero R] {m n : ℕ} (A : Array R) (hA : A.size = m * n) : Matrix.ofArray A hA = Matrix.of fun i j => A.getD (n * ↑i + ↑j) 0 - Matrix.coe_ofAddEquiv 📋 Mathlib.LinearAlgebra.Matrix.Defs
{m : Type u_2} {n : Type u_3} {α : Type v} [Add α] : ⇑Matrix.ofAddEquiv = ⇑Matrix.of - Matrix.smul_of 📋 Mathlib.LinearAlgebra.Matrix.Defs
{m : Type u_2} {n : Type u_3} {R : Type u_5} {α : Type v} [SMul R α] (r : R) (f : m → n → α) : r • Matrix.of f = Matrix.of (r • f) - Matrix.coe_ofAddEquiv_symm 📋 Mathlib.LinearAlgebra.Matrix.Defs
{m : Type u_2} {n : Type u_3} {α : Type v} [Add α] : ⇑Matrix.ofAddEquiv.symm = ⇑Matrix.of.symm - Matrix.of_add_of 📋 Mathlib.LinearAlgebra.Matrix.Defs
{m : Type u_2} {n : Type u_3} {α : Type v} [Add α] (f g : m → n → α) : Matrix.of f + Matrix.of g = Matrix.of (f + g) - Matrix.of_sub_of 📋 Mathlib.LinearAlgebra.Matrix.Defs
{m : Type u_2} {n : Type u_3} {α : Type v} [Sub α] (f g : m → n → α) : Matrix.of f - Matrix.of g = Matrix.of (f - g) - Matrix.diagonal_unique 📋 Mathlib.Data.Matrix.Diagonal
{m : Type u_2} {α : Type v} [Unique m] [DecidableEq m] [Zero α] (d : m → α) : Matrix.diagonal d = Matrix.of fun x x_1 => d default - Matrix.mul_mul_left 📋 Mathlib.Data.Matrix.Mul
{m : Type u_2} {n : Type u_3} {o : Type u_4} {α : Type v} [Semiring α] [Fintype n] (M : Matrix m n α) (N : Matrix n o α) (a : α) : (Matrix.of fun i j => a * M i j) * N = a • (M * N) - Matrix.mul_mul_right 📋 Mathlib.Data.Matrix.Mul
{m : Type u_2} {n : Type u_3} {o : Type u_4} {α : Type v} [CommSemiring α] [Fintype n] (M : Matrix m n α) (N : Matrix n o α) (a : α) : (M * Matrix.of fun i j => a * N i j) = a • (M * N) - Matrix.piEquiv_symm_apply 📋 Mathlib.Data.Matrix.Basic
{m : Type u_2} {n : Type u_3} {ι : Type u_11} {β : ι → Type u_12} (f : (i : ι) → Matrix m n (β i)) : Matrix.piEquiv.symm f = Matrix.of fun j k i => f i j k - Matrix.piAddEquiv_symm_apply 📋 Mathlib.Data.Matrix.Basic
{m : Type u_2} {n : Type u_3} {ι : Type u_11} {β : ι → Type u_12} [(i : ι) → Add (β i)] (f : (i : ι) → Matrix m n (β i)) : Matrix.piAddEquiv.symm f = Matrix.of fun j k i => f i j k - Matrix.coe_ofLinearEquiv 📋 Mathlib.Data.Matrix.Basic
{m : Type u_2} {n : Type u_3} (R : Type u_4) {α : Type u_8} [Semiring R] [AddCommMonoid α] [Module R α] : ⇑(Matrix.ofLinearEquiv R) = ⇑Matrix.of - Matrix.coe_ofLinearEquiv_symm 📋 Mathlib.Data.Matrix.Basic
{m : Type u_2} {n : Type u_3} (R : Type u_4) {α : Type u_8} [Semiring R] [AddCommMonoid α] [Module R α] : ⇑(Matrix.ofLinearEquiv R).symm = ⇑Matrix.of.symm - Matrix.piAlgEquiv_symm_apply 📋 Mathlib.Data.Matrix.Basic
{n : Type u_3} {ι : Type u_11} {β : ι → Type u_12} (R : Type u_13) [CommSemiring R] [(i : ι) → Semiring (β i)] [(i : ι) → Algebra R (β i)] [Fintype n] [DecidableEq n] (f : (i : ι) → Matrix n n (β i)) : (Matrix.piAlgEquiv R).symm f = Matrix.of fun j k i => f i j k - Matrix.piRingEquiv_symm_apply 📋 Mathlib.Data.Matrix.Basic
{n : Type u_3} {ι : Type u_11} {β : ι → Type u_12} [(i : ι) → AddCommMonoid (β i)] [(i : ι) → Mul (β i)] [Fintype n] (f : (i : ι) → Matrix n n (β i)) : Matrix.piRingEquiv.symm f = Matrix.of fun j k i => f i j k - Matrix.single_eq_of_single_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 = Matrix.of (Pi.single i (Pi.single j a)) - Matrix.of_symm_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.of.symm (Matrix.single i j a) = Pi.single i (Pi.single j a) - Matrix.sum_sum_single 📋 Mathlib.Data.Matrix.Basis
{m : Type u_2} {n : Type u_3} {α : Type u_7} [DecidableEq m] [DecidableEq n] [AddCommMonoid α] [Fintype m] [Fintype n] (x : m → n → α) : ∑ i, ∑ j, Matrix.single i j (x i j) = Matrix.of x - Matrix.toSquareBlockProp_def 📋 Mathlib.Data.Matrix.Block
{m : Type u_2} {α : Type u_11} (M : Matrix m m α) (p : m → Prop) : M.toSquareBlockProp p = Matrix.of fun i j => M ↑i ↑j - Matrix.toSquareBlock_def 📋 Mathlib.Data.Matrix.Block
{m : Type u_2} {α : Type u_11} {β : Type u_12} (M : Matrix m m α) (b : m → β) (k : β) : M.toSquareBlock b k = Matrix.of fun i j => M ↑i ↑j - Matrix.replicateRow_mul_replicateCol 📋 Mathlib.LinearAlgebra.Matrix.RowCol
{m : Type u_2} {α : Type v} {ι : Type u_6} [Fintype m] [Mul α] [AddCommMonoid α] (v w : m → α) : Matrix.replicateRow ι v * Matrix.replicateCol ι w = Matrix.of fun x x_1 => v ⬝ᵥ w - Matrix.replicateRow_cons 📋 Mathlib.LinearAlgebra.Matrix.Notation
{α : Type u} {m : ℕ} {ι : Type u_1} (x : α) (u : Fin m → α) : Matrix.replicateRow ι (Matrix.vecCons x u) = Matrix.of fun x_1 => Matrix.vecCons x u - Matrix.replicateCol_cons 📋 Mathlib.LinearAlgebra.Matrix.Notation
{α : Type u} {m : ℕ} {ι : Type u_1} (x : α) (u : Fin m → α) : Matrix.replicateCol ι (Matrix.vecCons x u) = Matrix.of (Matrix.vecCons (fun x_1 => x) (Matrix.replicateCol ι u)) - 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.replicateRow_empty 📋 Mathlib.LinearAlgebra.Matrix.Notation
{α : Type u} {ι : Type u_1} : Matrix.replicateRow ι ![] = Matrix.of fun x => ![] - Matrix.replicateCol_empty 📋 Mathlib.LinearAlgebra.Matrix.Notation
{α : Type u} {ι : Type u_1} (v : Fin 0 → α) : Matrix.replicateCol ι v = Matrix.of ![] - 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.vecMulVec_cons 📋 Mathlib.LinearAlgebra.Matrix.Notation
{α : Type u} {n : ℕ} {m' : Type uₘ} [NonUnitalNonAssocSemiring α] (v : m' → α) (x : α) (w : Fin n → α) : Matrix.vecMulVec v (Matrix.vecCons x w) = Matrix.of fun i => v i • Matrix.vecCons x w - Matrix.empty_vecMulVec 📋 Mathlib.LinearAlgebra.Matrix.Notation
{α : Type u} {n' : Type uₙ} [NonUnitalNonAssocSemiring α] (v : Fin 0 → α) (w : n' → α) : Matrix.vecMulVec v w = Matrix.of ![] - Matrix.vecMulVec_empty 📋 Mathlib.LinearAlgebra.Matrix.Notation
{α : Type u} {m' : Type uₘ} [NonUnitalNonAssocSemiring α] (v : m' → α) (w : Fin 0 → α) : Matrix.vecMulVec v w = Matrix.of fun x => ![] - Matrix.submatrix_empty 📋 Mathlib.LinearAlgebra.Matrix.Notation
{α : Type u} {m' : Type uₘ} {n' : Type uₙ} {o' : Type uₒ} (A : Matrix m' n' α) (row : Fin 0 → m') (col : o' → n') : A.submatrix row col = 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.empty_mul 📋 Mathlib.LinearAlgebra.Matrix.Notation
{α : Type u} {n' : Type uₙ} {o' : Type uₒ} [NonUnitalNonAssocSemiring α] [Fintype n'] (A : Matrix (Fin 0) n' α) (B : Matrix n' o' α) : A * B = Matrix.of ![] - Matrix.mul_empty 📋 Mathlib.LinearAlgebra.Matrix.Notation
{α : Type u} {m' : Type uₘ} {n' : Type uₙ} [NonUnitalNonAssocSemiring α] [Fintype n'] (A : Matrix m' n' α) (B : Matrix n' (Fin 0) α) : A * B = Matrix.of fun x => ![] - Matrix.cons_mulVec 📋 Mathlib.LinearAlgebra.Matrix.Notation
{α : Type u} {m : ℕ} {n' : Type uₙ} [NonUnitalNonAssocSemiring α] [Fintype n'] (v : n' → α) (A : Fin m → n' → α) (w : n' → α) : (Matrix.of (Matrix.vecCons v A)).mulVec w = Matrix.vecCons (v ⬝ᵥ w) ((Matrix.of A).mulVec w) - 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.cons_vecMul_cons 📋 Mathlib.LinearAlgebra.Matrix.Notation
{α : Type u} {n : ℕ} {o' : Type uₒ} [NonUnitalNonAssocSemiring α] (x : α) (v : Fin n → α) (w : o' → α) (B : Fin n → o' → α) : Matrix.vecMul (Matrix.vecCons x v) (Matrix.of (Matrix.vecCons w B)) = x • w + Matrix.vecMul v (Matrix.of B) - Matrix.cons_vecMul 📋 Mathlib.LinearAlgebra.Matrix.Notation
{α : Type u} {n : ℕ} {o' : Type uₒ} [NonUnitalNonAssocSemiring α] (x : α) (v : Fin n → α) (B : Fin n.succ → o' → α) : Matrix.vecMul (Matrix.vecCons x v) (Matrix.of B) = x • Matrix.vecHead B + Matrix.vecMul v (Matrix.of (Matrix.vecTail B)) - Matrix.vecMul_cons 📋 Mathlib.LinearAlgebra.Matrix.Notation
{α : Type u} {n : ℕ} {o' : Type uₒ} [NonUnitalNonAssocSemiring α] (v : Fin n.succ → α) (w : o' → α) (B : Fin n → o' → α) : Matrix.vecMul v (Matrix.of (Matrix.vecCons w B)) = Matrix.vecHead v • w + Matrix.vecMul (Matrix.vecTail v) (Matrix.of B) - Matrix.mul_val_succ 📋 Mathlib.LinearAlgebra.Matrix.Notation
{α : Type u} {m : ℕ} {n' : Type uₙ} {o' : Type uₒ} [NonUnitalNonAssocSemiring α] [Fintype n'] (A : Matrix (Fin m.succ) n' α) (B : Matrix n' o' α) (i : Fin m) (j : o') : (A * B) i.succ j = (Matrix.of (Matrix.vecTail (Matrix.of.symm A)) * B) i j - Matrix.diagonal_vec1 📋 Mathlib.LinearAlgebra.Matrix.Notation
{α : Type u} [Zero α] (a : α) : Matrix.diagonal ![a] = !![a] - Matrix.mulVec_cons 📋 Mathlib.LinearAlgebra.Matrix.Notation
{n : ℕ} {m' : Type uₘ} {α : Type u_1} [NonUnitalCommSemiring α] (A : m' → Fin n.succ → α) (x : α) (v : Fin n → α) : (Matrix.of A).mulVec (Matrix.vecCons x v) = x • Matrix.vecHead ∘ A + (Matrix.of (Matrix.vecTail ∘ A)).mulVec v - Matrix.diagonal_fin_one 📋 Mathlib.LinearAlgebra.Matrix.Notation
{α : Type u} [Zero α] (d : Fin 1 → α) : Matrix.diagonal d = !![d 0] - Matrix.diagonal_vec2 📋 Mathlib.LinearAlgebra.Matrix.Notation
{α : Type u} [Zero α] (a b : α) : Matrix.diagonal ![a, b] = !![a, 0; 0, b] - Matrix.one_fin_two 📋 Mathlib.LinearAlgebra.Matrix.Notation
{α : Type u} [Zero α] [One α] : 1 = !![1, 0; 0, 1] - Matrix.diagonal_fin_two 📋 Mathlib.LinearAlgebra.Matrix.Notation
{α : Type u} [Zero α] (d : Fin 2 → α) : Matrix.diagonal d = !![d 0, 0; 0, d 1] - Matrix.natCast_fin_two 📋 Mathlib.LinearAlgebra.Matrix.Notation
{α : Type u} [AddMonoidWithOne α] (n : ℕ) : ↑n = !![↑n, 0; 0, ↑n] - Matrix.ofNat_fin_two 📋 Mathlib.LinearAlgebra.Matrix.Notation
{α : Type u} [AddMonoidWithOne α] (n : ℕ) [n.AtLeastTwo] : OfNat.ofNat n = !![OfNat.ofNat n, 0; 0, OfNat.ofNat n] - Matrix.cons_mul 📋 Mathlib.LinearAlgebra.Matrix.Notation
{α : Type u} {m : ℕ} {n' : Type uₙ} {o' : Type uₒ} [NonUnitalNonAssocSemiring α] [Fintype n'] (v : n' → α) (A : Fin m → n' → α) (B : Matrix n' o' α) : Matrix.of (Matrix.vecCons v A) * B = Matrix.of (Matrix.vecCons (Matrix.vecMul v B) (Matrix.of.symm (Matrix.of A * B))) - Matrix.diagonal_vec3 📋 Mathlib.LinearAlgebra.Matrix.Notation
{α : Type u} [Zero α] (a b c : α) : Matrix.diagonal ![a, b, c] = !![a, 0, 0; 0, b, 0; 0, 0, c] - Matrix.one_fin_three 📋 Mathlib.LinearAlgebra.Matrix.Notation
{α : Type u} [Zero α] [One α] : 1 = !![1, 0, 0; 0, 1, 0; 0, 0, 1] - Matrix.diagonal_fin_three 📋 Mathlib.LinearAlgebra.Matrix.Notation
{α : Type u} [Zero α] (d : Fin 3 → α) : Matrix.diagonal d = !![d 0, 0, 0; 0, d 1, 0; 0, 0, d 2] - Matrix.eta_fin_two 📋 Mathlib.LinearAlgebra.Matrix.Notation
{α : Type u} (A : Matrix (Fin 2) (Fin 2) α) : A = !![A 0 0, A 0 1; A 1 0, A 1 1] - Matrix.natCast_fin_three 📋 Mathlib.LinearAlgebra.Matrix.Notation
{α : Type u} [AddMonoidWithOne α] (n : ℕ) : ↑n = !![↑n, 0, 0; 0, ↑n, 0; 0, 0, ↑n] - Matrix.ofNat_fin_three 📋 Mathlib.LinearAlgebra.Matrix.Notation
{α : Type u} [AddMonoidWithOne α] (n : ℕ) [n.AtLeastTwo] : OfNat.ofNat n = !![OfNat.ofNat n, 0, 0; 0, OfNat.ofNat n, 0; 0, 0, OfNat.ofNat n] - Matrix.eta_fin_three 📋 Mathlib.LinearAlgebra.Matrix.Notation
{α : Type u} (A : Matrix (Fin 3) (Fin 3) α) : A = !![A 0 0, A 0 1, A 0 2; A 1 0, A 1 1, A 1 2; A 2 0, A 2 1, A 2 2] - Matrix.mul_fin_two 📋 Mathlib.LinearAlgebra.Matrix.Notation
{α : Type u} [AddCommMonoid α] [Mul α] (a₁₁ a₁₂ a₂₁ a₂₂ b₁₁ b₁₂ b₂₁ b₂₂ : α) : !![a₁₁, a₁₂; a₂₁, a₂₂] * !![b₁₁, b₁₂; b₂₁, b₂₂] = !![a₁₁ * b₁₁ + a₁₂ * b₂₁, a₁₁ * b₁₂ + a₁₂ * b₂₂; a₂₁ * b₁₁ + a₂₂ * b₂₁, a₂₁ * b₁₂ + a₂₂ * b₂₂] - Matrix.mul_fin_three 📋 Mathlib.LinearAlgebra.Matrix.Notation
{α : Type u} [AddCommMonoid α] [Mul α] (a₁₁ a₁₂ a₁₃ a₂₁ a₂₂ a₂₃ a₃₁ a₃₂ a₃₃ b₁₁ b₁₂ b₁₃ b₂₁ b₂₂ b₂₃ b₃₁ b₃₂ b₃₃ : α) : !![a₁₁, a₁₂, a₁₃; a₂₁, a₂₂, a₂₃; a₃₁, a₃₂, a₃₃] * !![b₁₁, b₁₂, b₁₃; b₂₁, b₂₂, b₂₃; b₃₁, b₃₂, b₃₃] = !![a₁₁ * b₁₁ + a₁₂ * b₂₁ + a₁₃ * b₃₁, a₁₁ * b₁₂ + a₁₂ * b₂₂ + a₁₃ * b₃₂, a₁₁ * b₁₃ + a₁₂ * b₂₃ + a₁₃ * b₃₃; a₂₁ * b₁₁ + a₂₂ * b₂₁ + a₂₃ * b₃₁, a₂₁ * b₁₂ + a₂₂ * b₂₂ + a₂₃ * b₃₂, a₂₁ * b₁₃ + a₂₂ * b₂₃ + a₂₃ * b₃₃; a₃₁ * b₁₁ + a₃₂ * b₂₁ + a₃₃ * b₃₁, a₃₁ * b₁₂ + a₃₂ * b₂₂ + a₃₃ * b₃₂, a₃₁ * b₁₃ + a₃₂ * b₂₃ + a₃₃ * b₃₃] - Matrix.toLin_finTwoProd_apply 📋 Mathlib.LinearAlgebra.Matrix.ToLin
{R : Type u_1} [CommSemiring R] (a b c d : R) (x : R × R) : ((Matrix.toLin (Module.Basis.finTwoProd R) (Module.Basis.finTwoProd R)) !![a, b; c, d]) x = (a * x.1 + b * x.2, c * x.1 + d * x.2) - Matrix.toLin_finTwoProd 📋 Mathlib.LinearAlgebra.Matrix.ToLin
{R : Type u_1} [CommSemiring R] (a b c d : R) : (Matrix.toLin (Module.Basis.finTwoProd R) (Module.Basis.finTwoProd R)) !![a, b; c, d] = (a • LinearMap.fst R R R + b • LinearMap.snd R R R).prod (c • LinearMap.fst R R R + d • LinearMap.snd R R R) - Matrix.det_mul_column 📋 Mathlib.LinearAlgebra.Matrix.Determinant.Basic
{n : Type u_2} [DecidableEq n] [Fintype n] {R : Type v} [CommRing R] (v : n → R) (A : Matrix n n R) : (Matrix.of fun i j => v i * A i j).det = (∏ i, v i) * A.det - Matrix.det_mul_row 📋 Mathlib.LinearAlgebra.Matrix.Determinant.Basic
{n : Type u_2} [DecidableEq n] [Fintype n] {R : Type v} [CommRing R] (v : n → R) (A : Matrix n n R) : (Matrix.of fun i j => v j * A i j).det = (∏ i, v i) * A.det - Matrix.det_fin_one_of 📋 Mathlib.LinearAlgebra.Matrix.Determinant.Basic
{R : Type v} [CommRing R] (a : R) : !![a].det = a - Matrix.det_fin_two_of 📋 Mathlib.LinearAlgebra.Matrix.Determinant.Basic
{R : Type v} [CommRing R] (a b c d : R) : !![a, b; c, d].det = a * d - b * c - Matrix.eval_det_mvPolynomialX 📋 Mathlib.LinearAlgebra.Matrix.MvPolynomial
(m : Type u_1) (R : Type u_3) [DecidableEq m] [Fintype m] [CommRing R] (s : m × m → R) : (MvPolynomial.eval s) (Matrix.mvPolynomialX m m R).det = (Matrix.of fun i j => s (i, j)).det - 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.adjugate_fin_two 📋 Mathlib.LinearAlgebra.Matrix.Adjugate
{α : Type w} [CommRing α] (A : Matrix (Fin 2) (Fin 2) α) : A.adjugate = !![A 1 1, -A 0 1; -A 1 0, A 0 0] - Matrix.adjugate_fin_two_of 📋 Mathlib.LinearAlgebra.Matrix.Adjugate
{α : Type w} [CommRing α] (a b c d : α) : !![a, b; c, d].adjugate = !![d, -b; -c, a] - Matrix.adjugate_fin_three_of 📋 Mathlib.LinearAlgebra.Matrix.Adjugate
{α : Type w} [CommRing α] (a b c d e f g h i : α) : !![a, b, c; d, e, f; g, h, i].adjugate = !![e * i - f * h, -(b * i) + c * h, b * f - c * e; -(d * i) + f * g, a * i - c * g, -(a * f) + c * d; d * h - e * g, -(a * h) + b * g, a * e - b * d] - Matrix.adjugate_fin_three 📋 Mathlib.LinearAlgebra.Matrix.Adjugate
{α : Type w} [CommRing α] (A : Matrix (Fin 3) (Fin 3) α) : A.adjugate = !![A 1 1 * A 2 2 - A 1 2 * A 2 1, -(A 0 1 * A 2 2) + A 0 2 * A 2 1, A 0 1 * A 1 2 - A 0 2 * A 1 1; -(A 1 0 * A 2 2) + A 1 2 * A 2 0, A 0 0 * A 2 2 - A 0 2 * A 2 0, -(A 0 0 * A 1 2) + A 0 2 * A 1 0; A 1 0 * A 2 1 - A 1 1 * A 2 0, -(A 0 0 * A 2 1) + A 0 1 * A 2 0, A 0 0 * A 1 1 - A 0 1 * A 1 0] - Matrix.trace_fin_one_of 📋 Mathlib.LinearAlgebra.Matrix.Trace
{R : Type u_6} [AddCommMonoid R] (a : R) : !![a].trace = a - Matrix.trace_fin_two_of 📋 Mathlib.LinearAlgebra.Matrix.Trace
{R : Type u_6} [AddCommMonoid R] (a b c d : R) : !![a, b; c, d].trace = a + d - Matrix.trace_fin_three_of 📋 Mathlib.LinearAlgebra.Matrix.Trace
{R : Type u_6} [AddCommMonoid R] (a b c d e f g h i : R) : !![a, b, c; d, e, f; g, h, i].trace = a + e + i - Matrix.matrixOfPolynomials_blockTriangular 📋 Mathlib.LinearAlgebra.Matrix.Block
{R : Type u_6} [Semiring R] {n : ℕ} (p : Fin n → Polynomial R) (h_deg : ∀ (i : Fin n), (p i).natDegree ≤ ↑i) : (Matrix.of fun i j => (p j).coeff ↑i).BlockTriangular id - Matrix.det_matrixOfPolynomials 📋 Mathlib.LinearAlgebra.Matrix.Block
{R : Type v} [CommRing R] {n : ℕ} (p : Fin n → Polynomial R) (h_deg : ∀ (i : Fin n), (p i).natDegree = ↑i) (h_monic : ∀ (i : Fin n), (p i).Monic) : (Matrix.of fun i j => (p j).coeff ↑i).det = 1 - Matrix.det_piecewise_one_eq_submatrix_det 📋 Mathlib.LinearAlgebra.Matrix.Charpoly.Coeff
{R : Type u} [CommRing R] {n : Type v} [DecidableEq n] [Fintype n] (M : Matrix n n R) (s : Finset n) : (Matrix.of (s.piecewise M.row (Matrix.row 1))).det = (M.submatrix Subtype.val Subtype.val).det - basis_toMatrix_basisFun_mul 📋 Mathlib.LinearAlgebra.Matrix.Basis
{ι : Type u_1} {R : Type u_5} [CommSemiring R] [Fintype ι] (b : Module.Basis ι R (ι → R)) (A : Matrix ι ι R) : b.toMatrix ⇑(Pi.basisFun R ι) * A = Matrix.of fun i j => (b.repr (A.col j)) i - ModularGroup.coe_T 📋 Mathlib.LinearAlgebra.Matrix.SpecialLinearGroup
: ↑ModularGroup.T = !![1, 1; 0, 1] - ModularGroup.coe_S 📋 Mathlib.LinearAlgebra.Matrix.SpecialLinearGroup
: ↑ModularGroup.S = !![0, -1; 1, 0] - ModularGroup.coe_T_inv 📋 Mathlib.LinearAlgebra.Matrix.SpecialLinearGroup
: ↑ModularGroup.T⁻¹ = !![1, -1; 0, 1] - Matrix.SpecialLinearGroup.diag2_coe' 📋 Mathlib.LinearAlgebra.Matrix.SpecialLinearGroup
{F : Type u_1} [Field F] {a : F} (ha : a ≠ 0) : ↑(Matrix.SpecialLinearGroup.diag2 a ha) = !![a, 0; 0, a⁻¹] - Matrix.SpecialLinearGroup.fin_two_induction 📋 Mathlib.LinearAlgebra.Matrix.SpecialLinearGroup
{R : Type v} [CommRing R] (P : Matrix.SpecialLinearGroup (Fin 2) R → Prop) (h : ∀ (a b c d : R) (hdet : a * d - b * c = 1), P ⟨!![a, b; c, d], ⋯⟩) (g : Matrix.SpecialLinearGroup (Fin 2) R) : P g - ModularGroup.coe_T_zpow 📋 Mathlib.LinearAlgebra.Matrix.SpecialLinearGroup
(n : ℤ) : ↑(ModularGroup.T ^ n) = !![1, n; 0, 1] - Matrix.SpecialLinearGroup.fin_two_exists_eq_mk_of_apply_zero_one_eq_zero 📋 Mathlib.LinearAlgebra.Matrix.SpecialLinearGroup
{R : Type u_2} [Field R] (g : Matrix.SpecialLinearGroup (Fin 2) R) (hg : ↑g 1 0 = 0) : ∃ a b, ∃ (h : a ≠ 0), g = ⟨!![a, b; 0, a⁻¹], ⋯⟩ - PowerBasis.leftMulMatrix 📋 Mathlib.RingTheory.PowerBasis
{S : Type u_2} [Ring S] {A : Type u_3} [CommRing A] [Algebra A S] (pb : PowerBasis A S) : (Algebra.leftMulMatrix pb.basis) pb.gen = Matrix.of fun i j => if ↑j + 1 = pb.dim then -pb.minpolyGen.coeff ↑i else if ↑i = ↑j + 1 then 1 else 0 - Pi.basisFun_det_apply 📋 Mathlib.LinearAlgebra.Determinant
{R : Type u_1} [CommRing R] {ι : Type u_4} [DecidableEq ι] [Fintype ι] (v : ι → ι → R) : (Pi.basisFun R ι).det v = (Matrix.of v).det - Matrix.det_eval_matrixOfPolynomials_eq_det_vandermonde 📋 Mathlib.LinearAlgebra.Vandermonde
{R : Type u_1} [CommRing R] {n : ℕ} (v : Fin n → R) (p : Fin n → Polynomial R) (h_deg : ∀ (i : Fin n), (p i).natDegree = ↑i) (h_monic : ∀ (i : Fin n), (p i).Monic) : (Matrix.vandermonde v).det = (Matrix.of fun i j => Polynomial.eval (v i) (p j)).det - Matrix.eval_matrixOfPolynomials_eq_vandermonde_mul_matrixOfPolynomials 📋 Mathlib.LinearAlgebra.Vandermonde
{R : Type u_1} [CommRing R] {n : ℕ} (v : Fin n → R) (p : Fin n → Polynomial R) (h_deg : ∀ (i : Fin n), (p i).natDegree ≤ ↑i) : (Matrix.of fun i j => Polynomial.eval (v i) (p j)) = Matrix.vandermonde v * Matrix.of fun i j => (p j).coeff ↑i - Matrix.vandermonde_succ 📋 Mathlib.LinearAlgebra.Vandermonde
{R : Type u_1} [CommRing R] {n : ℕ} (v : Fin n.succ → R) : Matrix.vandermonde v = Matrix.of Fin.cons (fun j => v 0 ^ ↑j) fun i => Fin.cons 1 fun j => v i.succ * Matrix.vandermonde (Fin.tail v) i j - Matrix.hadamard_of_one 📋 Mathlib.LinearAlgebra.Matrix.Hadamard
{α : Type u_1} {m : Type u_2} {n : Type u_3} [MulOneClass α] (A : Matrix m n α) : A.hadamard (Matrix.of 1) = A - Matrix.of_one_hadamard 📋 Mathlib.LinearAlgebra.Matrix.Hadamard
{α : Type u_1} {m : Type u_2} {n : Type u_3} [MulOneClass α] (A : Matrix m n α) : (Matrix.of 1).hadamard A = A - Matrix.vec_of 📋 Mathlib.LinearAlgebra.Matrix.Vec
{m : Type u_2} {n : Type u_1} {R : Type u_3} (f : m → n → R) : (Matrix.of f).vec = Function.uncurry (flip f) - BirdDet.Spec.stepEntry_eq 📋 Mathlib.LinearAlgebra.Matrix.Determinant.Bird.Defs
{R : Type u_1} [CommRing R] {n : ℕ} (A F : Matrix (Fin n) (Fin n) R) : BirdDet.Spec.stepEntry A F = Matrix.of fun i j => (-∑ k > i, F k k) * A i j + ∑ k > i, F i k * A k j - CartanMatrix.A_one 📋 Mathlib.LinearAlgebra.Matrix.Cartan
: CartanMatrix.A 1 = !![2] - CartanMatrix.D_two 📋 Mathlib.LinearAlgebra.Matrix.Cartan
: CartanMatrix.D 2 = !![2, 0; 0, 2] - CartanMatrix.A_two 📋 Mathlib.LinearAlgebra.Matrix.Cartan
: CartanMatrix.A 2 = !![2, -1; -1, 2] - CartanMatrix.B_two 📋 Mathlib.LinearAlgebra.Matrix.Cartan
: CartanMatrix.B 2 = !![2, -2; -1, 2] - CartanMatrix.C_two 📋 Mathlib.LinearAlgebra.Matrix.Cartan
: CartanMatrix.C 2 = !![2, -1; -2, 2] - CartanMatrix.A_three 📋 Mathlib.LinearAlgebra.Matrix.Cartan
: CartanMatrix.A 3 = !![2, -1, 0; -1, 2, -1; 0, -1, 2] - CartanMatrix.D_three 📋 Mathlib.LinearAlgebra.Matrix.Cartan
: CartanMatrix.D 3 = !![2, -1, -1; -1, 2, 0; -1, 0, 2] - CartanMatrix.D_four 📋 Mathlib.LinearAlgebra.Matrix.Cartan
: CartanMatrix.D 4 = !![2, -1, 0, 0; -1, 2, -1, -1; 0, -1, 2, 0; 0, -1, 0, 2] - CartanMatrix.E_six_eq 📋 Mathlib.LinearAlgebra.Matrix.Cartan
: CartanMatrix.E 6 = !![2, 0, -1, 0, 0, 0; 0, 2, 0, -1, 0, 0; -1, 0, 2, -1, 0, 0; 0, -1, -1, 2, -1, 0; 0, 0, 0, -1, 2, -1; 0, 0, 0, 0, -1, 2] - CartanMatrix.E_seven_eq 📋 Mathlib.LinearAlgebra.Matrix.Cartan
: CartanMatrix.E 7 = !![2, 0, -1, 0, 0, 0, 0; 0, 2, 0, -1, 0, 0, 0; -1, 0, 2, -1, 0, 0, 0; 0, -1, -1, 2, -1, 0, 0; 0, 0, 0, -1, 2, -1, 0; 0, 0, 0, 0, -1, 2, -1; 0, 0, 0, 0, 0, -1, 2] - CartanMatrix.E_eight_eq 📋 Mathlib.LinearAlgebra.Matrix.Cartan
: CartanMatrix.E 8 = !![2, 0, -1, 0, 0, 0, 0, 0; 0, 2, 0, -1, 0, 0, 0, 0; -1, 0, 2, -1, 0, 0, 0, 0; 0, -1, -1, 2, -1, 0, 0, 0; 0, 0, 0, -1, 2, -1, 0, 0; 0, 0, 0, 0, -1, 2, -1, 0; 0, 0, 0, 0, 0, -1, 2, -1; 0, 0, 0, 0, 0, 0, -1, 2] - Matrix.charpoly.univ_map_eval₂Hom 📋 Mathlib.LinearAlgebra.Matrix.Charpoly.Univ
{R : Type u_1} {S : Type u_2} (n : Type u_3) [CommRing R] [CommRing S] [Fintype n] [DecidableEq n] (f : R →+* S) (M : n × n → S) : Polynomial.map (MvPolynomial.eval₂Hom f M) (Matrix.charpoly.univ R n) = (Matrix.of (Function.curry M)).charpoly - Matrix.charpoly.univ_coeff_eval₂Hom 📋 Mathlib.LinearAlgebra.Matrix.Charpoly.Univ
{R : Type u_1} {S : Type u_2} (n : Type u_3) [CommRing R] [CommRing S] [Fintype n] [DecidableEq n] (f : R →+* S) (M : n × n → S) (i : ℕ) : (MvPolynomial.eval₂Hom f M) ((Matrix.charpoly.univ R n).coeff i) = (Matrix.of (Function.curry M)).charpoly.coeff i - exteriorPower.alternatingMapToDual_apply_ιMulti 📋 Mathlib.LinearAlgebra.ExteriorPower.Pairing
{R : Type u_1} {M : Type u_2} [CommRing R] [AddCommGroup M] [Module R M] {n : ℕ} (f : Fin n → Module.Dual R M) (v : Fin n → M) : ((exteriorPower.alternatingMapToDual R M n) f) ((exteriorPower.ιMulti R n) v) = (Matrix.of fun i j => (f j) (v i)).det - exteriorPower.pairingDual_ιMulti_ιMulti 📋 Mathlib.LinearAlgebra.ExteriorPower.Pairing
{R : Type u_1} {M : Type u_2} [CommRing R] [AddCommGroup M] [Module R M] {n : ℕ} (f : Fin n → Module.Dual R M) (v : Fin n → M) : ((exteriorPower.pairingDual R M n) ((exteriorPower.ιMulti R n) f)) ((exteriorPower.ιMulti R n) v) = (Matrix.of fun i j => (f j) (v i)).det - exteriorPower.ιMultiDual_apply_ιMulti 📋 Mathlib.LinearAlgebra.ExteriorPower.Basis
(R : Type u_1) {M : Type u_3} (n : ℕ) [CommRing R] [AddCommGroup M] [Module R M] {I : Type u_5} [LinearOrder I] (b : Module.Basis I R M) (s : ↑(Set.powersetCard I n)) (v : Fin n → M) : (exteriorPower.ιMultiDual R n b s) ((exteriorPower.ιMulti R n) v) = (Matrix.of fun i j => (b.coord ((Set.powersetCard.ofFinEmbEquiv.symm s) j)) (v i)).det - Complex.toMatrix_conjAe 📋 Mathlib.LinearAlgebra.Complex.Module
: (LinearMap.toMatrix Complex.basisOneI Complex.basisOneI) ↑↑Complex.conjAe = !![1, 0; 0, -1] - Matrix.toLin_finTwoProd_toContinuousLinearMap 📋 Mathlib.Topology.Algebra.Module.FiniteDimension
{𝕜 : Type u} [hnorm : NontriviallyNormedField 𝕜] [CompleteSpace 𝕜] (a b c d : 𝕜) : LinearMap.toContinuousLinearMap ((Matrix.toLin (Module.Basis.finTwoProd 𝕜) (Module.Basis.finTwoProd 𝕜)) !![a, b; c, d]) = (a • ContinuousLinearMap.fst 𝕜 𝕜 𝕜 + b • ContinuousLinearMap.snd 𝕜 𝕜 𝕜).prod (c • ContinuousLinearMap.fst 𝕜 𝕜 𝕜 + d • ContinuousLinearMap.snd 𝕜 𝕜 𝕜) - Continuous.matrixOf 📋 Mathlib.Topology.Instances.Matrix
{α : Type u_2} {m : Type u_4} {n : Type u_5} {R : Type u_8} [TopologicalSpace R] [TopologicalSpace α] {f : α → m → n → R} : Continuous f → Continuous fun x => Matrix.of (f x) - continuous_matrixOf 📋 Mathlib.Topology.Instances.Matrix
{α : Type u_2} {m : Type u_4} {n : Type u_5} {R : Type u_8} [TopologicalSpace R] [TopologicalSpace α] {f : α → m → n → R} : (Continuous fun x => Matrix.of (f x)) ↔ Continuous f - PiLp.basis_toMatrix_basisFun_mul 📋 Mathlib.Analysis.Normed.Lp.PiLp
(p : ENNReal) {ι : Type u_2} [Fintype ι] {𝕜 : Type u_5} [SeminormedCommRing 𝕜] (b : Module.Basis ι 𝕜 (PiLp p fun x => 𝕜)) (A : Matrix ι ι 𝕜) : b.toMatrix ⇑(PiLp.basisFun p 𝕜 ι) * A = Matrix.of fun i j => (b.repr (WithLp.toLp p (A.transpose j))) i - Matrix.of_mem_specialOrthogonalGroup_fin_two_iff 📋 Mathlib.LinearAlgebra.UnitaryGroup
{R : Type v} [CommRing R] {a b c d : R} : !![a, b; c, d] ∈ Matrix.specialOrthogonalGroup (Fin 2) R ↔ a = d ∧ b = -c ∧ a ^ 2 + b ^ 2 = 1 - ZSpan.volume_real_fundamentalDomain 📋 Mathlib.Algebra.Module.ZLattice.Basic
{ι : Type u_2} [Fintype ι] [DecidableEq ι] (b : Module.Basis ι ℝ (ι → ℝ)) : MeasureTheory.volume.real (ZSpan.fundamentalDomain b) = |(Matrix.of ⇑b).det| - ZSpan.volume_fundamentalDomain 📋 Mathlib.Algebra.Module.ZLattice.Basic
{ι : Type u_2} [Fintype ι] [DecidableEq ι] (b : Module.Basis ι ℝ (ι → ℝ)) : MeasureTheory.volume (ZSpan.fundamentalDomain b) = ENNReal.ofReal |(Matrix.of ⇑b).det| - ZLattice.covolume_eq_det 📋 Mathlib.Algebra.Module.ZLattice.Covolume
{ι : Type u_2} [Fintype ι] [DecidableEq ι] (L : Submodule ℤ (ι → ℝ)) [DiscreteTopology ↥L] [IsZLattice ℝ L] (b : Module.Basis ι ℤ ↥L) : ZLattice.covolume L MeasureTheory.volume = |(Matrix.of (Subtype.val ∘ ⇑b)).det| - QuadraticAlgebra.toMatrix_algHom 📋 Mathlib.Algebra.QuadraticAlgebra.AlgHom
{R : Type u_1} [CommRing R] {a b a' b' : R} (f : QuadraticAlgebra R a b →ₐ[R] QuadraticAlgebra R a' b') : (LinearMap.toMatrix (QuadraticAlgebra.basis a b) (QuadraticAlgebra.basis a' b')) f.toLinearMap = !![1, (f QuadraticAlgebra.omega).re; 0, (f QuadraticAlgebra.omega).im] - Algebra.traceForm_toMatrix_powerBasis 📋 Mathlib.RingTheory.Trace.Basic
{R : Type u_1} {S : Type u_2} [CommRing R] [CommRing S] [Algebra R S] (h : PowerBasis R S) : (LinearMap.BilinForm.toMatrix h.basis) (Algebra.traceForm R S) = Matrix.of fun i j => (Algebra.trace R S) (h.gen ^ (↑i + ↑j)) - Matrix.val_planeConformalMatrix 📋 Mathlib.LinearAlgebra.Matrix.GeneralLinearGroup.Basic
{R : Type u_1} [Field R] (a b : R) (hab : a ^ 2 + b ^ 2 ≠ 0) : ↑(Matrix.planeConformalMatrix a b hab) = !![a, -b; b, a] - UpperHalfPlane.val_J 📋 Mathlib.Analysis.Complex.UpperHalfPlane.MoebiusAction
: ↑UpperHalfPlane.J = !![-1, 0; 0, 1] - UpperHalfPlane.coe_toSL2R 📋 Mathlib.Analysis.Complex.UpperHalfPlane.MoebiusAction
(z : UpperHalfPlane) : ↑z.toSL2R = !![√z.im, z.re / √z.im; 0, 1 / √z.im] - UpperHalfPlane.toSL2R_apply 📋 Mathlib.Analysis.Complex.UpperHalfPlane.MoebiusAction
(z : UpperHalfPlane) : z.toSL2R = ⟨!![√z.im, z.re / √z.im; 0, 1 / √z.im], ⋯⟩ - Matrix.GeneralLinearGroup.upperRightHom_apply 📋 Mathlib.LinearAlgebra.Matrix.GeneralLinearGroup.FinTwo
{R : Type u_1} [Ring R] (x : R) : Matrix.GeneralLinearGroup.upperRightHom x = { val := !![1, x; 0, 1], inv := !![1, -x; 0, 1], val_inv := ⋯, inv_val := ⋯ } - Algebra.leftMulMatrix_complex 📋 Mathlib.RingTheory.Complex
(z : ℂ) : (Algebra.leftMulMatrix Complex.basisOneI) z = !![z.re, -z.im; z.im, z.re] - Matrix.gram_eq_conjTranspose_mul 📋 Mathlib.Analysis.InnerProductSpace.GramMatrix
{E : Type u_1} {n : Type u_2} {𝕜 : Type u_4} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] {ι : Type u_5} [Fintype ι] (b : OrthonormalBasis ι 𝕜 E) (v : n → E) : Matrix.gram 𝕜 v = (Matrix.of fun i j => (b.repr (v j)).ofLp i).conjTranspose * Matrix.of fun i j => (b.repr (v j)).ofLp i - MeasureTheory.posSemidef_matrix_measure_inter 📋 Mathlib.MeasureTheory.Function.L2Space
{α : Type u_1} {m : MeasurableSpace α} {μ : MeasureTheory.Measure α} {ι : Type u_5} [Finite ι] {s : ι → Set α} (mv : ∀ (j : ι), MeasurableSet (s j)) (hv : ∀ (j : ι), μ (s j) ≠ ⊤ := by finiteness) : (Matrix.of fun i j => μ.real (s i ∩ s j)).PosSemidef - exteriorPower.inner_ιMulti_ιMulti 📋 Mathlib.Analysis.InnerProductSpace.ExteriorPower
{n : ℕ} {E : Type u_1} [NormedAddCommGroup E] [InnerProductSpace ℝ E] [FiniteDimensional ℝ E] (x y : Fin n → E) : inner ℝ ((exteriorPower.ιMulti ℝ n) x) ((exteriorPower.ιMulti ℝ n) y) = (Matrix.of fun i j => inner ℝ (x j) (y i)).det - Matrix.measurable_of 📋 Mathlib.Analysis.Matrix.MeasurableSpace
(m : Type u_1) (n : Type u_2) (α : Type u_3) [MeasurableSpace α] : Measurable ⇑Matrix.of - Matrix.coe_ofMeasurableEquiv 📋 Mathlib.Analysis.Matrix.MeasurableSpace
(m : Type u_1) (n : Type u_2) (α : Type u_3) [MeasurableSpace α] : ⇑(Matrix.ofMeasurableEquiv m n α) = ⇑Matrix.of - Matrix.ofMeasurableEquiv_apply 📋 Mathlib.Analysis.Matrix.MeasurableSpace
(m : Type u_1) (n : Type u_2) (α : Type u_3) [MeasurableSpace α] (f : m → n → α) : (Matrix.ofMeasurableEquiv m n α) f = Matrix.of f - Matrix.coe_ofMeasurableEquiv_symm 📋 Mathlib.Analysis.Matrix.MeasurableSpace
(m : Type u_1) (n : Type u_2) (α : Type u_3) [MeasurableSpace α] : ⇑(Matrix.ofMeasurableEquiv m n α).symm = ⇑Matrix.of.symm - Matrix.ofMeasurableEquiv_symm_apply 📋 Mathlib.Analysis.Matrix.MeasurableSpace
(m : Type u_1) (n : Type u_2) (α : Type u_3) [MeasurableSpace α] (M : Matrix m n α) : (Matrix.ofMeasurableEquiv m n α).symm M = Matrix.of.symm M - SimpleGraph.adjMatrix_top 📋 Mathlib.Combinatorics.SimpleGraph.AdjMatrix
{α : Type u_1} {V : Type u_2} [DecidableEq V] [Ring α] : SimpleGraph.adjMatrix α ⊤ = Matrix.of fun i j => if i = j then 0 else 1 - SimpleGraph.adjMatrix_completeGraph_eq_of_one_sub_one 📋 Mathlib.Combinatorics.SimpleGraph.AdjMatrix
(α : Type u_1) (V : Type u_2) [AddGroup α] [One α] [DecidableEq V] : SimpleGraph.adjMatrix α (SimpleGraph.completeGraph V) = Matrix.of 1 - 1 - Matrix.compl_of_one_sub_one 📋 Mathlib.Combinatorics.SimpleGraph.AdjMatrix
(α : Type u_1) (V : Type u_2) [AddGroup α] [One α] [DecidableEq V] [DecidableEq α] : (Matrix.of 1 - 1).compl = 0 - Matrix.compl_zero_eq_of_one_sub_one 📋 Mathlib.Combinatorics.SimpleGraph.AdjMatrix
(α : Type u_1) (V : Type u_2) [AddGroup α] [One α] [DecidableEq V] [DecidableEq α] : Matrix.compl 0 = Matrix.of 1 - 1 - SimpleGraph.one_add_adjMatrix_add_compl_adjMatrix_eq_of_one 📋 Mathlib.Combinatorics.SimpleGraph.AdjMatrix
(α : Type u_1) {V : Type u_2} (G : SimpleGraph V) [DecidableRel G.Adj] [DecidableEq V] [DecidableEq α] [AddMonoid α] [One α] : 1 + SimpleGraph.adjMatrix α G + (SimpleGraph.adjMatrix α G).compl = Matrix.of 1 - SimpleGraph.incMatrix_mul_transpose 📋 Mathlib.Combinatorics.SimpleGraph.IncMatrix
{R : Type u_1} {α : Type u_2} (G : SimpleGraph α) [Fintype (Sym2 α)] [DecidableEq α] [DecidableRel G.Adj] [Semiring R] [G.LocallyFinite] : SimpleGraph.incMatrix R G * (SimpleGraph.incMatrix R G).transpose = Matrix.of fun a b => if a = b then ↑(G.degree a) else if G.Adj a b then 1 else 0 - SimpleGraph.lapMatrix_top 📋 Mathlib.Combinatorics.SimpleGraph.LapMatrix
{V : Type u_1} (R : Type u_2) [Fintype V] [DecidableEq V] [AddGroupWithOne R] : SimpleGraph.lapMatrix R ⊤ = ↑(Fintype.card V) - Matrix.of 1 - Orientation.rotation_eq_matrix_toLin 📋 Mathlib.Geometry.Euclidean.Angle.Oriented.Rotation
{V : Type u_1} [NormedAddCommGroup V] [InnerProductSpace ℝ V] [Fact (Module.finrank ℝ V = 2)] (o : Orientation ℝ V (Fin 2)) (θ : Real.Angle) {x : V} (hx : x ≠ 0) : ↑(o.rotation θ).toLinearEquiv = (Matrix.toLin (o.basisRightAngleRotation x hx) (o.basisRightAngleRotation x hx)) !![θ.cos, -θ.sin; θ.sin, θ.cos] - Matrix.dualNumberEquiv_apply 📋 Mathlib.LinearAlgebra.Matrix.DualNumber
{R n : Type} [CommSemiring R] [Fintype n] [DecidableEq n] (A : Matrix n n (DualNumber R)) : Matrix.dualNumberEquiv A = (Matrix.of fun i j => TrivSqZeroExt.fst (A i j), Matrix.of fun i j => TrivSqZeroExt.snd (A i j)) - Matrix.dualNumberEquiv_symm_apply 📋 Mathlib.LinearAlgebra.Matrix.DualNumber
{R n : Type} [CommSemiring R] [Fintype n] [DecidableEq n] (d : DualNumber (Matrix n n R)) : Matrix.dualNumberEquiv.symm d = Matrix.of fun i j => (TrivSqZeroExt.fst d i j, TrivSqZeroExt.snd d i j) - Matrix.uniqueEquiv_symm_apply 📋 Mathlib.LinearAlgebra.Matrix.Unique
{m : Type u_1} {n : Type u_2} {A : Type u_3} [Unique m] [Unique n] (a : A) : Matrix.uniqueEquiv.symm a = Matrix.of fun x x_1 => a - Matrix.uniqueAddEquiv_symm_apply 📋 Mathlib.LinearAlgebra.Matrix.Unique
{m : Type u_1} {n : Type u_2} {A : Type u_3} [Unique m] [Unique n] [Add A] (a : A) : Matrix.uniqueAddEquiv.symm a = Matrix.of fun x x_1 => a - Matrix.uniqueAlgEquiv_symm_apply 📋 Mathlib.LinearAlgebra.Matrix.Unique
{m : Type u_1} {A : Type u_3} {R : Type u_4} [Unique m] [Semiring A] [CommSemiring R] [Algebra R A] (a : A) : Matrix.uniqueAlgEquiv.symm a = Matrix.of fun x x_1 => a - Matrix.uniqueRingEquiv_symm_apply 📋 Mathlib.LinearAlgebra.Matrix.Unique
{m : Type u_1} {A : Type u_3} [Unique m] [NonUnitalNonAssocSemiring A] (a : A) : Matrix.uniqueRingEquiv.symm a = Matrix.of fun x x_1 => a - convOne_def 📋 Mathlib.LinearAlgebra.Matrix.WithConv
{m : Type u_1} {n : Type u_2} {α : Type u_3} [One α] : 1 = WithConv.toConv (Matrix.of 1) - NumberField.Units.finrank_mul_regulator_eq_det 📋 Mathlib.NumberTheory.NumberField.Units.Regulator
(K : Type u_1) [Field K] [NumberField K] (w' : NumberField.InfinitePlace K) (e : { w // w ≠ w' } ≃ Fin (NumberField.Units.rank K)) : ↑(Module.finrank ℚ K) * NumberField.Units.regulator K = |(Matrix.of fun i w => if h : i = w' then ↑w.mult else ↑w.mult * Real.log (w ((algebraMap (NumberField.RingOfIntegers K) K) ↑(NumberField.Units.fundSystem K (e ⟨i, h⟩))))).det| - NumberField.Units.finrank_mul_regOfFamily_eq_det 📋 Mathlib.NumberTheory.NumberField.Units.Regulator
{K : Type u_1} [Field K] [NumberField K] (u : Fin (NumberField.Units.rank K) → (NumberField.RingOfIntegers K)ˣ) (w' : NumberField.InfinitePlace K) (e : { w // w ≠ w' } ≃ Fin (NumberField.Units.rank K)) : ↑(Module.finrank ℚ K) * NumberField.Units.regOfFamily u = |(Matrix.of fun i w => if h : i = w' then ↑w.mult else ↑w.mult * Real.log (w ((algebraMap (NumberField.RingOfIntegers K) K) ↑(u (e ⟨i, h⟩))))).det| - NumberField.Units.regulator_eq_det 📋 Mathlib.NumberTheory.NumberField.Units.Regulator
(K : Type u_1) [Field K] [NumberField K] (w' : NumberField.InfinitePlace K) (e : { w // w ≠ w' } ≃ Fin (NumberField.Units.rank K)) : NumberField.Units.regulator K = |(Matrix.of fun i w => ↑(↑w).mult * Real.log (↑w ((algebraMap (NumberField.RingOfIntegers K) K) ↑(NumberField.Units.fundSystem K (e i))))).det| - NumberField.Units.regOfFamily_eq_det 📋 Mathlib.NumberTheory.NumberField.Units.Regulator
{K : Type u_1} [Field K] [NumberField K] (u : Fin (NumberField.Units.rank K) → (NumberField.RingOfIntegers K)ˣ) (w' : NumberField.InfinitePlace K) (e : { w // w ≠ w' } ≃ Fin (NumberField.Units.rank K)) : NumberField.Units.regOfFamily u = |(Matrix.of fun i w => ↑(↑w).mult * Real.log (↑w ((algebraMap (NumberField.RingOfIntegers K) K) ↑(u (e i))))).det| - NumberField.Units.regulator_eq_det' 📋 Mathlib.NumberTheory.NumberField.Units.Regulator
(K : Type u_1) [Field K] [NumberField K] : NumberField.Units.regulator K = |(Matrix.of fun i => (NumberField.Units.logEmbedding K) (Additive.ofMul (NumberField.Units.fundSystem K ((NumberField.Units.equivFinRank K).symm i)))).det| - NumberField.Units.regOfFamily_eq_det' 📋 Mathlib.NumberTheory.NumberField.Units.Regulator
{K : Type u_1} [Field K] [NumberField K] (u : Fin (NumberField.Units.rank K) → (NumberField.RingOfIntegers K)ˣ) : NumberField.Units.regOfFamily u = |(Matrix.of fun i => (NumberField.Units.logEmbedding K) (Additive.ofMul (u ((NumberField.Units.equivFinRank K).symm i)))).det| - NumberField.Units.abs_det_eq_abs_det 📋 Mathlib.NumberTheory.NumberField.Units.Regulator
{K : Type u_1} [Field K] [NumberField K] (u : Fin (NumberField.Units.rank K) → (NumberField.RingOfIntegers K)ˣ) {w₁ w₂ : NumberField.InfinitePlace K} (e₁ : { w // w ≠ w₁ } ≃ Fin (NumberField.Units.rank K)) (e₂ : { w // w ≠ w₂ } ≃ Fin (NumberField.Units.rank K)) : |(Matrix.of fun i w => ↑(↑w).mult * Real.log (↑w ((algebraMap (NumberField.RingOfIntegers K) K) ↑(u (e₁ i))))).det| = |(Matrix.of fun i w => ↑(↑w).mult * Real.log (↑w ((algebraMap (NumberField.RingOfIntegers K) K) ↑(u (e₂ i))))).det|
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