Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-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.

Blaschke factors and Blaschke products

Definition

For a∈D, let φa(z)=a−z1−a‾z be the published Blaschke factor of The unit disc, the upper half-plane, and Blaschke factors, a biholomorphic self-map of D by Blaschke factors are automorphisms of the disc. Define the normalized Blaschke factor ba(z):=a‾∣a∣ φa(z)  (a≠0),b0(z):=z. Since ∣a‾/∣a∣∣=1, each ba is holomorphic on an open neighbourhood of the closed disc (the denominator 1−a‾z does not vanish there), ba is zero-free on D except for the simple zero at a (the zero of φa), and ba(0)=a‾∣a∣ a=∣a∣≥0,∣ba(z)∣≤1(z∈D), the last inequality because φa maps D into itself. On the unit circle one has ∣ba(ζ)∣=1 for every ζ∈T (identified with the unit circle): for ∣ζ∣=1, ∣1−a‾ζ∣=∣ζ∣⋅∣ζ‾−a‾∣=∣a−ζ∣ by Conjugation is an involutive real-field automorphism, zz‾=∣z∣2, and modulus is definite, multiplicative, and subadditive and Real and imaginary parts, complex conjugation, and modulus, so ∣φa(ζ)∣=1.

Blaschke sequences and products. A sequence (an)n≥1 in D is a Blaschke sequence if ∑n(1−∣an∣)<+∞; its Blaschke product is the holomorphic product B(z):=∏n≥1ban(z), defined as the locally uniform limit of the partial products BN:=∏n≤Nban; for the empty sequence set B:=1. This definition is meaningful because the product converges normally on D in the sense of Normal convergence of holomorphic products: a Blaschke sequence satisfies ∣an∣→1, so for every compact K⊆D only finitely many an lie in K, and for every a∈D∖{0} and ∣z∣≤r<1 the identity 1−ba(z)=(1−∣a∣) 1+a‾∣a∣z1−a‾z,∣1−ba(z)∣≤(1−∣a∣)1+r1−r holds: the identity is a direct computation from ba=a‾∣a∣a−z1−a‾z using ∣a∣2=aa‾, and the estimate uses ∣1+a‾∣a∣z∣≤1+r and ∣1−a‾z∣≥1−r. For a=0, b0(z)=z and ∣1−b0(z)∣≤1+r=(1−∣0∣)(1+r)≤(1−∣0∣)(1+r)/(1−r), so the same estimate holds without dividing by ∣a∣. Hence ∑nsup⁡∣z∣≤r∣1−ban(z)∣≤1+r1−r∑n(1−∣an∣)<+∞. The published normal-convergence theorem therefore applies: the partial products converge locally uniformly to a holomorphic B that has exactly the zeros an with the multiplicity with which they occur, and satisfies ∣B(z)∣≤1 on D (Normally convergent products define holomorphic functions with the expected zeros). The limit does not depend on the enumeration of the sequence: the normal-convergence criterion is a condition on the set of factors, and for two enumerations and finite initial segments A,B containing a common block {1,…,N} the quotient ∏n∈Aban/∏n∈Bban deviates from 1 by at most a constant times the tail sum ∑n>Nsup⁡∣z∣≤r∣1−ban(z)∣, which tends to 0; hence the two partial-product sequences have the same locally uniform limit. The Blaschke sequence is reproduced by The zero set of a Hardy function satisfies the Blaschke condition from the zero set of a Hardy function. The boundary-modulus property ∣B∗∣=1 almost everywhere is not part of this definition; it is proved in Boundary values and zeros of a Blaschke product ↗.

Depends on

Used by

Dependency tree · two levels

28 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