Loogle!
Result
Found 45 declarations whose name contains "neumann".
- VonNeumannAlgebra 📋 Mathlib.Analysis.VonNeumannAlgebra.Basic
(H : Type u) [NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H] : Type u - VonNeumannAlgebra.instPartialOrder 📋 Mathlib.Analysis.VonNeumannAlgebra.Basic
{H : Type u} [NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H] : PartialOrder (VonNeumannAlgebra H) - VonNeumannAlgebra.commutant 📋 Mathlib.Analysis.VonNeumannAlgebra.Basic
{H : Type u} [NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H] (S : VonNeumannAlgebra H) : VonNeumannAlgebra H - VonNeumannAlgebra.commutant_commutant 📋 Mathlib.Analysis.VonNeumannAlgebra.Basic
{H : Type u} [NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H] (S : VonNeumannAlgebra H) : S.commutant.commutant = S - VonNeumannAlgebra.instSetLike 📋 Mathlib.Analysis.VonNeumannAlgebra.Basic
{H : Type u} [NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H] : SetLike (VonNeumannAlgebra H) (H →L[ℂ] H) - VonNeumannAlgebra.instStarMemClass 📋 Mathlib.Analysis.VonNeumannAlgebra.Basic
{H : Type u} [NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H] : StarMemClass (VonNeumannAlgebra H) (H →L[ℂ] H) - VonNeumannAlgebra.instSubringClass 📋 Mathlib.Analysis.VonNeumannAlgebra.Basic
{H : Type u} [NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H] : SubringClass (VonNeumannAlgebra H) (H →L[ℂ] H) - VonNeumannAlgebra.coe_commutant 📋 Mathlib.Analysis.VonNeumannAlgebra.Basic
{H : Type u} [NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H] (S : VonNeumannAlgebra H) : ↑S.commutant = (↑S).centralizer - VonNeumannAlgebra.ext 📋 Mathlib.Analysis.VonNeumannAlgebra.Basic
{H : Type u} [NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H] {S T : VonNeumannAlgebra H} (h : ∀ (x : H →L[ℂ] H), x ∈ S ↔ x ∈ T) : S = T - VonNeumannAlgebra.ext_iff 📋 Mathlib.Analysis.VonNeumannAlgebra.Basic
{H : Type u} [NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H] {S T : VonNeumannAlgebra H} : S = T ↔ ∀ (x : H →L[ℂ] H), x ∈ S ↔ x ∈ T - VonNeumannAlgebra.centralizer_centralizer 📋 Mathlib.Analysis.VonNeumannAlgebra.Basic
{H : Type u} [NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H] (S : VonNeumannAlgebra H) : (↑S).centralizer.centralizer = ↑S - VonNeumannAlgebra.toStarSubalgebra 📋 Mathlib.Analysis.VonNeumannAlgebra.Basic
{H : Type u} [NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H] (self : VonNeumannAlgebra H) : StarSubalgebra ℂ (H →L[ℂ] H) - VonNeumannAlgebra.IsStarProjection.mem_iff 📋 Mathlib.Analysis.VonNeumannAlgebra.Basic
{H : Type u} [NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H] {e : H →L[ℂ] H} (he : IsStarProjection e) (S : VonNeumannAlgebra H) : e ∈ S ↔ ∀ y ∈ S.commutant, (↑e).range ∈ Module.End.invtSubmodule ↑y - VonNeumannAlgebra.mem_commutant_iff 📋 Mathlib.Analysis.VonNeumannAlgebra.Basic
{H : Type u} [NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H] {S : VonNeumannAlgebra H} {z : H →L[ℂ] H} : z ∈ S.commutant ↔ ∀ g ∈ S, g * z = z * g - VonNeumannAlgebra.coe_toStarSubalgebra 📋 Mathlib.Analysis.VonNeumannAlgebra.Basic
{H : Type u} [NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H] (S : VonNeumannAlgebra H) : ↑S.toStarSubalgebra = ↑S - VonNeumannAlgebra.IsIdempotentElem.mem_iff 📋 Mathlib.Analysis.VonNeumannAlgebra.Basic
{H : Type u} [NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H] {e : H →L[ℂ] H} (h : IsIdempotentElem e) (S : VonNeumannAlgebra H) : e ∈ S ↔ ∀ y ∈ S.commutant, (↑e).range ∈ Module.End.invtSubmodule ↑y ∧ (↑e).ker ∈ Module.End.invtSubmodule ↑y - VonNeumannAlgebra.mem_carrier 📋 Mathlib.Analysis.VonNeumannAlgebra.Basic
{H : Type u} [NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H] {S : VonNeumannAlgebra H} {x : H →L[ℂ] H} : x ∈ S.toStarSubalgebra ↔ x ∈ ↑S - VonNeumannAlgebra.centralizer_centralizer' 📋 Mathlib.Analysis.VonNeumannAlgebra.Basic
{H : Type u} [NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H] (self : VonNeumannAlgebra H) : self.carrier.centralizer.centralizer = self.carrier - VonNeumannAlgebra.mk 📋 Mathlib.Analysis.VonNeumannAlgebra.Basic
{H : Type u} [NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H] (toStarSubalgebra : StarSubalgebra ℂ (H →L[ℂ] H)) (centralizer_centralizer' : toStarSubalgebra.carrier.centralizer.centralizer = toStarSubalgebra.carrier) : VonNeumannAlgebra H - VonNeumannAlgebra.coe_mk 📋 Mathlib.Analysis.VonNeumannAlgebra.Basic
{H : Type u} [NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H] (S : StarSubalgebra ℂ (H →L[ℂ] H)) (h : S.carrier.centralizer.centralizer = S.carrier) : ↑{ toStarSubalgebra := S, centralizer_centralizer' := h } = ↑S - ZFSet.vonNeumann 📋 Mathlib.SetTheory.ZFC.VonNeumann
(o : Ordinal.{u}) : ZFSet.{u} - ZFSet.isTransitive_vonNeumann 📋 Mathlib.SetTheory.ZFC.VonNeumann
(o : Ordinal.{u_1}) : (ZFSet.vonNeumann o).IsTransitive - ZFSet.vonNeumann_injective 📋 Mathlib.SetTheory.ZFC.VonNeumann
: Function.Injective ZFSet.vonNeumann - ZFSet.rank_vonNeumann 📋 Mathlib.SetTheory.ZFC.VonNeumann
(o : Ordinal.{u_1}) : (ZFSet.vonNeumann o).rank = o - Ordinal.toZFSet_subset_vonNeumann 📋 Mathlib.SetTheory.ZFC.VonNeumann
(o : Ordinal.{u_1}) : o.toZFSet ⊆ ZFSet.vonNeumann o - ZFSet.card_vonNeumann 📋 Mathlib.SetTheory.ZFC.VonNeumann
(o : Ordinal.{u}) : (ZFSet.vonNeumann o).card = Cardinal.preBeth o - ZFSet.subset_vonNeumann_self 📋 Mathlib.SetTheory.ZFC.VonNeumann
(x : ZFSet.{u_1}) : x ⊆ ZFSet.vonNeumann x.rank - Ordinal.card_le_card_vonNeumann 📋 Mathlib.SetTheory.ZFC.VonNeumann
(o : Ordinal.{u_1}) : o.card ≤ (ZFSet.vonNeumann o).card - ZFSet.vonNeumann_strictMono 📋 Mathlib.SetTheory.ZFC.VonNeumann
: StrictMono ZFSet.vonNeumann - ZFSet.iUnion_vonNeumann 📋 Mathlib.SetTheory.ZFC.VonNeumann
: ⋃ o, ↑(ZFSet.vonNeumann o) = Class.univ - ZFSet.vonNeumann_zero 📋 Mathlib.SetTheory.ZFC.VonNeumann
: ZFSet.vonNeumann 0 = ∅ - ZFSet.vonNeumann_inj 📋 Mathlib.SetTheory.ZFC.VonNeumann
{a b : Ordinal.{u}} : ZFSet.vonNeumann a = ZFSet.vonNeumann b ↔ a = b - ZFSet.exists_mem_vonNeumann 📋 Mathlib.SetTheory.ZFC.VonNeumann
(x : ZFSet.{u_1}) : ∃ o, x ∈ ZFSet.vonNeumann o - ZFSet.vonNeumann_succ 📋 Mathlib.SetTheory.ZFC.VonNeumann
(o : Ordinal.{u_1}) : ZFSet.vonNeumann (Order.succ o) = (ZFSet.vonNeumann o).powerset - ZFSet.mem_vonNeumann_succ 📋 Mathlib.SetTheory.ZFC.VonNeumann
(x : ZFSet.{u_1}) : x ∈ ZFSet.vonNeumann (Order.succ x.rank) - ZFSet.vonNeumann_subset_of_le 📋 Mathlib.SetTheory.ZFC.VonNeumann
{a b : Ordinal.{u}} (h : a ≤ b) : ZFSet.vonNeumann a ⊆ ZFSet.vonNeumann b - ZFSet.subset_vonNeumann 📋 Mathlib.SetTheory.ZFC.VonNeumann
{o : Ordinal.{u_1}} {x : ZFSet.{u_1}} : x ⊆ ZFSet.vonNeumann o ↔ x.rank ≤ o - ZFSet.vonNeumann_subset_vonNeumann_iff 📋 Mathlib.SetTheory.ZFC.VonNeumann
{a b : Ordinal.{u}} : ZFSet.vonNeumann a ⊆ ZFSet.vonNeumann b ↔ a ≤ b - ZFSet.vonNeumann_add_one 📋 Mathlib.SetTheory.ZFC.VonNeumann
(o : Ordinal.{u_1}) : ZFSet.vonNeumann (o + 1) = (ZFSet.vonNeumann o).powerset - ZFSet.vonNeumann_mem_of_lt 📋 Mathlib.SetTheory.ZFC.VonNeumann
{a b : Ordinal.{u}} (h : a < b) : ZFSet.vonNeumann a ∈ ZFSet.vonNeumann b - ZFSet.mem_vonNeumann 📋 Mathlib.SetTheory.ZFC.VonNeumann
{o : Ordinal.{u}} {x : ZFSet.{u}} : x ∈ ZFSet.vonNeumann o ↔ x.rank < o - ZFSet.vonNeumann_mem_vonNeumann_iff 📋 Mathlib.SetTheory.ZFC.VonNeumann
{a b : Ordinal.{u}} : ZFSet.vonNeumann a ∈ ZFSet.vonNeumann b ↔ a < b - ZFSet.mem_vonNeumann_of_subset 📋 Mathlib.SetTheory.ZFC.VonNeumann
{o : Ordinal.{u}} {x y : ZFSet.{u}} (h : x ⊆ y) (hy : y ∈ ZFSet.vonNeumann o) : x ∈ ZFSet.vonNeumann o - ZFSet.mem_vonNeumann' 📋 Mathlib.SetTheory.ZFC.VonNeumann
{o : Ordinal.{u}} {x : ZFSet.{u}} : x ∈ ZFSet.vonNeumann o ↔ ∃ a < o, x ⊆ ZFSet.vonNeumann a - ZFSet.vonNeumann_of_isSuccPrelimit 📋 Mathlib.SetTheory.ZFC.VonNeumann
{o : Ordinal.{u}} (h : Order.IsSuccPrelimit o) : ZFSet.vonNeumann o = ZFSet.iUnion fun a => ZFSet.vonNeumann ↑a
About
Loogle searches Lean and Mathlib definitions and theorems.
You can use Loogle from within the Lean4 VSCode language extension
using (by default) Ctrl-K Ctrl-S. 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 88c39f3 serving mathlib revision d2a1d69