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.
Transformation law of the Bergman kernel under a biholomorphism
Statement
Assume the Axiom of Countable Choice (The Axiom of Countable Choice ()). Let , let be domains, and let be a biholomorphism. Write . Then for every , and
The pullback , defined on the unique holomorphic representatives by , is a unitary isomorphism (a surjective linear isometry), with
Facts & Assumptions
The only choice principle assumed is (The Axiom of Countable Choice ()). Under it, the Bergman spaces are Hilbert spaces of unique holomorphic representatives with first-variable-linear inner products, Riesz sections, and reproducing kernels; the real change-of-variables supplier and Hilbert-adjoint definition also use only (The Bergman space and the Bergman kernel, Reproducing property, Bergman projection and the extremal characterization, A C^1 diffeomorphism satisfies the change-of-variables formula for L^1 functions, The Hilbert-space adjoint of a bounded operator).
A biholomorphism and its inverse are holomorphic maps. Their components are holomorphic scalar functions, hence smooth in real coordinates, so under both are real maps and is a diffeomorphism (Biholomorphic maps between open sets in , A map into is holomorphic exactly when each of its components is, Holomorphic functions of several variables are smooth and their complex derivatives are holomorphic, Euclidean maps and diffeomorphisms, Complex -space and its real coordinate dictionary).
The entries of the complex Jacobian matrix are the component derivatives , which are holomorphic; its determinant is a finite sum of products of these entries, so is holomorphic. Composition of holomorphic maps is holomorphic (Holomorphic maps and the complex Jacobian matrix, A map into is holomorphic exactly when each of its components is, Holomorphic functions of several variables are smooth and their complex derivatives are holomorphic, Sums, products and nonvanishing quotients of holomorphic functions are holomorphic, The composite of holomorphic maps is holomorphic and its complex Jacobian is the product).
The complex Jacobian determinant is multiplicative under composition. Applying this to gives , hence (The complex Jacobian determinant of a composite of equidimensional holomorphic maps is the product).
For a -linear map with complex determinant , the real determinant under is (The real Jacobian determinant of a complex-linear automorphism is the squared modulus of its complex determinant).
For the real diffeomorphism underlying , Lebesgue change of variables gives for every complex . The Bergman measures are restrictions of this Lebesgue measure (A C^1 diffeomorphism satisfies the change-of-variables formula for L^1 functions, The Bergman space and the Bergman kernel, Complex -space and its real coordinate dictionary).
The Bergman section satisfies ; the pairing is linear in its first variable (The Bergman space and the Bergman kernel, Reproducing property, Bergman projection and the extremal characterization).
For a bounded linear operator between Hilbert spaces, its adjoint is characterized by . An isometry is bounded with bound (The Hilbert-space adjoint of a bounded operator, A bounded linear operator between normed spaces).
If , then by Cauchy–Schwarz (Cauchy–Schwarz: , with equality exactly for dependent pairs).
Proof
Given: , domains , and a biholomorphism .
By [F1], and are smooth as real maps under the Euclidean identification, so is a real diffeomorphism between the corresponding open subsets of .
Applying [F3] to gives for every . Thus .
By [F2], is holomorphic, and the chain rule makes holomorphic for ; hence is holomorphic. Applying [F4] and [F5] to gives , so and . For , [F8] gives , and [F4]–[F5] yield . Pointwise linearity makes a linear isometry preserving the inner product.
Apply step 2.1 to as well. For each , lies in , and [F3] gives . Thus is onto with inverse , so it is a unitary isomorphism. For every , inner-product preservation and surjectivity give for all ; by [F7], . Finally, for and , [F6] gives , where . Nondegeneracy of the inner product yields .
Since , step 3.1 gives . Evaluating the unique holomorphic representatives at gives , the asserted transformation law.
Depends on
- A C^1 diffeomorphism satisfies the change-of-variables formula for L^1 functions
- The complex Jacobian determinant of a composite of equidimensional holomorphic maps is the product
- Holomorphic functions of several variables are smooth and their complex derivatives are holomorphic
- The Bergman space $A^2(\Omega)$ and the Bergman kernel
- Biholomorphic maps between open sets in $\mathbb{C}^m$
- A bounded linear operator between normed spaces
- $C^k$ Euclidean maps and diffeomorphisms
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- The Hilbert-space adjoint of a bounded operator
- Holomorphic maps $\mathbb{C}^m \to \mathbb{C}^n$ and the complex Jacobian matrix
- The real Jacobian determinant of a complex-linear automorphism is the squared modulus of its complex determinant
- Complex $m$-space and its real coordinate dictionary
- Sums, products and nonvanishing quotients of holomorphic functions are holomorphic
- Reproducing property, Bergman projection and the extremal characterization
- Cauchy–Schwarz: $|\langle x,y\rangle|\le\|x\|\,\|y\|$, with equality exactly for dependent pairs
- The composite of holomorphic maps is holomorphic and its complex Jacobian is the product
- A map into $\mathbb{C}^n$ is holomorphic exactly when each of its components is
Used by
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
- Zbigniew Błocki, The Bergman Kernel and Metric (standard reference, not scraped)
- Jiří Lebl, Tasty Bits of Several Complex Variables (standard reference, not scraped)