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.
An everywhere-defined closed operator on a Banach space is bounded
Statement refuted
Assume Dependent Choice. The inference that a closed linear operator defined on all of a Banach space can nevertheless be unbounded is false. Indeed, if are Banach spaces and is linear, defined on all of , and has closed graph in , then is bounded. Consequently an unbounded self-adjoint operator on a Hilbert space cannot have domain : its domain is a proper dense subspace.
Facts & Assumptions
Under Dependent Choice, an everywhere defined linear map between Banach spaces is bounded if and only if its graph is closed (Closed graph theorem, The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain).
A self-adjoint operator is densely defined and closed, being equal to the adjoint of a densely defined operator (Symmetric, self-adjoint and essentially self-adjoint operators, The adjoint is well defined, closed, and reverses inclusions, Unbounded linear operators: domain, graph and extension).
A Hilbert space is a Banach space, so the closed graph theorem applies to everywhere defined operators on it (Hilbert space, Closed graph theorem).
Counterexample
Given: Banach spaces and an everywhere defined linear with closed graph.
The closed graph theorem gives that is bounded: an everywhere defined linear map between Banach spaces with closed graph is bounded.
Let be a Hilbert space and let be a self-adjoint operator on . A self-adjoint operator is closed, being equal to the adjoint of a densely defined operator; if in addition , then step 1.1 applied to shows that is bounded.
Therefore a self-adjoint operator that is unbounded must have , and its domain is dense by the definition of self-adjointness; the claimed impossibility of an unbounded everywhere-defined self-adjoint operator follows.
Both conclusions are steps 1.1 and 2.1, and the hypothesis used is exactly Dependent Choice, through the closed graph theorem. ∎
Depends on
- Densely defined, closed and closable operators, and cores
- Closed graph theorem
- Symmetric, self-adjoint and essentially self-adjoint operators
- Unbounded linear operators: domain, graph and extension
- The axiom of dependent choice: a relation in which every element is related to something admits an $\mathbb{N}$-indexed chain
- Hilbert space
- The adjoint is well defined, closed, and reverses inclusions
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
26 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)