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 HH; and closable when T has a closed extension. Recall that the graph norm is xT=(x2+Tx2)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,yT=x,y+Tx,Ty whose induced norm is T.

A linear subspace D0D(T) is a core for a closed operator T when D0 is dense in (D(T),T), equivalently when Γ(TD0)=Γ(T), where the closure is taken in HH and TD0 denotes the restriction of T to D0.

Remarks

Claim 1. T= holds on kerT, and xxT always. The map J:x(x,Tx) is linear, and xT=JxHH. Hence homogeneity and the triangle inequality for T are the corresponding norm properties in HH pulled back along J. It is definite because xT=0 forces x=0 and x=0. The map J is therefore linear and isometric, and its image is Γ(T) with (x,Tx)2=x2+Tx2=xT2; a linear isometry is injective, so it is a bijection onto Γ(T).

Claim 2. The space HH 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 HH 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 qnq<1/(n+1) for every nN. 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 HH, 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,yT 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 Γ(TD0). Hence it carries the closure of D0 onto the closure of Γ(TD0) inside Γ(T). Therefore D0 is graph-norm dense exactly when Γ(TD0)=Γ(T); this topological argument does not replace density by sequential density.

Depends on

Used by

Dependency tree · two levels

24 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