Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6-luna)
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.

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.

Depends on

Used by

Dependency tree · two levels

41 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