Alphabeta Math
LemmaStatement: Literature-sourcedProof: 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.

The Smirnov class is the class of quotients by outer bounded functions

Statement

Let f be holomorphic on D with f≢0. Then f∈N+(D) if and only if there are g,h∈H∞(D) with h outer (equivalently log⁡∣h∗∣∈L1 and log⁡∣h(z)∣=P[log⁡∣h∗∣](z) for all z) such that f=g/h. Moreover h may be chosen with h(0)>0 and ∣h∣≤1, and the representation is not unique: (g,h) may be replaced by (gφ,hφ) for any bounded outer φ∈H∞.

Facts & Assumptions

Given: Countable choice and a holomorphic f≢0 on D; in the forward direction its boundary function f∗ with log⁡∣f∗∣∈L1.

[L1]

The Smirnov class N+(D)⊆N(D) consists of the f with log⁡∣f(z)∣≤P[log⁡∣f∗∣](z) for all z, where f∗ is the a.e. boundary function with log⁡∣f∗∣∈L1 (The Smirnov class on the disc, Boundary values and log-integrability of Nevanlinna-class functions).

[L2]

Bounded quotients of Nevanlinna functions: if g,h∈H∞ with h zero-free then f=g/h is holomorphic and lies in N(D); and for nonzero F∈H∞, log⁡∣F∣≤P[log⁡∣F∗∣] with log⁡∣F∗∣∈L1 (The Nevanlinna class is a bounded quotient class, Poisson-Jensen inequality for Hardy functions, The Nevanlinna class on the disc).

[L3]

If H≥0 has log⁡H∈L1, the outer function [H] is holomorphic and zero-free, with log⁡∣[H]∣=P[log⁡H] and [H](0)=exp⁡(∫log⁡H)>0. In particular, for φ≥0 in L1, h=[e−φ] satisfies log⁡∣h∣=−P[φ]≤0, hence ∣h∣≤1. Products of bounded outer functions remain bounded and outer, by adding their integrable boundary logarithms and their Poisson log-modulus identities. (Properties of outer functions, Inner, singular inner and outer functions)

[L5]

A zero-free factor multiplies numerator and denominator without changing the quotient; products of H∞ functions are in H∞ (The Nevanlinna class is a bounded quotient class).

Proof

technique · direct
1.1givenL1L2algebra

Quotients by outer bounded functions lie in N+. Assume f=g/h with g,h∈H∞, h outer and h≢0. By [L2], f is holomorphic and in N(D), and log⁡∣g∣≤P[log⁡∣g∗∣], while outer-ness of h gives log⁡∣h∣=P[log⁡∣h∗∣]; subtracting the two displays gives, using linearity of the Poisson integral, log⁡∣f∣=log⁡∣g∣−log⁡∣h∣≤P[log⁡∣g∗∣−log⁡∣h∗∣]=P[log⁡∣f∗∣], with the identification f∗=g∗/h∗ a.e. and log⁡∣f∗∣=log⁡∣g∗∣−log⁡∣h∗∣∈L1 by [L2]. Hence f∈N+(D) by [L1].

2.1step 1.1L1L3algebra

A Smirnov function is such a quotient. Assume f∈N+(D), so by [L1] log⁡∣f∗∣∈L1 and log⁡∣f∣≤P[log⁡∣f∗∣]. Put φ:=log⁡+∣f∗∣+1≥1, an L1 function, and h:=[e−φ]. By [L3], h is outer with 0<h(0)=e−∫φ≤e−1<1 and ∣h∣=e−P[φ]≤1, so h∈H∞ and h is outer. Let g:=fh, holomorphic on D. Then log⁡∣g∣=log⁡∣f∣−P[φ]≤P[log⁡∣f∗∣]−P[φ]=P[log⁡∣f∗∣−log⁡+∣f∗∣−1]=P[−log⁡− ⁣∣f∗∣−1]≤−1, because −log⁡−∣f∗∣−1≤−1 pointwise, and the Poisson integral of a function ≤−1 is ≤−1. Hence ∣g∣≤e−1<1 and g∈H∞(D), while f=g/h with h outer, h(0)>0, ∣h∣≤1.

3.1step 1.1step 2.1L3L5algebra

Non-uniqueness and normalization. If f=g/h with g,h∈H∞ and h outer, and φ∈H∞ is outer, both products gφ,hφ are bounded holomorphic by [L5]. The denominator is outer by [L3] and is zero-free. Therefore (gφ)/(hφ)=f is another representation with an outer denominator. Taking, for example, the constant outer multiplier 2 gives a distinct pair, so the representation is not unique. Step 2.1 already constructs a denominator with h(0)>0 and ∣h∣≤1. A merely zero-free bounded multiplier preserves the quotient but need not preserve an outer denominator.

4.1step 1.1step 2.1step 3.1∎

Assembly. Step 1.1 proves the backward implication, steps 2.1 and 3.1 the forward implication with the stated normalization, and step 3.1 records the non-uniqueness. This proves the equivalence of membership in N+(D) with the quotient representation.

Depends on

Used by

Nothing in the library uses this result yet.

Cited to discharge well-definedness by The Smirnov class on the disc.

Dependency tree · two levels

104 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