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.
Anchored finite metric graph and its H1 energy space
Definition
Assume the Axiom of Choice as required by the cited one-dimensional representative interface. A finite metric graph consists of finite vertex and edge sets , endpoint maps , and edge lengths . Distinct edges with the same endpoints are allowed, as are loop edges with . Every vertex is an endpoint of at least one edge. The two endpoint incidences and remain distinct even for a loop. A graph path is a finite sequence with and for every ; a loop permits . Vertices in the same connected edge component are those joined by such a path. Orient each edge only to choose its coordinate , with at and at . For , let be its finite set of endpoint incidences. The edge-product spaces are
For , its endpoint values mean the values of the unique absolutely continuous representative supplied by One-dimensional functions have unique absolutely continuous representatives. The trace-matching graph Sobolev space is the subspace of whose endpoint-incidence traces all agree at each vertex. For a designated anchor set , define the anchored graph energy space
We equip with the edge-sum inner product and with
No Kirchhoff derivative condition is built into ; that condition is a natural boundary condition of the later weak diffusion form. The elliptic and P1 error results below assume that meets every connected edge component.
Depends on
Used by
- Conforming P1 edge mesh on an anchored metric graph Definition
- A Y-junction satisfies Kirchhoff flux balance Example
- Green identity and Kirchhoff flux cancellation on a metric graph Lemma
- P1 edge interpolation estimate with junction compatibility Lemma
- Path Poincare inequality on an anchored finite metric graph Lemma
- The anchored metric graph H1 space is a closed Hilbert subspace Lemma
- Cea and O(h) energy error for conforming metric graph P1 FEM Theorem
- Energy-stable semidiscrete P1 evolution on an anchored metric graph Theorem
- Well-posed weak elliptic diffusion on an anchored metric graph Theorem
Dependency tree · two levels
41 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)