Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6.1-sol)audited 2026-10-02
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.

Locally uniform limits of harmonic functions are smooth, with all derivatives converging

Statement

Assume Countable Choice and n≥2. Let Ω⊆Rn be open and let uj:Ω→R or C be harmonic with uj→u locally uniformly on Ω. Then u is smooth and harmonic, and for every compact K⊂Ω and every multi-index α, sup⁡x∈K∣Dαuj(x)−Dαu(x)∣⟶0.

Facts & Assumptions

Given: Countable Choice, an integer n≥2, an open set Ω⊆Rn, harmonic functions uj on Ω converging locally uniformly to u, a compact set K⊂Ω and a multi-index α.

[F1]

A locally uniform limit of harmonic functions is harmonic (Locally uniform limits of harmonic functions are harmonic).

[F2]

Every harmonic function is real analytic and hence C∞, so all derivatives Dαu exist (Harmonic functions are real analytic).

[F3]

Supremum Cauchy estimates: for harmonic v on an open set containing Bρ(x)‾, ∣Dαv(x)∣≤Cn,α′ρ−∣α∣sup⁡Bρ(x)∣v∣ (Harmonic Cauchy estimates in supremum norm).

[F5]

Countable Choice ACω is the standing hypothesis (The Axiom of Countable Choice (ACω)).

Proof

technique · direct
1.1givenF1F2F5

Work under [F5]. By [F1] the limit u is harmonic, and hence C∞ with all derivatives existing, by [F2].

2.1step 1.1F4cases

If K=∅, the uniform-convergence assertion on K is vacuous, so assume K≠∅. If Ω≠Rn, its complement is nonempty, closed and disjoint from K, so [F4] gives δ:=dist⁡(K,Rn∖Ω)>0; put ρ:=δ/2. If Ω=Rn, put ρ:=1. In either case let Kρ:={x∈Rn:dist⁡(x,K)≤ρ}. Since K is compact, it is bounded; the distance function is continuous, so Kρ is closed and bounded and hence compact by [F4]. In the first case Kρ⊆Ω, since every point of the complement has distance at least δ from K; in the second case this inclusion is automatic. By local uniform convergence, εj:=sup⁡Kρ∣uj−u∣→0.

3.1step 1.1step 2.1F2F3

The difference uj−u is harmonic on Ω⊇Bρ(x)‾ for every x∈K, so [F2] and [F3] give ∣Dαuj(x)−Dαu(x)∣≤Cn,α′ρ−∣α∣sup⁡Bρ(x)∣uj−u∣≤Cn,α′ρ−∣α∣εj, a bound independent of x∈K.

4.1step 3.1algebra

Taking the supremum over x∈K in step 3.1 gives sup⁡K∣Dαuj−Dαu∣≤Cn,α′ρ−∣α∣εj→0 as j→∞, for the arbitrary compact K and multi-index α; this proves the derivative convergence.

5.1step 1.1step 4.1cases∎

Complex-valued uj are handled by applying the argument to real and imaginary parts, whose differences are harmonic and whose absolute values control ∣Dαuj−Dαu∣≤∣DαRe(uj−u)∣+∣DαIm(uj−u)∣; the constant is doubled. Together with step 1.1 this proves that u is smooth harmonic and that every derivative converges uniformly on compacta.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

67 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