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.
Bergman versus Szegő normalization on the disc
Example
Let be the unit disc with Lebesgue area measure , and let carry the normalized Haar probability of The one-dimensional torus and its normalized Haar integral. The diagonal Bergman and Szegő kernels of Bergman kernels of the disc, ball and polydisc, and Szegő kernels of the disc and ball are
the first relative to Lebesgue area measure on and the second relative to . In particular while . The two kernels are reproducing kernels of different Hilbert spaces — for the area pairing, and the disc Hardy space of boundary traces for the Haar pairing — and their boundary blow-up exponents are and : the two normalizations are comparable only after the measure is declared.
Facts & Assumptions
The only choice assumption is (The Axiom of Countable Choice ()), inherited from the model-kernel theorem and from the Bergman and Szegő definitions; no full Axiom of Choice is used.
Under , is the space of classes with a holomorphic representative for the area pairing, and its first-variable-linear kernel is the Riesz kernel of evaluation; for a Szegő-regular pair the Szegő kernel is built from the Riesz representers of the extended boundary evaluations (The Bergman space and the Bergman kernel, The Hardy boundary space, Szegő projection and Szegő kernel on a smoothly bounded domain).
The disc pair is Szegő-regular, and the model theorem gives and (Bergman kernels of the disc, ball and polydisc, and Szegő kernels of the disc and ball).
The classical disc Hardy class consists of the holomorphic functions whose radial means are bounded, and is the normalized Haar probability carried by the boundary torus of the disc pair (Analytic Hardy spaces on the unit disc, The one-dimensional torus and its normalized Haar integral).
Verification
Given: , the unit disc with its area measure, and the torus with normalized Haar measure.
Set in the two formulas of [F2]. Since on , the diagonal values are and ; at these are and .
By [F1] the first kernel reproduces point evaluations in for the area pairing, while the second reproduces the extended evaluations of the Szegő-regular pair , whose Hardy space is its boundary-trace closure; [F3] records the classical radial-mean form of the disc Hardy class against the same normalized Haar boundary measure.
As , the formulas of step 1.1 show and , so the boundary blow-up exponents are and . Their ratio is unbounded on ; in particular the two diagonal kernels are not equal, so neither normalization may be read off the other without declaring which measure is used.
Depends on
- Analytic Hardy spaces on the unit disc
- The Bergman space $A^2(\Omega)$ and the Bergman kernel
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- The Hardy boundary space, Szegő projection and Szegő kernel on a smoothly bounded domain
- The one-dimensional torus and its normalized Haar integral
- Bergman kernels of the disc, ball and polydisc, and Szegő kernels of the disc and ball
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
107 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
- Jiří Lebl, Tasty Bits of Several Complex Variables (book) (standard reference, not scraped)