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 anchored metric graph H1 space is a closed Hilbert subspace
Statement
Assume the Axiom of Choice. For a finite metric graph and anchor set , the trace-matching space and the anchored space of Anchored finite metric graph and its H1 energy space are closed real Hilbert subspaces of with the edge-product inner product.
Facts & Assumptions
Given: The Axiom of Choice, a finite metric graph as defined in Anchored finite metric graph and its H1 energy space with , an anchor set , and the edge-product space in Anchored finite metric graph and its H1 energy space.
Each real is a Hilbert space for under the Axiom of Choice (The Sobolev space is a Hilbert space, The Axiom of Choice).
For each edge , every , and every , the one-dimensional endpoint estimate at gives
and the corresponding estimate at uses the interval . Bounding each localized integral by its full-edge integral yields
with the same full-edge bound at (The one-dimensional endpoint estimate on a bounded interval).
Endpoint traces use the unique absolutely continuous representative supplied under the Axiom of Choice (The Axiom of Choice, One-dimensional functions have unique absolutely continuous representatives).
Proof
Given: The finite edge set, positive edge lengths, the product norm, the trace-matching conditions, and the zero anchor traces.
The product is a Hilbert space: if a sequence is Cauchy in the finite sum-of-squares norm, each edge coordinate is Cauchy in its norm and converges by [F1]; the finitely many coordinate limits form an element of the product and the sum of the finitely many squared errors tends to zero. The product inner product is the sum of the edge inner products.
For each edge , choose , which satisfies the hypothesis of [F2]. For either endpoint, [F2] then gives where . Thus each endpoint evaluation is a bounded linear functional on its edge space. For every vertex, the difference of two incident endpoint evaluations is therefore continuous; its kernel is closed. Each anchor endpoint evaluation is also continuous and its zero set is closed. There are finitely many vertices, incidences, and anchors, so the intersection of these kernels, namely the trace-matching space and then , is closed in the product.
A Cauchy sequence in either constrained space converges in the product by step 1.1. Continuity of every endpoint functional from step 1.2 passes all matching equalities and zero anchor values to the limit, so the limit remains in the same constrained space. The restricted edge-product inner product is positive definite and complete there. Hence both constrained spaces are Hilbert.
Depends on
Used by
Dependency tree · two levels
42 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
- Mario Arioli and Michele Benzi, A Finite Element Method for Quantum Graphs, Emory CS Technical Report TR-2015-009 (44-page full text) (standard reference, not scraped)
- Peter Kuchment, Quantum graphs: an introduction and a brief survey, arXiv:0802.3442 (2008) (standard reference, not scraped)