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.

Determinants and kernel quotients of the model Bergman metrics

Statement

Assume the Axiom of Countable Choice ACω (The Axiom of Countable Choice (ACω)), let m≥1, and use the one-based coordinate aliases of The Bergman metric form on a bounded domain. For the unit ball and the unit polydisc in Cm,

det⁡gBm(z)=(m+1)m(1−∣z∣2)m+1,det⁡gDm(z)=2m∏j=1m1(1−∣zj∣2)2.

Consequently the invariant quotients are the constants

det⁡gBmKBm=(m+1)mπmm!,det⁡gDmKDm=2mπm,

and these constants are distinct for every m≥2.

Facts & Assumptions

[A1]

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

[F1]

The model kernels are KBm(z,z)=m!πm(1−∣z∣2)m+1 and KDm(z,z)=1πm∏j=1m1(1−∣zj∣2)2 (Bergman kernels of the disc, ball and polydisc, and Szegő kernels of the disc and ball).

[F2]

The Bergman metric form is gΩ=∂∂‾log⁡KΩ(z,z), its matrix has entries (gΩ)jkˉ=∂j∂kˉlog⁡KΩ(z,z), and log⁡KΩ(z,z) is real C∞ on a bounded domain (The Bergman metric form on a bounded domain, Smoothness of the Bergman kernel and positivity of its diagonal on bounded domains).

[F4]

Under the complex Euclidean dictionary, ∣z∣2=∑j=1m∣zj∣2=∑j=1mzjzj‾, and ∂z‾kzj‾=δjk for these first-order operators (Complex m-space and its real coordinate dictionary, Wirtinger operators in Cm).

[F5]

For a commutative ring, A∈Mn(R) and columns u,v, det⁡(A+uvT)=det⁡(A)+vTadj⁡(A)u; the adjugate is the transpose of the cofactor matrix, and a diagonal matrix has determinant the product of its diagonal entries (For A∈Mn(R) and columns u,v over a commutative ring, det⁡(A+uvT)=det⁡(A)+vTadj⁡(A)u, Deleted-row-and-column minors, cofactors, the cofactor matrix and the adjugate over a commutative ring, The determinant of a triangular matrix is the product of its diagonal entries).

[F6]

For A=(1−r)Im with 0≤r<1, each diagonal cofactor equals (1−r)m−1, including the empty minor 1 when m=1. If i≠j, deleting row i and column j leaves the original row j present but zero, so its determinant is zero by the Leibniz formula. Thus adj⁡(A)=(1−r)m−1Im (Deleted-row-and-column minors, cofactors, the cofactor matrix and the adjugate over a commutative ring, For n≥1, the determinant over a commutative ring by the Leibniz formula, and ∣det⁡A∣ for a real matrix, The determinant of a triangular matrix is the product of its diagonal entries).

[F7]

The invariant quotient det⁡gΩ/KΩ agrees under biholomorphisms, and diagonal kernel values are positive on bounded domains (The determinant quotient det⁡gΩ/KΩ is a biholomorphic invariant, Smoothness of the Bergman kernel and positivity of its diagonal on bounded domains).

[F8]

Factorials of naturals are positive and m!=∏k=1mk (The factorial n! and the falling factorial nk‾, defined by recursion in N).

[F9]

In the Leibniz determinant formula every term contains exactly m matrix entries, so det⁡(cA)=cmdet⁡A for a complex scalar c (For n≥1, the determinant over a commutative ring by the Leibniz formula, and ∣det⁡A∣ for a real matrix).

Proof

technique · direct differentiation of the explicit model kernels, a rank-one determinant update, and a finite comparison of constants

Given: ACω, m≥1, the unit ball Bm and the unit polydisc Dm with the model kernels of [F1], and z in the respective domain.

1.1A1F1F2F3F4algebra

By [F1], log⁡KBm(z,z)=log⁡m!πm−(m+1)log⁡(1−∣z∣2). Using [F3] and [F4], ∂jlog⁡KBm(z,z)=(m+1)zj‾1−∣z∣2 and hence (gBm)jkˉ(z)=(m+1)(1−∣z∣2)δjk+zj‾zk(1−∣z∣2)2; in matrix form gBm(z)=m+1(1−∣z∣2)2((1−∣z∣2)Im+z‾ zT), where z‾ zT has entries zj‾zk.

1.2F1F2F3F4F5algebra

By [F1], log⁡KDm(z,z)=−mlog⁡π−2∑j=1mlog⁡(1−∣zj∣2). Each summand depends only on its own coordinate, so [F3] and [F4] give (gDm)jkˉ(z)=0 for j≠k and (gDm)jj(z)=2(1−∣zj∣2)2; the matrix is diagonal, and [F5] gives det⁡gDm(z)=2m∏j=1m(1−∣zj∣2)−2, the second displayed determinant.

2.1F5F6F9step 1.1algebra

Put r:=∣z∣2∈[0,1) and A:=(1−r)Im. By [F6], adj⁡(A)=(1−r)m−1Im, so the rank-one update [F5] with u=z‾, v=z gives det⁡((1−r)Im+z‾ zT)=det⁡(A)+zTadj⁡(A)z‾=(1−r)m+(1−r)m−1r=(1−r)m−1. Taking determinants in step 1.1 with [F9] therefore gives det⁡gBm(z)=(m+1)m(1−r)m−1/(1−r)2m=(m+1)m/(1−∣z∣2)m+1, the first displayed determinant.

3.1F1F7step 1.2step 2.1algebra

Dividing by the model kernel diagonals of [F1] cancels the (1−∣z∣2) and coordinate factors and gives det⁡gBm/KBm=(m+1)mπmm! and det⁡gDm/KDm=2mπm; the divisions use the positive diagonal values, and by [F7] the quotients are the biholomorphic invariants of the two domains.

4.1F8step 3.1algebra∎

It remains to compare the two constants. Their quotient is (m+1)m2mm!=∏k=1mm+12k, a product of positive real factors. Pair the factor k with the factor m+1−k; the pair contributes (m+1)24k(m+1−k)≥1, because (m+1)2−4k(m+1−k)=(2k−m−1)2≥0, with strict inequality unless 2k=m+1. If m=2n is even, every one of the n pairs has strict inequality, so the product exceeds 1. If m=2n+1≥3 is odd, the middle factor k=n+1 contributes 1 while the pair k=1 with k=m contributes (m+1)24m>1 for m≥2, so again the product exceeds 1. Hence (m+1)mπmm!>2mπm for every m≥2, and the two invariant constants are distinct.

Depends on

Used by

Dependency tree · two levels

132 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