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 ()). Let be a linear operator on with domain and graph (Unbounded linear operators: domain, graph and extension).
is densely defined when is a dense subset of (Dense, nowhere dense and codense subsets of a topological space, and the criterion by basic open sets); closed when is a closed subset of ; and closable when has a closed extension. Recall that the graph norm is .
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:
- is a norm on , and is an isometric isomorphism of onto ;
- is closed if and only if is a complete metric space (Complete metric space: every Cauchy sequence converges in the space);
- if is closed, then is a Hilbert space for the inner product whose induced norm is .
A linear subspace is a core for a closed operator when is dense in , equivalently when , where the closure is taken in and denotes the restriction of to .
Remarks
Claim 1. holds on , and always. The map is linear, and . Hence homogeneity and the triangle inequality for are the corresponding norm properties in pulled back along . It is definite because forces and . The map is therefore linear and isometric, and its image is with ; a linear isometry is injective, so it is a bijection onto .
Claim 2. The space is complete with (Complete metric space: every Cauchy sequence converges in the space, Hilbert space), while carries the subspace metric. If is closed, every Cauchy sequence in it converges in and its limit remains in , so the graph is complete. Conversely suppose is complete and . Countable Choice selects with for every . Then is Cauchy, so it converges to a point of ; uniqueness of metric limits makes that point . Thus is closed. Since the map of claim 1 is an isometry onto , the space is complete exactly when is closed, that is, exactly when is closed.
Claim 3. If is closed then is a closed subspace of the Hilbert space , hence a Hilbert space in its own right, and the inner product transfers to through the isometry of claim 1, making a Hilbert space with inner product and induced norm .
Core. The isometry of claim 1 is a homeomorphism from onto and maps onto . Hence it carries the closure of onto the closure of inside . Therefore is graph-norm dense exactly when ; this topological argument does not replace density by sequential density.
Depends on
Used by
- A symmetric closed operator that is not self-adjoint Counterexample
- An everywhere-defined closed operator on a Banach space is bounded Counterexample
- Adjoint of a densely defined operator Definition
- Deficiency subspaces and deficiency indices Definition
- Resolvent and spectrum of an unbounded operator Definition
- Symmetric, self-adjoint and essentially self-adjoint operators Definition
- Second resolvent identity for a closed perturbation Lemma
- The adjoint is well defined, closed, and reverses inclusions Lemma
- The generator of a unitary group is closed and skew-adjoint Lemma
- The unbounded PVM integral is densely defined, closed and normal Lemma
- Closability is equivalent to density of the adjoint domain Theorem
- Closure of a closable operator Theorem
- Kato-Rellich theorem Theorem
- Von Neumann parameterization of self-adjoint extensions Theorem
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
- Dana P. Williams, Lecture Notes on the Spectral Theorem (standard reference, not scraped)
- Theo Buehler and Dietmar A. Salamon, Functional Analysis (standard reference, not scraped)