Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedaudited 2026-09-22
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.

Closability is equivalent to density of the adjoint domain

Statement

Assume Countable Choice. Let T be a densely defined linear operator on H. Then T is closable if and only if D(T∗) is dense in H. In that case T‾=T∗∗ and T∗=T‾ ∗; moreover if T⊆T∗, then T is closable.

Facts & Assumptions

[A1]

For densely defined T the adjoint is defined by ⟨Tx,y⟩=⟨x,T∗y⟩ for x∈D(T), y∈D(T∗), and Γ(T∗)={(y,w):⟨Tx,y⟩=⟨x,w⟩ for all x∈D(T)}. Putting W(x,y):=(−y,x) defines a bijective isometry of H⊕H with W2=−I, and W maps orthocomplements to orthocomplements: W(M⊥)=(WM)⊥ (Adjoint of a densely defined operator, Hilbert space, Orthogonality and the orthogonal complement).

[A2]

If M is a linear subspace of the Hilbert space H⊕H, then M⊥⊥=M‾ (The double orthogonal complement of a subspace is its closure).

[A3]

For a densely defined T the operator T∗ is closed. If in addition D(T∗) is dense, then T∗∗ is defined, is closed, and contains T (The adjoint is well defined, closed, and reverses inclusions, Adjoint of a densely defined operator).

[A4]

T is closable when it has a closed extension; if T is closable then T‾ is the least closed extension of T and T⊆T‾ (Closure of a closable operator, Densely defined, closed and closable operators, and cores).

Proof

technique · direct

Given: A densely defined linear operator T on H.

1.1A1

By [A1] we have Γ(T∗)=W Γ(T)⊥: indeed (y,w)∈Γ(T∗) means ⟨Tx,y⟩=⟨x,w⟩ for all x∈D(T), which is exactly ⟨(x,Tx),W(y,w)⟩=0 for all x∈D(T), that is W(y,w)⊥Γ(T).

2.1step 1.1A1A2

Assume in addition that D(T∗) is dense, so that T∗∗ is defined. Replacing T by T∗ in step 1.1 gives Γ(T∗∗)=W Γ(T∗)⊥, so by step 1.1 and unitarity of W, with W(M⊥)=(WM)⊥ and W2=−I, one has Γ(T∗∗)=W (W Γ(T)⊥)⊥=W W Γ(T)⊥⊥=−Γ(T)‾=Γ(T)‾.

2.2A1A2A4step 1.1

Conversely assume T is closable, and let T‾ be its closure, a closed densely defined operator with Γ(T)⊆Γ(T‾) and Γ(T)‾=Γ(T‾) by [A4]. Then D(T‾∗) is dense: if y⊥D(T‾∗) then (y,0)⊥Γ(T‾∗), so by step 1.1 applied to T‾ and closedness of T‾ we get (y,0)∈Γ(T‾∗)⊥=W Γ(T‾)⊥⊥=W Γ(T‾), that is (y,0)=W(x,T‾x)=(−T‾x,x) for some x∈D(T‾), forcing x=0 and y=0.

3.1step 2.1A3A4

Under the hypothesis of step 2.1 the set Γ(T)‾ is the graph of the operator T∗∗, which is closed by [A3]; hence T has a closed extension and is closable, and its closure is T∗∗ by minimality in [A4].

3.2A1A2step 1.1step 2.2

With T closable as in step 2.2, apply step 1.1 to T and to T‾: using Γ(T)‾=Γ(T‾) and [A2] one gets Γ(T∗)=W Γ(T)⊥=W Γ(T)‾⊥=W Γ(T‾)⊥=Γ(T‾∗), so T∗=T‾∗ and D(T∗)=D(T‾∗) is dense by step 2.2.

4.1step 3.1step 3.2∎

The two implications are steps 3.1 (density of D(T∗) gives closability, with closure T∗∗) and 3.2 (closability gives density of D(T∗), and T∗=T‾∗). If T⊆T∗, then T∗ is a closed extension of T by [A3], so T is closable.

Depends on

Dependency tree · 2 levels

Sources