The von Neumann algebra generated by a set #
noncomputable def
CommutingRepetition.VN.wstar
{H : Type u_1}
[NormedAddCommGroup H]
[InnerProductSpace ℂ H]
[CompleteSpace H]
(S : Set (H →L[ℂ] H))
:
The von Neumann algebra generated by S: the bicommutant of S ∪ star S.
Equations
- CommutingRepetition.VN.wstar S = { toStarSubalgebra := StarSubalgebra.centralizer ℂ ↑(StarSubalgebra.centralizer ℂ S), centralizer_centralizer' := ⋯ }
Instances For
theorem
CommutingRepetition.VN.mem_wstar_iff
{H : Type u_1}
[NormedAddCommGroup H]
[InnerProductSpace ℂ H]
[CompleteSpace H]
{S : Set (H →L[ℂ] H)}
{T : H →L[ℂ] H}
:
theorem
CommutingRepetition.VN.subset_wstar
{H : Type u_1}
[NormedAddCommGroup H]
[InnerProductSpace ℂ H]
[CompleteSpace H]
{S : Set (H →L[ℂ] H)}
{s : H →L[ℂ] H}
(hs : s ∈ S)
:
theorem
CommutingRepetition.VN.mem_of_commute_commutant
{H : Type u_1}
[NormedAddCommGroup H]
[InnerProductSpace ℂ H]
[CompleteSpace H]
(N : VonNeumannAlgebra H)
{T : H →L[ℂ] H}
(h : ∀ y ∈ N.commutant, y * T = T * y)
:
An element commuting with the commutant of N lies in N (the definition of a von
Neumann algebra).
theorem
CommutingRepetition.VN.commutant_mul_of_mem
{H : Type u_1}
[NormedAddCommGroup H]
[InnerProductSpace ℂ H]
[CompleteSpace H]
{N : VonNeumannAlgebra H}
{T y : H →L[ℂ] H}
(hT : T ∈ N)
(hy : y ∈ N.commutant)
:
theorem
CommutingRepetition.VN.wstar_le
{H : Type u_1}
[NormedAddCommGroup H]
[InnerProductSpace ℂ H]
[CompleteSpace H]
{S : Set (H →L[ℂ] H)}
{N : VonNeumannAlgebra H}
(h : S ⊆ ↑N)
{T : H →L[ℂ] H}
(hT : T ∈ wstar S)
:
wstar S is the smallest von Neumann algebra containing S.
Closure under strong limits and functional calculi #
theorem
CommutingRepetition.VN.mem_of_tendsto
{H : Type u_1}
[NormedAddCommGroup H]
[InnerProductSpace ℂ H]
[CompleteSpace H]
(N : VonNeumannAlgebra H)
{ι : Type u_2}
{l : Filter ι}
[l.NeBot]
{T : ι → H →L[ℂ] H}
{L : H →L[ℂ] H}
(hT : ∀ (i : ι), T i ∈ N)
(h : ∀ (ξ : H), Filter.Tendsto (fun (i : ι) => (T i) ξ) l (nhds (L ξ)))
:
A von Neumann algebra is closed under pointwise (strong) limits of bounded or unbounded nets: the commutation relations pass to the limit.
theorem
CommutingRepetition.VN.cfc_mem
{H : Type u_1}
[NormedAddCommGroup H]
[InnerProductSpace ℂ H]
[CompleteSpace H]
(N : VonNeumannAlgebra H)
{T : H →L[ℂ] H}
(hT : T ∈ N)
(f : ℂ → ℂ)
:
theorem
CommutingRepetition.VN.cfc_real_mem
{H : Type u_1}
[NormedAddCommGroup H]
[InnerProductSpace ℂ H]
[CompleteSpace H]
(N : VonNeumannAlgebra H)
{T : H →L[ℂ] H}
(hT : T ∈ N)
(f : ℝ → ℝ)
:
theorem
CommutingRepetition.VN.bfc_mem
{H : Type u_1}
[NormedAddCommGroup H]
[InnerProductSpace ℂ H]
[CompleteSpace H]
(N : VonNeumannAlgebra H)
{E : H →L[ℂ] H}
(hE : IsSelfAdjoint E)
(hEN : E ∈ N)
{g : ℝ → ℝ}
(hg : BorelCalc.Bdd g)
:
theorem
CommutingRepetition.VN.mem_of_tendsto_seq
{H : Type u_1}
[NormedAddCommGroup H]
[InnerProductSpace ℂ H]
[CompleteSpace H]
(N : VonNeumannAlgebra H)
{T : ℕ → H →L[ℂ] H}
{L : H →L[ℂ] H}
(hT : ∀ (n : ℕ), T n ∈ N)
(h : ∀ (ξ : H), Filter.Tendsto (fun (n : ℕ) => (T n) ξ) Filter.atTop (nhds (L ξ)))
:
Pointwise limits of sequences: the form used for monotone and Cesàro limits.