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 on the adjoint is well defined and linear with linear domain ; is closed; for every and if and both are densely defined, then .
Facts & Assumptions
holds exactly when is bounded on , and then is the unique with for all ; is linear and is a linear subspace (Adjoint of a densely defined operator, The Axiom of Countable Choice ()).
is closed exactly when is closed, and (Unbounded linear operators: domain, graph and extension, Adjoint of a densely defined operator).
Proof
Given: A densely defined linear operator on .
By [A1] the adjoint is well defined, is a linear subspace and is linear.
Let with and . For every we have , both limits being scalar limits; hence is bounded, with . So and by [A1], and therefore is closed.
Let and . If , then , that is , for every ; this exhibits as a bounded functional, so and by uniqueness in [A1]. Conversely if , then for every , so . Hence .
If are densely defined, then for every , so every pair lies in by [A3]; hence .
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
- Adjoint of a densely defined operator
- Densely defined, closed and closable operators, and cores
- Unbounded linear operators: domain, graph and extension
- Dense, nowhere dense and codense subsets of a topological space, and the criterion by basic open sets
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
Used by
- A symmetric closed operator that is not self-adjoint Counterexample
- An everywhere-defined closed operator on a Banach space is bounded Counterexample
- Deficiency subspaces and deficiency indices Definition
- Symmetric, self-adjoint and essentially self-adjoint operators Definition
- The generator of a unitary group is closed and skew-adjoint Lemma
- The unbounded PVM integral is densely defined, closed and normal Lemma
- Cayley correspondence between self-adjoint operators and unitaries Theorem
- Closability is equivalent to density of the adjoint domain Theorem
- Range criterion for self-adjointness Theorem
- Resolvent of a self-adjoint operator: nonreal resolvents and the estimate Theorem
Dependency tree · two levels
20 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)