Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passverified 2026-09-23 (gpt-6-sol)
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.

Weyl's lemma for the Laplacian

Statement

Assume the Axiom of Countable Choice ACω.

If T∈D′(Ω) and ΔT=0, there is a unique smooth harmonic h with T=Th.

Proof

Given: Countable Choice (The Axiom of Countable Choice (ACω)) and ΔT=0 on the open set Ω.

1.1

The distributional Laplacian commutes with local mollification makes hε=T∗ρε smooth and harmonic on Ωε [given].

2.1step 1.1

Each hε is harmonic by step 1.1, so the ball and spherical mean-value properties apply under Countable Choice. Radial mollification therefore fixes it: hε∗ρδ=hε on Ωε+δ, and likewise hδ∗ρε=hδ. Associativity of distributional convolution with these compactly supported test kernels identifies the two double convolutions on that common shrunken domain. Hence hε=hδ there.

3.1step 2.1

On each compact subset of Ω, all sufficiently small regularizations agree by step 2.1; their common value defines a smooth harmonic h. For a test function ϕ supported in that compact subset, ⟨Thε,ϕ⟩=⟨T,ρˇε∗ϕ⟩→⟨T,ϕ⟩: the mollified tests converge to ϕ with all derivatives on one fixed compact support, so distributional continuity applies. Since hε=h on the support for small ε, this gives Th=T.

4.1

If Th=Tk, then h=k almost everywhere; continuity makes h=k everywhere [given]. ∎

Depends on

Used by

Dependency tree · two levels

16 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