Loogle!
Result
Found 175 declarations mentioning Matrix.map.
- Matrix.map 📋 Mathlib.LinearAlgebra.Matrix.Defs
{m : Type u_2} {n : Type u_3} {α : Type v} {β : Type w} (M : Matrix m n α) (f : α → β) : Matrix m n β - Matrix.map_id 📋 Mathlib.LinearAlgebra.Matrix.Defs
{m : Type u_2} {n : Type u_3} {α : Type v} (M : Matrix m n α) : M.map id = M - Matrix.map_id' 📋 Mathlib.LinearAlgebra.Matrix.Defs
{m : Type u_2} {n : Type u_3} {α : Type v} (M : Matrix m n α) : (M.map fun x => x) = M - Matrix.map_involutive 📋 Mathlib.LinearAlgebra.Matrix.Defs
{m : Type u_2} {n : Type u_3} {α : Type v} {f : α → α} (hf : Function.Involutive f) : Function.Involutive fun M => M.map f - Matrix.map_apply 📋 Mathlib.LinearAlgebra.Matrix.Defs
{m : Type u_2} {n : Type u_3} {α : Type v} {β : Type w} {M : Matrix m n α} {f : α → β} {i : m} {j : n} : M.map f i j = f (M i j) - Matrix.map_injective 📋 Mathlib.LinearAlgebra.Matrix.Defs
{m : Type u_2} {n : Type u_3} {α : Type v} {β : Type w} {f : α → β} (hf : Function.Injective f) : Function.Injective fun M => M.map f - Matrix.col_map 📋 Mathlib.LinearAlgebra.Matrix.Defs
{m : Type u_2} {n : Type u_3} {α : Type v} {β : Type w} (A : Matrix m n α) (f : α → β) (j : n) : (A.map f).col j = f ∘ A.col j - Matrix.row_map 📋 Mathlib.LinearAlgebra.Matrix.Defs
{m : Type u_2} {n : Type u_3} {α : Type v} {β : Type w} (A : Matrix m n α) (f : α → β) (i : m) : (A.map f).row i = f ∘ A.row i - 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.map_map 📋 Mathlib.LinearAlgebra.Matrix.Defs
{m : Type u_2} {n : Type u_3} {α : Type v} {M : Matrix m n α} {β : Type u_10} {γ : Type u_11} {f : α → β} {g : β → γ} : (M.map f).map g = M.map (g ∘ f) - Matrix.submatrix_map 📋 Mathlib.LinearAlgebra.Matrix.Defs
{l : Type u_1} {m : Type u_2} {n : Type u_3} {o : Type u_4} {α : Type v} {β : Type w} (f : α → β) (e₁ : l → m) (e₂ : o → n) (A : Matrix m n α) : (A.map f).submatrix e₁ e₂ = (A.submatrix e₁ e₂).map f - Matrix.map_neg 📋 Mathlib.LinearAlgebra.Matrix.Defs
{m : Type u_2} {n : Type u_3} {α : Type v} {β : Type w} [Neg α] [Neg β] (f : α → β) (hf : ∀ (a : α), f (-a) = -f a) (M : Matrix m n α) : (-M).map f = -M.map f - Matrix.map_zero 📋 Mathlib.LinearAlgebra.Matrix.Defs
{m : Type u_2} {n : Type u_3} {α : Type v} {β : Type w} [Zero α] [Zero β] (f : α → β) (h : f 0 = 0) : Matrix.map 0 f = 0 - Matrix.map_smul 📋 Mathlib.LinearAlgebra.Matrix.Defs
{m : Type u_2} {n : Type u_3} {R : Type u_7} {α : Type v} {β : Type w} [SMul R α] [SMul R β] (f : α → β) (r : R) (hf : ∀ (a : α), f (r • a) = r • f a) (M : Matrix m n α) : (r • M).map f = r • M.map f - Matrix.map_smul' 📋 Mathlib.LinearAlgebra.Matrix.Defs
{n : Type u_3} {α : Type v} {β : Type w} [Mul α] [Mul β] (f : α → β) (r : α) (A : Matrix n n α) (hf : ∀ (a₁ a₂ : α), f (a₁ * a₂) = f a₁ * f a₂) : (r • A).map f = f r • A.map f - Matrix.map_smulₛₗ 📋 Mathlib.LinearAlgebra.Matrix.Defs
{m : Type u_2} {n : Type u_3} {R : Type u_7} {S : Type u_8} {α : Type v} {β : Type w} [SMul R α] [SMul S β] (f : α → β) (σ : R → S) (r : R) (hf : ∀ (a : α), f (r • a) = σ r • f a) (M : Matrix m n α) : (r • M).map f = σ r • M.map f - Matrix.map_add 📋 Mathlib.LinearAlgebra.Matrix.Defs
{m : Type u_2} {n : Type u_3} {α : Type v} {β : Type w} [Add α] [Add β] (f : α → β) (hf : ∀ (a₁ a₂ : α), f (a₁ + a₂) = f a₁ + f a₂) (M N : Matrix m n α) : (M + N).map f = M.map f + N.map f - Matrix.map_sub 📋 Mathlib.LinearAlgebra.Matrix.Defs
{m : Type u_2} {n : Type u_3} {α : Type v} {β : Type w} [Sub α] [Sub β] (f : α → β) (hf : ∀ (a₁ a₂ : α), f (a₁ - a₂) = f a₁ - f a₂) (M N : Matrix m n α) : (M - N).map f = M.map f - N.map f - Matrix.map_op_smul' 📋 Mathlib.LinearAlgebra.Matrix.Defs
{n : Type u_3} {α : Type v} {β : Type w} [Mul α] [Mul β] (f : α → β) (r : α) (A : Matrix n n α) (hf : ∀ (a₁ a₂ : α), f (a₁ * a₂) = f a₁ * f a₂) : (MulOpposite.op r • A).map f = MulOpposite.op (f r) • A.map f - Matrix.diag_map 📋 Mathlib.Data.Matrix.Diagonal
{n : Type u_3} {α : Type v} {β : Type w} {f : α → β} {A : Matrix n n α} : (A.map f).diag = f ∘ A.diag - Matrix.diagonal_map 📋 Mathlib.Data.Matrix.Diagonal
{n : Type u_3} {α : Type v} {β : Type w} [DecidableEq n] [Zero α] [Zero β] {f : α → β} (h : f 0 = 0) {d : n → α} : (Matrix.diagonal d).map f = Matrix.diagonal fun m => f (d m) - Matrix.map_natCast 📋 Mathlib.Data.Matrix.Diagonal
{n : Type u_3} {α : Type v} {β : Type w} [DecidableEq n] [AddMonoidWithOne α] [Zero β] {f : α → β} (h : f 0 = 0) (d : ℕ) : (↑d).map f = Matrix.diagonal fun x => f ↑d - Matrix.map_intCast 📋 Mathlib.Data.Matrix.Diagonal
{n : Type u_3} {α : Type v} {β : Type w} [DecidableEq n] [AddGroupWithOne α] [Zero β] {f : α → β} (h : f 0 = 0) (d : ℤ) : (↑d).map f = Matrix.diagonal fun x => f ↑d - Matrix.map_one 📋 Mathlib.Data.Matrix.Diagonal
{n : Type u_3} {α : Type v} {β : Type w} [DecidableEq n] [Zero α] [One α] [Zero β] [One β] (f : α → β) (h₀ : f 0 = 0) (h₁ : f 1 = 1) : Matrix.map 1 f = 1 - Matrix.map_ofNat 📋 Mathlib.Data.Matrix.Diagonal
{n : Type u_3} {α : Type v} {β : Type w} [DecidableEq n] [AddMonoidWithOne α] [Zero β] {f : α → β} (h : f 0 = 0) (d : ℕ) [d.AtLeastTwo] : (OfNat.ofNat d).map f = Matrix.diagonal fun x => f (OfNat.ofNat d) - RingHom.map_mulVec 📋 Mathlib.Data.Matrix.Mul
{m : Type u_2} {n : Type u_3} {R : Type u_7} {S : Type u_8} [Fintype n] [NonAssocSemiring R] [NonAssocSemiring S] (f : R →+* S) (M : Matrix m n R) (v : n → R) (i : m) : f (M.mulVec v i) = (M.map ⇑f).mulVec (⇑f ∘ v) i - RingHom.map_vecMul 📋 Mathlib.Data.Matrix.Mul
{m : Type u_2} {n : Type u_3} {R : Type u_7} {S : Type u_8} [Fintype n] [NonAssocSemiring R] [NonAssocSemiring S] (f : R →+* S) (M : Matrix n m R) (v : n → R) (i : m) : f (Matrix.vecMul v M i) = Matrix.vecMul (⇑f ∘ v) (M.map ⇑f) i - Matrix.map_mul 📋 Mathlib.Data.Matrix.Mul
{m : Type u_2} {n : Type u_3} {o : Type u_4} {α : Type v} {β : Type w} [NonUnitalNonAssocSemiring α] [Fintype n] {L : Matrix m n α} {M : Matrix n o α} [NonUnitalNonAssocSemiring β] {F : Type u_10} [FunLike F α β] [NonUnitalRingHomClass F α β] {f : F} : (L * M).map ⇑f = L.map ⇑f * M.map ⇑f - RingHom.map_matrix_mul 📋 Mathlib.Data.Matrix.Mul
{m : Type u_2} {n : Type u_3} {o : Type u_4} {α : Type v} {β : Type w} [Fintype n] [NonAssocSemiring α] [NonAssocSemiring β] (M : Matrix m n α) (N : Matrix n o α) (i : m) (j : o) (f : α →+* β) : f ((M * N) i j) = (M.map ⇑f * N.map ⇑f) i j - Equiv.mapMatrix_apply 📋 Mathlib.Data.Matrix.Basic
{m : Type u_2} {n : Type u_3} {α : Type u_11} {β : Type u_12} (f : α ≃ β) (M : Matrix m n α) : f.mapMatrix M = M.map ⇑f - Matrix.piEquiv_apply 📋 Mathlib.Data.Matrix.Basic
{m : Type u_2} {n : Type u_3} {ι : Type u_14} {β : ι → Type u_15} (f : Matrix m n ((i : ι) → β i)) (i : ι) : Matrix.piEquiv f i = f.map fun x => x i - RingHom.mapMatrix_apply 📋 Mathlib.Data.Matrix.Basic
{m : Type u_2} {α : Type u_11} {β : Type u_12} [Fintype m] [DecidableEq m] [NonAssocSemiring α] [NonAssocSemiring β] (f : α →+* β) (M : Matrix m m α) : f.mapMatrix M = M.map ⇑f - AddMonoidHom.mapMatrix_apply 📋 Mathlib.Data.Matrix.Basic
{m : Type u_2} {n : Type u_3} {α : Type u_11} {β : Type u_12} [AddZeroClass α] [AddZeroClass β] (f : α →+ β) (M : Matrix m n α) : f.mapMatrix M = M.map ⇑f - AddEquiv.mapMatrix_apply 📋 Mathlib.Data.Matrix.Basic
{m : Type u_2} {n : Type u_3} {α : Type u_11} {β : Type u_12} [Add α] [Add β] (f : α ≃+ β) (M : Matrix m n α) : f.mapMatrix M = M.map ⇑f - Matrix.map_pow 📋 Mathlib.Data.Matrix.Basic
{m : Type u_2} [Fintype m] [DecidableEq m] {α : Type u_14} {β : Type u_15} [Semiring α] [Semiring β] (M : Matrix m m α) (f : α →+* β) (a : ℕ) : (M ^ a).map ⇑f = M.map ⇑f ^ a - AlgEquiv.mapMatrix_apply 📋 Mathlib.Data.Matrix.Basic
{m : Type u_2} {R : Type u_7} {α : Type u_11} {β : Type u_12} [Fintype m] [DecidableEq m] [CommSemiring R] [Semiring α] [Semiring β] [Algebra R α] [Algebra R β] (f : α ≃ₐ[R] β) (M : Matrix m m α) : f.mapMatrix M = M.map ⇑f - AlgHom.mapMatrix_apply 📋 Mathlib.Data.Matrix.Basic
{m : Type u_2} {R : Type u_7} {α : Type u_11} {β : Type u_12} [Fintype m] [DecidableEq m] [CommSemiring R] [Semiring α] [Semiring β] [Algebra R α] [Algebra R β] (f : α →ₐ[R] β) (M : Matrix m m α) : f.mapMatrix M = M.map ⇑f - Matrix.piAddEquiv_apply 📋 Mathlib.Data.Matrix.Basic
{m : Type u_2} {n : Type u_3} {ι : Type u_14} {β : ι → Type u_15} [(i : ι) → Add (β i)] (f : Matrix m n ((i : ι) → β i)) (i : ι) : Matrix.piAddEquiv f i = f.map fun x => x i - LinearMap.mapMatrix_apply 📋 Mathlib.Data.Matrix.Basic
{m : Type u_2} {n : Type u_3} {R : Type u_7} {S : Type u_8} {α : Type u_11} {β : Type u_12} [Semiring R] [Semiring S] {σᵣₛ : R →+* S} [AddCommMonoid α] [AddCommMonoid β] [Module R α] [Module S β] (f : α →ₛₗ[σᵣₛ] β) (M : Matrix m n α) : f.mapMatrix M = M.map ⇑f - AlgEquiv.mopMatrix_apply 📋 Mathlib.Data.Matrix.Basic
{m : Type u_2} {R : Type u_7} {α : Type u_11} [Fintype m] [DecidableEq m] [CommSemiring R] [Semiring α] [Algebra R α] (M : Matrix m m αᵐᵒᵖ) : AlgEquiv.mopMatrix M = MulOpposite.op (M.transpose.map MulOpposite.unop) - RingEquiv.mopMatrix_apply 📋 Mathlib.Data.Matrix.Basic
{m : Type u_2} [Fintype m] {α : Type u_14} [Mul α] [AddCommMonoid α] (M : Matrix m m αᵐᵒᵖ) : RingEquiv.mopMatrix M = MulOpposite.op (M.transpose.map MulOpposite.unop) - Matrix.piAlgEquiv_apply 📋 Mathlib.Data.Matrix.Basic
{n : Type u_3} {ι : Type u_14} {β : ι → Type u_15} (R : Type u_16) [CommSemiring R] [(i : ι) → Semiring (β i)] [(i : ι) → Algebra R (β i)] [Fintype n] [DecidableEq n] (f : Matrix n n ((i : ι) → β i)) (i : ι) : (Matrix.piAlgEquiv R) f i = f.map fun x => x i - Matrix.map_algebraMap 📋 Mathlib.Data.Matrix.Basic
{n : Type u_3} {R : Type u_7} {α : Type u_11} {β : Type u_12} [Fintype n] [DecidableEq n] [CommSemiring R] [Semiring α] [Semiring β] [Algebra R α] [Algebra R β] (r : R) (f : α → β) (hf : f 0 = 0) (hf₂ : f ((algebraMap R α) r) = (algebraMap R β) r) : ((algebraMap R (Matrix n n α)) r).map f = (algebraMap R (Matrix n n β)) r - AlgEquiv.mopMatrix_symm_apply 📋 Mathlib.Data.Matrix.Basic
{m : Type u_2} {R : Type u_7} {α : Type u_11} [Fintype m] [DecidableEq m] [CommSemiring R] [Semiring α] [Algebra R α] (M : (Matrix m m α)ᵐᵒᵖ) : AlgEquiv.mopMatrix.symm M = (MulOpposite.unop M).transpose.map MulOpposite.op - LinearEquiv.mapMatrix_apply 📋 Mathlib.Data.Matrix.Basic
{m : Type u_2} {n : Type u_3} {R : Type u_7} {S : Type u_8} {α : Type u_11} {β : Type u_12} [Semiring R] [Semiring S] [AddCommMonoid α] [AddCommMonoid β] [Module R α] [Module S β] {σᵣₛ : R →+* S} {σₛᵣ : S →+* R} [RingHomInvPair σᵣₛ σₛᵣ] [RingHomInvPair σₛᵣ σᵣₛ] (f : α ≃ₛₗ[σᵣₛ] β) (M : Matrix m n α) : f.mapMatrix M = M.map ⇑f - RingEquiv.mopMatrix_symm_apply 📋 Mathlib.Data.Matrix.Basic
{m : Type u_2} [Fintype m] {α : Type u_14} [Mul α] [AddCommMonoid α] (M : (Matrix m m α)ᵐᵒᵖ) : RingEquiv.mopMatrix.symm M = (MulOpposite.unop M).transpose.map MulOpposite.op - Matrix.piRingEquiv_apply 📋 Mathlib.Data.Matrix.Basic
{n : Type u_3} {ι : Type u_14} {β : ι → Type u_15} [(i : ι) → AddCommMonoid (β i)] [(i : ι) → Mul (β i)] [Fintype n] (f : Matrix n n ((i : ι) → β i)) (i : ι) : Matrix.piRingEquiv f i = f.map fun x => x i - RingEquiv.mapMatrix_apply 📋 Mathlib.Data.Matrix.Basic
{m : Type u_2} {α : Type u_11} {β : Type u_12} [Fintype m] [DecidableEq m] [NonAssocSemiring α] [NonAssocSemiring β] (f : α ≃+* β) (M : Matrix m m α) : f.mapMatrix M = M.map ⇑f - Matrix.map_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 : α) {β : Type u_10} [Zero β] {F : Type u_11} [FunLike F α β] [ZeroHomClass F α β] (f : F) : (Matrix.single i j a).map ⇑f = Matrix.single i j (f a) - Matrix.comp_map_map 📋 Mathlib.Data.Matrix.Composition
{I : Type u_1} {J : Type u_2} {K : Type u_3} {L : Type u_4} {R : Type u_5} (R' : Type u_6) (M : Matrix I J (Matrix K L R)) (f : R → R') : (Matrix.comp I J K L R') (M.map fun M' => M'.map f) = ((Matrix.comp I J K L R) M).map f - 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_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.diag_map_star 📋 Mathlib.LinearAlgebra.Matrix.ConjTranspose
{n : Type u_3} {α : Type v} [Star α] (A : Matrix n n α) : (A.map star).diag = star A.diag - Matrix.conjTranspose_map 📋 Mathlib.LinearAlgebra.Matrix.ConjTranspose
{m : Type u_2} {n : Type u_3} {α : Type v} {β : Type w} [Star α] [Star β] {A : Matrix m n α} (f : α → β) (hf : Function.Semiconj f star star) : A.conjTranspose.map f = (A.map f).conjTranspose - Matrix.map_diagonal_star 📋 Mathlib.LinearAlgebra.Matrix.ConjTranspose
{n : Type u_3} {α : Type v} [DecidableEq n] [AddMonoid α] [StarAddMonoid α] (x : n → α) : (Matrix.diagonal x).map star = Matrix.diagonal (star x) - 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.map_star_eq_diagonal 📋 Mathlib.LinearAlgebra.Matrix.ConjTranspose
{n : Type u_3} {α : Type v} [DecidableEq n] [AddMonoid α] [StarAddMonoid α] {M : Matrix n n α} {v : n → α} : M.map star = Matrix.diagonal v ↔ M = Matrix.diagonal (star v) - Matrix.map_star_eq_zero 📋 Mathlib.LinearAlgebra.Matrix.ConjTranspose
{m : Type u_2} {n : Type u_3} {α : Type v} [AddMonoid α] [StarAddMonoid α] {M : Matrix m n α} : M.map star = 0 ↔ M = 0 - Matrix.map_natCast_star 📋 Mathlib.LinearAlgebra.Matrix.ConjTranspose
{n : Type u_3} {α : Type v} [DecidableEq n] [NonAssocSemiring α] [StarRing α] (d : ℕ) : (↑d).map star = ↑d - Matrix.map_intCast_star 📋 Mathlib.LinearAlgebra.Matrix.ConjTranspose
{n : Type u_3} {α : Type v} [DecidableEq n] [Ring α] [StarRing α] (d : ℤ) : (↑d).map star = ↑d - Matrix.map_star_eq_natCast 📋 Mathlib.LinearAlgebra.Matrix.ConjTranspose
{n : Type u_3} {α : Type v} [DecidableEq n] [NonAssocSemiring α] [StarRing α] {M : Matrix n n α} {d : ℕ} : M.map star = ↑d ↔ M = ↑d - Matrix.map_ofNat_star 📋 Mathlib.LinearAlgebra.Matrix.ConjTranspose
{n : Type u_3} {α : Type v} [DecidableEq n] [NonAssocSemiring α] [StarRing α] (d : ℕ) [d.AtLeastTwo] : (OfNat.ofNat d).map star = OfNat.ofNat d - Matrix.map_star_eq_intCast 📋 Mathlib.LinearAlgebra.Matrix.ConjTranspose
{n : Type u_3} {α : Type v} [DecidableEq n] [Ring α] [StarRing α] {M : Matrix n n α} {d : ℤ} : M.map star = ↑d ↔ M = ↑d - Matrix.map_star_eq_one 📋 Mathlib.LinearAlgebra.Matrix.ConjTranspose
{n : Type u_3} {α : Type v} [DecidableEq n] [NonAssocSemiring α] [StarRing α] {M : Matrix n n α} : M.map star = 1 ↔ M = 1 - Matrix.map_star_eq_ofNat 📋 Mathlib.LinearAlgebra.Matrix.ConjTranspose
{n : Type u_3} {α : Type v} [DecidableEq n] [Semiring α] [StarRing α] {M : Matrix n n α} {d : ℕ} [d.AtLeastTwo] : M.map star = OfNat.ofNat d ↔ M = OfNat.ofNat d - Matrix.blockDiag_map 📋 Mathlib.Data.Matrix.Block
{m : Type u_2} {n : Type u_3} {o : Type u_4} {α : Type u_12} {β : Type u_13} (M : Matrix (m × o) (n × o) α) (f : α → β) : (M.map f).blockDiag = fun k => (M.blockDiag k).map f - Matrix.blockDiag'_map 📋 Mathlib.Data.Matrix.Block
{o : Type u_4} {m' : o → Type u_7} {n' : o → Type u_8} {α : Type u_12} {β : Type u_13} (M : Matrix ((i : o) × m' i) ((i : o) × n' i) α) (f : α → β) : (M.map f).blockDiag' = fun k => (M.blockDiag' k).map f - Matrix.map_toSquareBlock 📋 Mathlib.Data.Matrix.Block
{m : Type u_2} {α : Type u_15} {β : Type u_16} (f : α → β) {M : Matrix m m α} {ι : Type u_18} {b : m → ι} {i : ι} : (M.map f).toSquareBlock b i = (M.toSquareBlock b i).map f - Matrix.blockDiagonal_map 📋 Mathlib.Data.Matrix.Block
{m : Type u_2} {n : Type u_3} {o : Type u_4} {α : Type u_12} {β : Type u_13} [DecidableEq o] [Zero α] [Zero β] (M : o → Matrix m n α) (f : α → β) (hf : f 0 = 0) : (Matrix.blockDiagonal M).map f = Matrix.blockDiagonal fun k => (M k).map f - Matrix.fromBlocks_map 📋 Mathlib.Data.Matrix.Block
{l : Type u_1} {m : Type u_2} {n : Type u_3} {o : Type u_4} {α : Type u_12} {β : Type u_13} (A : Matrix n l α) (B : Matrix n m α) (C : Matrix o l α) (D : Matrix o m α) (f : α → β) : (Matrix.fromBlocks A B C D).map f = Matrix.fromBlocks (A.map f) (B.map f) (C.map f) (D.map f) - Matrix.blockDiagonal'_map 📋 Mathlib.Data.Matrix.Block
{o : Type u_4} {m' : o → Type u_7} {n' : o → Type u_8} {α : Type u_12} {β : Type u_13} [DecidableEq o] [Zero α] [Zero β] (M : (i : o) → Matrix (m' i) (n' i) α) (f : α → β) (hf : f 0 = 0) : (Matrix.blockDiagonal' M).map f = Matrix.blockDiagonal' fun k => (M k).map f - Matrix.map_updateCol 📋 Mathlib.LinearAlgebra.Matrix.RowCol
{m : Type u_2} {n : Type u_3} {α : Type v} {β : Type w} {M : Matrix m n α} {j : n} {c : m → α} [DecidableEq n] (f : α → β) : (M.updateCol j c).map f = (M.map f).updateCol j (f ∘ c) - Matrix.map_updateRow 📋 Mathlib.LinearAlgebra.Matrix.RowCol
{m : Type u_2} {n : Type u_3} {α : Type v} {β : Type w} {M : Matrix m n α} {i : m} {b : n → α} [DecidableEq m] (f : α → β) : (M.updateRow i b).map f = (M.map f).updateRow i (f ∘ b) - LinearMap.restrictScalars_toMatrix 📋 Mathlib.LinearAlgebra.Matrix.ToLin
{R : Type u_1} [CommSemiring R] {m : Type u_3} [Fintype m] [DecidableEq m] {A : Type u_4} {M : Type u_5} {n : Type u_6} [Fintype n] [DecidableEq n] [CommSemiring A] [AddCommMonoid M] [Module R M] [Module A M] [Algebra R A] [IsScalarTower R A M] (bA : Module.Basis m R A) (bM : Module.Basis n A M) (f : M →ₗ[A] M) : (LinearMap.toMatrix (bA.smulTower' bM) (bA.smulTower' bM)) (↑R f) = (Matrix.comp n n m m R) (((LinearMap.toMatrix bM bM) f).map ⇑(Algebra.leftMulMatrix bA)) - Int.cast_det 📋 Mathlib.LinearAlgebra.Matrix.Determinant.Basic
{n : Type u_2} [DecidableEq n] [Fintype n] {R : Type v} [CommRing R] (M : Matrix n n ℤ) : ↑M.det = (M.map fun x => ↑x).det - Rat.cast_det 📋 Mathlib.LinearAlgebra.Matrix.Determinant.Basic
{n : Type u_2} [DecidableEq n] [Fintype n] {F : Type u_3} [Field F] [CharZero F] (M : Matrix n n ℚ) : ↑M.det = (M.map fun x => ↑x).det - Matrix.IsSymm.map 📋 Mathlib.LinearAlgebra.Matrix.Symmetric
{α : Type u_1} {β : Type u_2} {n : Type u_3} {A : Matrix n n α} (h : A.IsSymm) (f : α → β) : (A.map f).IsSymm - Matrix.isSymm_map_iff 📋 Mathlib.LinearAlgebra.Matrix.Symmetric
{α : Type u_1} {β : Type u_2} {n : Type u_3} {A : Matrix n n α} {f : α → β} (hf : Function.Injective f) : (A.map f).IsSymm ↔ A.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.mvPolynomialX_map_eval₂ 📋 Mathlib.LinearAlgebra.Matrix.MvPolynomial
{m : Type u_1} {n : Type u_2} {R : Type u_3} {S : Type u_4} [CommSemiring R] [CommSemiring S] (f : R →+* S) (A : Matrix m n S) : (Matrix.mvPolynomialX m n R).map (MvPolynomial.eval₂ f fun p => A p.1 p.2) = A - Polynomial.leadingCoeff_det_X_one_add_C 📋 Mathlib.LinearAlgebra.Matrix.Polynomial
{n : Type u_1} {α : Type u_2} [DecidableEq n] [Fintype n] [CommRing α] (A : Matrix n n α) : (Polynomial.X • 1 + A.map ⇑Polynomial.C).det.leadingCoeff = 1 - Polynomial.natDegree_det_X_add_C_le 📋 Mathlib.LinearAlgebra.Matrix.Polynomial
{n : Type u_1} {α : Type u_2} [DecidableEq n] [Fintype n] [CommRing α] (A B : Matrix n n α) : (Polynomial.X • A.map ⇑Polynomial.C + B.map ⇑Polynomial.C).det.natDegree ≤ Fintype.card n - Polynomial.coeff_det_X_add_C_card 📋 Mathlib.LinearAlgebra.Matrix.Polynomial
{n : Type u_1} {α : Type u_2} [DecidableEq n] [Fintype n] [CommRing α] (A B : Matrix n n α) : (Polynomial.X • A.map ⇑Polynomial.C + B.map ⇑Polynomial.C).det.coeff (Fintype.card n) = A.det - Polynomial.coeff_det_X_add_C_zero 📋 Mathlib.LinearAlgebra.Matrix.Polynomial
{n : Type u_1} {α : Type u_2} [DecidableEq n] [Fintype n] [CommRing α] (A B : Matrix n n α) : (Polynomial.X • A.map ⇑Polynomial.C + B.map ⇑Polynomial.C).det.coeff 0 = B.det - AddMonoidHom.map_trace 📋 Mathlib.LinearAlgebra.Matrix.Trace
{n : Type u_3} {R : Type u_6} {S : Type u_7} [Fintype n] [AddCommMonoid R] [AddCommMonoid S] {F : Type u_8} [FunLike F R S] [AddMonoidHomClass F R S] (f : F) (A : Matrix n n R) : f A.trace = (A.map ⇑f).trace - Matrix.kroneckerMap_map_left 📋 Mathlib.LinearAlgebra.Matrix.Kronecker
{α : Type u_3} {α' : Type u_4} {β : Type u_5} {γ : Type u_7} {l : Type u_9} {m : Type u_10} {n : Type u_11} {p : Type u_12} (f : α' → β → γ) (g : α → α') (A : Matrix l m α) (B : Matrix n p β) : Matrix.kroneckerMap f (A.map g) B = Matrix.kroneckerMap (fun a b => f (g a) b) A B - Matrix.kroneckerMap_map_right 📋 Mathlib.LinearAlgebra.Matrix.Kronecker
{α : Type u_3} {β : Type u_5} {β' : Type u_6} {γ : Type u_7} {l : Type u_9} {m : Type u_10} {n : Type u_11} {p : Type u_12} (f : α → β' → γ) (g : β → β') (A : Matrix l m α) (B : Matrix n p β) : Matrix.kroneckerMap f A (B.map g) = Matrix.kroneckerMap (fun a b => f a (g b)) A B - Matrix.kroneckerMap_map 📋 Mathlib.LinearAlgebra.Matrix.Kronecker
{α : Type u_3} {β : Type u_5} {γ : Type u_7} {γ' : Type u_8} {l : Type u_9} {m : Type u_10} {n : Type u_11} {p : Type u_12} (f : α → β → γ) (g : γ → γ') (A : Matrix l m α) (B : Matrix n p β) : (Matrix.kroneckerMap f A B).map g = Matrix.kroneckerMap (fun a b => g (f a b)) A B - Matrix.kroneckerMap_diagonal_right 📋 Mathlib.LinearAlgebra.Matrix.Kronecker
{α : Type u_3} {β : Type u_5} {γ : Type u_7} {l : Type u_9} {m : Type u_10} {n : Type u_11} [Zero β] [Zero γ] [DecidableEq n] (f : α → β → γ) (hf : ∀ (a : α), f a 0 = 0) (A : Matrix l m α) (b : n → β) : Matrix.kroneckerMap f A (Matrix.diagonal b) = Matrix.blockDiagonal fun i => A.map fun a => f a (b i) - Matrix.kroneckerTMul_diagonal 📋 Mathlib.LinearAlgebra.Matrix.Kronecker
(R : Type u_1) {α : Type u_3} {β : Type u_5} {l : Type u_9} {m : Type u_10} {n : Type u_11} [CommSemiring R] [AddCommMonoid α] [AddCommMonoid β] [Module R α] [Module R β] [DecidableEq n] (A : Matrix l m α) (b : n → β) : Matrix.kroneckerMap (TensorProduct.tmul R) A (Matrix.diagonal b) = Matrix.blockDiagonal fun i => A.map fun a => a ⊗ₜ[R] b i - Matrix.kroneckerMap_diagonal_left 📋 Mathlib.LinearAlgebra.Matrix.Kronecker
{α : Type u_3} {β : Type u_5} {γ : Type u_7} {l : Type u_9} {m : Type u_10} {n : Type u_11} [Zero α] [Zero γ] [DecidableEq l] (f : α → β → γ) (hf : ∀ (b : β), f 0 b = 0) (a : l → α) (B : Matrix m n β) : Matrix.kroneckerMap f (Matrix.diagonal a) B = (Matrix.reindex (Equiv.prodComm m l) (Equiv.prodComm n l)) (Matrix.blockDiagonal fun i => B.map fun b => f (a i) b) - Matrix.diagonal_kroneckerTMul 📋 Mathlib.LinearAlgebra.Matrix.Kronecker
(R : Type u_1) {α : Type u_3} {β : Type u_5} {l : Type u_9} {m : Type u_10} {n : Type u_11} [CommSemiring R] [AddCommMonoid α] [AddCommMonoid β] [Module R α] [Module R β] [DecidableEq l] (a : l → α) (B : Matrix m n β) : Matrix.kroneckerMap (TensorProduct.tmul R) (Matrix.diagonal a) B = (Matrix.reindex (Equiv.prodComm m l) (Equiv.prodComm n l)) (Matrix.blockDiagonal fun i => B.map fun b => a i ⊗ₜ[R] b) - Matrix.kroneckerTMul_assoc' 📋 Mathlib.LinearAlgebra.Matrix.Kronecker
(R : Type u_1) {α : Type u_3} {β : Type u_5} {γ : Type u_7} {l : Type u_9} {m : Type u_10} {n : Type u_11} {p : Type u_12} {q : Type u_13} {r : Type u_14} [CommSemiring R] [AddCommMonoid α] [AddCommMonoid β] [AddCommMonoid γ] [Module R α] [Module R β] [Module R γ] (A : Matrix l m α) (B : Matrix n p β) (C : Matrix q r γ) : ((Matrix.kroneckerMap (TensorProduct.tmul R) (Matrix.kroneckerMap (TensorProduct.tmul R) A B) C).map ⇑(TensorProduct.assoc R α β γ)).submatrix ⇑(Equiv.prodAssoc l n q).symm ⇑(Equiv.prodAssoc m p r).symm = Matrix.kroneckerMap (TensorProduct.tmul R) A (Matrix.kroneckerMap (TensorProduct.tmul R) B C) - Matrix.kroneckerTMul_assoc 📋 Mathlib.LinearAlgebra.Matrix.Kronecker
(R : Type u_1) {α : Type u_3} {β : Type u_5} {γ : Type u_7} {l : Type u_9} {m : Type u_10} {n : Type u_11} {p : Type u_12} {q : Type u_13} {r : Type u_14} [CommSemiring R] [AddCommMonoid α] [AddCommMonoid β] [AddCommMonoid γ] [Module R α] [Module R β] [Module R γ] (A : Matrix l m α) (B : Matrix n p β) (C : Matrix q r γ) : (Matrix.reindex (Equiv.prodAssoc l n q) (Equiv.prodAssoc m p r)) ((Matrix.kroneckerMap (TensorProduct.tmul R) (Matrix.kroneckerMap (TensorProduct.tmul R) A B) C).map ⇑(TensorProduct.assoc R α β γ)) = Matrix.kroneckerMap (TensorProduct.tmul R) A (Matrix.kroneckerMap (TensorProduct.tmul R) B C) - Matrix.det_kroneckerMapBilinear 📋 Mathlib.LinearAlgebra.Matrix.Kronecker
{R : Type u_1} {S : Type u_2} {α : Type u_3} {β : Type u_5} {γ : Type u_7} {m : Type u_10} {n : Type u_11} [Semiring S] [Semiring R] [Fintype m] [Fintype n] [DecidableEq m] [DecidableEq n] [NonAssocSemiring α] [NonAssocSemiring β] [CommRing γ] [Module R α] [Module S β] [Module R γ] [Module S γ] [SMulCommClass S R γ] (f : α →ₗ[R] β →ₗ[S] γ) (h_comm : ∀ (a b : α) (a' b' : β), (f (a * b)) (a' * b') = (f a) a' * (f b) b') (A : Matrix m m α) (B : Matrix n n β) : (((Matrix.kroneckerMapBilinear f) A) B).det = (A.map fun a => (f a) 1).det ^ Fintype.card n * (B.map fun b => (f 1) b).det ^ Fintype.card m - Matrix.BlockTriangular.map 📋 Mathlib.LinearAlgebra.Matrix.Block
{α : Type u_1} {m : Type u_3} {R : Type v} {M : Matrix m m R} {b : m → α} [LT α] {S : Type u_9} {F : Type u_10} [FunLike F R S] [Zero R] [Zero S] [ZeroHomClass F R S] (f : F) (h : M.BlockTriangular b) : (M.map ⇑f).BlockTriangular b - MatrixEquivTensor.invFun_algebraMap 📋 Mathlib.RingTheory.MatrixAlgebra
(n : Type u_3) (R : Type u_5) (A : Type u_7) [CommSemiring R] [Semiring A] [Algebra R A] [DecidableEq n] [Fintype n] (M : Matrix n n R) : MatrixEquivTensor.invFun n R A (M.map ⇑(algebraMap R A)) = 1 ⊗ₜ[R] M - MatrixEquivTensor.toFunAlgHom_apply 📋 Mathlib.RingTheory.MatrixAlgebra
(n : Type u_3) (R : Type u_5) (A : Type u_7) [CommSemiring R] [Semiring A] [Algebra R A] [DecidableEq n] [Fintype n] (a : A) (m : Matrix n n R) : (MatrixEquivTensor.toFunAlgHom n R A) (a ⊗ₜ[R] m) = a • m.map ⇑(algebraMap R A) - matrixEquivTensor_apply_symm 📋 Mathlib.RingTheory.MatrixAlgebra
(n : Type u_3) (R : Type u_5) (A : Type u_7) [CommSemiring R] [Semiring A] [Algebra R A] [Fintype n] [DecidableEq n] (a : A) (M : Matrix n n R) : (matrixEquivTensor n R A).symm (a ⊗ₜ[R] M) = a • M.map ⇑(algebraMap R A) - MatrixEquivTensor.toFunBilinear_apply 📋 Mathlib.RingTheory.MatrixAlgebra
(n : Type u_3) (R : Type u_5) (A : Type u_7) [CommSemiring R] [Semiring A] [Algebra R A] (a : A) (m : Matrix n n R) : ((MatrixEquivTensor.toFunBilinear n R A) a) m = a • m.map ⇑(algebraMap R A) - eval_det_add_X_smul 📋 Mathlib.RingTheory.MatrixPolynomialAlgebra
{n : Type w} [DecidableEq n] [Fintype n] {R : Type u_3} [CommRing R] (A : Matrix n n (Polynomial R)) (M : Matrix n n R) : Polynomial.eval 0 (A + Polynomial.X • M.map ⇑Polynomial.C).det = Polynomial.eval 0 A.det - matPolyEquiv_eval_eq_map 📋 Mathlib.RingTheory.MatrixPolynomialAlgebra
{R : Type u_1} [CommSemiring R] {n : Type w} [DecidableEq n] [Fintype n] (M : Matrix n n (Polynomial R)) (r : R) : Polynomial.eval ((Matrix.scalar n) r) (matPolyEquiv M) = M.map (Polynomial.eval r) - matPolyEquiv_symm_map_eval 📋 Mathlib.RingTheory.MatrixPolynomialAlgebra
{R : Type u_1} [CommSemiring R] {n : Type w} [DecidableEq n] [Fintype n] (M : Polynomial (Matrix n n R)) (r : R) : (matPolyEquiv.symm M).map (Polynomial.eval r) = Polynomial.eval ((Matrix.scalar n) r) M - matPolyEquiv_map_C 📋 Mathlib.RingTheory.MatrixPolynomialAlgebra
{R : Type u_1} [CommSemiring R] {n : Type w} [DecidableEq n] [Fintype n] (M : Matrix n n R) : matPolyEquiv (M.map ⇑Polynomial.C) = Polynomial.C M - matPolyEquiv_symm_C 📋 Mathlib.RingTheory.MatrixPolynomialAlgebra
{R : Type u_1} [CommSemiring R] {n : Type w} [DecidableEq n] [Fintype n] (M : Matrix n n R) : matPolyEquiv.symm (Polynomial.C M) = M.map ⇑Polynomial.C - Matrix.charpoly_map 📋 Mathlib.LinearAlgebra.Matrix.Charpoly.Basic
{R : Type u_1} {S : Type u_2} [CommRing R] [CommRing S] {n : Type u_4} [DecidableEq n] [Fintype n] (M : Matrix n n R) (f : R →+* S) : (M.map ⇑f).charpoly = Polynomial.map f M.charpoly - Matrix.charmatrix_map 📋 Mathlib.LinearAlgebra.Matrix.Charpoly.Basic
{R : Type u_1} {S : Type u_2} [CommRing R] [CommRing S] {n : Type u_4} [DecidableEq n] [Fintype n] (M : Matrix n n R) (f : R →+* S) : (M.map ⇑f).charmatrix = M.charmatrix.map (Polynomial.map f) - Matrix.charmatrix_fromBlocks 📋 Mathlib.LinearAlgebra.Matrix.Charpoly.Basic
{R : Type u_1} [CommRing R] {m : Type u_3} {n : Type u_4} [DecidableEq m] [DecidableEq n] [Fintype m] [Fintype n] (M₁₁ : Matrix m m R) (M₁₂ : Matrix m n R) (M₂₁ : Matrix n m R) (M₂₂ : Matrix n n R) : (Matrix.fromBlocks M₁₁ M₁₂ M₂₁ M₂₂).charmatrix = Matrix.fromBlocks M₁₁.charmatrix (-M₁₂.map ⇑Polynomial.C) (-M₂₁.map ⇑Polynomial.C) M₂₂.charmatrix - Matrix.coeff_det_one_add_X_smul_one 📋 Mathlib.LinearAlgebra.Matrix.Charpoly.Coeff
{R : Type u} [CommRing R] {n : Type v} [DecidableEq n] [Fintype n] (M : Matrix n n R) : (1 + Polynomial.X • M.map ⇑Polynomial.C).det.coeff 1 = M.trace - Matrix.coeff_det_one_add_X_smul_eq_sum_minors 📋 Mathlib.LinearAlgebra.Matrix.Charpoly.Coeff
{R : Type u} [CommRing R] {n : Type v} [DecidableEq n] [Fintype n] (M : Matrix n n R) (k : ℕ) : (1 + Polynomial.X • M.map ⇑Polynomial.C).det.coeff k = ∑ s ∈ Finset.powersetCard k Finset.univ, (M.submatrix Subtype.val Subtype.val).det - Matrix.det_one_add_smul 📋 Mathlib.LinearAlgebra.Matrix.Charpoly.Coeff
{R : Type u} [CommRing R] {n : Type v} [DecidableEq n] [Fintype n] (r : R) (M : Matrix n n R) : (1 + r • M).det = 1 + M.trace * r + Polynomial.eval r (1 + Polynomial.X • M.map ⇑Polynomial.C).det.divX.divX * r ^ 2 - Matrix.derivative_det_one_add_X_smul 📋 Mathlib.LinearAlgebra.Matrix.Charpoly.Coeff
{R : Type u} [CommRing R] {n : Type v} [DecidableEq n] [Fintype n] (M : Matrix n n R) : Polynomial.eval 0 (Polynomial.derivative (1 + Polynomial.X • M.map ⇑Polynomial.C).det) = M.trace - Matrix.derivative_det_one_add_X_smul_aux 📋 Mathlib.LinearAlgebra.Matrix.Charpoly.Coeff
{R : Type u} [CommRing R] {n : ℕ} (M : Matrix (Fin n) (Fin n) R) : Polynomial.eval 0 (Polynomial.derivative (1 + Polynomial.X • M.map ⇑Polynomial.C).det) = M.trace - Matrix.det_one_add_X_smul 📋 Mathlib.LinearAlgebra.Matrix.Charpoly.Coeff
{R : Type u} [CommRing R] {n : Type v} [DecidableEq n] [Fintype n] (M : Matrix n n R) : (1 + Polynomial.X • M.map ⇑Polynomial.C).det = 1 + M.trace • Polynomial.X + (1 + Polynomial.X • M.map ⇑Polynomial.C).det.divX.divX * Polynomial.X ^ 2 - Module.Basis.toMatrix_map_vecMul 📋 Mathlib.LinearAlgebra.Matrix.Basis
{ι : Type u_1} {ι' : Type u_2} {R : Type u_5} [CommSemiring R] {S : Type u_9} [Semiring S] [Algebra R S] [Fintype ι] (b : Module.Basis ι R S) (v : ι' → S) : Matrix.vecMul (⇑b) ((b.toMatrix v).map ⇑(algebraMap R S)) = v - Matrix.SpecialLinearGroup.coe_matrix_coe 📋 Mathlib.LinearAlgebra.Matrix.SpecialLinearGroup
{n : Type u} [DecidableEq n] [Fintype n] {R : Type v} [CommRing R] (g : Matrix.SpecialLinearGroup n ℤ) : ↑((Matrix.SpecialLinearGroup.map (Int.castRingHom R)) g) = (↑g).map ⇑(Int.castRingHom R) - Matrix.GeneralLinearGroup.coe_map_inv_mul_map 📋 Mathlib.LinearAlgebra.Matrix.GeneralLinearGroup.Defs
{n : Type u} [DecidableEq n] [Fintype n] {R : Type v} [CommRing R] {S : Type u_1} [CommRing S] (f : R →+* S) (g : GL n R) : (↑g)⁻¹.map ⇑f * (↑g).map ⇑f = 1 - Matrix.GeneralLinearGroup.coe_map_mul_map_inv 📋 Mathlib.LinearAlgebra.Matrix.GeneralLinearGroup.Defs
{n : Type u} [DecidableEq n] [Fintype n] {R : Type v} [CommRing R] {S : Type u_1} [CommRing S] (f : R →+* S) (g : GL n R) : (↑g).map ⇑f * (↑g)⁻¹.map ⇑f = 1 - Matrix.GeneralLinearGroup.val_map_apply 📋 Mathlib.LinearAlgebra.Matrix.GeneralLinearGroup.Defs
{n : Type u} [DecidableEq n] [Fintype n] {R : Type v} [CommRing R] {S : Type u_1} [CommRing S] (f : R →+* S) (u : (Matrix n n R)ˣ) : ↑((Matrix.GeneralLinearGroup.map f) u) = (↑u).map ⇑f - LinearMap.toMatrix_baseChange 📋 Mathlib.RingTheory.TensorProduct.Free
{R : Type u_1} {M₁ : Type u_2} {M₂ : Type u_3} {ι : Type u_4} {ι₂ : Type u_5} (A : Type u_6) [Fintype ι] [Finite ι₂] [DecidableEq ι] [CommSemiring R] [CommSemiring A] [Algebra R A] [AddCommMonoid M₁] [Module R M₁] [AddCommMonoid M₂] [Module R M₂] (f : M₁ →ₗ[R] M₂) (b₁ : Module.Basis ι R M₁) (b₂ : Module.Basis ι₂ R M₂) : (LinearMap.toMatrix (Algebra.TensorProduct.basis A b₁) (Algebra.TensorProduct.basis A b₂)) (LinearMap.baseChange A f) = ((LinearMap.toMatrix b₁ b₂) f).map ⇑(algebraMap R A) - RootPairing.Base.cartanMatrix_map_abs 📋 Mathlib.LinearAlgebra.RootSystem.CartanMatrix
{ι : Type u_1} {R : Type u_2} {M : Type u_3} {N : Type u_4} [CommRing R] [AddCommGroup M] [Module R M] [AddCommGroup N] [Module R N] {P : RootPairing ι R M N} (b : P.Base) [P.IsCrystallographic] [CharZero R] [IsDomain R] [Finite ι] [DecidableEq ι] : b.cartanMatrix.map abs = 4 - b.cartanMatrix - RootPairing.Base.cartanMatrixIn_mul_diagonal_eq 📋 Mathlib.LinearAlgebra.RootSystem.CartanMatrix
{ι : Type u_1} {R : Type u_2} {M : Type u_3} {N : Type u_4} [CommRing R] [AddCommGroup M] [Module R M] [AddCommGroup N] [Module R N] (S : Type u_5) [CommRing S] [Algebra S R] {P : RootPairing ι R M N} [P.IsRootSystem] [P.IsValuedIn S] (B : P.InvariantForm) (b : P.Base) [DecidableEq ι] : ((RootPairing.Base.cartanMatrixIn S b).map ⇑(algebraMap S R) * Matrix.diagonal fun i => (B.form (P.root ↑i)) (P.root ↑i)) = 2 • (LinearMap.BilinForm.toMatrix b.toWeightBasis) B.form - Matrix.toMvPolynomial_map 📋 Mathlib.Algebra.Module.LinearMap.Polynomial
{m : Type u_1} {n : Type u_2} {R : Type u_4} {S : Type u_5} [Fintype n] [CommSemiring R] [CommSemiring S] (f : R →+* S) (M : Matrix m n R) (i : m) : (M.map ⇑f).toMvPolynomial i = (MvPolynomial.map f) (M.toMvPolynomial i) - Topology.IsClosedEmbedding.matrix_map 📋 Mathlib.Topology.Instances.Matrix
{m : Type u_11} {n : Type u_12} {R : Type u_13} {S : Type u_14} [TopologicalSpace R] [TopologicalSpace S] {f : R → S} (hf : Topology.IsClosedEmbedding f) : Topology.IsClosedEmbedding fun x => x.map f - Topology.IsEmbedding.matrix_map 📋 Mathlib.Topology.Instances.Matrix
{m : Type u_11} {n : Type u_12} {R : Type u_13} {S : Type u_14} [TopologicalSpace R] [TopologicalSpace S] {f : R → S} (hf : Topology.IsEmbedding f) : Topology.IsEmbedding fun x => x.map f - Topology.IsInducing.matrix_map 📋 Mathlib.Topology.Instances.Matrix
{m : Type u_11} {n : Type u_12} {R : Type u_13} {S : Type u_14} [TopologicalSpace R] [TopologicalSpace S] {f : R → S} (hf : Topology.IsInducing f) : Topology.IsInducing fun x => x.map f - Topology.IsOpenEmbedding.matrix_map 📋 Mathlib.Topology.Instances.Matrix
{m : Type u_11} {n : Type u_12} {R : Type u_13} {S : Type u_14} [TopologicalSpace R] [TopologicalSpace S] {f : R → S} [Finite m] [Finite n] (hf : Topology.IsOpenEmbedding f) : Topology.IsOpenEmbedding fun x => x.map f - Continuous.matrix_map 📋 Mathlib.Topology.Instances.Matrix
{X : Type u_1} {m : Type u_4} {n : Type u_5} {S : Type u_7} {R : Type u_8} [TopologicalSpace X] [TopologicalSpace R] [TopologicalSpace S] {A : X → Matrix m n S} {f : S → R} (hA : Continuous A) (hf : Continuous f) : Continuous fun x => (A x).map f - Matrix.map_star_mem_unitaryGroup_iff 📋 Mathlib.LinearAlgebra.UnitaryGroup
{n : Type u} [DecidableEq n] [Fintype n] {α : Type v} [CommRing α] [StarRing α] {U : Matrix n n α} : U.map star ∈ Matrix.unitaryGroup n α ↔ U ∈ Matrix.unitaryGroup n α - Matrix.UnitaryGroup.map_star_coe 📋 Mathlib.LinearAlgebra.UnitaryGroup
{n : Type u} [DecidableEq n] [Fintype n] {α : Type v} [CommRing α] [StarRing α] (U : ↥(Matrix.unitaryGroup n α)) : ↑(Matrix.UnitaryGroup.map_star U) = (↑U).map star - Matrix.intrinsicStar_toLin' 📋 Mathlib.Algebra.Star.LinearMap
{R : Type u_4} {m : Type u_5} {n : Type u_6} [CommSemiring R] [StarRing R] [Fintype m] [DecidableEq m] (A : Matrix n m R) : star (WithConv.toConv (Matrix.toLin' A)) = WithConv.toConv (Matrix.toLin' (A.map star)) - LinearMap.toMatrix'_intrinsicStar 📋 Mathlib.Algebra.Star.LinearMap
{R : Type u_4} {m : Type u_5} {n : Type u_6} [CommSemiring R] [StarRing R] [Fintype m] [DecidableEq m] (f : WithConv ((m → R) →ₗ[R] n → R)) : LinearMap.toMatrix' (star f).ofConv = (LinearMap.toMatrix' f.ofConv).map star - Algebra.traceMatrix_of_matrix_mulVec 📋 Mathlib.RingTheory.Trace.Basic
{κ : Type w} {A : Type u} {B : Type v} [CommRing A] [CommRing B] [Algebra A B] [Fintype κ] (b : κ → B) (P : Matrix κ κ A) : Algebra.traceMatrix A ((P.map ⇑(algebraMap A B)).mulVec b) = P * Algebra.traceMatrix A b * P.transpose - Algebra.traceMatrix_of_matrix_vecMul 📋 Mathlib.RingTheory.Trace.Basic
{κ : Type w} {A : Type u} {B : Type v} [CommRing A] [CommRing B] [Algebra A B] [Fintype κ] (b : κ → B) (P : Matrix κ κ A) : Algebra.traceMatrix A (Matrix.vecMul b (P.map ⇑(algebraMap A B))) = P.transpose * Algebra.traceMatrix A b * P - Algebra.traceMatrix_eq_embeddingsMatrixReindex_mul_trans 📋 Mathlib.RingTheory.Trace.Basic
(K : Type u_4) {L : Type u_5} [Field K] [Field L] [Algebra K L] {κ : Type w} (E : Type z) [Field E] [Algebra K E] [Module.Finite K L] [Algebra.IsSeparable K L] [IsAlgClosed E] (b : κ → L) [Fintype κ] (e : κ ≃ (L →ₐ[K] E)) : (Algebra.traceMatrix K b).map ⇑(algebraMap K E) = Algebra.embeddingsMatrixReindex K E b e * (Algebra.embeddingsMatrixReindex K E b e).transpose - Algebra.traceMatrix_eq_embeddingsMatrix_mul_trans 📋 Mathlib.RingTheory.Trace.Basic
(K : Type u_4) {L : Type u_5} [Field K] [Field L] [Algebra K L] {κ : Type w} (E : Type z) [Field E] [Algebra K E] [Module.Finite K L] [Algebra.IsSeparable K L] [IsAlgClosed E] (b : κ → L) : (Algebra.traceMatrix K b).map ⇑(algebraMap K E) = Algebra.embeddingsMatrix K E b * (Algebra.embeddingsMatrix K E b).transpose - Algebra.PreSubmersivePresentation.jacobiMatrix_reindex 📋 Mathlib.RingTheory.Extension.Presentation.Submersive
{R : Type u} {S : Type v} {ι : Type w} {σ : Type t} [CommRing R] [CommRing S] [Algebra R S] (P : Algebra.PreSubmersivePresentation R S ι σ) {ι' : Type u_1} {σ' : Type u_2} (e : ι' ≃ ι) (f : σ' ≃ σ) [Fintype σ'] [DecidableEq σ'] [Fintype σ] [DecidableEq σ] : (P.reindex e f).jacobiMatrix = ((Matrix.reindex f.symm f.symm) P.jacobiMatrix).map ⇑(MvPolynomial.rename ⇑e.symm) - Matrix.frobenius_norm_map_eq 📋 Mathlib.Analysis.Matrix.Normed
{m : Type u_3} {n : Type u_4} {α : Type u_5} {β : Type u_6} [Fintype m] [Fintype n] [SeminormedAddCommGroup α] [SeminormedAddCommGroup β] (A : Matrix m n α) (f : α → β) (hf : ∀ (a : α), ‖f a‖ = ‖a‖) : ‖A.map f‖ = ‖A‖ - Matrix.norm_map_eq 📋 Mathlib.Analysis.Matrix.Normed
{m : Type u_3} {n : Type u_4} {α : Type u_5} {β : Type u_6} [Fintype m] [Fintype n] [SeminormedAddCommGroup α] [SeminormedAddCommGroup β] (A : Matrix m n α) (f : α → β) (hf : ∀ (a : α), ‖f a‖ = ‖a‖) : ‖A.map f‖ = ‖A‖ - Matrix.frobenius_nnnorm_map_eq 📋 Mathlib.Analysis.Matrix.Normed
{m : Type u_3} {n : Type u_4} {α : Type u_5} {β : Type u_6} [Fintype m] [Fintype n] [SeminormedAddCommGroup α] [SeminormedAddCommGroup β] (A : Matrix m n α) (f : α → β) (hf : ∀ (a : α), ‖f a‖₊ = ‖a‖₊) : ‖A.map f‖₊ = ‖A‖₊ - Matrix.nnnorm_map_eq 📋 Mathlib.Analysis.Matrix.Normed
{m : Type u_3} {n : Type u_4} {α : Type u_5} {β : Type u_6} [Fintype m] [Fintype n] [SeminormedAddCommGroup α] [SeminormedAddCommGroup β] (A : Matrix m n α) (f : α → β) (hf : ∀ (a : α), ‖f a‖₊ = ‖a‖₊) : ‖A.map f‖₊ = ‖A‖₊ - CStarMatrix.map_map 📋 Mathlib.Analysis.CStarAlgebra.CStarMatrix
{m : Type u_1} {n : Type u_2} {A : Type u_5} {B : Type u_6} {C : Type u_7} {M : Matrix m n A} {f : A → B} {g : B → C} : (M.map f).map g = M.map (g ∘ f) - Matrix.det_det 📋 Mathlib.RingTheory.Norm.Transitivity
{R : Type u_1} {S : Type u_2} {n : Type u_4} {m : Type u_5} [CommRing R] [CommRing S] (M : Matrix m m S) [DecidableEq m] [DecidableEq n] [Fintype m] [Fintype n] (f : S →+* Matrix n n R) : (f M.det).det = ((Matrix.comp m m n n R) (M.map ⇑f)).det - Algebra.Norm.Transitivity.eval_zero_comp_det 📋 Mathlib.RingTheory.Norm.Transitivity
{R : Type u_1} {S : Type u_2} {n : Type u_4} {m : Type u_5} [CommRing R] [CommRing S] (M : Matrix m m S) [DecidableEq m] [DecidableEq n] (k : m) [Fintype m] [Fintype n] (f : S →+* Matrix n n R) : Polynomial.eval 0 ((Matrix.comp m m n n (Polynomial R)) ((Algebra.Norm.Transitivity.cornerAddX M k).map ⇑f.polyToMatrix)).det = ((Matrix.comp m m n n R) (M.map ⇑f)).det - Algebra.Norm.Transitivity.comp_det_mul_pow 📋 Mathlib.RingTheory.Norm.Transitivity
{R : Type u_1} {S : Type u_2} {n : Type u_4} {m : Type u_5} [CommRing R] [CommRing S] (M : Matrix m m S) [DecidableEq m] [DecidableEq n] (k : m) [Fintype m] [Fintype n] (f : S →+* Matrix n n R) : ((Matrix.comp m m n n R) (M.map ⇑f)).det * (f (M k k)).det ^ (Fintype.card m - 1) = (f (M k k)).det * ((Matrix.comp { a // (a = k) = False } { a // (a = k) = False } n n R) (((M * Algebra.Norm.Transitivity.auxMat M k).toSquareBlock (fun x => x = k) False).map ⇑f)).det - Algebra.Norm.Transitivity.det_det_aux 📋 Mathlib.RingTheory.Norm.Transitivity
{R : Type u_1} {S : Type u_2} {n : Type u_4} {m : Type u_5} [CommRing R] [CommRing S] {M : Matrix m m S} [DecidableEq m] [DecidableEq n] (k : m) [Fintype m] [Fintype n] {f : S →+* Matrix n n R} (ih : ∀ (M : Matrix { a // (a = k) = False } { a // (a = k) = False } S), (f M.det).det = ((Matrix.comp { a // (a = k) = False } { a // (a = k) = False } n n R) (M.map ⇑f)).det) : ((f M.det).det - ((Matrix.comp m m n n R) (M.map ⇑f)).det) * (f (M k k)).det ^ (Fintype.card m - 1) = 0 - PEquiv.map_toMatrix 📋 Mathlib.Data.Matrix.PEquiv
{m : Type u_3} {n : Type u_4} {α : Type u_5} {β : Type u_6} [DecidableEq n] [NonAssocSemiring α] [NonAssocSemiring β] (f : α →+* β) (σ : m ≃. n) : σ.toMatrix.map ⇑f = σ.toMatrix - Matrix.IsHermitian.map 📋 Mathlib.LinearAlgebra.Matrix.Hermitian
{α : Type u_1} {β : Type u_2} {n : Type u_4} [Star α] [Star β] {A : Matrix n n α} (h : A.IsHermitian) (f : α → β) (hf : Function.Semiconj f star star) : (A.map f).IsHermitian - Matrix.isHermitian_map_iff 📋 Mathlib.LinearAlgebra.Matrix.Hermitian
{α : Type u_1} {β : Type u_2} {n : Type u_4} [Star α] [Star β] {A : Matrix n n α} {f : α → β} (hf : Function.Semiconj f star star) (hinj : Function.Injective f) : (A.map f).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_map 📋 Mathlib.LinearAlgebra.Matrix.Vec
{m : Type u_1} {n : Type u_2} {R : Type u_3} {S : Type u_4} (A : Matrix m n R) (f : R → S) : (A.map f).vec = f ∘ A.vec - Matrix.star_vec 📋 Mathlib.LinearAlgebra.Matrix.Vec
{m : Type u_2} {n : Type u_3} {R : Type u_1} [Star R] (x : Matrix m n R) : star x.vec = (x.map star).vec - Matrix.fromCols_map 📋 Mathlib.Data.Matrix.ColumnRowPartitioned
{R : Type u_1} {m : Type u_2} {n₁ : Type u_6} {n₂ : Type u_7} (A₁ : Matrix m n₁ R) (A₂ : Matrix m n₂ R) {R' : Type u_8} (f : R → R') : (A₁.fromCols A₂).map f = (A₁.map f).fromCols (A₂.map f) - Matrix.fromRows_map 📋 Mathlib.Data.Matrix.ColumnRowPartitioned
{R : Type u_1} {m₁ : Type u_3} {m₂ : Type u_4} {n : Type u_5} (A₁ : Matrix m₁ n R) (A₂ : Matrix m₂ n R) {R' : Type u_8} (f : R → R') : (A₁.fromRows A₂).map f = (A₁.map f).fromRows (A₂.map f) - Algebra.discr_of_matrix_mulVec 📋 Mathlib.RingTheory.Discriminant
{A : Type u} {B : Type v} {ι : Type w} [DecidableEq ι] [CommRing A] [CommRing B] [Algebra A B] [Fintype ι] (b : ι → B) (P : Matrix ι ι A) : Algebra.discr A ((P.map ⇑(algebraMap A B)).mulVec b) = P.det ^ 2 * Algebra.discr A b - Algebra.discr_of_matrix_vecMul 📋 Mathlib.RingTheory.Discriminant
{A : Type u} {B : Type v} {ι : Type w} [DecidableEq ι] [CommRing A] [CommRing B] [Algebra A B] [Fintype ι] (b : ι → B) (P : Matrix ι ι A) : Algebra.discr A (Matrix.vecMul b (P.map ⇑(algebraMap A B))) = P.det ^ 2 * Algebra.discr A b - IsBaseChange.endHom_toMatrix 📋 Mathlib.RingTheory.TensorProduct.IsBaseChangeHom
{R : Type u_1} [CommSemiring R] (S : Type u_2) [CommSemiring S] [Algebra R S] (M : Type u_3) [AddCommMonoid M] [Module R M] {P : Type u_5} [AddCommMonoid P] [Module R P] [Module S P] [IsScalarTower R S P] {α : M →ₗ[R] P} (ibcM : IsBaseChange S α) {ι : Type u_7} [DecidableEq ι] [Fintype ι] (b : Module.Basis ι R M) (f : M →ₗ[R] M) : (LinearMap.toMatrix (IsBaseChange.basis b ibcM) (IsBaseChange.basis b ibcM)) (ibcM.endHom f) = ((LinearMap.toMatrix b b) f).map ⇑(algebraMap R S) - IsBaseChange.linearMapLeftRightHom_toMatrix 📋 Mathlib.RingTheory.TensorProduct.IsBaseChangeHom
{R : Type u_1} [CommSemiring R] (S : Type u_2) [CommSemiring S] [Algebra R S] (M : Type u_3) [AddCommMonoid M] [Module R M] {N : Type u_4} [AddCommMonoid N] [Module R N] {P : Type u_5} [AddCommMonoid P] [Module R P] {Q : Type u_6} [AddCommMonoid Q] [Module R Q] [Module S P] [IsScalarTower R S P] [Module S Q] [IsScalarTower R S Q] {α : M →ₗ[R] P} {β : N →ₗ[R] Q} (ibcM : IsBaseChange S α) (ibcN : IsBaseChange S β) {ι : Type u_7} {θ : Type u_8} [DecidableEq ι] [Fintype ι] [Finite θ] (b : Module.Basis ι R M) (c : Module.Basis θ R N) (f : M →ₗ[R] N) : (LinearMap.toMatrix (IsBaseChange.basis b ibcM) (IsBaseChange.basis c ibcN)) ((ibcM.linearMapLeftRightHom β) f) = ((LinearMap.toMatrix b c) f).map ⇑(algebraMap R S) - Matrix.map_circulant 📋 Mathlib.LinearAlgebra.Matrix.Circulant
{α : Type u_1} {β : Type u_2} {n : Type u_3} [Sub n] (v : n → α) (f : α → β) : (Matrix.circulant v).map f = Matrix.circulant fun i => f (v i) - Matrix.num_map_intCast 📋 Mathlib.LinearAlgebra.Matrix.Integer
{m : Type u_1} {n : Type u_2} [Fintype m] [Fintype n] (A : Matrix m n ℤ) : (A.map Int.cast).num = A - Matrix.den_map_intCast 📋 Mathlib.LinearAlgebra.Matrix.Integer
{m : Type u_1} {n : Type u_2} [Fintype m] [Fintype n] (A : Matrix m n ℤ) : (A.map Int.cast).den = 1 - Matrix.den_map_natCast 📋 Mathlib.LinearAlgebra.Matrix.Integer
{m : Type u_1} {n : Type u_2} [Fintype m] [Fintype n] (A : Matrix m n ℕ) : (A.map Nat.cast).den = 1 - Matrix.num_map_natCast 📋 Mathlib.LinearAlgebra.Matrix.Integer
{m : Type u_1} {n : Type u_2} [Fintype m] [Fintype n] (A : Matrix m n ℕ) : (A.map Nat.cast).num = A.map Nat.cast - Matrix.inv_denom_smul_num 📋 Mathlib.LinearAlgebra.Matrix.Integer
{m : Type u_1} {n : Type u_2} [Fintype m] [Fintype n] (A : Matrix m n ℚ) : (↑A.den)⁻¹ • A.num.map Int.cast = A - Matrix.map_mul_natCast 📋 Mathlib.LinearAlgebra.Matrix.Integer
{n : Type u_2} [Fintype n] {α : Type u_3} [NonAssocSemiring α] (A B : Matrix n n ℕ) : (A * B).map Nat.cast = A.map Nat.cast * B.map Nat.cast - Matrix.map_mul_ratCast 📋 Mathlib.LinearAlgebra.Matrix.Integer
{n : Type u_2} [Fintype n] {α : Type u_3} [DivisionRing α] [CharZero α] (A B : Matrix n n ℚ) : (A * B).map Rat.cast = A.map Rat.cast * B.map Rat.cast - Matrix.map_mul_intCast 📋 Mathlib.LinearAlgebra.Matrix.Integer
{n : Type u_2} [Fintype n] {α : Type u_3} [NonAssocRing α] (A B : Matrix n n ℤ) : (A * B).map Int.cast = A.map Int.cast * B.map Int.cast - Matrix.IsDiag.map 📋 Mathlib.LinearAlgebra.Matrix.IsDiag
{α : Type u_1} {β : Type u_2} {n : Type u_4} [Zero α] [Zero β] {A : Matrix n n α} (ha : A.IsDiag) {f : α → β} (hf : f 0 = 0) : (A.map f).IsDiag - Matrix.map_swap 📋 Mathlib.LinearAlgebra.Matrix.Swap
{R : Type u_1} {n : Type u_2} [Semiring R] [DecidableEq n] {S : Type u_4} [NonAssocSemiring S] (f : R →+* S) (i j : n) : (Matrix.swap R i j).map ⇑f = Matrix.swap S i j - intrinsicStar_def 📋 Mathlib.LinearAlgebra.Matrix.WithConv
{m : Type u_1} {n : Type u_2} {α : Type u_3} [Star α] (x : WithConv (Matrix m n α)) : star x = WithConv.toConv (x.ofConv.map star) - NumberField.conj_basisMatrix 📋 Mathlib.NumberTheory.NumberField.EquivReindex
(K : Type u_1) [Field K] [NumberField K] : (NumberField.basisMatrix K).map ⇑(starRingEnd ℂ) = (Matrix.reindex (Equiv.refl (K →+* ℂ)) (Function.Involutive.toPerm NumberField.ComplexEmbedding.conjugate ⋯)) (NumberField.basisMatrix K)
About
Loogle searches Lean and Mathlib definitions and theorems.
You can use Loogle from within the Lean4 VSCode language extension
using the Loogle command from the command palette. You can also try the
#loogle command from LeanSearchClient,
the CLI version, the Loogle
VS Code extension, the lean.nvim
integration or the Zulip bot.
Usage
Loogle finds definitions and lemmas in various ways:
By constant:
🔍Real.sin
finds all lemmas whose statement somehow mentions the sine function.By lemma name substring:
🔍"differ"
finds all lemmas that have"differ"somewhere in their lemma name.By subexpression:
🔍_ * (_ ^ _)
finds all lemmas whose statements somewhere include a product where the second argument is raised to some power.The pattern can also be non-linear, as in
🔍Real.sqrt ?a * Real.sqrt ?aIf the pattern has parameters, they are matched in any order. Both of these will find
List.map:
🔍(?a -> ?b) -> List ?a -> List ?b
🔍List ?a -> (?a -> ?b) -> List ?bBy main conclusion:
🔍|- tsum _ = _ * tsum _
finds all lemmas where the conclusion (the subexpression to the right of all→and∀) has the given shape.As before, if the pattern has parameters, they are matched against the hypotheses of the lemma in any order; for example,
🔍|- _ < _ → tsum _ < tsum _
will findtsum_lt_tsumeven though the hypothesisf i < g iis not the last.You can filter for definitions vs theorems: Using
⊢ (_ : Type _)finds all definitions which provide data while⊢ (_ : Prop)finds all theorems (and definitions of proofs).
If you pass more than one such search filter, separated by commas
Loogle will return lemmas which match all of them. The
search
🔍 Real.sin, "two", tsum, _ * _, _ ^ _, |- _ < _ → _
would find all lemmas which mention the constants Real.sin
and tsum, have "two" as a substring of the
lemma name, include a product and a power somewhere in the type,
and have a hypothesis of the form _ < _ (if
there were any such lemmas). Metavariables (?a) are
assigned independently in each filter.
The #lucky button will directly send you to the
documentation of the first hit.
Source code
You can find the source code for this service at https://github.com/nomeata/loogle. The https://loogle.lean-lang.org/ service is provided by the Lean FRO. Please review the Lean FRO Terms of Use and Privacy Policy.
This is Loogle revision a114d38 serving mathlib revision 476fb97