Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-27
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.

A weak local subharmonic peak function upgrades to regularity

Statement

Let Ω⊆C be a bounded complex domain and let ζ∈∂Ω. Suppose there are a neighbourhood U of ζ and a subharmonic function q on Ω∩U such that:

  1. q(z)<0 on Ω∩U;
  2. q(z)→0 as z→ζ with z∈Ω;
  3. writing q∂(η):=lim sup⁡z→ηz∈Ω∩Uq(z)(η∈Ω∩U‾), every compact set K⊆(Ω∩U‾)∖{ζ} satisfies sup⁡η∈Kq∂(η)<0.

Then ζ is regular for Ω.

Facts & Assumptions

Given: A bounded complex domain Ω, a boundary point ζ, and local data U and q as in the Statement.

[L1]

A local strict peak function globalizes to a global barrier (A local strict subharmonic peak function globalizes).

[L2]

A boundary point is regular exactly when it admits a barrier (A boundary point is regular exactly when it admits a barrier).

Proof

technique · direct
1.1givenchoose

Choose a smaller neighbourhood W⋐U of ζ. The compact seam (Ω∩W‾)∩∂W is a compact subset of (Ω∩U‾)∖{ζ}, so hypothesis 3 gives [given, choose] sup⁡η∈(Ω∩W‾)∩∂Wq∂(η)<0. Thus q is already a local strict peak function on Ω∩W.

2.1L1L2step 1.1∎

Applying [L1] to the restricted data on W yields a global barrier at ζ. Then [L2] shows that ζ is regular.

Depends on

Used by

Dependency tree · two levels

11 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