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.
Closability is equivalent to density of the adjoint domain
Statement
Assume Countable Choice. Let be a densely defined linear operator on . Then is closable if and only if is dense in . In that case and ; moreover if , then is closable.
Facts & Assumptions
For densely defined the adjoint is defined by for , , and . Putting defines a bijective isometry of with , and maps orthocomplements to orthocomplements: (Adjoint of a densely defined operator, Hilbert space, Orthogonality and the orthogonal complement).
If is a linear subspace of the Hilbert space , then (The double orthogonal complement of a subspace is its closure).
For a densely defined the operator is closed. If in addition is dense, then is defined, is closed, and contains (The adjoint is well defined, closed, and reverses inclusions, Adjoint of a densely defined operator).
is closable when it has a closed extension; if is closable then is the least closed extension of and (Closure of a closable operator, Densely defined, closed and closable operators, and cores).
Proof
Given: A densely defined linear operator on .
By [A1] we have : indeed means for all , which is exactly for all , that is .
Assume in addition that is dense, so that is defined. Replacing by in step 1.1 gives , so by step 1.1 and unitarity of , with and , one has .
Conversely assume is closable, and let be its closure, a closed densely defined operator with and by [A4]. Then is dense: if then , so by step 1.1 applied to and closedness of we get , that is for some , forcing and .
Under the hypothesis of step 2.1 the set is the graph of the operator , which is closed by [A3]; hence has a closed extension and is closable, and its closure is by minimality in [A4].
With closable as in step 2.2, apply step 1.1 to and to : using and [A2] one gets , so and is dense by step 2.2.
The two implications are steps 3.1 (density of gives closability, with closure ) and 3.2 (closability gives density of , and ). If , then is a closed extension of by [A3], so is closable.
Depends on
- Closure of a closable operator
- The adjoint is well defined, closed, and reverses inclusions
- The double orthogonal complement of a subspace is its closure
- Adjoint of a densely defined operator
- Densely defined, closed and closable operators, and cores
- Orthogonality and the orthogonal complement
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- Hilbert space
- Unbounded linear operators: domain, graph and extension
Used by
Dependency tree · two levels
27 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)
- Gerald Teschl, Mathematical Methods in Quantum Mechanics, second edition (standard reference, not scraped)