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.
Well-posed weak elliptic diffusion on an anchored metric graph
Statement
Assume the Axiom of Choice and Countable Choice, , and that the anchor set meets every connected edge component of the finite metric graph . Let constant edge diffusivities satisfy For every there is a unique such that
The equation is the anchored weak metric-graph diffusion problem. Whenever as defined in Integer-order Sobolev spaces and their norms, the Green identity Green identity and Kirchhoff flux cancellation on a metric graph identifies its interior equation as and its natural free-vertex condition as Kirchhoff balance of the outward diffusive fluxes.
Facts & Assumptions
Given: The Axiom of Choice and Countable Choice, a finite metric graph with nonempty edge set, anchor set meeting every connected edge component, the spaces , the edge diffusivities, and the load in the Statement.
is a real Hilbert space with the edge-product inner product (The anchored metric graph H1 space is a closed Hilbert subspace).
With , every satisfies (Path Poincare inequality on an anchored finite metric graph).
A bounded coercive bilinear form on a real Hilbert space with a bounded linear functional has a unique weak solution; the Lax–Milgram interface assumes Countable Choice (The Lax--Milgram theorem, The Axiom of Countable Choice ()).
The real form convention is the edgewise integral pairing in the Statement, linear in both arguments (Bounded, coercive and symmetric sesquilinear forms).
Cauchy–Schwarz bounds the edge-product integral pairing by the product of its two norms (Cauchy–Schwarz: , with equality exactly for dependent pairs).
For an edgewise H2 function, Green's identity groups the endpoint terms as common vertex traces times the sum of outward diffusive fluxes (Green identity and Kirchhoff flux cancellation on a metric graph).
The edge traces and graph Hilbert structure inherit the Axiom of Choice from the one-dimensional Sobolev representative theorem (The Axiom of Choice).
Countable Choice is assumed by the Lax–Milgram and smooth-density interfaces (The Axiom of Countable Choice ()).
Under Countable Choice, smooth functions compactly supported in an edge interior are dense in its space. Such functions belong to edge and have zero endpoint traces, so their zero extensions to the other edges lie in (Smooth compactly supported functions of an open set are dense in , Integer-order Sobolev spaces and their norms, Anchored finite metric graph and its H1 energy space, The Axiom of Countable Choice ()).
Proof
Given: The finite anchored metric graph, , , and the real Hilbert space .
The form is symmetric and bilinear. By Cauchy–Schwarz on the finite edge product, Thus it is bounded with constant .
By [F2], Consequently The form is coercive with .
The load is linear and satisfies by [F5] and [F2]. Hence is bounded on .
Apply [F3] to the real Hilbert space [F1], the bounded coercive form from steps 1.1–1.2, and the bounded functional from step 1.3. It gives exactly one satisfying for all . If this is edgewise H2, [F6] and the weak equation give, for every ,
Fix an edge and take smooth with compact support in its interior and zero on every other edge. The vertex sum vanishes, so the integral of against every such test is zero. This residual is in ; density from [F7] and continuity of the pairing by [F5] imply almost everywhere on that edge. Now fix a free vertex . Prescribe endpoint-incidence value at every incidence at and at incidences at every other vertex, and interpolate linearly on each edge. Both incidences of a loop at receive value , so this defines a trace-matching test function in . Substitution in step 2.1 and the interior equation just proved leaves only the flux sum at , so it is zero. This proves the stated natural Kirchhoff condition.
Depends on
- Anchored finite metric graph and its H1 energy space
- The anchored metric graph H1 space is a closed Hilbert subspace
- Path Poincare inequality on an anchored finite metric graph
- Green identity and Kirchhoff flux cancellation on a metric graph
- Integer-order Sobolev spaces and their norms
- Cauchy–Schwarz: $|\langle x,y\rangle|\le\|x\|\,\|y\|$, with equality exactly for dependent pairs
- Smooth compactly supported functions of an open set are dense in $L^2$
- The Lax--Milgram theorem
- Bounded, coercive and symmetric sesquilinear forms
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- The Axiom of Choice
Used by
Dependency tree · two levels
68 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)