Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-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.

Densely defined, closed and closable operators, and cores

Definition

Assume Countable Choice (The Axiom of Countable Choice (ACω)). Let T be a linear operator on H with domain D(T) and graph Γ(T) (Unbounded linear operators: domain, graph and extension).

T is densely defined when D(T) is a dense subset of H (Dense, nowhere dense and codense subsets of a topological space, and the criterion by basic open sets); closed when Γ(T) is a closed subset of H⊕H; and closable when T has a closed extension. Recall that the graph norm is ∥x∥T=(∥x∥2+∥Tx∥2)1/2.

The graph-norm dictionary. The following three statements are part of the definition's content and are proved in the remarks below rather than assumed:

  1. ∥⋅∥T is a norm on D(T), and x↦(x,Tx) is an isometric isomorphism of (D(T),∥⋅∥T) onto Γ(T);
  2. T is closed if and only if (D(T),∥⋅∥T) is a complete metric space (Complete metric space: every Cauchy sequence converges in the space);
  3. if T is closed, then D(T) is a Hilbert space for the inner product ⟨x,y⟩T=⟨x,y⟩+⟨Tx,Ty⟩ whose induced norm is ∥⋅∥T.

A linear subspace D0⊆D(T) is a core for a closed operator T when D0 is dense in (D(T),∥⋅∥T), equivalently when Γ(T∣D0)‾=Γ(T), where the closure is taken in H⊕H and T∣D0 denotes the restriction of T to D0.

Remarks

Claim 1. ∥⋅∥T=∥⋅∥ holds on ker⁡T, and ∥x∥≤∥x∥T always. The map J:x↦(x,Tx) is linear, and ∥x∥T=∥Jx∥H⊕H. Hence homogeneity and the triangle inequality for ∥⋅∥T are the corresponding norm properties in H⊕H pulled back along J. It is definite because ∥x∥T=0 forces ∥x∥=0 and x=0. The map J is therefore linear and isometric, and its image is Γ(T) with ∥(x,Tx)∥2=∥x∥2+∥Tx∥2=∥x∥T2; a linear isometry is injective, so it is a bijection onto Γ(T).

Claim 2. The space H⊕H is complete with ∥(x,y)∥ (Complete metric space: every Cauchy sequence converges in the space, Hilbert space), while Γ(T) carries the subspace metric. If Γ(T) is closed, every Cauchy sequence in it converges in H⊕H and its limit remains in Γ(T), so the graph is complete. Conversely suppose Γ(T) is complete and q∈Γ(T)‾. Countable Choice selects qn∈Γ(T) with ∥qn−q∥<1/(n+1) for every n∈N. Then (qn) is Cauchy, so it converges to a point of Γ(T); uniqueness of metric limits makes that point q. Thus Γ(T) is closed. Since the map of claim 1 is an isometry onto Γ(T), the space (D(T),∥⋅∥T) is complete exactly when Γ(T) is closed, that is, exactly when T is closed.

Claim 3. If T is closed then Γ(T) is a closed subspace of the Hilbert space H⊕H, hence a Hilbert space in its own right, and the inner product ⟨(x,Tx),(y,Ty)⟩=⟨x,y⟩+⟨Tx,Ty⟩ transfers to D(T) through the isometry of claim 1, making D(T) a Hilbert space with inner product ⟨x,y⟩T and induced norm ∥⋅∥T.

Core. The isometry J:x↦(x,Tx) of claim 1 is a homeomorphism from (D(T),∥⋅∥T) onto Γ(T) and maps D0 onto Γ(T∣D0). Hence it carries the closure of D0 onto the closure of Γ(T∣D0) inside Γ(T). Therefore D0 is graph-norm dense exactly when Γ(T∣D0)‾=Γ(T); this topological argument does not replace density by sequential density.

Depends on

Dependency tree · 2 levels

Sources