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

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.

Depends on

Used by

Dependency tree · two levels

68 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