Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck 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 E⊆E^Ω.
  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)∣≤sup⁡E∣f∣ for every holomorphic f on Ω (Holomorphic hulls and holomorphic convexity).

Proof

technique · direct
1.1L1given

If a∈E and f∈O(Ω), then ∣f(a)∣≤sup⁡E∣f∣ by definition of the supremum. Hence [L1] gives a∈E^Ω, so E⊆E^Ω.

1.2L1given

For compact K, [L1] gives K^Ω=⋂f∈O(Ω){a∈Ω:∣f(a)∣≤sup⁡K∣f∣}. Each set in the intersection is closed in Ω because f is continuous, so K^Ω is closed in Ω. The coordinate functions z↦zj are holomorphic on Ω, so [L1] also gives ∣aj∣≤sup⁡z∈K∣zj∣ for every a∈K^Ω and every coordinate j. Thus K^Ω is coordinate-bounded.

2.1L1step 1.1algebra∎

Step 1.1 applied to E gives E^Ω⊆E^Ω^Ω. For the reverse inclusion, let a∈E^Ω^Ω. Then [L1] gives ∣f(a)∣≤sup⁡E^Ω∣f∣ for every f∈O(Ω), while the definition of E^Ω itself gives sup⁡E^Ω∣f∣≤sup⁡E∣f∣. So ∣f(a)∣≤sup⁡E∣f∣ for every holomorphic f, and another use of [L1] shows a∈E^Ω.

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