Alphabeta Math
LemmaStatement: 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.

The adjoint is well defined, closed, and reverses inclusions

Statement

Assume Countable Choice. For a densely defined linear operator T on H the adjoint T is well defined and linear with linear domain D(T); T is closed; for every zC ran(Tz)=ker(Tz), and if ST and both are densely defined, then TS.

Facts & Assumptions

[A1]

yD(T) holds exactly when xTx,y is bounded on D(T), and then Ty is the unique w with Tx,y=x,w for all xD(T); T is linear and D(T) is a linear subspace (Adjoint of a densely defined operator, The Axiom of Countable Choice (ACω)).

[A3]

T is closed exactly when Γ(T) is closed, and Γ(T)={(y,w):Tx,y=x,w for all xD(T)} (Unbounded linear operators: domain, graph and extension, Adjoint of a densely defined operator).

Proof

technique · direct

Given: A densely defined linear operator T on H.

1.1

By [A1] the adjoint is well defined, D(T) is a linear subspace and T is linear.

A1
1.2

Let ynD(T) with yny and Tynw. For every xD(T) we have Tx,y=limnTx,yn=limnx,Tyn=x,w, both limits being scalar limits; hence xTx,y is bounded, with Tx,y=x,wxw. So yD(T) and Ty=w by [A1], and therefore T is closed.

A1
1.3

Let yH and zC. If yran(Tz), then (Tz)x,y=0, that is Tx,y=zx,y=x,zy, for every xD(T); this exhibits xTx,y as a bounded functional, so yD(T) and Ty=zy by uniqueness in [A1]. Conversely if Ty=zy, then (Tz)x,y=x,zyzx,y=0 for every xD(T), so yran(Tz). Hence ran(Tz)=ker(Tz).

A1
1.4

If ST are densely defined, then Sx,y=Tx,y=x,w for every xD(S), so every pair (y,w)Γ(T) lies in Γ(S) by [A3]; hence TS.

A3
2.1

Claims collected: well-definedness and linearity from step 1.1, closedness from step 1.2, the kernel-range identity from step 1.3, and the inclusion reversal from step 1.4. ∎

Depends on

Used by

Dependency tree · two levels

20 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