Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generated
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.

Boundary vanishing of a nonzero Hardy function is confined to a null set

Example

(a) The function f(z)=1−z lies in H∞(D); its boundary function f∗(ζ)=1−ζ vanishes exactly at ζ=1, a set of m-measure zero, and f≢0. Thus a nonzero Hardy function may vanish at boundary points, although by (b) its boundary vanishing set must be null.

(b) If f∈Hp(D) for some 0<p≤∞ and the zero set {f∗=0} has positive m-measure, then f≡0.

(c) (Uniqueness) If f,g∈Hp(D) have f∗=g∗ m-almost everywhere, then f=g.

(d) The function f(z)=1−z is itself outer: it has no zeros in D, its canonical factorization is 1−z=B Sμ F with B=1, Sμ=1 and F=1−z, and indeed 1−z=[ ∣1−ζ∣ ].

Facts & Assumptions

Given: The functions f(z)=1−z and, where asserted, functions f,g∈Hp(D). The countable-choice regime of Analytic Hardy spaces on the unit disc and Inner, singular inner and outer functions is in force (The Axiom of Countable Choice (ACω)).

[F1]

Fatou's boundary theorem for analytic Hp and the log-integrability lemma: for f∈Hp, f≢0, the boundary function f∗ exists a.e. and log⁡∣f∗∣∈L1(T,m), so f∗≠0 m-almost everywhere; if f∗=0 on a set of positive measure then f≡0 (Fatou's boundary theorem for analytic Hardy spaces, Log-integrability of the boundary values of a Hardy function, Analytic Hardy spaces on the unit disc).

[F2]

Hp(D)⊆Hp′(D) for 0<p′<p≤∞ with norm comparison, so sums of Hp functions lie in Hmin⁡(p,q); in particular H∞⊆Hp for every p (Radial p-means of a holomorphic function are nondecreasing, Analytic Hardy spaces on the unit disc).

[F3]

The computation of the preceding example: for h=∣ 1−ζ ∣ one has [h](z)=1−z, log⁡∣1−z∣=P[log⁡∣1−ζ∣](z), and [h] is outer with [h](0)=1 (An outer function with a prescribed power of a vanishing modulus, Properties of outer functions).

[F4]

A holomorphic f is outer exactly when f=eiγ[ ∣f∗∣ ] for some γ, equivalently when log⁡∣f∣=P[log⁡∣f∗∣]; the canonical factorization of an outer function has trivial Blaschke and singular factors (Inner, singular inner and outer functions, Properties of outer functions).

[F5]

The point {1}⊆T is m-null and ζ↦1−ζ is continuous with 1−ζ=0 exactly at ζ=1 (The one-dimensional torus and its normalized Haar integral, The complex exponential by its power series).

Verification

1.1givenF2F5algebra

Part (a). The function f(z)=1−z is a polynomial, hence holomorphic, with ∣f∣≤2 on D, so f∈H∞(D); it is not identically zero. Its radial limits are f∗(ζ)=1−ζ, continuous on T and vanishing exactly at ζ=1 by [F5], a set of measure zero.

1.2givenF1

Part (b). Let f∈Hp with {f∗=0} of positive measure. If f≢0, then [F1] gives log⁡∣f∗∣∈L1, so f∗≠0 m-almost everywhere, contradicting positive measure of the zero set; hence f≡0.

2.1step 1.2F2

Part (c). Let f,g∈Hp with f∗=g∗ a.e. By [F2], the difference f−g lies in Hp′ for some 0<p′≤∞ (take p′=p); its boundary function (f−g)∗=f∗−g∗ vanishes a.e., a set of full measure. If f−g≢0, then by step 1.2 applied to f−g its zero set would have to be null, contradicting that it has full measure; hence f=g.

2.2step 1.1F3F4algebra

Part (d): 1−z is outer. By [F3] and [F4], 1−z=[ ∣1−ζ∣ ]; since [h](0)=1>0 and eiγ is normalized by the value at the origin, the unimodular constant is 1. Hence 1−z is outer, and its canonical factorization 1−z=λ B Sμ F has B=1 (no zeros in D), Sμ=1 (no singular factor for an outer function) and F=1−z with λ=1.

3.1step 1.1step 1.2step 2.1step 2.2∎

Assembly. Step 1.1 proves (a), step 1.2 proves (b), step 2.1 proves the uniqueness statement (c), and step 2.2 identifies 1−z as the outer function [ ∣1−ζ∣ ] with the stated trivial canonical factors, proving (d).

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

123 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