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.
F4 Bare Nodal Evaluation Supercharge Not Closable
Pure local functional-analysis counterexample under the explicit Euclidean disk and H1 graph-norm hypotheses; no actual physical degeneration is assumed.
Statement
Assume the Axiom of Choice. Let be the open unit disk with Lebesgue measure, let , and write for the compactly supported smooth complex functions on . A function is the weak derivative of when for every . Define with norm . Let be a complex Hilbert space and regard as an unbounded complex-linear map . Assume that is densely defined and closed and that constants satisfy Let be the smooth test space, and for a fixed define by
For a densely defined linear operator between Hilbert spaces, write . Call closable when the closure of in is the graph of an operator; equivalently, every sequence with and has . The smooth test space is dense in , but is not closable from to . Moreover, the smooth branch pairs satisfying are dense in . Thus a bare point-matching condition is lost under this graph-norm completion. This result uses the Euclidean disk and the stated -equivalent graph norm; it is not a claim about every physical singular metric or domain.
Facts & Assumptions
Given: The Axiom of Choice, disk, Sobolev and Hilbert spaces, operator , graph-norm equivalence, and nonzero scalar in the Statement.
The Axiom of Choice is the stated set-theoretic hypothesis (The Axiom of Choice).
For a bounded smooth domain, integer and , restrictions of ambient smooth functions are dense in (Ambient smooth restrictions are dense on bounded domains). In particular this supplies the density used below, but its statement does not include .
Under countable choice, complex is dense in Euclidean Lebesgue for and (Complex finite-simple and smooth compact-support density for finite p). The full Axiom of Choice in [A1] supplies this countable-choice hypothesis.
Proof
Given: The hypotheses in the Statement.
For , let be its zero extension to . Then with the same norm. For each , [F2] with , gives such that . Its restriction to lies in , and . Thus is dense in .
Define for and for , and put . The denominator is positive, is smooth, on , on , and is supported in . For , set and It is smooth and radial because it is constant for and for . It equals zero near and one for . The function has support in , so . In polar coordinates, with , Therefore in , while .
The graph closure criterion in the Statement is equivalent to the usual closed-extension definition: a graph closure that is a graph is a closed extension, and any closed extension contains the graph closure. Its being a graph is equivalent to having no nonzero vector ; such a vector belongs to the graph closure exactly when a sequence of domain elements tends to zero while their outputs tend to . Put on the plus branch and zero on the minus branch. The inputs tend to zero in , and graph-norm equivalence gives in . Their point-difference output is always . Hence the graph of contains . It also contains the zero graph pair . The closure of the graph therefore contains two distinct outputs over the same zero input, so it is not the graph of an operator. Thus is not closable.
For smooth on , and the product rule gives Thus in . For a smooth pair , is zero at both origins, so it satisfies the matching condition and converges to the pair in . By [F1], smooth pairs are dense in . The closure of the matched smooth pairs is consequently the whole direct-sum space. This proves the claimed loss of point matching under completion.