Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)audited 2026-10-08
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 ACω (The Axiom of Countable Choice (ACω)). Let m≥1, let Ω,Ω′⊆Cm be domains, and let F:Ω→Ω′ be a biholomorphism. Write JF(z):=det⁡CDF(z). Then JF(z)≠0 for every z∈Ω, and

KΩ(z,w)=JF(z) KΩ′(F(z),F(w)) JF(w)‾(z,w∈Ω).

The pullback UF:A2(Ω′)→A2(Ω), defined on the unique holomorphic representatives by UFg:=(g∘F)JF, is a unitary isomorphism (a surjective linear isometry), with

UF∗KΩ(⋅,z)=JF(z)‾KΩ′(⋅,F(z)).

Facts & Assumptions

[A1]

The only choice principle assumed is ACω (The Axiom of Countable Choice (ACω)). 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 ACω (The Bergman space A2(Ω) 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).

[F1]

A biholomorphism and its inverse are holomorphic maps. Their components are holomorphic scalar functions, hence smooth in real coordinates, so under Cm≅R2m both are real C1 maps and F is a C1 diffeomorphism (Biholomorphic maps between open sets in Cm, A map into Cn is holomorphic exactly when each of its components is, Holomorphic functions of several variables are smooth and their complex derivatives are holomorphic, Ck Euclidean maps and diffeomorphisms, Complex m-space and its real coordinate dictionary).

[F2]

The entries of the complex Jacobian matrix are the component derivatives ∂zkFj, which are holomorphic; its determinant is a finite sum of products of these entries, so JF is holomorphic. Composition of holomorphic maps is holomorphic (Holomorphic maps Cm→Cn and the complex Jacobian matrix, A map into Cn 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).

[F3]

The complex Jacobian determinant is multiplicative under composition. Applying this to F−1∘F=id⁡ gives JF−1(F(z))JF(z)=1, hence JF(z)≠0 (The complex Jacobian determinant of a composite of equidimensional holomorphic maps is the product).

[F4]

For a C-linear map with complex determinant J, the real determinant under Cm≅R2m is ∣J∣2 (The real Jacobian determinant of a complex-linear automorphism is the squared modulus of its complex determinant).

[F5]

For the real C1 diffeomorphism underlying F, Lebesgue change of variables gives ∫Ω′q(ζ) dλ2m(ζ)=∫Ωq(F(z))∣det⁡RDF(z)∣ dλ2m(z) for every complex q∈L1(Ω′). 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 A2(Ω) and the Bergman kernel, Complex m-space and its real coordinate dictionary).

[F6]

The Bergman section kz=KΩ(⋅,z) satisfies f(z)=⟨f,kz⟩; the pairing is linear in its first variable (The Bergman space A2(Ω) and the Bergman kernel, Reproducing property, Bergman projection and the extremal characterization).

[F7]

For a bounded linear operator T:H→K between Hilbert spaces, its adjoint is characterized by ⟨Tx,y⟩K=⟨x,T∗y⟩H. An isometry is bounded with bound 1 (The Hilbert-space adjoint of a bounded operator, A bounded linear operator between normed spaces).

[F8]

If g,h∈A2(Ω′), then gh‾∈L1(Ω′) by Cauchy–Schwarz (Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs).

Proof

technique · direct, using the weighted pullback and the reproducing property

Given: ACω, domains Ω,Ω′⊆Cm, and a biholomorphism F:Ω→Ω′.

1.1A1F1given

By [F1], F and F−1 are smooth as real maps under the Euclidean identification, so F is a real C1 diffeomorphism between the corresponding open subsets of R2m.

1.2F3given

Applying [F3] to F−1∘F=id⁡Ω gives JF−1(F(z))JF(z)=1 for every z∈Ω. Thus JF(z)≠0.

2.1A1F2F4F5F8step 1.1given

By [F2], JF is holomorphic, and the chain rule makes g∘F holomorphic for g∈A2(Ω′); hence (g∘F)JF is holomorphic. Applying [F4] and [F5] to ∣g∣2∈L1(Ω′) gives ∫Ω∣(g∘F)(z)JF(z)∣2 dλ2m(z)=∫Ω′∣g(ζ)∣2 dλ2m(ζ)<∞, so UFg∈A2(Ω) and ∥UFg∥2=∥g∥2. For g,h∈A2(Ω′), [F8] gives gh‾∈L1(Ω′), and [F4]–[F5] yield ⟨UFg,UFh⟩Ω=∫Ωg(F(z))h(F(z))‾∣JF(z)∣2 dλ2m(z)=∫Ω′g(ζ)h(ζ)‾ dλ2m(ζ)=⟨g,h⟩Ω′. Pointwise linearity makes UF a linear isometry preserving the inner product.

3.1A1F3F6F7step 1.2step 2.1given

Apply step 2.1 to F−1 as well. For each h∈A2(Ω), g:=(h∘F−1)JF−1 lies in A2(Ω′), and [F3] gives UFg=h. Thus UF is onto with inverse UF−1, so it is a unitary isomorphism. For every y∈A2(Ω), inner-product preservation and surjectivity give ⟨UFg,y⟩Ω=⟨g,UF−1y⟩Ω′ for all g; by [F7], UF∗=UF−1. Finally, for z∈Ω and g∈A2(Ω′), [F6] gives ⟨g,UF∗kz⟩Ω′=⟨UFg,kz⟩Ω=(UFg)(z)=JF(z)g(F(z))=⟨g,JF(z)‾kF(z)′⟩Ω′, where kη′:=KΩ′(⋅,η). Nondegeneracy of the inner product yields UF∗kz=JF(z)‾kF(z)′.

4.1F6step 3.1∎

Since UFUF∗=id⁡, step 3.1 gives kw=UFUF∗kw=JF(w)‾ UFkF(w)′. Evaluating the unique holomorphic representatives at z gives KΩ(z,w)=JF(w)‾JF(z)KΩ′(F(z),F(w)), the asserted transformation law.

Depends on

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