Alphabeta Math
LemmaStatement: AI-adaptedProof: 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.

The determinant quotient det⁡gΩ/KΩ is a biholomorphic invariant

Statement

Assume the Axiom of Countable Choice ACω (The Axiom of Countable Choice (ACω)). Let Ω,Ω′⊆Cm be bounded domains, let F:Ω→Ω′ be a biholomorphism with complex Jacobian DF(z), and let gΩ(z) be the matrix of the Bergman metric form in the one-based coordinate aliases of The Levi form and strict plurisubharmonicity. Then, for every z∈Ω,

det⁡gΩ(z)=∣det⁡DF(z)∣2det⁡gΩ′(F(z)),KΩ(z,z)=∣det⁡DF(z)∣2KΩ′(F(z),F(z)),

and consequently

det⁡gΩ(z)KΩ(z,z)=det⁡gΩ′(F(z))KΩ′(F(z),F(z))(z∈Ω).

If each quotient is constant on its domain, then the two constants are equal. (For m≥2 these quotients are the invariants that distinguish the ball metric from the polydisc metric, but constancy is not claimed here.)

Facts & Assumptions

[A1]

The only choice assumption is ACω (The Axiom of Countable Choice (ACω)), inherited through the Bergman metric, kernel and transformation suppliers; no full Axiom of Choice is used.

[F1]

The Bergman metric form of a bounded domain is the Hermitian form gΩ(z)(X,Y)=∑j,k=1m(gΩ)jkˉ(z)XjYk‾ with matrix (gΩ)jkˉ(z), and BΩ2(z;X)=gΩ(z)(X,X) (The Bergman metric form on a bounded domain, The Levi form and strict plurisubharmonicity).

[F2]

A biholomorphism F:Ω→Ω′ of bounded domains satisfies gΩ(z)(X,Y)=gΩ′(F(z))(DF(z)X,DF(z)Y) for all z,X,Y (The Bergman metric is positive definite on bounded domains and biholomorphically invariant).

[F3]

A biholomorphism F satisfies KΩ(z,w)=JF(z)KΩ′(F(z),F(w))JF(w)‾ with JF=det⁡DF≠0; in particular the diagonal kernel law KΩ(z,z)=∣det⁡DF(z)∣2KΩ′(F(z),F(z)) holds (Transformation law of the Bergman kernel under a biholomorphism).

[F4]

On a bounded domain, KΩ(z,z)>0 for every z (Smoothness of the Bergman kernel and positivity of its diagonal on bounded domains).

[F5]

For A∈Mn(R) over a commutative ring, det⁡(A)=∑σ∈Snsgn⁡(σ)∏i<naσ(i),i, and transposition leaves the determinant unchanged; the determinant is multiplicative: det⁡(AB)=det⁡Adet⁡B (For n≥1, the determinant over a commutative ring by the Leibniz formula, and ∣det⁡A∣ for a real matrix, Finite rectangular matrices over a commutative ring, their entries, rows and columns, For every square matrix over a commutative ring, det⁡(AT)=det⁡(A), For same-sized finite square matrices over a commutative ring, det⁡(AB)=det⁡(A)det⁡(B)).

[F6]

Complex conjugation is a field automorphism of C fixing the rationals, so it commutes with finite sums and products of complex numbers (Conjugation is an involutive real-field automorphism, zz‾=∣z∣2, and modulus is definite, multiplicative, and subadditive).

Proof

technique · direct, comparing Hermitian matrices by their quadratic forms and taking determinants

Given: ACω, bounded domains Ω,Ω′, a biholomorphism F, a point z∈Ω, and J:=DF(z).

1.1A1F1F2F7algebra

Put G:=gΩ′(F(z)) and H:=gΩ(z), with entries Glm and Hjk in the one-based aliases. By [F1] and [F2], for all X,Y∈Cm, ∑j,kHjkXjYk‾=∑l,mGlm(JX)l(JY)m‾=∑j,k(∑l,mJmk‾GlmJlj)XjYk‾. Since the Hermitian form is determined by its coefficients, Hjk=∑l,mJmk‾GlmJlj, which is the (j,k) entry of JTGJ‾ because (JTGJ‾)jk=∑l,mJljGlmJmk‾ by [F7]; in matrix notation gΩ(z)=JTgΩ′(F(z))J‾.

1.2F5F6algebra

Conjugation is a field automorphism of C [F6] applied entrywise to the Leibniz sum of [F5] gives det⁡(J‾)=det⁡J‾; since transposition leaves determinants unchanged [F5], det⁡(J‾T)=det⁡J‾.

2.1F3F5step 1.1step 1.2

Taking determinants in the matrix identity of step 1.1 and using multiplicativity and transposition invariance [F5] gives det⁡gΩ(z)=det⁡(J)det⁡gΩ′(F(z))det⁡(J‾)=det⁡J det⁡gΩ′(F(z)) det⁡J‾=∣det⁡J∣2det⁡gΩ′(F(z)), the first displayed identity. The second displayed identity is the diagonal kernel law of [F3] with J=DF(z), whose determinant is nonzero.

3.1F3F4step 2.1∎

By [F4] the diagonal values KΩ(z,z) and KΩ′(F(z),F(z)) are positive, and ∣det⁡DF(z)∣2>0 by [F3]; dividing the two identities of step 2.1 by each other and cancelling the common positive factor ∣det⁡DF(z)∣2 gives the displayed identity of the quotients for every z∈Ω. If each quotient is constant on its domain, evaluating the identity at any z shows the two constants are equal.

Depends on

Used by

Dependency tree · two levels

87 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