Alphabeta Math
CorollaryStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passaudited 2026-10-02
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.

Bounded harmonic functions have L-infinity Fatou boundary data

Statement

Assume the Axiom of Choice. Let u:D→C be complex harmonic and bounded, and put M:=sup⁡z∈D∣u(z)∣<+∞. Then there is a unique f∈L∞(T,m;C) with u=P[f], and ∥u∥h∞=sup⁡z∈D∣u(z)∣=∥f∥∞. Moreover, for m-almost every ζ∈T one has u(z)→f(ζ) as z→ζ within every fixed nontangential region ΓA(ζ), A>1.

Facts & Assumptions

Given: The Axiom of Choice; a complex harmonic function u:D→C with M:=sup⁡z∈D∣u(z)∣<+∞; the notation ur(ζ)=u(rζ) and P[f]=P[fm].

[L1]

Under countable choice h∞(D) consists of the complex harmonic u on D with sup⁡0≤r<1sup⁡ζ∈T∣u(rζ)∣<+∞, and ∥u∥h∞=sup⁡0≤r<1 sup⁡ζ∈T∣u(rζ)∣=sup⁡z∈D∣u(z)∣; every element of h∞(D) is continuous on D (Harmonic Hardy classes on the unit disc).

[L2]

Under the Axiom of Choice, for every 1<p≤∞ and every u∈hp(D) there is a unique f∈Lp(T,m;C) with u=P[f], and ∥u∥hp=∥f∥p (h^p is the Poisson image of Lp for 1<p<=infinity).

[L3]

Under countable choice, if f∈L1(T,m;C), then for m-almost every ζ∈T one has P[f](z)→f(ζ) as z→ζ within every fixed nontangential region ΓA(ζ), A>1; the assertion uses an almost-everywhere representative of f (Fatou limits for Poisson extensions of L1 boundary data).

[L4]

The Axiom of Choice implies dependent choice, which implies countable choice (AC implies DC implies countable choice, The Axiom of Countable Choice (ACω), The Axiom of Choice).

[L5]

The normalized Haar measure m on T is a probability measure: m(T)=1 and ∫T1 dm=1, so the class of the constant function 1 has ∥1∥L1(T,m)=1 (The one-dimensional torus and its normalized Haar integral).

[L6]

For conjugate exponents p,p′∈[1,∞] and f∈Lp(T,m;C), g∈Lp′(T,m;C) one has ∫T∣fg∣ dm≤∥f∥p∥g∥p′; the Lp norms are the quotient norms of the spaces Lp(T,m;C) (Complex Holder, Minkowski, and the quotient norm, Complex Lp classes and Euclidean test-function conventions).

Proof

technique · direct
1.1givenL1L2L3L4

Class membership and choice bookkeeping. The hypothesis says that u is complex harmonic with M=sup⁡z∈D∣u(z)∣<+∞, so [L1] gives u∈h∞(D) and ∥u∥h∞=M. By [L4] the Axiom of Choice supplies countable choice, so the choice hypotheses of [L2] (the Axiom of Choice) and of [L3] (countable choice) are met.

2.1step 1.1L2

The boundary data. Apply [L2] with p=∞, which is allowed because 1<∞≤∞: there is a unique f∈L∞(T,m;C) with u=P[f], and ∥u∥h∞=∥f∥∞. Together with step 1.1 this gives ∥f∥∞=M=sup⁡z∈D∣u(z)∣, so f is the promised boundary datum and the norm identity holds.

3.1step 2.1L5L6

The boundary datum is integrable. Apply the Hölder inequality of [L6] with the conjugate pair (p,p′)=(∞,1), to f∈L∞(T,m;C) and to the constant function 1∈L1(T,m;C): one has ∥f∥1=∫T∣f⋅1∣ dm≤∥f∥∞∥1∥1=∥f∥∞, where the last equality is [L5]. Since ∥f∥∞=M<+∞ by step 2.1, this shows f∈L1(T,m;C).

4.1step 1.1step 2.1step 3.1L3

Nontangential convergence almost everywhere. By step 3.1 the function f lies in L1(T,m;C) and by step 1.1 countable choice is available, so [L3] applies: there is a set N⊆T with m(N)=0 such that for every ζ∈T∖N and every A>1 one has P[f](z)→f(ζ) as z→ζ within ΓA(ζ). Since u=P[f] by step 2.1, the same convergence holds with u in place of P[f]; the exceptional set does not depend on A, and the almost-everywhere representative used is the class f of step 2.1.

5.1step 1.1step 2.1step 3.1step 4.1

Assembly. Steps 2.1, 3.1 and 4.1 produce a unique f∈L∞(T,m;C) with u=P[f] and ∥u∥h∞=∥f∥∞, and show that u(z)→f(ζ) as z→ζ within every fixed nontangential region ΓA(ζ), A>1, for m-almost every ζ∈T; by step 1.1 the norm ∥u∥h∞ equals sup⁡z∈D∣u(z)∣, so all clauses of the Statement hold. The Axiom of Choice is used exactly in step 1.1: it supplies the hypothesis of the representation theorem [L2] and, through dependent and countable choice, the hypothesis of the Fatou theorem [L3]. ∎

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

114 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