Alphabeta Math
Pipeline-generated
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.

✓ 11 results · all verified · 7 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 4 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Graph diffusion and metric network pde numerics

1 · Prerequisites

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 BCBT, 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 1TMu.

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 H1 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 O(h) energy estimate when the exact solution is H2 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

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

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 Γ=(V,E,∂−,∂+,ℓ) consists of finite vertex and edge sets V,E, endpoint maps ∂−,∂+:E→V, and edge lengths 0<ℓe<∞. Distinct edges with the same endpoints are allowed, as are loop edges with ∂−e=∂+e. Every vertex is an endpoint of at least one edge. The two endpoint incidences (e,−) and (e,+) remain distinct even for a loop. A graph path is a finite sequence z0,e1,z1,…,en,zn with n≥0 and {∂−ej,∂+ej}={zj−1,zj} for every j; a loop permits zj−1=zj. Vertices in the same connected edge component are those joined by such a path. Orient each edge only to choose its coordinate xe∈[0,ℓe], with 0 at ∂−e and ℓe at ∂+e. For z∈V, let I(z):={(e,−):∂−e=z}∪{(e,+):∂+e=z} be its finite set of endpoint incidences. The edge-product spaces are

H:=⨁e∈EL2(0,ℓe;R),W:=⨁e∈EH1(0,ℓe;R).

For we∈H1(0,ℓe), its endpoint values mean the values of the unique absolutely continuous representative supplied by One-dimensional W1,p functions have unique absolutely continuous representatives. The trace-matching graph Sobolev space is the subspace of W whose endpoint-incidence traces all agree at each vertex. For a designated anchor set D⊆V, define the anchored graph energy space

VD:={w∈W: wι=wι′ whenever ι,ι′∈I(v),wι=0 for each v∈D, ι∈I(v)}.

We equip H with the edge-sum L2 inner product and VD with

∥w∥VD2=∑e∈E∫0ℓe(∣we∣2+∣we′∣2) dxe.

No Kirchhoff derivative condition is built into VD; that condition is a natural boundary condition of the later weak diffusion form. The elliptic and P1 error results below assume that D meets every connected edge component.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Conservative nonnegative network advection routing

Definition

At a directed network junction, let nin edges carry nonnegative incoming mass fluxes qiin into the junction, and let nout edges carry outgoing mass fluxes. A conservative nonnegative routing matrix is a real matrix P∈Rnout×nin such that

Pji≥0,∑j=1noutPji=1(1≤i≤nin).

It routes the incoming flux vector to qout=Pqin. The column i distributes the mass flux arriving on incoming edge i 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.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Finite weighted network diffusion data

Definition

Let G=(V,E) be a finite simple graph with ordered vertex and edge sets. Choose an orientation of each edge and let B∈RV×E be the resulting incidence matrix of An oriented incidence matrix of a finite simple graph: a column has −1 at its tail, +1 at its head, and zero elsewhere. Let D⊆V be the vertices with prescribed Dirichlet values and let I=V∖D be the free vertices. Assign a mass mi>0 to each i∈I and a conductance ce≥0 to each e∈E. Put

M=diag⁡(mi)i∈I,C=diag⁡(ce)e∈E,LC=BCBT.

The matrix LC is the conductance-weighted graph stiffness. Its free Dirichlet restriction LD is the principal submatrix (LC)I,I. The finite weighted network diffusion equation is

Mu′(t)+LDu(t)=f(t),

where u(t)∈RI and f(t)∈RI. If D=∅, this is the closed Neumann network equation. If the boundary values are instead a nonzero vector g(t), restriction of LC(u,g) to I gives Mu′+LDu=f−(LC)I,Dg.

When every ce=1, LC=BBT agrees with the ordinary graph Laplacian by The Laplacian equals BBT for every oriented incidence matrix B. Zero conductances are allowed and remove those edges from the diffusion coupling; they do not remove the vertices or masses.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Conforming P1 edge mesh on an anchored metric graph

Definition

Assume E≠∅. For each edge e, choose a finite partition 0=xe,0<xe,1<⋯<xe,Ne=ℓe, where Ne≥1, and let Th be the union of the resulting interval cells Ke,j=[xe,j−1,xe,j]. Set h=max⁡e,j(xe,j−xe,j−1). The conforming P1 edge space is Vh={w∈VD: we is affine on every Ke,j}. Thus internal nodal values are single-valued along each edge, while the original-vertex matching and zero-anchor conditions are inherited from VD. The maximum step h is positive and finite because the mesh has finitely many cells of positive length.

LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

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 D, the trace-matching space and the anchored space VD of Anchored finite metric graph and its H1 energy space are closed real Hilbert subspaces of ⨁e∈EH1(0,ℓe;R) with the edge-product H1 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 ℓe>0, an anchor set D⊆V, and the edge-product space in Anchored finite metric graph and its H1 energy space.

[F1]

Each real H1(0,ℓe)=W1,2(0,ℓe) is a Hilbert space for ∫0ℓe(uv+u′v′) under the Axiom of Choice (The Sobolev space H1 is a Hilbert space, The Axiom of Choice).

[F2]

For each edge e, every we∈H1(0,ℓe), and every 0<ϵ<ℓe, the one-dimensional endpoint estimate at p=2 gives

∣we(0)∣2≤2(ϵ−1∫0ϵ∣we∣2 dxe+ϵ∫0ϵ∣we′∣2 dxe),

and the corresponding estimate at ℓe uses the interval (ℓe−ϵ,ℓe). Bounding each localized integral by its full-edge integral yields

∣we(0)∣2≤2(ϵ−1∥we∥L2(0,ℓe)2+ϵ∥we′∥L2(0,ℓe)2),

with the same full-edge bound at ℓe (The one-dimensional endpoint estimate on a bounded interval).

[A1]

Endpoint traces use the unique absolutely continuous representative supplied under the Axiom of Choice (The Axiom of Choice, One-dimensional W1,p 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.

1.1F1given

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 H1 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.

1.2A1F2givenalgebrachoose

For each edge e, choose ϵe=ℓe/2, which satisfies the hypothesis of [F2]. For either endpoint, [F2] then gives max⁡{∣we(0)∣2,∣we(ℓe)∣2}≤4ℓe∥we∥L2(0,ℓe)2+ℓe∥we′∥L2(0,ℓe)2≤Ce∥we∥H1(0,ℓe)2, where Ce:=max⁡{4/ℓe,ℓe}<∞. Thus each endpoint evaluation is a bounded linear functional on its edge H1 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 VD, is closed in the product.

2.1step 1.1step 1.2given∎

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.

LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

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 D. Put LΓ=∑e∈Eℓe. Then every w∈VD satisfies

∥w∥L2(Γ)≤LΓ(∑e∈E∥we′∥L2(e)2)1/2.

Facts & Assumptions

Given: The Axiom of Choice, a finite metric graph with positive edge lengths, total length LΓ, an anchor set meeting each connected component, and w∈VD.

[F1]

Each edge restriction has an absolutely continuous representative with increment we(y)−we(x)=∫xywe′; all endpoint-incidence representatives at a vertex have the common value prescribed by VD (One-dimensional W1,p functions have unique absolutely continuous representatives, Anchored finite metric graph and its H1 energy space).

[F2]

Cauchy–Schwarz gives ∣∫Sw′∣2≤∣S∣∫S∣w′∣2 on any finite union S of edge segments (Holder's inequality for integrals, including the endpoint cases).

[F3]

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.

[A1]

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 w.

1.1A1F1F2F3givenchoose

If E=∅, then H={0} and the inequality is 0≤0. Otherwise fix an edge e in a component containing an anchor. If e 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 e reaches one endpoint before traversing it; after deleting e, vertices are therefore connected to one of its two endpoints. Thus removing e 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 e. 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 x on e, append the segment from that incidence to x. The total length is at most LΓ, and the common vertex traces agree along the path by [F1]. Since w=0 at the anchor, [F1] and [F2] imply ∣we(x)∣2≤LΓ∑a on the concatenated path∫a∣wa′∣2≤LΓ∑a∈E∥wa′∥L2(a)2.

2.1step 1.1algebra∎

Integrate the pointwise bound of step 1.1 over every edge and sum. The total measure of the disjoint edge interiors is ∑eℓe=LΓ, so ∥w∥L2(Γ)2≤LΓ2∑e∈E∥we′∥L2(e)2. Taking nonnegative square roots proves the statement.

LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passOpen item page →

Green identity and Kirchhoff flux cancellation on a metric graph

Statement

Assume the Axiom of Choice. Orient each edge coordinate from 0 at ∂−e to ℓe at ∂+e. For endpoint incidences (e,−) and (e,+) define the outward derivatives by ∂ν(e,−)ue=−ue′(0) and ∂ν(e,+)ue=+ue′(ℓe). The two incidences are both included at a loop vertex. For ι=(e,±) write e(ι)=e. If ue∈H2(0,ℓe), with H2 as defined by Integer-order Sobolev spaces and their norms, v∈VD, and each edge has a constant diffusivity κe>0, then

∑e∈Eκe∫0ℓeue′ve′ dxe=−∑e∈Eκe∫0ℓeue′′ve dxe+∑z∈Vv(z)∑ι∈I(z)κe(ι)∂νιue(ι)(z).

Thus zero test traces remove anchored endpoint terms, and a Kirchhoff condition ∑ι∈I(z)κe(ι)∂νιue(ι)(z)=0 at each free vertex cancels the remaining terms.

Facts & Assumptions

Given: The Axiom of Choice, a finite metric graph, edge diffusivities κe>0, edgewise ue∈H2(0,ℓe), and a trace-matching test function v∈VD.

[F1]

Functions in H1 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 W1,p functions have unique absolutely continuous representatives).

[F2]

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).

[F4]

Membership in H2(0,ℓe) means ue,ue′∈H1(0,ℓe) and ue′′ is the second weak derivative (Integer-order Sobolev spaces and their norms).

[A1]

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.

1.1A1F1F2F3F4givenalgebra

If E=∅, both sides are empty sums and the identity is 0=0. Otherwise fix an edge e and first suppose ue is real-valued. By [F1] and [F4], ue′ and ve have absolutely continuous representatives on [0,ℓe]. They are bounded there. The product ue′ve is absolutely continuous: for any disjoint intervals [aj,bj], ∑j∣ue′(bj)ve(bj)−ue′(aj)ve(aj)∣≤∥ue′∥∞∑j∣ve(bj)−ve(aj)∣+∥ve∥∞∑j∣ue′(bj)−ue′(aj)∣, so the defining absolute-continuity condition follows from that of the two factors. At almost every point both derivatives exist, and [F3] gives (ue′ve)′=ue′′ve+ue′ve′. Both terms are integrable because ue′′,ve′ are integrable derivatives of absolutely continuous functions and ue′,ve are bounded. Applying [F2] to the product therefore yields ∫0ℓeue′ve′ dxe=−∫0ℓeue′′ve dxe+ue′(ℓe)ve(ℓe)−ue′(0)ve(0). If ue is complex-valued, write the absolutely continuous representative ue′=p+iq. By [F1], p,q are real absolutely continuous functions with derivatives Re⁡ue′′,Im⁡ue′′ almost everywhere; these derivatives lie in L2 since their absolute values are bounded by ∣ue′′∣. The test function ve is real by definition of VD. Apply the preceding product-rule and fundamental-theorem calculation separately to pve and qve and combine the two identities, using componentwise complex integration. This proves the same displayed identity for complex ue. The endpoint terms are the head and tail outward derivatives paired with their traces.

2.1step 1.1givenalgebra∎

Multiply the identity of step 1.1 by κe and sum over the finite edge set. At each vertex, all endpoint-incidence values of v equal the common trace v(z) by definition of VD; this includes both incidences of a loop. Regrouping the finite endpoint sum by vertices gives the displayed identity. If z∈D, then v(z)=0; if z∉D, the stated Kirchhoff sum is zero. Hence the boundary contribution vanishes under those conditions.

LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

Energy, kernel, and weighted mass balance for a finite network

Statement

Use the data of Finite weighted network diffusion data. Let E+={e∈E:ce>0} and let G+=(V,E+); its connected components are the positive-conductance components. For x∈RI, let xˉ∈RV equal x on I and 0 on D. Then

xTLDx=∑e∈Ece(xˉhead(e)−xˉtail(e))2≥0.

Consequently LD is symmetric positive semidefinite, and x∈ker⁡LD exactly when xˉ is constant on each positive-conductance component and that constant is zero on every such component meeting D. In the closed case D=∅, every differentiable solution of Mu′+LCu=f satisfies

ddt1TMu(t)=1Tf(t).

Thus homogeneous closed diffusion conserves weighted mass 1TMu, which need not equal the unweighted sum 1Tu.

Facts & Assumptions

Given: A finite oriented simple graph, conductances ce≥0, positive free-vertex masses mi>0, a Dirichlet set D, and the matrices B,C,M,LC,LD of Finite weighted network diffusion data.

[F1]

Each oriented incidence column has exactly one −1 at its tail and one +1 at its head; the other entries are zero (An oriented incidence matrix of a finite simple graph).

[F2]

LC=BCBT and LD is its principal restriction to free vertices (Finite weighted network diffusion data).

Proof

1.1givenF1F2algebra

Reversing an edge orientation replaces its incidence column be by −be, but the contribution cebebeT to BCBT does not change. For the zero extension xˉ, [F1] gives beTxˉ=xˉhead(e)−xˉtail(e). Expanding xˉTBCBTxˉ=∑ece(beTxˉ)2 proves the displayed energy identity. It is nonnegative term by term, so LD is symmetric positive semidefinite.

2.1step 1.1givenalgebra

If LDx=0, step 1.1 gives a sum of nonnegative terms equal to xTLDx=0. For every e∈E+ its endpoint difference must therefore be zero. Along every path in G+, xˉ has equal values at successive vertices, hence is constant on each positive-conductance component; it is zero on any such component meeting D because xˉ=0 there. Conversely, if these componentwise conditions hold, every edge with ce>0 has zero endpoint difference, while an edge with ce=0 contributes zero regardless of its difference. Thus BCBTxˉ=0 and LDx=0.

3.1F1F2givenalgebra∎

Suppose D=∅. From [F1], every column of B sums to zero, so 1TB=0 and therefore 1TLC=0. Multiplying Mu′+LCu=f on the left by 1T gives 1TMu′+1TLCu=1Tf. The second term vanishes, and the first is the derivative of 1TMu, proving the balance law and its homogeneous conservation case.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

A conservative routing matrix preserves total flux

Statement

Let P be a conservative nonnegative routing matrix from Conservative nonnegative network advection routing, and let qin∈Rnin be entrywise nonnegative. Then qout=Pqin is entrywise nonnegative and ∑j=1noutqjout=∑i=1ninqiin.

Facts & Assumptions

Given: A finite incoming flux vector qin≥0, a nonnegative routing matrix P, and the unit incoming column-sum condition.

[F1]

Pji≥0 and ∑j=1noutPji=1 for each incoming index i (Conservative nonnegative network advection routing).

Proof

technique · direct finite-sum calculation

Given: The nonnegative incoming flux vector and the routing matrix of the Statement.

1.1F1givenalgebra

For every outgoing index j, qjout=∑iPjiqiin is a sum of nonnegative terms by [F1] and the assumption qin≥0. Hence qout≥0.

2.1F1step 1.1algebra∎

All sums are finite, so they may be interchanged: ∑jqjout=∑j∑iPjiqiin=∑i(∑jPji)qiin=∑iqiin, where the final equality uses the unit column sums of [F1].

CorollaryStatement: Literature-sourcedProof: AI-generatedprecheck passOpen item page →

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 mth iterate uniquely minimizes the A-norm of the error over x0+Km(A,r0) applies to each of the following systems:

  1. M+τLD for every τ>0;
  2. the grounded steady matrix LD if every positive-conductance component containing a free vertex also meets the Dirichlet set D;
  3. the closed Neumann matrix LC restricted to K⊥, where K=ker⁡LC, for every compatible right-hand side b∈K⊥.

In case 3 the gauge u∈K⊥ gives the unique solution of LCu=b. Here K⊥ uses the standard Euclidean inner product ⟨x,y⟩=xTy. 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 D, and the matrices M,LD,LC.

[F1]

LD 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 D; these are precisely the vectors in ker⁡LD. In the closed case D=∅, LD=LC and ker⁡LC 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).

[F2]

A linear endomorphism of a finite-dimensional vector space with trivial kernel is onto by rank-nullity (Rank-nullity: dim⁡FV=nullity⁡T+rank⁡T).

[F3]

For a real symmetric positive-definite system Ax=b, the exact-arithmetic CG iterates satisfy the published Krylov Galerkin and energy-minimization theorem (CG is the Krylov Galerkin method, and the mth iterate uniquely minimizes the A-norm of the error over x0+Km(A,r0)).

[F4]

M is diagonal with strictly positive entries (Finite weighted network diffusion data).

[F5]

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

technique · positive-definite restriction

Given: The weighted graph matrices and the exact-arithmetic CG interface of [F3].

1.1F1givenalgebra

Under the grounded condition, suppose x∈RI and xTLDx=0. By [F1], the zero extension of x is constant on each positive-conductance component and zero on each such component meeting D. The grounded condition says every component containing a free vertex meets D, so every free coordinate is zero. Thus LD has trivial kernel; it is symmetric positive semidefinite by [F1], hence positive definite.

1.2F1F2F5givenalgebra

In the closed case, let K=ker⁡LC. Symmetry implies LC(K⊥)⊆K⊥: for x∈K⊥ and k∈K, kTLCx=(LCk)Tx=0. If a vector x∈K⊥ has xTLCx=0, [F1] puts x in K; hence x=0. Therefore the restriction LC∣K⊥ is positive definite. It has trivial kernel and is an endomorphism of the finite-dimensional space K⊥, so [F2] makes it onto. Thus each b∈K⊥ has one gauged solution u∈K⊥. By [F5], an orthonormal basis of K⊥ identifies this restriction with a real symmetric positive definite matrix, including the zero-dimensional case.

1.3F1F4givenalgebra

For τ>0 and any nonzero x, [F1] and [F4] give xT(M+τLD)x=xTMx+τxTLDx≥∑imixi2>0. Thus M+τLD is positive definite.

2.1F2F3step 1.1step 1.2step 1.3given∎

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.

LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passOpen item page →

P1 edge interpolation estimate with junction compatibility

Statement

Assume the Axiom of Choice, any anchor set D⊆V as in Anchored finite metric graph and its H1 energy space, a mesh Th of Conforming P1 edge mesh on an anchored metric graph, positive constants κe on the edges, and edgewise ue∈H2(0,ℓe;R) as in Integer-order Sobolev spaces and their norms, with the trace matching and anchor conditions of VD. Let Ihu be the edgewise nodal linear interpolant. Then Ihu∈Vh and (∑e∈Eκe∥(ue−Ihue)′∥L2(e)2)1/2≤h(∑e∈Eκe∥ue′′∥L2(e)2)1/2.

Facts & Assumptions

Given: The Axiom of Choice, a finite anchored metric graph, its finite edge partition, positive edge constants κe, and a real-valued edgewise H2 function u with common vertex traces and zero anchor traces.

[F1]

H2 means that both ue and its weak derivative ue′ belong to H1, and ue′′ is its second weak derivative (Integer-order Sobolev spaces and their norms).

[F2]

Each H1 edge class has an absolutely continuous representative whose increments are integrals of its weak derivative (One-dimensional W1,p functions have unique absolutely continuous representatives).

[F3]

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).

[F4]

The mesh consists of finitely many interval cells and h is their maximum length (Conforming P1 edge mesh on an anchored metric graph).

[A1]

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.

1.1F1F2F4A1given

Fix an edge cell K=[a,b] of length hK=b−a. By [F1] and [F2], the continuous representative of ue has endpoint values and the representative of ue′ is absolutely continuous. Thus the slope of the nodal interpolant on K is sK=ue(b)−ue(a)hK=1hK∫abue′(y) dy. The fundamental theorem in [F2] justifies this equality.

2.1F2F3step 1.1algebra

For any x∈K, [F2] and [F3] give ∣ue′(x)−sK∣≤1hK∫ab∣ue′(x)−ue′(y)∣ dy≤1hK∫abhK∥ue′′∥L2(K) dy=hK∥ue′′∥L2(K). Squaring and integrating over x∈K yields ∥(ue−Ihue)′∥L2(K)2=∥ue′−sK∥L2(K)2≤hK2∥ue′′∥L2(K)2. The first equality holds because the derivative of the nodal interpolant is the constant slope sK on K.

3.1F4step 2.1algebra

Multiply the cell estimate in step 2.1 by κe, sum over all cells, and use hK≤h. The cells partition the edge interiors and their finitely many endpoints have measure zero. Hence ∑eκe∥(ue−Ihue)′∥L2(e)2≤h2∑eκe∥ue′′∥L2(e)2. Taking square roots proves the displayed error estimate.

4.1givenF1F4construct∎

At an original vertex, the endpoint nodal value at every incident endpoint incidence is the common trace of u, 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 L2 (the internal endpoint terms cancel when testing against a smooth compactly supported function). Hence it belongs to the edge-product real H1 space. Thus Ihu∈VD and it is affine on every cell by construction, which is exactly membership in Vh.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

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 V=VD and H=⨁e∈EL2(0,ℓe;R), and let Vh be its conforming P1 edge space. Put LΓ=∑eℓe, α=κmin⁡/(1+LΓ2), and assume constant diffusivities 0<κmin⁡≤κe≤κmax⁡. For T>0, f∈L2(0,T;VD∗), and uh0∈Vh, define a(w,v)=∑eκe∫0ℓewe′ve′ dxe. There is a unique uh∈H1(0,T;Vh) with uh(0)=uh0 satisfying, for almost every t,

((uh)′(t),vh)H+a(uh(t),vh)=⟨f(t),vh⟩VD∗,VD(vh∈Vh).

For every t∈[0,T],

∥uh(t)∥H2+α∫0t∥uh(s)∥VD2 ds≤∥uh0∥H2+α−1∫0t∥f(s)∥VD∗2 ds.

Here Vh 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 V=VD and H; positive edge diffusivities; a fixed finite P1 edge mesh; a dual load f; and an initial vector uh0∈Vh.

[F1]

The edge-product L2 space is a real Hilbert space under the edge-sum integral inner product, assuming Countable Choice (L2 with the integral pairing is a Hilbert space, The Axiom of Countable Choice (ACω)).

[F2]

Each Cc∞(0,ℓe) function belongs to edge H1 and has zero endpoint traces, so its extension by zero to the other edges lies in VD. Such functions are dense in L2(0,ℓe) 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 L2, The Axiom of Countable Choice (ACω)).

[F3]

The anchored graph H1 space is Hilbert and its inclusion in H is continuous, with ∥v∥H≤∥v∥V (The anchored metric graph H1 space is a closed Hilbert subspace, Anchored finite metric graph and its H1 energy space).

[F4]

Path Poincare gives ∥v∥H≤LΓ∥v′∥H, so the graph diffusion form is bounded by κmax⁡ and coercive with α=κmin⁡/(1+LΓ2) on V (Path Poincare inequality on an anchored finite metric graph, Bounded, coercive and symmetric sesquilinear forms).

[F5]

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).

[F6]

The edge-product Cauchy–Schwarz inequality controls the diffusion form and its load pairing (Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs).

[F7]

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).

[F8]

The conforming graph P1 space consists of functions in VD affine on each cell of the specified finite edge mesh (Conforming P1 edge mesh on an anchored metric graph).

[A1]

The graph traces and H1 space inherit the Axiom of Choice from the one-dimensional representative theorem (The Axiom of Choice).

[A2]

Countable Choice is assumed by the edge L2 Hilbert and smooth-density suppliers (The Axiom of Countable Choice (ACω)).

Proof

technique · finite-dimensional parabolic Galerkin ODE

Given: Full AC and Countable Choice, the anchored edge graph, the finite P1 space, the diffusion form, the dual load, and the initial value.

1.1F2F3A2givenchoosealgebra

The canonical inclusion i:VD→H is continuous because ∥v∥H≤∥v∥VD. It is injective because VD consists of Sobolev classes included in the edge-product L2 classes. To prove density, fix g=(ge)∈H and ϵ>0. By [F2] and finite choice, choose for each of the finitely many edges a ϕe∈Cc∞(0,ℓe) with ∥ge−ϕe∥L2(e)<ϵ/∣E∣. The edge-product function ϕ=(ϕe) has zero endpoint traces, hence belongs to VD, and ∥g−ϕ∥H2=∑e∥ge−ϕe∥L2(e)2<ϵ2. Thus the range of i is dense in H.

1.2A1F1F2F3F7F8givenconstruct

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].

2.1F4F5F6step 1.2given

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.

3.1F5step 2.1given∎

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.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

Well-posed weak elliptic diffusion on an anchored metric graph

Statement

Assume the Axiom of Choice and Countable Choice, E≠∅, and that the anchor set D meets every connected edge component of the finite metric graph Γ. Let constant edge diffusivities satisfy 0<κmin⁡≤κe≤κmax⁡<∞. For every f∈H=⨁e∈EL2(0,ℓe;R) there is a unique u∈VD such that

a(u,v):=∑e∈Eκe∫0ℓeue′ve′ dxe=F(v):=∑e∈E∫0ℓefeve dxe(v∈VD).

The equation is the anchored weak metric-graph diffusion problem. Whenever ue∈H2(0,ℓe) 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 −κeue′′=fe 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 H,VD, the edge diffusivities, and the load f in the Statement.

[F1]

VD is a real Hilbert space with the edge-product H1 inner product (The anchored metric graph H1 space is a closed Hilbert subspace).

[F2]

With LΓ=∑eℓe, every v∈VD satisfies ∥v∥H≤LΓ∥v′∥H (Path Poincare inequality on an anchored finite metric graph).

[F3]

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 (ACω)).

[F4]

The real form convention is the edgewise integral pairing in the Statement, linear in both arguments (Bounded, coercive and symmetric sesquilinear forms).

[F5]

Cauchy–Schwarz bounds the edge-product integral pairing by the product of its two L2 norms (Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs).

[F6]

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).

[A1]

The edge traces and graph Hilbert structure inherit the Axiom of Choice from the one-dimensional Sobolev representative theorem (The Axiom of Choice).

[A2]

Countable Choice is assumed by the Lax–Milgram and smooth-density interfaces (The Axiom of Countable Choice (ACω)).

[F7]

Under Countable Choice, smooth functions compactly supported in an edge interior are dense in its L2 space. Such functions belong to edge H1 and have zero endpoint traces, so their zero extensions to the other edges lie in VD (Smooth compactly supported functions of an open set are dense in L2, Integer-order Sobolev spaces and their norms, Anchored finite metric graph and its H1 energy space, The Axiom of Countable Choice (ACω)).

Proof

technique · coercive variational method

Given: The finite anchored metric graph, κmin⁡,κmax⁡, f∈H, and the real Hilbert space VD.

1.1F1F4F5givenalgebra

The form a is symmetric and bilinear. By Cauchy–Schwarz on the finite edge product, ∣a(w,v)∣≤κmax⁡∥w′∥H∥v′∥H≤κmax⁡∥w∥VD∥v∥VD. Thus it is bounded with constant M=κmax⁡.

1.2F2F4givenalgebra

By [F2], ∥v∥VD2=∥v∥H2+∥v′∥H2≤(1+LΓ2)∥v′∥H2. Consequently a(v,v)≥κmin⁡∥v′∥H2≥κmin⁡1+LΓ2∥v∥VD2. The form is coercive with α=κmin⁡/(1+LΓ2)>0.

1.3F2F5givenalgebra

The load F(v)=∑e∫feve is linear and satisfies ∣F(v)∣≤∥f∥H∥v∥H≤LΓ∥f∥H∥v′∥H≤LΓ∥f∥H∥v∥VD by [F5] and [F2]. Hence F is bounded on VD.

2.1A1A2F1F3F6step 1.1step 1.2step 1.3given

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 u∈VD satisfying a(u,v)=F(v) for all v∈VD. If this u is edgewise H2, [F6] and the weak equation give, for every v∈VD, ∑e∫0ℓe(−κeue′′−fe)ve dxe+∑z∉Dv(z)∑ι∈I(z)κe(ι)∂νιue(ι)(z)=0.

3.1A2F5F6F7step 2.1constructalgebra∎

Fix an edge and take v smooth with compact support in its interior and zero on every other edge. The vertex sum vanishes, so the integral of −κeue′′−fe against every such test is zero. This residual is in L2(0,ℓe); density from [F7] and continuity of the pairing by [F5] imply −κeue′′=fe almost everywhere on that edge. Now fix a free vertex z. Prescribe endpoint-incidence value 1 at every incidence at z and 0 at incidences at every other vertex, and interpolate linearly on each edge. Both incidences of a loop at z receive value 1, so this defines a trace-matching test function in VD. Substitution in step 2.1 and the interior equation just proved leaves only the flux sum at z, so it is zero. This proves the stated natural Kirchhoff condition.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

Positive graph-diffusion semigroup and Euler maps

Statement

Use the data of Finite weighted network diffusion data and write L=LD. For any t≥0, the homogeneous exact semigroup SD(t)=e−tM−1L maps entrywise nonnegative initial vectors to entrywise nonnegative vectors. For a forward Euler step of size τ≥0, the map EF(τ)=I−τM−1L is entrywise nonnegative, and hence positivity preserving for every nonnegative input, exactly when 0≤τ≤τF:=min⁡i∈ILii>0miLii, where the minimum of an empty set is +∞. For every τ>0, the backward Euler map (M+τL)−1M 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, M=diag⁡(mi) with mi>0, C=diag⁡(ce) with ce≥0, L=LD, and τ≥0.

[F1]

The weighted stiffness is LD=BCBT 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).

[F2]

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).

[F3]

The finite matrix exponential is given by its locally convergent power series, has derivative QetQ, and satisfies eAeB=eA+B for commuting matrices (Finite matrix exponential series and its identities).

Proof

Given: The finite weighted network and the nonnegative data conventions in the Statement.

1.1F1F2givenalgebra

If I=∅, all free-state assertions are vacuous, so assume I≠∅. Put Q=−LM−1. For distinct free vertices i,j, Qij=−Lij/mj≥0 by [F1]. If D=∅, [F1] says that 1 is constant on every positive-conductance component, so L1=0; symmetry gives 1TL=0. Thus Q has zero column sums and is a finite column generator by [F2]. If p0≥0 is nonzero, let s=1Tp0>0 and π=p0/s. By [F2], etQπ is a probability vector, so it is entrywise nonnegative; multiplying by s proves etQp0≥0. If p0=0, its image is zero.

1.2F1F3givenconstruct

If D≠∅, then Q has nonnegative off-diagonal entries and diagonal entries Qii=−Lii/mi. Put λ=max⁡i∈ILii/mi≥0. If λ=0, then Lii=∑e incident to ice=0 for every free vertex. Since each ce≥0, every conductance incident to a free vertex is zero; hence each free row of LD vanishes, Q=0, and its exponential is the identity. If λ>0, every entry of Q+λI is nonnegative. For t≥0, each term of the matrix series et(Q+λI)=∑k≥0tk(Q+λI)k/k! is entrywise nonnegative. By [F3], since −λtI commutes with t(Q+λI), etQ=e−λtIet(Q+λI)=e−λtet(Q+λI) is entrywise nonnegative.

1.3F1givenalgebra

The diagonal entries of EF(τ) are 1−τLii/mi, and its off-diagonal entries are −τLij/mi≥0 by [F1]. Thus all entries are nonnegative exactly when each diagonal is nonnegative, which is exactly τ≤mi/Lii for every i with Lii>0. If a diagonal is negative, applying the step matrix to the corresponding coordinate vector produces a negative coordinate, so the condition is sharp.

2.1F3step 1.1step 1.2algebra

The mass state p=Mu satisfies p′=Qp for the homogeneous network equation. Its solution is p(t)=etQp(0). Since M and M−1 are entrywise positive diagonal matrices, u(t)=M−1etQMu(0)=e−tM−1Lu(0), where the second equality follows term by term from the matrix exponential series applied to the similarity M−1QM=−M−1L. Steps 1.1–1.2 therefore prove positivity of SD(t) for both boundary cases.

3.1F1givenstep 1.1algebra∎

Let y≥0 and solve (M+τL)x=My. The matrix is symmetric positive definite because for nonzero x, xT(M+τL)x≥∑imixi2>0 by [F1]; hence the solve exists uniquely. If xk<0 is a minimum coordinate, extend x by zero on D. The edge formula for (Lx)k is a sum of terms ce(xk−xˉother(e)), each nonpositive because every free neighbor has value at least xk and every Dirichlet value is zero. Therefore ((M+τL)x)k=mkxk+τ(Lx)k<0, contradicting (My)k=mkyk≥0. Thus x≥0 and backward Euler is positivity preserving.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

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 κe is constant with 0<κmin⁡≤κe≤κmax⁡, and the weak solution u of Well-posed weak elliptic diffusion on an anchored metric graph satisfies ue∈H2(0,ℓe), as defined in Integer-order Sobolev spaces and their norms, on every edge. For the conforming P1 space Vh of Conforming P1 edge mesh on an anchored metric graph, let uh∈Vh solve a(uh,vh)=F(vh)(vh∈Vh), where a and F are the weak diffusion form and load of that theorem. Put LΓ=∑eℓe, Ma=κmax⁡, and αa=κmin⁡/(1+LΓ2). Then uh exists uniquely and ∥u−uh∥VD≤Maαainf⁡vh∈Vh∥u−vh∥VD. (∑eκe∥(ue−uh,e)′∥L2(e)2)1/2≤h(∑eκe∥ue′′∥L2(e)2)1/2. Thus the energy-seminorm error is O(h) 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 u∈VD, edgewise H2 regularity, and the finite P1 edge mesh.

[F2]

For a bounded coercive form and a bounded functional on a real Hilbert space, the conforming Galerkin solution exists uniquely and obeys Cea's Ma/αa quasi-optimality estimate; Countable Choice is assumed (Céa quasi-optimality for coercive conforming Galerkin problems, The Axiom of Countable Choice (ACω)).

[F3]

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 (ACω)).

[F4]

The nodal P1 interpolant is conforming and obeys the displayed edgewise H2 energy estimate (P1 edge interpolation estimate with junction compatibility).

[F5]

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).

[F6]

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).

[F7]

Cauchy–Schwarz bounds the edge-product integral pairing by the product of its two L2 norms (Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs).

[F8]

The anchored graph Poincare inequality is ∥v∥H≤LΓ∥v′∥H (Path Poincare inequality on an anchored finite metric graph).

[A1]

The graph trace space uses the Axiom of Choice (The Axiom of Choice).

[A2]

Countable Choice is used by the Cea and best-approximation results (The Axiom of Countable Choice (ACω)).

Proof

technique · conforming Galerkin approximation

Given: The real anchored graph Hilbert space, its symmetric diffusion form with κmin⁡>0, the load, a finite edge partition, and the edgewise H2 regularity of u.

1.1givenF1construct

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 Vh is finite-dimensional. Its defining vertex and anchor constraints make it a subspace of VD.

1.2F1F7F8givenalgebra

For w,v∈VD, [F7] gives ∣a(w,v)∣≤κmax⁡∥w′∥H∥v′∥H≤Ma∥w∥VD∥v∥VD. By path Poincare, ∥v∥VD2≤(1+LΓ2)∥v′∥H2, so a(v,v)≥κmin⁡∥v′∥H2≥αa∥v∥VD2. Thus a is bounded and coercive with the stated constants and is symmetric.

2.1A1A2F1F2F6step 1.1step 1.2given

Apply [F2] with V=VD, subspace Vh, form a, and load F 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].

3.1F3F4F5step 2.1given∎

Apply the symmetric best-approximation fact [F3] to uh and choose vh=Ihu. By [F4], this interpolant is in Vh and its energy error is at most h(∑eκe∥ue′′∥L2(e)2)1/2. 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