Loogle!
Result
Found 100 declarations mentioning PositiveLinearMap.
- PositiveLinearMap 📋 Mathlib.Algebra.Order.Module.PositiveLinearMap
(R : Type u_1) (E₁ : Type u_2) (E₂ : Type u_3) [Semiring R] [AddCommMonoid E₁] [PartialOrder E₁] [AddCommMonoid E₂] [PartialOrder E₂] [Module R E₁] [Module R E₂] : Type (max u_2 u_3) - PositiveLinearMap.id 📋 Mathlib.Algebra.Order.Module.PositiveLinearMap
(R : Type u_1) (E₁ : Type u_2) [Semiring R] [AddCommMonoid E₁] [PartialOrder E₁] [Module R E₁] : E₁ →ₚ[R] E₁ - PositiveLinearMap.instZero 📋 Mathlib.Algebra.Order.Module.PositiveLinearMap
{R : Type u_1} {E₁ : Type u_2} {E₂ : Type u_3} [Semiring R] [AddCommMonoid E₁] [PartialOrder E₁] [AddCommMonoid E₂] [PartialOrder E₂] [Module R E₁] [Module R E₂] : Zero (E₁ →ₚ[R] E₂) - PositiveLinearMap.instFunLike 📋 Mathlib.Algebra.Order.Module.PositiveLinearMap
{R : Type u_1} {E₁ : Type u_2} {E₂ : Type u_3} [Semiring R] [AddCommMonoid E₁] [PartialOrder E₁] [AddCommMonoid E₂] [PartialOrder E₂] [Module R E₁] [Module R E₂] : FunLike (E₁ →ₚ[R] E₂) E₁ E₂ - PositiveLinearMap.instAdd 📋 Mathlib.Algebra.Order.Module.PositiveLinearMap
{R : Type u_1} {E₁ : Type u_2} {E₂ : Type u_3} [Semiring R] [AddCommMonoid E₁] [PartialOrder E₁] [AddCommMonoid E₂] [PartialOrder E₂] [Module R E₁] [Module R E₂] [IsOrderedAddMonoid E₂] : Add (E₁ →ₚ[R] E₂) - PositiveLinearMap.instAddCommMonoid 📋 Mathlib.Algebra.Order.Module.PositiveLinearMap
{R : Type u_1} {E₁ : Type u_2} {E₂ : Type u_3} [Semiring R] [AddCommMonoid E₁] [PartialOrder E₁] [AddCommMonoid E₂] [PartialOrder E₂] [Module R E₁] [Module R E₂] [IsOrderedAddMonoid E₂] : AddCommMonoid (E₁ →ₚ[R] E₂) - PositiveLinearMap.instSMulNat 📋 Mathlib.Algebra.Order.Module.PositiveLinearMap
{R : Type u_1} {E₁ : Type u_2} {E₂ : Type u_3} [Semiring R] [AddCommMonoid E₁] [PartialOrder E₁] [AddCommMonoid E₂] [PartialOrder E₂] [Module R E₁] [Module R E₂] [IsOrderedAddMonoid E₂] : SMul ℕ (E₁ →ₚ[R] E₂) - PositiveLinearMap.toOrderHom 📋 Mathlib.Algebra.Order.Module.PositiveLinearMap
{R : Type u_1} {E₁ : Type u_2} {E₂ : Type u_3} [Semiring R] [AddCommMonoid E₁] [PartialOrder E₁] [AddCommMonoid E₂] [PartialOrder E₂] [Module R E₁] [Module R E₂] (self : E₁ →ₚ[R] E₂) : E₁ →o E₂ - PositiveLinearMap.toLinearMap 📋 Mathlib.Algebra.Order.Module.PositiveLinearMap
{R : Type u_1} {E₁ : Type u_2} {E₂ : Type u_3} [Semiring R] [AddCommMonoid E₁] [PartialOrder E₁] [AddCommMonoid E₂] [PartialOrder E₂] [Module R E₁] [Module R E₂] (self : E₁ →ₚ[R] E₂) : E₁ →ₗ[R] E₂ - PositiveLinearMap.id_apply 📋 Mathlib.Algebra.Order.Module.PositiveLinearMap
(R : Type u_1) (E₁ : Type u_2) [Semiring R] [AddCommMonoid E₁] [PartialOrder E₁] [Module R E₁] (x : E₁) : (PositiveLinearMap.id R E₁) x = x - PositiveLinearMap.instLinearMapClass 📋 Mathlib.Algebra.Order.Module.PositiveLinearMap
{R : Type u_1} {E₁ : Type u_2} {E₂ : Type u_3} [Semiring R] [AddCommMonoid E₁] [PartialOrder E₁] [AddCommMonoid E₂] [PartialOrder E₂] [Module R E₁] [Module R E₂] : LinearMapClass (E₁ →ₚ[R] E₂) R E₁ E₂ - PositiveLinearMap.instOrderHomClass 📋 Mathlib.Algebra.Order.Module.PositiveLinearMap
{R : Type u_1} {E₁ : Type u_2} {E₂ : Type u_3} [Semiring R] [AddCommMonoid E₁] [PartialOrder E₁] [AddCommMonoid E₂] [PartialOrder E₂] [Module R E₁] [Module R E₂] : OrderHomClass (E₁ →ₚ[R] E₂) E₁ E₂ - PositiveLinearMap.toLinearMap_injective 📋 Mathlib.Algebra.Order.Module.PositiveLinearMap
{R : Type u_1} {E₁ : Type u_2} {E₂ : Type u_3} [Semiring R] [AddCommMonoid E₁] [PartialOrder E₁] [AddCommMonoid E₂] [PartialOrder E₂] [Module R E₁] [Module R E₂] : Function.Injective PositiveLinearMap.toLinearMap - PositiveLinearMap.comp 📋 Mathlib.Algebra.Order.Module.PositiveLinearMap
{R : Type u_1} {E₁ : Type u_2} {E₂ : Type u_3} {E₃ : Type u_4} [Semiring R] [AddCommMonoid E₁] [PartialOrder E₁] [AddCommMonoid E₂] [PartialOrder E₂] [AddCommMonoid E₃] [PartialOrder E₃] [Module R E₁] [Module R E₂] [Module R E₃] (g : E₂ →ₚ[R] E₃) (f : E₁ →ₚ[R] E₂) : E₁ →ₚ[R] E₃ - PositiveLinearMap.ofClass 📋 Mathlib.Algebra.Order.Module.PositiveLinearMap
{F : Type u_1} {R : Type u_2} {E₁ : Type u_3} {E₂ : Type u_4} [Semiring R] [AddCommMonoid E₁] [PartialOrder E₁] [AddCommMonoid E₂] [PartialOrder E₂] [Module R E₁] [Module R E₂] [FunLike F E₁ E₂] [LinearMapClass F R E₁ E₂] [OrderHomClass F E₁ E₂] (f : F) : E₁ →ₚ[R] E₂ - PositiveLinearMapClass.toPositiveLinearMap 📋 Mathlib.Algebra.Order.Module.PositiveLinearMap
{F : Type u_1} {R : Type u_2} {E₁ : Type u_3} {E₂ : Type u_4} [Semiring R] [AddCommMonoid E₁] [PartialOrder E₁] [AddCommMonoid E₂] [PartialOrder E₂] [Module R E₁] [Module R E₂] [FunLike F E₁ E₂] [LinearMapClass F R E₁ E₂] [OrderHomClass F E₁ E₂] (f : F) : E₁ →ₚ[R] E₂ - PositiveLinearMap.instIsZeroApply 📋 Mathlib.Algebra.Order.Module.PositiveLinearMap
{R : Type u_1} {E₁ : Type u_2} {E₂ : Type u_3} [Semiring R] [AddCommMonoid E₁] [PartialOrder E₁] [AddCommMonoid E₂] [PartialOrder E₂] [Module R E₁] [Module R E₂] : IsZeroApply (E₁ →ₚ[R] E₂) E₁ E₂ - PositiveLinearMap.comp_id 📋 Mathlib.Algebra.Order.Module.PositiveLinearMap
{R : Type u_1} {E₁ : Type u_2} {E₂ : Type u_3} [Semiring R] [AddCommMonoid E₁] [PartialOrder E₁] [AddCommMonoid E₂] [PartialOrder E₂] [Module R E₁] [Module R E₂] (f : E₁ →ₚ[R] E₂) : f.comp (PositiveLinearMap.id R E₁) = f - PositiveLinearMap.id_comp 📋 Mathlib.Algebra.Order.Module.PositiveLinearMap
{R : Type u_1} {E₁ : Type u_2} {E₂ : Type u_3} [Semiring R] [AddCommMonoid E₁] [PartialOrder E₁] [AddCommMonoid E₂] [PartialOrder E₂] [Module R E₁] [Module R E₂] (f : E₁ →ₚ[R] E₂) : (PositiveLinearMap.id R E₂).comp f = f - PositiveLinearMap.instIsAddApply 📋 Mathlib.Algebra.Order.Module.PositiveLinearMap
{R : Type u_1} {E₁ : Type u_2} {E₂ : Type u_3} [Semiring R] [AddCommMonoid E₁] [PartialOrder E₁] [AddCommMonoid E₂] [PartialOrder E₂] [Module R E₁] [Module R E₂] [IsOrderedAddMonoid E₂] : IsAddApply (E₁ →ₚ[R] E₂) E₁ E₂ - PositiveLinearMap.instIsSMulApplyNat 📋 Mathlib.Algebra.Order.Module.PositiveLinearMap
{R : Type u_1} {E₁ : Type u_2} {E₂ : Type u_3} [Semiring R] [AddCommMonoid E₁] [PartialOrder E₁] [AddCommMonoid E₂] [PartialOrder E₂] [Module R E₁] [Module R E₂] [IsOrderedAddMonoid E₂] : IsSMulApply ℕ (E₁ →ₚ[R] E₂) E₁ E₂ - PositiveLinearMap.monotone' 📋 Mathlib.Algebra.Order.Module.PositiveLinearMap
{R : Type u_1} {E₁ : Type u_2} {E₂ : Type u_3} [Semiring R] [AddCommMonoid E₁] [PartialOrder E₁] [AddCommMonoid E₂] [PartialOrder E₂] [Module R E₁] [Module R E₂] (self : E₁ →ₚ[R] E₂) : Monotone self.toFun - PositiveLinearMap.mk 📋 Mathlib.Algebra.Order.Module.PositiveLinearMap
{R : Type u_1} {E₁ : Type u_2} {E₂ : Type u_3} [Semiring R] [AddCommMonoid E₁] [PartialOrder E₁] [AddCommMonoid E₂] [PartialOrder E₂] [Module R E₁] [Module R E₂] (toLinearMap : E₁ →ₗ[R] E₂) (monotone' : Monotone toLinearMap.toFun) : E₁ →ₚ[R] E₂ - PositiveLinearMap.toLinearMap_inj 📋 Mathlib.Algebra.Order.Module.PositiveLinearMap
{R : Type u_1} {E₁ : Type u_2} {E₂ : Type u_3} [Semiring R] [AddCommMonoid E₁] [PartialOrder E₁] [AddCommMonoid E₂] [PartialOrder E₂] [Module R E₁] [Module R E₂] {f g : E₁ →ₚ[R] E₂} : f.toLinearMap = g.toLinearMap ↔ f = g - PositiveLinearMap.zero_apply 📋 Mathlib.Algebra.Order.Module.PositiveLinearMap
{R : Type u_1} {E₁ : Type u_2} {E₂ : Type u_3} [Semiring R] [AddCommMonoid E₁] [PartialOrder E₁] [AddCommMonoid E₂] [PartialOrder E₂] [Module R E₁] [Module R E₂] (x : E₁) : 0 x = 0 - PositiveLinearMap.map_nonneg 📋 Mathlib.Algebra.Order.Module.PositiveLinearMap
{R : Type u_1} {E₁ : Type u_2} {E₂ : Type u_3} [Semiring R] [AddCommMonoid E₁] [PartialOrder E₁] [AddCommMonoid E₂] [PartialOrder E₂] [Module R E₁] [Module R E₂] (f : E₁ →ₚ[R] E₂) {x : E₁} (hx : 0 ≤ x) : 0 ≤ f x - PositiveLinearMap.coe_toLinearMap 📋 Mathlib.Algebra.Order.Module.PositiveLinearMap
{R : Type u_1} {E₁ : Type u_2} {E₂ : Type u_3} [Semiring R] [AddCommMonoid E₁] [PartialOrder E₁] [AddCommMonoid E₂] [PartialOrder E₂] [Module R E₁] [Module R E₂] (f : E₁ →ₚ[R] E₂) : ⇑f.toLinearMap = ⇑f - PositiveLinearMap.ext 📋 Mathlib.Algebra.Order.Module.PositiveLinearMap
{R : Type u_1} {E₁ : Type u_2} {E₂ : Type u_3} [Semiring R] [AddCommMonoid E₁] [PartialOrder E₁] [AddCommMonoid E₂] [PartialOrder E₂] [Module R E₁] [Module R E₂] {f g : E₁ →ₚ[R] E₂} (h : ∀ (x : E₁), f x = g x) : f = g - PositiveLinearMap.ext_iff 📋 Mathlib.Algebra.Order.Module.PositiveLinearMap
{R : Type u_1} {E₁ : Type u_2} {E₂ : Type u_3} [Semiring R] [AddCommMonoid E₁] [PartialOrder E₁] [AddCommMonoid E₂] [PartialOrder E₂] [Module R E₁] [Module R E₂] {f g : E₁ →ₚ[R] E₂} : f = g ↔ ∀ (x : E₁), f x = g x - PositiveLinearMap.toOrderHom_comp 📋 Mathlib.Algebra.Order.Module.PositiveLinearMap
{R : Type u_1} {E₁ : Type u_2} {E₂ : Type u_3} {E₃ : Type u_4} [Semiring R] [AddCommMonoid E₁] [PartialOrder E₁] [AddCommMonoid E₂] [PartialOrder E₂] [AddCommMonoid E₃] [PartialOrder E₃] [Module R E₁] [Module R E₂] [Module R E₃] (g : E₂ →ₚ[R] E₃) (f : E₁ →ₚ[R] E₂) : (g.comp f).toOrderHom = g.toOrderHom.comp f.toOrderHom - PositiveLinearMap.map_smul_of_tower 📋 Mathlib.Algebra.Order.Module.PositiveLinearMap
{R : Type u_1} {E₁ : Type u_2} {E₂ : Type u_3} [Semiring R] [AddCommMonoid E₁] [PartialOrder E₁] [AddCommMonoid E₂] [PartialOrder E₂] [Module R E₁] [Module R E₂] {S : Type u_6} [SMul S E₁] [SMul S E₂] [LinearMap.CompatibleSMul E₁ E₂ S R] (f : E₁ →ₚ[R] E₂) (c : S) (x : E₁) : f (c • x) = c • f x - PositiveLinearMap.toLinearMap_zero 📋 Mathlib.Algebra.Order.Module.PositiveLinearMap
{R : Type u_1} {E₁ : Type u_2} {E₂ : Type u_3} [Semiring R] [AddCommMonoid E₁] [PartialOrder E₁] [AddCommMonoid E₂] [PartialOrder E₂] [Module R E₁] [Module R E₂] : PositiveLinearMap.toLinearMap 0 = 0 - PositiveLinearMap.comp_zero 📋 Mathlib.Algebra.Order.Module.PositiveLinearMap
{R : Type u_1} {E₁ : Type u_2} {E₂ : Type u_3} {E₃ : Type u_4} [Semiring R] [AddCommMonoid E₁] [PartialOrder E₁] [AddCommMonoid E₂] [PartialOrder E₂] [AddCommMonoid E₃] [PartialOrder E₃] [Module R E₁] [Module R E₂] [Module R E₃] (f : E₂ →ₚ[R] E₃) : f.comp 0 = 0 - PositiveLinearMap.zero_comp 📋 Mathlib.Algebra.Order.Module.PositiveLinearMap
{R : Type u_1} {E₁ : Type u_2} {E₂ : Type u_3} {E₃ : Type u_4} [Semiring R] [AddCommMonoid E₁] [PartialOrder E₁] [AddCommMonoid E₂] [PartialOrder E₂] [AddCommMonoid E₃] [PartialOrder E₃] [Module R E₁] [Module R E₂] [Module R E₃] (f : E₁ →ₚ[R] E₂) : PositiveLinearMap.comp 0 f = 0 - PositiveLinearMap.comp_assoc 📋 Mathlib.Algebra.Order.Module.PositiveLinearMap
{R : Type u_1} {E₁ : Type u_2} {E₂ : Type u_3} {E₃ : Type u_4} {E₄ : Type u_5} [Semiring R] [AddCommMonoid E₁] [PartialOrder E₁] [AddCommMonoid E₂] [PartialOrder E₂] [AddCommMonoid E₃] [PartialOrder E₃] [AddCommMonoid E₄] [PartialOrder E₄] [Module R E₁] [Module R E₂] [Module R E₃] [Module R E₄] (h : E₃ →ₚ[R] E₄) (g : E₂ →ₚ[R] E₃) (f : E₁ →ₚ[R] E₂) : h.comp (g.comp f) = (h.comp g).comp f - PositiveLinearMap.toLinearMap_comp 📋 Mathlib.Algebra.Order.Module.PositiveLinearMap
{R : Type u_1} {E₁ : Type u_2} {E₂ : Type u_3} {E₃ : Type u_4} [Semiring R] [AddCommMonoid E₁] [PartialOrder E₁] [AddCommMonoid E₂] [PartialOrder E₂] [AddCommMonoid E₃] [PartialOrder E₃] [Module R E₁] [Module R E₂] [Module R E₃] (g : E₂ →ₚ[R] E₃) (f : E₁ →ₚ[R] E₂) : (g.comp f).toLinearMap = g.toLinearMap ∘ₗ f.toLinearMap - PositiveLinearMap.nsmul_apply 📋 Mathlib.Algebra.Order.Module.PositiveLinearMap
{R : Type u_1} {E₁ : Type u_2} {E₂ : Type u_3} [Semiring R] [AddCommMonoid E₁] [PartialOrder E₁] [AddCommMonoid E₂] [PartialOrder E₂] [Module R E₁] [Module R E₂] [IsOrderedAddMonoid E₂] (f : E₁ →ₚ[R] E₂) (n : ℕ) (x : E₁) : (n • f) x = n • f x - PositiveLinearMap.mk₀ 📋 Mathlib.Algebra.Order.Module.PositiveLinearMap
{R : Type u_1} {E₁ : Type u_2} {E₂ : Type u_3} [Semiring R] [AddCommGroup E₁] [PartialOrder E₁] [IsOrderedAddMonoid E₁] [AddCommGroup E₂] [PartialOrder E₂] [IsOrderedAddMonoid E₂] [Module R E₁] [Module R E₂] (f : E₁ →ₗ[R] E₂) (hf : ∀ (x : E₁), 0 ≤ x → 0 ≤ f x) : E₁ →ₚ[R] E₂ - PositiveLinearMap.comp_apply 📋 Mathlib.Algebra.Order.Module.PositiveLinearMap
{R : Type u_1} {E₁ : Type u_2} {E₂ : Type u_3} {E₃ : Type u_4} [Semiring R] [AddCommMonoid E₁] [PartialOrder E₁] [AddCommMonoid E₂] [PartialOrder E₂] [AddCommMonoid E₃] [PartialOrder E₃] [Module R E₁] [Module R E₂] [Module R E₃] (g : E₂ →ₚ[R] E₃) (f : E₁ →ₚ[R] E₂) (x : E₁) : (g.comp f) x = g.toLinearMap (f.toLinearMap x) - PositiveLinearMap.add_apply 📋 Mathlib.Algebra.Order.Module.PositiveLinearMap
{R : Type u_1} {E₁ : Type u_2} {E₂ : Type u_3} [Semiring R] [AddCommMonoid E₁] [PartialOrder E₁] [AddCommMonoid E₂] [PartialOrder E₂] [Module R E₁] [Module R E₂] [IsOrderedAddMonoid E₂] (f g : E₁ →ₚ[R] E₂) (x : E₁) : (f + g) x = f x + g x - PositiveLinearMap.toLinearMap_nsmul 📋 Mathlib.Algebra.Order.Module.PositiveLinearMap
{R : Type u_1} {E₁ : Type u_2} {E₂ : Type u_3} [Semiring R] [AddCommMonoid E₁] [PartialOrder E₁] [AddCommMonoid E₂] [PartialOrder E₂] [Module R E₁] [Module R E₂] [IsOrderedAddMonoid E₂] (f : E₁ →ₚ[R] E₂) (n : ℕ) : (n • f).toLinearMap = n • f.toLinearMap - PositiveLinearMap.toLinearMap_add 📋 Mathlib.Algebra.Order.Module.PositiveLinearMap
{R : Type u_1} {E₁ : Type u_2} {E₂ : Type u_3} [Semiring R] [AddCommMonoid E₁] [PartialOrder E₁] [AddCommMonoid E₂] [PartialOrder E₂] [Module R E₁] [Module R E₂] [IsOrderedAddMonoid E₂] (f g : E₁ →ₚ[R] E₂) : (f + g).toLinearMap = f.toLinearMap + g.toLinearMap - PositiveLinearMap.PreGNS 📋 Mathlib.Analysis.CStarAlgebra.GelfandNaimarkSegal
{A : Type u_1} [NonUnitalRing A] [PartialOrder A] [Module ℂ A] (f : A →ₚ[ℂ] ℂ) : Type u_1 - PositiveLinearMap.instAddCommGroupPreGNS 📋 Mathlib.Analysis.CStarAlgebra.GelfandNaimarkSegal
{A : Type u_1} [NonUnitalRing A] [PartialOrder A] [Module ℂ A] (f : A →ₚ[ℂ] ℂ) : AddCommGroup f.PreGNS - PositiveLinearMap.GNS 📋 Mathlib.Analysis.CStarAlgebra.GelfandNaimarkSegal
{A : Type u_1} [NonUnitalCStarAlgebra A] [PartialOrder A] [StarOrderedRing A] (f : A →ₚ[ℂ] ℂ) : Type u_1 - PositiveLinearMap.instModuleComplexPreGNS 📋 Mathlib.Analysis.CStarAlgebra.GelfandNaimarkSegal
{A : Type u_1} [NonUnitalRing A] [PartialOrder A] [Module ℂ A] (f : A →ₚ[ℂ] ℂ) : Module ℂ f.PreGNS - PositiveLinearMap.ofPreGNS 📋 Mathlib.Analysis.CStarAlgebra.GelfandNaimarkSegal
{A : Type u_1} [NonUnitalRing A] [PartialOrder A] [Module ℂ A] (f : A →ₚ[ℂ] ℂ) : f.PreGNS ≃ₗ[ℂ] A - PositiveLinearMap.toPreGNS 📋 Mathlib.Analysis.CStarAlgebra.GelfandNaimarkSegal
{A : Type u_1} [NonUnitalRing A] [PartialOrder A] [Module ℂ A] (f : A →ₚ[ℂ] ℂ) : A ≃ₗ[ℂ] f.PreGNS - PositiveLinearMap.instSeminormedAddCommGroupPreGNS 📋 Mathlib.Analysis.CStarAlgebra.GelfandNaimarkSegal
{A : Type u_1} [NonUnitalRing A] [PartialOrder A] [Module ℂ A] [StarRing A] [StarOrderedRing A] [SelfAdjointDecompose A] [StarModule ℂ A] [IsScalarTower ℂ A A] (f : A →ₚ[ℂ] ℂ) : SeminormedAddCommGroup f.PreGNS - PositiveLinearMap.instInnerProductSpaceComplexPreGNS 📋 Mathlib.Analysis.CStarAlgebra.GelfandNaimarkSegal
{A : Type u_1} [NonUnitalRing A] [PartialOrder A] [Module ℂ A] [StarRing A] [StarOrderedRing A] [SelfAdjointDecompose A] [StarModule ℂ A] [IsScalarTower ℂ A A] (f : A →ₚ[ℂ] ℂ) : InnerProductSpace ℂ f.PreGNS - PositiveLinearMap.preGNSpreInnerProdSpace 📋 Mathlib.Analysis.CStarAlgebra.GelfandNaimarkSegal
{A : Type u_1} [NonUnitalRing A] [PartialOrder A] [Module ℂ A] [StarRing A] [StarOrderedRing A] [SelfAdjointDecompose A] [StarModule ℂ A] [IsScalarTower ℂ A A] (f : A →ₚ[ℂ] ℂ) : PreInnerProductSpace.Core ℂ f.PreGNS - PositiveLinearMap.ofPreGNS_toPreGNS 📋 Mathlib.Analysis.CStarAlgebra.GelfandNaimarkSegal
{A : Type u_1} [NonUnitalRing A] [PartialOrder A] [Module ℂ A] (f : A →ₚ[ℂ] ℂ) (a : A) : f.ofPreGNS (f.toPreGNS a) = a - PositiveLinearMap.toPreGNS_ofPreGNS 📋 Mathlib.Analysis.CStarAlgebra.GelfandNaimarkSegal
{A : Type u_1} [NonUnitalRing A] [PartialOrder A] [Module ℂ A] (f : A →ₚ[ℂ] ℂ) (a : f.PreGNS) : f.toPreGNS (f.ofPreGNS a) = a - PositiveLinearMap.preGNS_norm_def 📋 Mathlib.Analysis.CStarAlgebra.GelfandNaimarkSegal
{A : Type u_1} [NonUnitalRing A] [PartialOrder A] [Module ℂ A] [StarRing A] [StarOrderedRing A] [SelfAdjointDecompose A] [StarModule ℂ A] [IsScalarTower ℂ A A] (f : A →ₚ[ℂ] ℂ) (a : f.PreGNS) : ‖a‖ = √(f (star (f.ofPreGNS a) * f.ofPreGNS a)).re - PositiveLinearMap.preGNS_norm_def' 📋 Mathlib.Analysis.CStarAlgebra.GelfandNaimarkSegal
{A : Type u_1} [NonUnitalRing A] [PartialOrder A] [Module ℂ A] [StarRing A] [StarOrderedRing A] [SelfAdjointDecompose A] [StarModule ℂ A] [IsScalarTower ℂ A A] (f : A →ₚ[ℂ] ℂ) (a : f.PreGNS) : ‖a‖ = √‖f (star (f.ofPreGNS a) * f.ofPreGNS a)‖ - PositiveLinearMap.preGNS_norm_sq 📋 Mathlib.Analysis.CStarAlgebra.GelfandNaimarkSegal
{A : Type u_1} [NonUnitalRing A] [PartialOrder A] [Module ℂ A] [StarRing A] [StarOrderedRing A] [SelfAdjointDecompose A] [StarModule ℂ A] [IsScalarTower ℂ A A] (f : A →ₚ[ℂ] ℂ) (a : f.PreGNS) : ↑‖a‖ ^ 2 = f (star (f.ofPreGNS a) * f.ofPreGNS a) - PositiveLinearMap.preGNS_inner_def 📋 Mathlib.Analysis.CStarAlgebra.GelfandNaimarkSegal
{A : Type u_1} [NonUnitalRing A] [PartialOrder A] [Module ℂ A] [StarRing A] [StarOrderedRing A] [SelfAdjointDecompose A] [StarModule ℂ A] [IsScalarTower ℂ A A] (f : A →ₚ[ℂ] ℂ) (a b : f.PreGNS) : inner ℂ a b = f (star (f.ofPreGNS a) * f.ofPreGNS b) - PositiveLinearMap.leftMulMapPreGNS 📋 Mathlib.Analysis.CStarAlgebra.GelfandNaimarkSegal
{A : Type u_1} [NonUnitalCStarAlgebra A] [PartialOrder A] [StarOrderedRing A] (f : A →ₚ[ℂ] ℂ) (a : A) : f.PreGNS →L[ℂ] f.PreGNS - PositiveLinearMap.leftMulMapPreGNS_mul_eq_comp 📋 Mathlib.Analysis.CStarAlgebra.GelfandNaimarkSegal
{A : Type u_1} [NonUnitalCStarAlgebra A] [PartialOrder A] [StarOrderedRing A] (f : A →ₚ[ℂ] ℂ) (a b : A) : f.leftMulMapPreGNS (a * b) = f.leftMulMapPreGNS a ∘SL f.leftMulMapPreGNS b - PositiveLinearMap.leftMulMapPreGNS_apply 📋 Mathlib.Analysis.CStarAlgebra.GelfandNaimarkSegal
{A : Type u_1} [NonUnitalCStarAlgebra A] [PartialOrder A] [StarOrderedRing A] (f : A →ₚ[ℂ] ℂ) (a : A) (x : f.PreGNS) : (f.leftMulMapPreGNS a) x = f.toPreGNS (a * f.ofPreGNS x) - PositiveLinearMap.gnsStarAlgHom 📋 Mathlib.Analysis.CStarAlgebra.GelfandNaimarkSegal
{A : Type u_1} [CStarAlgebra A] [PartialOrder A] [StarOrderedRing A] (f : A →ₚ[ℂ] ℂ) : A →⋆ₐ[ℂ] f.GNS →L[ℂ] f.GNS - PositiveLinearMap.gnsNonUnitalStarAlgHom 📋 Mathlib.Analysis.CStarAlgebra.GelfandNaimarkSegal
{A : Type u_1} [NonUnitalCStarAlgebra A] [PartialOrder A] [StarOrderedRing A] (f : A →ₚ[ℂ] ℂ) : A →⋆ₙₐ[ℂ] f.GNS →L[ℂ] f.GNS - PositiveLinearMap.gnsNonUnitalStarAlgHom_apply 📋 Mathlib.Analysis.CStarAlgebra.GelfandNaimarkSegal
{A : Type u_1} [NonUnitalCStarAlgebra A] [PartialOrder A] [StarOrderedRing A] (f : A →ₚ[ℂ] ℂ) {a : A} : f.gnsNonUnitalStarAlgHom a = (f.leftMulMapPreGNS a).completion - PositiveLinearMap.gnsNonUnitalStarAlgHom_apply_coe 📋 Mathlib.Analysis.CStarAlgebra.GelfandNaimarkSegal
{A : Type u_1} [NonUnitalCStarAlgebra A] [PartialOrder A] [StarOrderedRing A] (f : A →ₚ[ℂ] ℂ) {a : A} {b : f.PreGNS} : (f.gnsNonUnitalStarAlgHom a) ↑b = ↑((f.leftMulMapPreGNS a) b) - PositiveLinearMap.gnsStarAlgHom_apply 📋 Mathlib.Analysis.CStarAlgebra.GelfandNaimarkSegal
{A : Type u_1} [CStarAlgebra A] [PartialOrder A] [StarOrderedRing A] (f : A →ₚ[ℂ] ℂ) (a✝ : A) : f.gnsStarAlgHom a✝ = f.gnsNonUnitalStarAlgHom.toFun a✝ - PositiveContinuousLinearMap.toPositiveLinearMap 📋 Mathlib.Topology.Algebra.Module.ContinuousLinearMap.Positive
{R : Type u_1} {E₁ : Type u_2} {E₂ : Type u_3} [Semiring R] [AddCommMonoid E₁] [PartialOrder E₁] [TopologicalSpace E₁] [AddCommMonoid E₂] [PartialOrder E₂] [TopologicalSpace E₂] [Module R E₁] [Module R E₂] (self : E₁ →P[R] E₂) : E₁ →ₚ[R] E₂ - PositiveContinuousLinearMap.instCoePositiveLinearMap 📋 Mathlib.Topology.Algebra.Module.ContinuousLinearMap.Positive
{R : Type u_1} {E₁ : Type u_2} {E₂ : Type u_3} [Semiring R] [AddCommMonoid E₁] [PartialOrder E₁] [AddCommMonoid E₂] [PartialOrder E₂] [Module R E₁] [Module R E₂] [TopologicalSpace E₁] [TopologicalSpace E₂] : Coe (E₁ →P[R] E₂) (E₁ →ₚ[R] E₂) - PositiveContinuousLinearMap.toPositiveLinearMap_id 📋 Mathlib.Topology.Algebra.Module.ContinuousLinearMap.Positive
(R : Type u_1) (E₁ : Type u_2) [Semiring R] [AddCommMonoid E₁] [PartialOrder E₁] [Module R E₁] [TopologicalSpace E₁] : (PositiveContinuousLinearMap.id R E₁).toPositiveLinearMap = PositiveLinearMap.id R E₁ - PositiveContinuousLinearMap.toPositiveLinearMap_injective 📋 Mathlib.Topology.Algebra.Module.ContinuousLinearMap.Positive
{R : Type u_1} {E₁ : Type u_2} {E₂ : Type u_3} [Semiring R] [AddCommMonoid E₁] [PartialOrder E₁] [AddCommMonoid E₂] [PartialOrder E₂] [Module R E₁] [Module R E₂] [TopologicalSpace E₁] [TopologicalSpace E₂] : Function.Injective PositiveContinuousLinearMap.toPositiveLinearMap - PositiveContinuousLinearMap.mk 📋 Mathlib.Topology.Algebra.Module.ContinuousLinearMap.Positive
{R : Type u_1} {E₁ : Type u_2} {E₂ : Type u_3} [Semiring R] [AddCommMonoid E₁] [PartialOrder E₁] [TopologicalSpace E₁] [AddCommMonoid E₂] [PartialOrder E₂] [TopologicalSpace E₂] [Module R E₁] [Module R E₂] (toPositiveLinearMap : E₁ →ₚ[R] E₂) (cont : Continuous toPositiveLinearMap.toFun := by first | fun_prop | eta_expand; dsimp; fun_prop | skip) : E₁ →P[R] E₂ - PositiveContinuousLinearMap.toPositiveLinearMap_inj 📋 Mathlib.Topology.Algebra.Module.ContinuousLinearMap.Positive
{R : Type u_1} {E₁ : Type u_2} {E₂ : Type u_3} [Semiring R] [AddCommMonoid E₁] [PartialOrder E₁] [AddCommMonoid E₂] [PartialOrder E₂] [Module R E₁] [Module R E₂] [TopologicalSpace E₁] [TopologicalSpace E₂] (f g : E₁ →P[R] E₂) : f.toPositiveLinearMap = g.toPositiveLinearMap ↔ f = g - PositiveContinuousLinearMap.coe_toPositiveLinearMap 📋 Mathlib.Topology.Algebra.Module.ContinuousLinearMap.Positive
{R : Type u_1} {E₁ : Type u_2} {E₂ : Type u_3} [Semiring R] [AddCommMonoid E₁] [PartialOrder E₁] [AddCommMonoid E₂] [PartialOrder E₂] [Module R E₁] [Module R E₂] [TopologicalSpace E₁] [TopologicalSpace E₂] (f : E₁ →P[R] E₂) : ⇑f.toPositiveLinearMap = ⇑f - PositiveContinuousLinearMap.toPositiveLinearMap_zero 📋 Mathlib.Topology.Algebra.Module.ContinuousLinearMap.Positive
{R : Type u_1} {E₁ : Type u_2} {E₂ : Type u_3} [Semiring R] [AddCommMonoid E₁] [PartialOrder E₁] [AddCommMonoid E₂] [PartialOrder E₂] [Module R E₁] [Module R E₂] [TopologicalSpace E₁] [TopologicalSpace E₂] : PositiveContinuousLinearMap.toPositiveLinearMap 0 = 0 - PositiveContinuousLinearMap.toPositiveLinearMap_comp 📋 Mathlib.Topology.Algebra.Module.ContinuousLinearMap.Positive
{R : Type u_1} {E₁ : Type u_2} {E₂ : Type u_3} {E₃ : Type u_4} [Semiring R] [AddCommMonoid E₁] [PartialOrder E₁] [AddCommMonoid E₂] [PartialOrder E₂] [Module R E₁] [Module R E₂] [TopologicalSpace E₁] [TopologicalSpace E₂] [AddCommMonoid E₃] [PartialOrder E₃] [Module R E₃] [TopologicalSpace E₃] (g : E₂ →P[R] E₃) (f : E₁ →P[R] E₂) : (g.comp f).toPositiveLinearMap = g.comp f.toPositiveLinearMap - PositiveContinuousLinearMap.toPositiveLinearMap_nsmul 📋 Mathlib.Topology.Algebra.Module.ContinuousLinearMap.Positive
{R : Type u_1} {E₁ : Type u_2} {E₂ : Type u_3} [Semiring R] [AddCommMonoid E₁] [PartialOrder E₁] [AddCommMonoid E₂] [PartialOrder E₂] [Module R E₁] [Module R E₂] [TopologicalSpace E₁] [TopologicalSpace E₂] [IsOrderedAddMonoid E₂] [ContinuousAdd E₂] (f : E₁ →P[R] E₂) (n : ℕ) : (n • f).toPositiveLinearMap = n • f.toPositiveLinearMap - PositiveContinuousLinearMap.toPositiveLinearMap_add 📋 Mathlib.Topology.Algebra.Module.ContinuousLinearMap.Positive
{R : Type u_1} {E₁ : Type u_2} {E₂ : Type u_3} [Semiring R] [AddCommMonoid E₁] [PartialOrder E₁] [AddCommMonoid E₂] [PartialOrder E₂] [Module R E₁] [Module R E₂] [TopologicalSpace E₁] [TopologicalSpace E₂] [IsOrderedAddMonoid E₂] [ContinuousAdd E₂] (f g : E₁ →P[R] E₂) : (f + g).toPositiveLinearMap = f.toPositiveLinearMap + g.toPositiveLinearMap - PositiveContinuousLinearMap.toPositiveLinearMap_mk₀ 📋 Mathlib.Topology.Algebra.Module.ContinuousLinearMap.Positive
{R : Type u_1} {E₁ : Type u_2} {E₂ : Type u_3} [Semiring R] [AddCommGroup E₁] [PartialOrder E₁] [IsOrderedAddMonoid E₁] [TopologicalSpace E₁] [AddCommGroup E₂] [PartialOrder E₂] [IsOrderedAddMonoid E₂] [TopologicalSpace E₂] [Module R E₁] [Module R E₂] (f : E₁ →L[R] E₂) (hf : ∀ (x : E₁), 0 ≤ x → 0 ≤ f x) : (PositiveContinuousLinearMap.mk₀ f hf).toPositiveLinearMap = PositiveLinearMap.mk₀ (↑f) hf - PositiveLinearMap.exists_norm_apply_le 📋 Mathlib.Analysis.CStarAlgebra.PositiveLinearMap
{A₁ : Type u_1} {A₂ : Type u_2} [NonUnitalCStarAlgebra A₁] [NonUnitalCStarAlgebra A₂] [PartialOrder A₁] [StarOrderedRing A₁] [PartialOrder A₂] [StarOrderedRing A₂] (f : A₁ →ₚ[ℂ] A₂) : ∃ C, ∀ (a : A₁), ‖f a‖ ≤ ↑C * ‖a‖ - PositiveLinearMap.norm_apply_le_of_nonneg 📋 Mathlib.Analysis.CStarAlgebra.PositiveLinearMap
{B₁ : Type u_3} {B₂ : Type u_4} [CStarAlgebra B₁] [CStarAlgebra B₂] [PartialOrder B₁] [PartialOrder B₂] [StarOrderedRing B₁] [StarOrderedRing B₂] (f : B₁ →ₚ[ℂ] B₂) (x : B₁) (hx : 0 ≤ x) : ‖f x‖ ≤ ‖f 1‖ * ‖x‖ - PositiveLinearMap.apply_le_of_isSelfAdjoint 📋 Mathlib.Analysis.CStarAlgebra.PositiveLinearMap
{B₁ : Type u_3} {B₂ : Type u_4} [CStarAlgebra B₁] [CStarAlgebra B₂] [PartialOrder B₁] [PartialOrder B₂] [StarOrderedRing B₁] (f : B₁ →ₚ[ℂ] B₂) (x : B₁) (hx : IsSelfAdjoint x) : f x ≤ f ((algebraMap ℝ B₁) ‖x‖) - Matrix.tracePositiveLinearMap 📋 Mathlib.Analysis.Matrix.Order
(n : Type u_3) (α : Type u_4) (𝕜 : Type u_5) [Fintype n] [Semiring α] [RCLike 𝕜] [Module α 𝕜] : Matrix n n 𝕜 →ₚ[α] 𝕜 - Matrix.tracePositiveLinearMap_apply 📋 Mathlib.Analysis.Matrix.Order
(n : Type u_3) (α : Type u_4) (𝕜 : Type u_5) [Fintype n] [Semiring α] [RCLike 𝕜] [Module α 𝕜] (x : Matrix n n 𝕜) : (Matrix.tracePositiveLinearMap n α 𝕜) x = x.trace - LinearMap.tracePositiveLinearMap 📋 Mathlib.Analysis.InnerProductSpace.Positive
(𝕜 : Type u_1) (E : Type u_2) [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] : (E →ₗ[𝕜] E) →ₚ[𝕜] 𝕜 - LinearMap.tracePositiveLinearMap_apply 📋 Mathlib.Analysis.InnerProductSpace.Positive
{𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] (x : E →ₗ[𝕜] E) : (LinearMap.tracePositiveLinearMap 𝕜 E) x = (LinearMap.trace 𝕜 E) x - CompactlySupportedContinuousMap.toNNRealLinear 📋 Mathlib.Topology.ContinuousMap.CompactlySupported
{α : Type u_2} [TopologicalSpace α] (Λ : CompactlySupportedContinuousMap α ℝ →ₚ[ℝ] ℝ) : CompactlySupportedContinuousMap α NNReal →ₗ[NNReal] NNReal - CompactlySupportedContinuousMap.toRealPositiveLinear 📋 Mathlib.Topology.ContinuousMap.CompactlySupported
{α : Type u_2} [TopologicalSpace α] (Λ : CompactlySupportedContinuousMap α NNReal →ₗ[NNReal] NNReal) : CompactlySupportedContinuousMap α ℝ →ₚ[ℝ] ℝ - CompactlySupportedContinuousMap.toNNRealLinear_inj 📋 Mathlib.Topology.ContinuousMap.CompactlySupported
{α : Type u_2} [TopologicalSpace α] (Λ₁ Λ₂ : CompactlySupportedContinuousMap α ℝ →ₚ[ℝ] ℝ) : CompactlySupportedContinuousMap.toNNRealLinear Λ₁ = CompactlySupportedContinuousMap.toNNRealLinear Λ₂ ↔ Λ₁ = Λ₂ - CompactlySupportedContinuousMap.eq_toRealPositiveLinear_toReal 📋 Mathlib.Topology.ContinuousMap.CompactlySupported
{α : Type u_2} [TopologicalSpace α] (Λ : CompactlySupportedContinuousMap α NNReal →ₗ[NNReal] NNReal) (f : CompactlySupportedContinuousMap α NNReal) : (CompactlySupportedContinuousMap.toRealPositiveLinear Λ) f.toReal = ↑(Λ f) - CompactlySupportedContinuousMap.toNNRealLinear_apply 📋 Mathlib.Topology.ContinuousMap.CompactlySupported
{α : Type u_2} [TopologicalSpace α] (Λ : CompactlySupportedContinuousMap α ℝ →ₚ[ℝ] ℝ) (f : CompactlySupportedContinuousMap α NNReal) : ↑((CompactlySupportedContinuousMap.toNNRealLinear Λ) f) = Λ f.toReal - CompactlySupportedContinuousMap.toRealPositiveLinear_apply 📋 Mathlib.Topology.ContinuousMap.CompactlySupported
{α : Type u_2} [TopologicalSpace α] {Λ : CompactlySupportedContinuousMap α NNReal →ₗ[NNReal] NNReal} (f : CompactlySupportedContinuousMap α ℝ) : (CompactlySupportedContinuousMap.toRealPositiveLinear Λ) f = ↑(Λ f.nnrealPart) - ↑(Λ (-f).nnrealPart) - CompactlySupportedContinuousMap.integralPositiveLinearMap 📋 Mathlib.MeasureTheory.Integral.CompactlySupported
{X : Type u_1} [TopologicalSpace X] [MeasurableSpace X] [OpensMeasurableSpace X] (μ : MeasureTheory.Measure X) [MeasureTheory.IsFiniteMeasureOnCompacts μ] : CompactlySupportedContinuousMap X ℝ →ₚ[ℝ] ℝ - CompactlySupportedContinuousMap.integralPositiveLinearMap_apply 📋 Mathlib.MeasureTheory.Integral.CompactlySupported
{X : Type u_1} [TopologicalSpace X] [MeasurableSpace X] [OpensMeasurableSpace X] (μ : MeasureTheory.Measure X) [MeasureTheory.IsFiniteMeasureOnCompacts μ] (f : CompactlySupportedContinuousMap X ℝ) : (CompactlySupportedContinuousMap.integralPositiveLinearMap μ) f = ∫ (x : X), f x ∂μ - RealRMK.rieszMeasure 📋 Mathlib.MeasureTheory.Integral.RieszMarkovKakutani.Real
{X : Type u_1} [TopologicalSpace X] [T2Space X] [MeasurableSpace X] [BorelSpace X] (Λ : CompactlySupportedContinuousMap X ℝ →ₚ[ℝ] ℝ) [LocallyCompactSpace X] : MeasureTheory.Measure X - RealRMK.regular_rieszMeasure 📋 Mathlib.MeasureTheory.Integral.RieszMarkovKakutani.Real
{X : Type u_1} [TopologicalSpace X] [T2Space X] [MeasurableSpace X] [BorelSpace X] (Λ : CompactlySupportedContinuousMap X ℝ →ₚ[ℝ] ℝ) [LocallyCompactSpace X] : (RealRMK.rieszMeasure Λ).Regular - RealRMK.instIsFiniteMeasureRieszMeasure 📋 Mathlib.MeasureTheory.Integral.RieszMarkovKakutani.Real
{X : Type u_1} [TopologicalSpace X] [T2Space X] [MeasurableSpace X] [BorelSpace X] [CompactSpace X] (Λ : CompactlySupportedContinuousMap X ℝ →ₚ[ℝ] ℝ) : MeasureTheory.IsFiniteMeasure (RealRMK.rieszMeasure Λ) - RealRMK.integralPositiveLinearMap_inj 📋 Mathlib.MeasureTheory.Integral.RieszMarkovKakutani.Real
{X : Type u_1} [TopologicalSpace X] [T2Space X] [MeasurableSpace X] [BorelSpace X] {μ ν : MeasureTheory.Measure X} [LocallyCompactSpace X] [μ.Regular] [ν.Regular] : CompactlySupportedContinuousMap.integralPositiveLinearMap μ = CompactlySupportedContinuousMap.integralPositiveLinearMap ν ↔ μ = ν - RealRMK.integralPositiveLinearMap_rieszMeasure 📋 Mathlib.MeasureTheory.Integral.RieszMarkovKakutani.Real
{X : Type u_1} [TopologicalSpace X] [T2Space X] [MeasurableSpace X] [BorelSpace X] (Λ : CompactlySupportedContinuousMap X ℝ →ₚ[ℝ] ℝ) [LocallyCompactSpace X] : CompactlySupportedContinuousMap.integralPositiveLinearMap (RealRMK.rieszMeasure Λ) = Λ - RealRMK.integral_rieszMeasure 📋 Mathlib.MeasureTheory.Integral.RieszMarkovKakutani.Real
{X : Type u_1} [TopologicalSpace X] [T2Space X] [MeasurableSpace X] [BorelSpace X] (Λ : CompactlySupportedContinuousMap X ℝ →ₚ[ℝ] ℝ) [LocallyCompactSpace X] (f : CompactlySupportedContinuousMap X ℝ) : ∫ (x : X), f x ∂ RealRMK.rieszMeasure Λ = Λ f - RealRMK.rieszMeasure_le_of_eq_one 📋 Mathlib.MeasureTheory.Integral.RieszMarkovKakutani.Real
{X : Type u_1} [TopologicalSpace X] [T2Space X] [MeasurableSpace X] [BorelSpace X] (Λ : CompactlySupportedContinuousMap X ℝ →ₚ[ℝ] ℝ) [LocallyCompactSpace X] {f : CompactlySupportedContinuousMap X ℝ} (hf : ∀ (x : X), 0 ≤ f x) {K : Set X} (hK : IsCompact K) (hfK : ∀ x ∈ K, f x = 1) : (RealRMK.rieszMeasure Λ) K ≤ ENNReal.ofReal (Λ f) - RealRMK.le_rieszMeasure_tsupport_subset 📋 Mathlib.MeasureTheory.Integral.RieszMarkovKakutani.Real
{X : Type u_1} [TopologicalSpace X] [T2Space X] [MeasurableSpace X] [BorelSpace X] (Λ : CompactlySupportedContinuousMap X ℝ →ₚ[ℝ] ℝ) [LocallyCompactSpace X] {f : CompactlySupportedContinuousMap X ℝ} (hf : ∀ (x : X), 0 ≤ f x ∧ f x ≤ 1) {V : Set X} (hV : tsupport ⇑f ⊆ V) : ENNReal.ofReal (Λ f) ≤ (RealRMK.rieszMeasure Λ) V
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