Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedSession-authored (Fable 5 assisted)precheck passaudited 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 holomorphic function on a Hartogs figure extends to the full bidisc

Statement

Fix 0<r,s<1. Every holomorphic function on the Hartogs figure H(r,s) admits a unique holomorphic extension to the bidisc H^(r,s).

Facts & Assumptions

Given: A holomorphic function f on H(r,s).

[L1]

The Hartogs figure H(r,s) and its bidisc hull H^(r,s) are the sets defined on the page's opening definition (The Hartogs figure H(r,s) and its bidisc hull).

[L2]

For any ρ with r<ρ<1, define Fρ(z,w):=12πiζ=ρf(ζ,w)ζzdζ for z<ρ and w<1.

[L3]

If w<s, then the slice zf(z,w) is holomorphic on the whole unit disc, so the one-variable Cauchy formula recovers it from the circle ζ=ρ whenever z<ρ<1 (Cauchy's integral formula on a circle compactly contained in a disc of holomorphy).

[L4]

A holomorphic function on a connected open set is determined by its values on any nonempty open subset (A holomorphic function vanishing on a nonempty open subset of a domain vanishes identically).

[L5]

The negative Laurent coefficients of the z-slices vanish identically on the parameter disc (Negative Laurent coefficients vanish on a Hartogs figure), and the coefficient functions themselves are holomorphic in the parameter (Laurent coefficients on Hartogs slices depend holomorphically on the remaining variables).

[L6]

A separately holomorphic function that is locally bounded is jointly holomorphic (Locally bounded and separately holomorphic implies holomorphic).

Proof

technique · direct
1.1

Fix ρ with r<ρ<1 and define Fρ by the Cauchy integral in [L2]. Since ζ=ρ and w<1 place (ζ,w) inside H(r,s) by [L1], the integral is well defined. For fixed z with z<ρ, [L2] applied to the one complex parameter w makes wFρ(z,w) holomorphic on w<1. For fixed w, the same theorem applied to the one complex parameter z makes zFρ(z,w) holomorphic on z<ρ. The ML estimate gives local bounds on compact subsets, so [L6] upgrades Fρ to a jointly holomorphic function on {z<ρ, w<1}.

L1L2L6algebra
2.1

If w<s, then the slice zf(z,w) is holomorphic on z<1. Therefore [L3] gives Fρ(z,w)=f(z,w) whenever z<ρ and w<s. So Fρ extends f across the missing core over that open overlap.

L3step 1.1
3.1

If r<ρ1<ρ2<1, then both Fρ1 and Fρ2 are holomorphic on {z<ρ1, w<1} by step 1.1, and step 2.1 shows that they agree on the nonempty open subset {z<ρ1, w<s}. Hence [L4] forces Fρ1=Fρ2 on the whole connected domain {z<ρ1, w<1}.

step 1.1step 2.1L4
4.1

For each point (z,w)H^(r,s) choose any ρ with max{r,z}<ρ<1, and set F(z,w):=Fρ(z,w). Step 3.1 shows that this does not depend on the chosen ρ, so F is well defined and holomorphic locally, hence holomorphic on all of H^(r,s).

step 3.1construct
5.1

Step 2.1 gives F=f on the open set {w<s}H(r,s), so F is a holomorphic extension of f to the bidisc. If G is another such extension, then F and G are holomorphic on the connected bidisc and agree on the same nonempty open overlap with f; [L4] gives F=G. Thus the extension is unique.

step 2.1step 4.1L4
6.1

The Laurent-coefficient view in [L5] is compatible with the integral construction above: the Cauchy kernel removes the vanished negative part and rebuilds the same holomorphic continuation.

L5step 5.1

Depends on

Used by

Dependency tree · two levels

44 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