Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-28
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.

Basic properties of the holomorphic hull

Statement

Let ΩCm be a domain.

  1. For every EΩ, one has EE^Ω.
  2. If KΩ is compact, then K^Ω is closed in Ω and is bounded in each coordinate.
  3. For every EΩ, one has E^Ω^Ω=E^Ω.

Facts & Assumptions

Given: A domain ΩCm, a subset EΩ, and a compact set KΩ.

[L1]

The holomorphic hull is defined by the pointwise inequalities f(a)supEf for every holomorphic f on Ω (Holomorphic hulls and holomorphic convexity).

Proof

technique · direct
1.1

If aE and fO(Ω), then f(a)supEf by definition of the supremum. Hence [L1] gives aE^Ω, so EE^Ω.

L1given
1.2

For compact K, [L1] gives K^Ω=fO(Ω){aΩ:f(a)supKf}. Each set in the intersection is closed in Ω because f is continuous, so K^Ω is closed in Ω. The coordinate functions zzj are holomorphic on Ω, so [L1] also gives ajsupzKzj for every aK^Ω and every coordinate j. Thus K^Ω is coordinate-bounded.

L1given
2.1

Step 1.1 applied to E gives E^ΩE^Ω^Ω. For the reverse inclusion, let aE^Ω^Ω. Then [L1] gives f(a)supE^Ωf for every fO(Ω), while the definition of E^Ω itself gives supE^ΩfsupEf. So f(a)supEf for every holomorphic f, and another use of [L1] shows aE^Ω.

L1step 1.1algebra

Depends on

Used by

Dependency tree · two levels

2 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