Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedverified 2026-10-22 (gpt-6.1-sol)
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.

Closed antilinear polar calculus and Tomita-operator closability

Statement

For this item, let H be a complex Hilbert space and let S:D(S)⊆H→H be an antilinear operator. Set Γ(S):={(x,Sx):x∈D(S)}⊆H⊕H, where H⊕H has its direct-sum Hilbert norm. Use the conjugate space H‾, canonical conjugate-linear surjective isometry cH:H→H‾, and linearization S~:D(S~)⊆H‾→H from the earlier conjugate-Hilbert-space and antilinear-adjoint definition. The map cH⊕IH:H⊕H→H‾⊕H given by (x,y)↦(cHx,y), with IH the identity on H, is a real-linear isometric bijection and sends Γ(S) onto Γ(S~). Call S closed or closable when S~ is closed or closable, respectively, in the complex-linear sense already defined for densely defined operators. For closable S, S‾ denotes the antilinear operator whose graph is the norm closure of Γ(S); the proof verifies that this closure is a graph and equivalently that S‾~ is the graph closure of S~. An antiunitary on H means a conjugate-linear, surjective isometry H→H.

Assume the Axiom of Choice. Let H be a complex Hilbert space and let S:D(S)⊆H→H be a densely defined closable antilinear operator. Its graph closure S‾ is closed and has the polar decomposition S‾=J∣S‾∣,∣S‾∣=(S‾ ∗S‾)1/2. Here J is antilinear, vanishes on ker⁡S‾, and is isometric on (ker⁡S‾)⊥; if S‾ is injective and has dense range, J is antiunitary.

For a concrete von Neumann algebra M⊆B(H) and a vector Ω cyclic and separating for M, define D(S0)=MΩ and S0(xΩ)=x∗Ω for x∈M. Then S0 is well defined, densely defined, antilinear, and closable.

Facts & Assumptions

Given: [A1], a complex Hilbert space H, a densely defined closable antilinear S, and, for the Tomita clause, a concrete von Neumann algebra M with a cyclic and separating vector Ω.

[A1]

Assume the Axiom of Choice, used by the local closed-operator polar lemma (The Axiom of Choice).

[F1]

The conjugate space H‾, canonical conjugate-linear isometry cH, linearization S~, and antilinear adjoint S∗ are defined by Conjugate Hilbert space and adjoint of an antilinear operator. In particular, S∗=cH−1S~∗.

[F2]

A closed densely defined linear operator A has polar decomposition A=UB, where B=(A∗A)1/2 is positive self-adjoint with D(B)=D(A), and U has the stated initial and final spaces; when A is injective with dense range, U is unitary (Polar decomposition of a closed densely defined operator).

[F3]

For a concrete von Neumann algebra, a vector is cyclic for M′ exactly when it is separating for M′′=M (Strong closure and cyclic-separating duality, Concrete von Neumann algebra and faithful vector).

[F4]

A densely defined operator is closable exactly when its graph closure is the graph of a closed operator. Here this criterion is applied to the complex-linear operator S~: by the linear definition, closability means that S~ has a closed linear extension. The closure of its graph is then contained in the graph of every such extension, so its vertical fiber is zero and the closed graph itself defines the smallest closed extension. Conversely, if that graph closure is a graph, it is a closed extension. The isometry cH⊕IH transfers this criterion to Γ(S); its inverse sends a graph of a complex-linear operator to the graph of an antilinear operator. Thus it also defines S‾ and identifies its graph with Γ(S)‾ (Unbounded linear operators: domain, graph and extension, Densely defined, closed and closable operators, and cores).

[F5]

If T is a closed densely defined antilinear operator and A=T~, then T∗=cH−1A∗ and, with the operator-composition domains, T∗T=cH−1(A∗A)cH. Conjugation by cH carries positive self-adjoint operators and their positive square roots to positive self-adjoint operators on H; this follows by transporting the spectral projections in the unbounded spectral calculus (Polar decomposition of a closed densely defined operator).

Proof

technique · direct

Given: [A1], [F1]–[F4], the operator S, and the cyclic-separating data for S0.

1.1A1F1F2F5constructalgebra

Put C=cH and T=S‾. The definition of graph closure above makes A:=T~ a closed densely defined complex-linear operator H‾→H. By [F2], write A=UB, where B=(A∗A)1/2 is positive self-adjoint with D(B)=D(A) and U is a partial isometry with initial space ran⁡B‾=(ker⁡A)⊥, final space ran⁡A‾, and kernel ker⁡A. Set J:=UC and P:=C−1BC, with domain D(P)=C−1D(B). The composition P is linear. If E is the spectral measure of B, then F(Λ):=C−1E(Λ)C is a spectral measure of orthogonal projections on H, and its spectral integral is P; hence P is positive self-adjoint. More explicitly, D(T∗T)={x:Cx∈D(A), ACx∈D(A∗)}=C−1D(A∗A), and the adjoint convention [F1] gives T∗T=C−1A∗AC there. Also D(P2)=C−1D(B2) and P2=C−1B2C=C−1A∗AC=T∗T on that domain; uniqueness of the positive self-adjoint square root gives P=(T∗T)1/2. For x∈D(T), JPx=UCC−1BCx=UBCx=ACx=Tx, so T=JP. The operator J is antilinear, vanishes on ker⁡T, and is isometric on (ker⁡T)⊥, since C maps ker⁡T onto ker⁡A and preserves orthogonality. Its final space is ran⁡T‾. If T is injective and has dense range, then A is injective with dense range, so U is unitary by [F2] and J=UC is antiunitary.

1.2givenF3algebra

For x,y∈M, if xΩ=yΩ, then (x−y)Ω=0; separatingness of Ω for M forces x=y. Thus the rule S0(xΩ)=x∗Ω is well defined. It is antilinear because (ax+by)∗=a‾ x∗+b‾ y∗, and its domain is dense because Ω is cyclic for M.

2.1givenF3F4step 1.2algebra

Let un∈D(S~0) satisfy un→0 in H‾ and S~0un→η in H. Write un=C(xnΩ) with xn∈M; then xnΩ→0 and xn∗Ω=S0(xnΩ)=S~0un→η. For every y′∈M′, the linear-first adjoint identity and commutation give ⟨η,y′Ω⟩=lim⁡n⟨xn∗Ω,y′Ω⟩=lim⁡n⟨y′∗Ω,xnΩ⟩=0. Since Ω is separating for M, [F3] makes it cyclic for M′, so M′Ω is dense and η=0. Thus the graph closure of the linear operator S~0 has zero vertical fiber: because H‾⊕H is a metric space, every point of that closure is the limit of a sequence of graph points, and the argument just given excludes a nonzero limit over 0. This closed linear subspace is therefore the graph of a closed linear extension of S~0. By [F4], S~0 is closable, and the local convention above proves that S0 is closable with graph closure defined there.

3.1step 1.1step 1.2step 2.1∎

Step 1.1 proves the polar decomposition for the closure of every densely-defined closable antilinear operator, and steps 1.2–2.1 prove the Tomita operator clause with its stated cyclic-separating hypotheses. The Choice assumption is inherited through the spectral theorem used in [F2].

Depends on

Dependency tree · 2 levels

Sources