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.
P1 edge interpolation estimate with junction compatibility
Statement
Assume the Axiom of Choice, any anchor set as in Anchored finite metric graph and its H1 energy space, a mesh of Conforming P1 edge mesh on an anchored metric graph, positive constants on the edges, and edgewise as in Integer-order Sobolev spaces and their norms, with the trace matching and anchor conditions of . Let be the edgewise nodal linear interpolant. Then and
Facts & Assumptions
Given: The Axiom of Choice, a finite anchored metric graph, its finite edge partition, positive edge constants , and a real-valued edgewise H2 function with common vertex traces and zero anchor traces.
H2 means that both and its weak derivative belong to H1, and is its second weak derivative (Integer-order Sobolev spaces and their norms).
Each H1 edge class has an absolutely continuous representative whose increments are integrals of its weak derivative (One-dimensional functions have unique absolutely continuous representatives).
Cauchy–Schwarz bounds an interval integral by the square root of its length times the L2 norm (Holder's inequality for integrals, including the endpoint cases).
The mesh consists of finitely many interval cells and is their maximum length (Conforming P1 edge mesh on an anchored metric graph).
The representative interface in [F2] assumes the Axiom of Choice (The Axiom of Choice).
Proof
Given: The graph, edge constants, mesh, and edgewise H2 function in the Statement.
Fix an edge cell of length . By [F1] and [F2], the continuous representative of has endpoint values and the representative of is absolutely continuous. Thus the slope of the nodal interpolant on is The fundamental theorem in [F2] justifies this equality.
For any , [F2] and [F3] give Squaring and integrating over yields The first equality holds because the derivative of the nodal interpolant is the constant slope on K.
Multiply the cell estimate in step 2.1 by , sum over all cells, and use . The cells partition the edge interiors and their finitely many endpoints have measure zero. Hence Taking square roots proves the displayed error estimate.
At an original vertex, the endpoint nodal value at every incident endpoint incidence is the common trace of , so all interpolant traces agree, including both ends of a loop. At each anchor the nodal value is zero. The interpolant is real-valued, continuous and piecewise affine on each finite edge partition, so its weak derivative is its piecewise constant slope in (the internal endpoint terms cancel when testing against a smooth compactly supported function). Hence it belongs to the edge-product real space. Thus and it is affine on every cell by construction, which is exactly membership in .
Depends on
- Anchored finite metric graph and its H1 energy space
- Conforming P1 edge mesh on an anchored metric graph
- Integer-order Sobolev spaces and their norms
- One-dimensional $W^{1,p}$ functions have unique absolutely continuous representatives
- Holder's inequality for integrals, including the endpoint cases
- The Axiom of Choice
Used by
Dependency tree · two levels
45 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)