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

P0 Galerkin BEM for the single layer is well posed and quasioptimal

Statement

Assume the Axiom of Choice and Countable Choice. Let Γ be as above, let Th be any finite conforming surface triangulation, and let Xh be its P0 space. For every f∈H1/2(Γ) there are unique λ∈H−1/2(Γ) and λh∈Xh satisfying ⟨μ,Vλ⟩Γ=⟨μ,f⟩Γ(μ∈H−1/2(Γ)),⟨μh,Vλh⟩Γ=⟨μh,f⟩Γ(μh∈Xh). For constants c,C>0 from The three-dimensional single layer is bounded and coercive, ∥λ−λh∥H−1/2(Γ)≤(1+C/c)inf⁡μh∈Xh∥λ−μh∥H−1/2(Γ). The method is conforming because Xh⊂H−1/2(Γ); this is an exact Galerkin estimate and contains no quadrature or geometry error.

Facts & Assumptions

Given: The Axiom of Choice, Countable Choice, the layer-potential conventions, a finite conforming surface mesh, and f∈H1/2(Γ).

[A1]

The Axiom of Choice is assumed by the single-layer coercivity theorem, and Countable Choice by Lax–Milgram and Strang (The Axiom of Choice, The Axiom of Countable Choice (ACω)).

[F1]

The single-layer trace map is bounded and coercive: V:H−1/2→H1/2 and ⟨μ,Vμ⟩≥c∥μ∥H−1/22 (The three-dimensional single layer is bounded and coercive).

[F2]

The weak single-layer solution satisfies ∫R3∇Sλ⋅∇v=⟨λ,γv⟩ for every v∈H˙1(R3) (Weak Laplace single-layer potentials and energy spaces).

[F3]

The P0 space is finite-dimensional and is a subspace of H−1/2(Γ); the dual pairing bounds the restricted load (Shape-regular surface meshes and conforming P0 densities, Lipschitz polyhedral boundary, orientation, and trace spaces).

[F4]

The second Strang estimate gives the quasi-optimal bound for a bounded coercive exact problem and a finite-dimensional discrete problem with bounded extension; with the exact form and load on the conforming subspace its consistency defect is zero (Second Strang estimate with a bounded extension to the comparison space).

Proof

1.1A1F1F2F3givenalgebra

Define a(λ,μ)=⟨μ,Vλ⟩. Boundedness follows from [F1] and the dual norm. For u=Sλ and v=Sμ, the weak equations [F2] give a(λ,μ)=∫R3∇u⋅∇v=a(μ,λ), so a is symmetric; with [F1] it is coercive. The load Ff(μ)=⟨μ,f⟩ is bounded by duality.

2.1A1F1F3step 1.1givenconstruct

The fixed square-sum chart norm makes H1/2 a real Hilbert space, hence its continuous dual H−1/2 is Hilbert under the fixed dual norm by the trace-space convention in [F3]. Apply Lax–Milgram using [A1] to obtain the unique exact solution λ. By [F3], the restriction of a to Xh remains bounded and coercive and the restricted load is bounded, so Lax–Milgram on the finite-dimensional real Hilbert space Xh gives the unique λh.

3.1F1F3F4step 2.1givenalgebra∎

Apply [F4] with V=H−1/2(Γ), Vh=Xh, common norm ∥⋅∥H−1/2, extension a~h=a, and Fh=Ff∣Xh. The bounded-form constant is at most C and the coercivity constant is at least c by [F1]; the consistency defect is zero because both discrete objects are restrictions of the exact form and load. Its estimate is therefore ∥λ−λh∥≤(1+C/c)inf⁡μh∈Xh∥λ−μh∥, as stated.

Depends on

Used by

Dependency tree · two levels

33 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