Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedPipeline-generatedprecheck pass
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

P1 edge interpolation estimate with junction compatibility

Statement

Assume the Axiom of Choice, any anchor set 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.

Depends on

Used by

Dependency tree · two levels

45 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources