Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedjudge pass (gpt-6-sol)audited 2026-09-30
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Von Neumann algebras and commutants

Definition

Assume AC. Let H be a complex Hilbert space and let B(H) denote its bounded linear operators. Applying AC to a family indexed by the natural numbers supplies Countable Choice, the hypothesis of Hilbert-adjoint identities, which provides adjoints on B(H). A concrete von Neumann algebra on H is a unital ∗-subalgebra A⊆B(H) that is closed in the weak operator topology (WOT). Here unital means IH∈A; the zero Hilbert space is allowed, with IH=0 and sole unital algebra {0}. This is the only use of AC in this definition.

For any set S⊆B(H), its commutant and double commutant are S′:={T∈B(H):TS=ST for every S∈S},S′′:=(S′)′. Commutants are taken inside B(H). The von Neumann algebra generated by S is W∗(S):=Alg⁡∗(S∪{IH})‾ WOT, the WOT closure in B(H) of the unital ∗-algebra generated by S. No bicommutant theorem is part of these definitions.

Two elementary properties will be used. For fixed S∈B(H), ⟨TSξ,η⟩=⟨T(Sξ),η⟩,⟨STξ,η⟩=⟨Tξ,S∗η⟩ are WOT-continuous matrix coefficients as functions of T. Thus each equation TS=ST defines a WOT-closed set, and so S′ is WOT-closed. If S is self-adjoint, then S′ is a unital ∗-subalgebra: products preserve commutation with every S, and taking adjoints of TS=ST gives ST∗=T∗S. These facts do not identify W∗(S) with S′′.

Depends on

Used by

Dependency tree · two levels

19 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources