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.

Bounded Calderon maps and signed jump identities

Statement

Assume the Axiom of Choice and Countable Choice, as in the single- and double-layer transmission theorems. For λ∈H−1/2(Γ) and ϕ∈H1/2(Γ), the operators in Calderon boundary operators and trace conventions are bounded as V:H−1/2→H1/2,K:H1/2→H1/2,K′:H−1/2→H−1/2,W:H1/2→H−1/2. Their weak traces satisfy γ−Sλ=γ+Sλ=Vλ,∂n−Sλ=K′λ+12λ,∂n+Sλ=K′λ−12λ, γ−Dϕ=Kϕ−12ϕ,γ+Dϕ=Kϕ+12ϕ,∂n−Dϕ=∂n+Dϕ=−Wϕ. All equalities are in the stated Sobolev trace or dual spaces and use the outward normal orientation fixed on the A page.

Facts & Assumptions

Given: The Axiom of Choice, Countable Choice, the real trace spaces and orientation, the weak layer-potential conventions, and the single- and double-layer transmission theorems.

[F1]

The single layer has a bounded common trace, energy bound, and conormal jump ∂n−Sλ−∂n+Sλ=λ (The three-dimensional single layer is bounded and coercive).

[F2]

The double layer has bounded average trace, common conormal, and jump γ−Dϕ−γ+Dϕ=−ϕ (The double-layer potential has the stated jumps and bounds).

[F3]

The averaged operators are defined by the trace and conormal averages, with W equal to minus the common double-layer conormal (Calderon boundary operators and trace conventions).

[F4]

Interior and exterior trace lifts are bounded from H1/2(Γ) into their local H1 spaces (The H1 trace and lifting theorem on a compact Lipschitz boundary).

Proof

1.1F1F2F3F4givenalgebra

The bounds for V and K are respectively the trace bound in [F1] and the average-trace bound in [F2]. The bound for W is the common-conormal bound in [F2] and the definition in [F3]. For K′, harmonicity of Sλ and the weak conormal definition give, for every g∈H1/2(Γ), ∣⟨∂n−Sλ,g⟩∣≤∥∇Sλ∥L2(Ω−)∥∇L−g∥L2(Ω−)≤C∥λ∥H−1/2∥g∥H1/2, and the exterior estimate is identical with an exterior local lift. Thus both conormals, and their average K′λ, lie in H−1/2 with the claimed bound.

2.1F1F2F3step 1.1givenalgebra∎

The first common-trace identity and the single-layer conormal difference are [F1]. By [F3], K′λ is the arithmetic mean of those two conormals; solving the sum-and-difference equations gives the displayed K′±12I formulas. The double-layer jump and average-trace definition [F2]–[F3] similarly give K∓12I for the interior/exterior traces. The common double-layer conormal equals −Wϕ by [F3]. These algebraic identities establish every signed formula.

Remarks

The double-layer transmission theorem identifies the weak double layer with its off-surface kernel integral for every global H1/2(Γ) density, including compatible facewise smooth densities reaching polyhedral edges. For those facewise smooth densities, Finite-energy transmission pairs have the double-layer kernel representation across polyhedral edges also computes the face-interior kernel realization of K and the signed half-jumps. The single-layer transmission theorem identifies the weak single layer with its kernel for bounded densities, including discontinuous P0 densities. The common double-layer conormal defines the hypersingular operator weakly; no ordinary absolutely convergent hypersingular boundary integral or pointwise half-jump at edges or vertices is asserted.

Depends on

Used by

Cited to discharge well-definedness by Calderon boundary operators and trace conventions.

Dependency tree · two levels

38 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