Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-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.

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.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

44 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