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 z∈C ran⁡(T−z)⊥=ker⁡(T∗−z‾), and if S⊆T and both are densely defined, then T∗⊆S∗.

Facts & Assumptions

[A1]

y∈D(T∗) holds exactly when x↦⟨Tx,y⟩ is bounded on D(T), and then T∗y is the unique w with ⟨Tx,y⟩=⟨x,w⟩ for all x∈D(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 x∈D(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.1A1

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

1.2A1

Let yn∈D(T∗) with yn→y and T∗yn→w. For every x∈D(T) we have ⟨Tx,y⟩=lim⁡n⟨Tx,yn⟩=lim⁡n⟨x,T∗yn⟩=⟨x,w⟩, both limits being scalar limits; hence x↦⟨Tx,y⟩ is bounded, with ∣⟨Tx,y⟩∣=∣⟨x,w⟩∣≤∥x∥ ∥w∥. So y∈D(T∗) and T∗y=w by [A1], and therefore T∗ is closed.

1.3A1

Let y∈H and z∈C. If y⊥ran⁡(T−z), then ⟨(T−z)x,y⟩=0, that is ⟨Tx,y⟩=z⟨x,y⟩=⟨x,z‾y⟩, for every x∈D(T); this exhibits x↦⟨Tx,y⟩ as a bounded functional, so y∈D(T∗) and T∗y=z‾y by uniqueness in [A1]. Conversely if T∗y=z‾y, then ⟨(T−z)x,y⟩=⟨x,z‾y⟩−z⟨x,y⟩=0 for every x∈D(T), so y⊥ran⁡(T−z). Hence ran⁡(T−z)⊥=ker⁡(T∗−z‾).

1.4A3

If S⊆T are densely defined, then ⟨Sx,y⟩=⟨Tx,y⟩=⟨x,w⟩ for every x∈D(S), so every pair (y,w)∈Γ(T∗) lies in Γ(S∗) by [A3]; hence T∗⊆S∗.

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

Dependency tree · 2 levels

Sources