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.
Energy-stable semidiscrete P1 evolution on an anchored metric graph
Statement
Assume the Axiom of Choice and Countable Choice. Let a finite metric graph with nonempty edge set have every connected edge component anchored, let and , and let be its conforming P1 edge space. Put , , and assume constant diffusivities . For , , and , define . There is a unique with satisfying, for almost every ,
For every ,
Here is the finite P1 space from Conforming P1 edge mesh on an anchored metric graph. This is a semidiscrete existence and energy statement; it gives no parabolic spatial error rate.
Facts & Assumptions
Given: Full AC and Countable Choice; a finite anchored metric graph; the real spaces and ; positive edge diffusivities; a fixed finite P1 edge mesh; a dual load ; and an initial vector .
The edge-product L2 space is a real Hilbert space under the edge-sum integral inner product, assuming Countable Choice ( with the integral pairing is a Hilbert space, The Axiom of Countable Choice ()).
Each function belongs to edge and has zero endpoint traces, so its extension by zero to the other edges lies in . Such functions are dense in under Countable Choice (Anchored finite metric graph and its H1 energy space, Integer-order Sobolev spaces and their norms, Smooth compactly supported functions of an open set are dense in , The Axiom of Countable Choice ()).
The anchored graph H1 space is Hilbert and its inclusion in H is continuous, with (The anchored metric graph H1 space is a closed Hilbert subspace, Anchored finite metric graph and its H1 energy space).
Path Poincare gives , so the graph diffusion form is bounded by and coercive with on V (Path Poincare inequality on an anchored finite metric graph, Bounded, coercive and symmetric sesquilinear forms).
If V_h is a finite-dimensional real subspace of an evolution space V continuously embedded in H, and the real form is measurable, bounded and coercive on V_h, then the finite-dimensional parabolic Galerkin ODE has a unique H1-in-time solution and the displayed energy estimate (Finite-dimensional parabolic Galerkin ODEs with measurable coefficients).
The edge-product Cauchy–Schwarz inequality controls the diffusion form and its load pairing (Cauchy–Schwarz: , with equality exactly for dependent pairs).
An evolution triple is a real Hilbert space V continuously and densely embedded in a real Hilbert space H, with V* its continuous real dual (Evolution triples and the parabolic energy space).
The conforming graph P1 space consists of functions in affine on each cell of the specified finite edge mesh (Conforming P1 edge mesh on an anchored metric graph).
The graph traces and H1 space inherit the Axiom of Choice from the one-dimensional representative theorem (The Axiom of Choice).
Countable Choice is assumed by the edge L2 Hilbert and smooth-density suppliers (The Axiom of Countable Choice ()).
Proof
Given: Full AC and Countable Choice, the anchored edge graph, the finite P1 space, the diffusion form, the dual load, and the initial value.
The canonical inclusion is continuous because . It is injective because consists of Sobolev classes included in the edge-product classes. To prove density, fix and . By [F2] and finite choice, choose for each of the finitely many edges a with . The edge-product function has zero endpoint traces, hence belongs to , and . Thus the range of i is dense in H.
By [F1] and [F3], H and V_D are real Hilbert spaces with dense continuous inclusion. With V_D^* as its continuous real dual, these spaces form the evolution triple of Evolution triples and the parabolic energy space. The mesh has finitely many cells, and a P1 function is determined by its finite list of nodal values; the vertex matching and anchor conditions are linear. Therefore V_h is a finite-dimensional subspace of V_D by [F8].
By [F4] and [F6], the form a is bounded by M=κmax and coercive by α on V_D, hence also on V_h. The restriction F_h(t):=f(t)|{V_h} is a bounded functional and its norm is at most |f(t)|{V^}; restriction is a continuous linear map from V_D^ to V_h^*, so F_h is strongly measurable and square-integrable. Thus all hypotheses of [F5] hold for the evolution triple and finite P1 subspace of step 1.2.
Applying [F5] gives the unique semidiscrete solution and its energy estimate for every t in [0,T]. No spatial approximation rate is part of [F5], so none follows here.
Depends on
- Anchored finite metric graph and its H1 energy space
- Integer-order Sobolev spaces and their norms
- The anchored metric graph H1 space is a closed Hilbert subspace
- Path Poincare inequality on an anchored finite metric graph
- Conforming P1 edge mesh on an anchored metric graph
- Smooth compactly supported functions of an open set are dense in $L^2$
- $L^2$ with the integral pairing is a Hilbert space
- Evolution triples and the parabolic energy space
- Finite-dimensional parabolic Galerkin ODEs with measurable coefficients
- Bounded, coercive and symmetric sesquilinear forms
- Cauchy–Schwarz: $|\langle x,y\rangle|\le\|x\|\,\|y\|$, with equality exactly for dependent pairs
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- The Axiom of Choice
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
67 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)
- Christian Clason, Introduction to Finite Element Methods, complete lecture notes, Chapter 12 (standard reference, not scraped)
- Peter Kuchment, Quantum graphs: an introduction and a brief survey, arXiv:0802.3442 (2008) (standard reference, not scraped)