Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck 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 supzη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.1

Choose a smaller neighbourhood WU 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.

givenchoose
2.1

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

L1L2step 1.1

Depends on

Used by

Dependency tree · two levels

8 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