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.
Graph diffusion and metric network pde numerics
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Absolute Continuity and the Sharp Fundamental Theorem of Calculus
- Algebraic and Spectral Graph Theory
- Areas of Elementary Plane Figures
- Banach Valued Integration and the Radon Nikodym Property
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Linear Operators and Quotient Spaces
- Bounded Variation and the Riemann–Stieltjes Integral
- Céa and Aubin–Nitsche error estimates
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Complex Lp Spaces and Test-Function Conventions
- Complex Norms and Realification
- Complex Subspace Realification
- Complexification, Realification and Real Structures
- Conjugate Gradients, MINRES and Preconditioning
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Density Separability and Convolution in Lᵖ
- Determinants of Matrices over a Commutative Ring
- Differentiation of Monotone Functions and the Vitali Covering Theorem
- Direct Matrix Factorisations: LU, Cholesky and QR
- Distributions Test Functions and Differentiation
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Dual Spaces Adjoint Operators and Annihilators
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Dimensional Normed Spaces and Riesz Lemma
- Finite generator master equations and uniformization
- Foundations of the Real Numbers for Analysis
- Fredholm Elliptic Problems and the Elliptic Spectrum
- Fubini and Change of Variables
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Graphs, Walks and Connectivity
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Harmonic Functions and Mean Values in Rn
- Hilbert Space Geometry and Riesz Representation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Krylov Subspaces, Arnoldi and GMRES
- Lax--Milgram and Weak Elliptic Solutions
- Lebesgue Measure on Euclidean Space
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Matrix Norms, Condition Numbers and Numerical Stability
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Mixed Partials, Taylor Formulae, and Extrema
- Modes of Convergence Egorov and Lusin
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- Norming and Separation under Hahn–Banach
- Order, Zorn's Lemma, and the Axiom of Choice
- Orthonormal Bases, Parseval and Fourier Series
- Outer Measure and the Caratheodory Extension Theorem
- Parabolic finite-element methods
- Picard-Lindelöf and First-Order Ordinary Differential Equations
- Pointwise Extended-Real Function Products
- Poisson and Cox point processes
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Probability Spaces Random Variables and Expectation
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Schwartz Space and the Plancherel Theorem
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Signed and Complex Measures Hahn and Jordan
- Simple Field Extensions and the Construction of the Complex Numbers
- Smooth Approximation and Sobolev Extension
- Smooth Partitions of Unity and Exhaustions
- Sobolev Traces and Zero Boundary Values
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Analytic Hahn Banach Theorem
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Exponential Function
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Maximal Function and Lebesgue Differentiation
- The Radon Nikodym Theorem and Lebesgue Decomposition
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Weak Derivatives and Sobolev Spaces
2 · Summary
This page develops finite weighted graph diffusion and diffusion on finite metric graphs. For a finite network, it defines the oriented weighted stiffness , positive vertex masses, grounded and closed boundary cases, and the column mass-state convention. It proves the positive-conductance component kernel, weighted mass balance, positivity of the exact semigroup, the sharp forward-Euler threshold, backward-Euler positivity, and exact-arithmetic conjugate-gradient applicability after grounding or a Neumann gauge. The conserved quantity is .
For metric graphs, the finite interval-edge definition allows parallel edges and loops, with the two endpoint incidences of a loop counted separately. The page defines the edge-product trace space with anchors, proves a path Poincare inequality and Kirchhoff Green identity, and constructs the anchored weak elliptic solution. The conforming edgewise P1 method has Cea quasi-optimality and an energy estimate when the exact solution is on every edge. This regularity is an explicit hypothesis: the page does not infer vertex smoothness or a rate from the network geometry. Its parabolic result is a semidiscrete existence and energy bound proved through the graph evolution triple and the generic finite-dimensional ODE interface; no parabolic spatial error rate is claimed.
The advection section defines routing on mass fluxes by a nonnegative column-stochastic matrix. It imposes conservation of total incoming and outgoing flux and does not identify that condition with equality of edge densities. Axiom of Choice and Countable Choice uses are declared at the specific graph-space and variational interfaces. The published rectangular finite-difference and polyhedral parabolic estimates are not transferred to metric graphs.
3 · Logical flowchart
4 · Definitions, theorems and proofs
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.
Conservative nonnegative network advection routing
Definition
At a directed network junction, let edges carry nonnegative incoming mass fluxes into the junction, and let edges carry outgoing mass fluxes. A conservative nonnegative routing matrix is a real matrix such that
It routes the incoming flux vector to . The column distributes the mass flux arriving on incoming edge among the outgoing edges. The column-sum condition stipulates no source or sink at the junction. It is a model condition on flux; it does not assert that the densities on incident edges are equal.
Finite weighted network diffusion data
Definition
Let be a finite simple graph with ordered vertex and edge sets. Choose an orientation of each edge and let be the resulting incidence matrix of An oriented incidence matrix of a finite simple graph: a column has at its tail, at its head, and zero elsewhere. Let be the vertices with prescribed Dirichlet values and let be the free vertices. Assign a mass to each and a conductance to each . Put
The matrix is the conductance-weighted graph stiffness. Its free Dirichlet restriction is the principal submatrix . The finite weighted network diffusion equation is
where and . If , this is the closed Neumann network equation. If the boundary values are instead a nonzero vector , restriction of to gives .
When every , agrees with the ordinary graph Laplacian by The Laplacian equals for every oriented incidence matrix . Zero conductances are allowed and remove those edges from the diffusion coupling; they do not remove the vertices or masses.
Conforming P1 edge mesh on an anchored metric graph
Definition
Assume . For each edge , choose a finite partition where , and let be the union of the resulting interval cells . Set . The conforming P1 edge space is Thus internal nodal values are single-valued along each edge, while the original-vertex matching and zero-anchor conditions are inherited from . The maximum step is positive and finite because the mesh has finitely many cells of positive length.
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.
Path Poincare inequality on an anchored finite metric graph
Statement
Assume the Axiom of Choice and assume every connected edge component of the finite metric graph has at least one anchor in . Put . Then every satisfies
Facts & Assumptions
Given: The Axiom of Choice, a finite metric graph with positive edge lengths, total length , an anchor set meeting each connected component, and .
Each edge restriction has an absolutely continuous representative with increment ; all endpoint-incidence representatives at a vertex have the common value prescribed by (One-dimensional functions have unique absolutely continuous representatives, Anchored finite metric graph and its H1 energy space).
Cauchy–Schwarz gives on any finite union of edge segments (Holder's inequality for integrals, including the endpoint cases).
Vertices in one connected edge component are joined by a finite graph path, as defined in Anchored finite metric graph and its H1 energy space.
The one-dimensional representative interface assumes the Axiom of Choice (The Axiom of Choice).
Proof
Given: The finite anchored graph and the edgewise absolutely continuous representatives of .
If , then and the inequality is . Otherwise fix an edge in a component containing an anchor. If is a loop, deleting its interior leaves the component connected because any path that traverses the loop can omit that closed excursion. If its endpoints are distinct, every original path that uses reaches one endpoint before traversing it; after deleting , vertices are therefore connected to one of its two endpoints. Thus removing either leaves the component connected or separates it into two components, one containing each endpoint. In the connected case choose either endpoint; in the separated case choose the endpoint in the component containing an anchor. By [F3] there is a finite path from an anchor to that endpoint avoiding . Deleting the portions between repeated vertices gives a simple path, so no edge is traversed twice. For a loop choose its tail incidence; otherwise use the incidence at the chosen endpoint. For any on , append the segment from that incidence to . The total length is at most , and the common vertex traces agree along the path by [F1]. Since at the anchor, [F1] and [F2] imply
Integrate the pointwise bound of step 1.1 over every edge and sum. The total measure of the disjoint edge interiors is , so Taking nonnegative square roots proves the statement.
Green identity and Kirchhoff flux cancellation on a metric graph
Statement
Assume the Axiom of Choice. Orient each edge coordinate from at to at . For endpoint incidences and define the outward derivatives by and . The two incidences are both included at a loop vertex. For write . If , with as defined by Integer-order Sobolev spaces and their norms, , and each edge has a constant diffusivity , then
Thus zero test traces remove anchored endpoint terms, and a Kirchhoff condition at each free vertex cancels the remaining terms.
Facts & Assumptions
Given: The Axiom of Choice, a finite metric graph, edge diffusivities , edgewise , and a trace-matching test function .
Functions in on a finite interval have absolutely continuous representatives extending to both endpoints, with derivative equal almost everywhere to the weak derivative; the two endpoint incidences of a loop are still distinct before trace matching (One-dimensional functions have unique absolutely continuous representatives).
A real-valued absolutely continuous function equals its initial value plus the integral of its almost-everywhere derivative (Fundamental theorem of calculus for absolutely continuous functions).
At points where two real-valued factors are differentiable, the derivative of their product is the sum of the two ordinary product-rule terms (Sums, scalar multiples, products and quotients: , , , and when ).
Membership in means and is the second weak derivative (Integer-order Sobolev spaces and their norms).
The representative theorem in [F1] assumes the Axiom of Choice (The Axiom of Choice).
Proof
Given: The oriented intervals, outward derivative convention, edge diffusivities, and edge functions specified in the Statement.
If , both sides are empty sums and the identity is . Otherwise fix an edge and first suppose is real-valued. By [F1] and [F4], and have absolutely continuous representatives on . They are bounded there. The product is absolutely continuous: for any disjoint intervals , so the defining absolute-continuity condition follows from that of the two factors. At almost every point both derivatives exist, and [F3] gives . Both terms are integrable because are integrable derivatives of absolutely continuous functions and are bounded. Applying [F2] to the product therefore yields If is complex-valued, write the absolutely continuous representative . By [F1], are real absolutely continuous functions with derivatives almost everywhere; these derivatives lie in since their absolute values are bounded by . The test function is real by definition of . Apply the preceding product-rule and fundamental-theorem calculation separately to and and combine the two identities, using componentwise complex integration. This proves the same displayed identity for complex . The endpoint terms are the head and tail outward derivatives paired with their traces.
Multiply the identity of step 1.1 by and sum over the finite edge set. At each vertex, all endpoint-incidence values of equal the common trace by definition of ; this includes both incidences of a loop. Regrouping the finite endpoint sum by vertices gives the displayed identity. If , then ; if , the stated Kirchhoff sum is zero. Hence the boundary contribution vanishes under those conditions.
Energy, kernel, and weighted mass balance for a finite network
Statement
Use the data of Finite weighted network diffusion data. Let and let ; its connected components are the positive-conductance components. For , let equal on and on . Then
Consequently is symmetric positive semidefinite, and exactly when is constant on each positive-conductance component and that constant is zero on every such component meeting . In the closed case , every differentiable solution of satisfies
Thus homogeneous closed diffusion conserves weighted mass , which need not equal the unweighted sum .
Facts & Assumptions
Given: A finite oriented simple graph, conductances , positive free-vertex masses , a Dirichlet set , and the matrices of Finite weighted network diffusion data.
Each oriented incidence column has exactly one at its tail and one at its head; the other entries are zero (An oriented incidence matrix of a finite simple graph).
and is its principal restriction to free vertices (Finite weighted network diffusion data).
Proof
Reversing an edge orientation replaces its incidence column by , but the contribution to does not change. For the zero extension , [F1] gives . Expanding proves the displayed energy identity. It is nonnegative term by term, so is symmetric positive semidefinite.
If , step 1.1 gives a sum of nonnegative terms equal to . For every its endpoint difference must therefore be zero. Along every path in , has equal values at successive vertices, hence is constant on each positive-conductance component; it is zero on any such component meeting because there. Conversely, if these componentwise conditions hold, every edge with has zero endpoint difference, while an edge with contributes zero regardless of its difference. Thus and .
Suppose . From [F1], every column of sums to zero, so and therefore . Multiplying on the left by gives . The second term vanishes, and the first is the derivative of , proving the balance law and its homogeneous conservation case.
A conservative routing matrix preserves total flux
Statement
Let be a conservative nonnegative routing matrix from Conservative nonnegative network advection routing, and let be entrywise nonnegative. Then is entrywise nonnegative and
Facts & Assumptions
Given: A finite incoming flux vector , a nonnegative routing matrix , and the unit incoming column-sum condition.
and for each incoming index (Conservative nonnegative network advection routing).
Proof
Given: The nonnegative incoming flux vector and the routing matrix of the Statement.
For every outgoing index , is a sum of nonnegative terms by [F1] and the assumption . Hence .
All sums are finite, so they may be interchanged: where the final equality uses the unit column sums of [F1].
Exact-arithmetic CG after grounding or a Neumann gauge
Statement
Use the weighted network data of Finite weighted network diffusion data. The exact-arithmetic conjugate-gradient result CG is the Krylov Galerkin method, and the th iterate uniquely minimizes the -norm of the error over applies to each of the following systems:
- for every ;
- the grounded steady matrix if every positive-conductance component containing a free vertex also meets the Dirichlet set ;
- the closed Neumann matrix restricted to , where , for every compatible right-hand side .
In case 3 the gauge gives the unique solution of . Here uses the standard Euclidean inner product . If a stated unknown space is zero-dimensional, its solver claim is vacuous. These are exact-arithmetic applicability claims only; no finite-precision stability claim is made.
Facts & Assumptions
Given: Positive diagonal masses, nonnegative edge conductances, a finite oriented graph, Dirichlet set , and the matrices .
is symmetric positive semidefinite. Its energy is zero exactly for vectors whose zero extensions are constant on every positive-conductance component, with constant zero on components meeting ; these are precisely the vectors in . In the closed case , and consists of all positive-conductance componentwise constants, with no Dirichlet constraint (Finite weighted network diffusion data, Energy, kernel, and weighted mass balance for a finite network).
A linear endomorphism of a finite-dimensional vector space with trivial kernel is onto by rank-nullity (Rank-nullity: ).
For a real symmetric positive-definite system , the exact-arithmetic CG iterates satisfy the published Krylov Galerkin and energy-minimization theorem (CG is the Krylov Galerkin method, and the th iterate uniquely minimizes the -norm of the error over ).
is diagonal with strictly positive entries (Finite weighted network diffusion data).
Every finite-dimensional real inner-product space has an orthonormal basis, including the empty basis in dimension zero (Every finite-dimensional real or complex inner product space has an orthonormal basis).
Proof
Given: The weighted graph matrices and the exact-arithmetic CG interface of [F3].
Under the grounded condition, suppose and . By [F1], the zero extension of is constant on each positive-conductance component and zero on each such component meeting . The grounded condition says every component containing a free vertex meets , so every free coordinate is zero. Thus has trivial kernel; it is symmetric positive semidefinite by [F1], hence positive definite.
In the closed case, let . Symmetry implies : for and , . If a vector has , [F1] puts in ; hence . Therefore the restriction is positive definite. It has trivial kernel and is an endomorphism of the finite-dimensional space , so [F2] makes it onto. Thus each has one gauged solution . By [F5], an orthonormal basis of identifies this restriction with a real symmetric positive definite matrix, including the zero-dimensional case.
For and any nonzero , [F1] and [F4] give . Thus is positive definite.
The grounded matrix from step 1.1, the restricted Neumann matrix in the orthonormal coordinates constructed in the preceding argument, and the shifted mass matrix from step 1.3 are all real symmetric positive definite on their stated spaces. Each therefore has trivial kernel and is onto by [F2] on its finite-dimensional domain, so each right-hand side has a unique solution. Applying [F3] gives the exact-arithmetic CG Krylov Galerkin and energy-minimization conclusions.
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 .
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.
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.
Positive graph-diffusion semigroup and Euler maps
Statement
Use the data of Finite weighted network diffusion data and write . For any , the homogeneous exact semigroup maps entrywise nonnegative initial vectors to entrywise nonnegative vectors. For a forward Euler step of size , the map is entrywise nonnegative, and hence positivity preserving for every nonnegative input, exactly when where the minimum of an empty set is . For every , the backward Euler map exists and is positivity preserving. The forward Euler threshold is sharp for positivity of the full step matrix.
Facts & Assumptions
Given: A finite graph, free and Dirichlet vertices, with , with , , and .
The weighted stiffness is restricted to free vertices; it is symmetric positive semidefinite, has nonpositive off-diagonal entries, and its kernel is the componentwise constant space stated in (Finite weighted network diffusion data, Energy, kernel, and weighted mass balance for a finite network).
A finite column generator has nonnegative off-diagonal entries and zero column sums; its finite master equation has the matrix-exponential solution and maps probability vectors to probability vectors (Finite column generator, Finite master equation and uniformization formula).
The finite matrix exponential is given by its locally convergent power series, has derivative , and satisfies for commuting matrices (Finite matrix exponential series and its identities).
Proof
Given: The finite weighted network and the nonnegative data conventions in the Statement.
If , all free-state assertions are vacuous, so assume . Put . For distinct free vertices , by [F1]. If , [F1] says that is constant on every positive-conductance component, so ; symmetry gives . Thus has zero column sums and is a finite column generator by [F2]. If is nonzero, let and . By [F2], is a probability vector, so it is entrywise nonnegative; multiplying by proves . If , its image is zero.
If , then has nonnegative off-diagonal entries and diagonal entries . Put . If , then for every free vertex. Since each , every conductance incident to a free vertex is zero; hence each free row of vanishes, , and its exponential is the identity. If , every entry of is nonnegative. For , each term of the matrix series is entrywise nonnegative. By [F3], since commutes with , is entrywise nonnegative.
The diagonal entries of are , and its off-diagonal entries are by [F1]. Thus all entries are nonnegative exactly when each diagonal is nonnegative, which is exactly for every with . If a diagonal is negative, applying the step matrix to the corresponding coordinate vector produces a negative coordinate, so the condition is sharp.
The mass state satisfies for the homogeneous network equation. Its solution is . Since and are entrywise positive diagonal matrices, where the second equality follows term by term from the matrix exponential series applied to the similarity . Steps 1.1–1.2 therefore prove positivity of for both boundary cases.
Let and solve . The matrix is symmetric positive definite because for nonzero , by [F1]; hence the solve exists uniquely. If is a minimum coordinate, extend by zero on . The edge formula for is a sum of terms , each nonpositive because every free neighbor has value at least and every Dirichlet value is zero. Therefore , contradicting . Thus and backward Euler is positivity preserving.
Cea and O(h) energy error for conforming metric graph P1 FEM
Statement
Assume the Axiom of Choice and Countable Choice, every edge component is anchored, each is constant with , and the weak solution of Well-posed weak elliptic diffusion on an anchored metric graph satisfies , as defined in Integer-order Sobolev spaces and their norms, on every edge. For the conforming P1 space of Conforming P1 edge mesh on an anchored metric graph, let solve where and are the weak diffusion form and load of that theorem. Put , , and . Then exists uniquely and Thus the energy-seminorm error is for this fixed finite graph and edgewise H2 solution. The Green identity Green identity and Kirchhoff flux cancellation on a metric graph identifies the natural free-vertex condition as Kirchhoff balance; this theorem makes no claim for vertex singularities or higher-dimensional junctions.
Facts & Assumptions
Given: The Axiom of Choice and Countable Choice, the anchored graph, positive edge diffusivities, weak solution , edgewise H2 regularity, and the finite P1 edge mesh.
is a real Hilbert space (The anchored metric graph H1 space is a closed Hilbert subspace).
For a bounded coercive form and a bounded functional on a real Hilbert space, the conforming Galerkin solution exists uniquely and obeys Cea's quasi-optimality estimate; Countable Choice is assumed (Céa quasi-optimality for coercive conforming Galerkin problems, The Axiom of Countable Choice ()).
For a real symmetric bounded coercive form, the conforming Galerkin solution is the best approximation in the induced energy norm (Hermitian Galerkin solutions are best in the energy norm, The Axiom of Countable Choice ()).
The nodal P1 interpolant is conforming and obeys the displayed edgewise H2 energy estimate (P1 edge interpolation estimate with junction compatibility).
The weak variational equation is equivalent, under edgewise H2 regularity, to the edge equation and the free-vertex Kirchhoff flux balance (Well-posed weak elliptic diffusion on an anchored metric graph, Green identity and Kirchhoff flux cancellation on a metric graph).
The anchored weak problem has a unique variational solution with the same form and load (Well-posed weak elliptic diffusion on an anchored metric graph).
Cauchy–Schwarz bounds the edge-product integral pairing by the product of its two norms (Cauchy–Schwarz: , with equality exactly for dependent pairs).
The anchored graph Poincare inequality is (Path Poincare inequality on an anchored finite metric graph).
The graph trace space uses the Axiom of Choice (The Axiom of Choice).
Countable Choice is used by the Cea and best-approximation results (The Axiom of Countable Choice ()).
Proof
Given: The real anchored graph Hilbert space, its symmetric diffusion form with , the load, a finite edge partition, and the edgewise H2 regularity of .
The map sending a P1 graph function to its finite list of nodal values is linear and injective, since an affine function on a cell is determined by its two endpoint values. There are finitely many cells, so is finite-dimensional. Its defining vertex and anchor constraints make it a subspace of .
For , [F7] gives . By path Poincare, , so . Thus is bounded and coercive with the stated constants and is symmetric.
Apply [F2] with , subspace , form , and load from the weak problem. Its Hilbert, finite-dimensional inclusion, boundedness, coercivity and bounded-load hypotheses hold by [F1], step 1.1, and step 1.2. Hence a unique Galerkin solution exists and satisfies the displayed Cea estimate. It agrees with the restriction of the same weak equation because the continuous solution is unique by [F6].
Apply the symmetric best-approximation fact [F3] to and choose . By [F4], this interpolant is in and its energy error is at most . Therefore the Galerkin energy error is bounded by the same quantity, as claimed. The rate is conditional on the stated edgewise H2 regularity; no vertex regularity is inferred. By [F5], the natural free-vertex condition is Kirchhoff flux balance.
5 · Examples, counterexamples and false statements
None yet.
Sources
- Mario Arioli and Michele Benzi, A Finite Element Method for Quantum Graphs, Emory CS Technical Report TR-2015-009 (44-page full text)
- Peter Kuchment, Quantum graphs: an introduction and a brief survey, arXiv:0802.3442 (2008)
- Ward Whitt, Continuous-Time Markov Chains, full lecture notes (2006)
- Fan R. K. Chung, Spectral Graph Theory, Chapter 1: Eigenvalues and the Laplacian of a Graph, CBMS 92 (1997), complete chapter text
- Jonathan Richard Shewchuk, An Introduction to the Conjugate Gradient Method Without the Agonizing Pain, complete lecture note
- Christian Clason, Introduction to Finite Element Methods, complete lecture notes, Chapter 12