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 (The Axiom of Countable Choice ()), let , 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 ,
Consequently the invariant quotients are the constants
and these constants are distinct for every .
Facts & Assumptions
The only choice assumption is (The Axiom of Countable Choice ()), inherited through the Bergman metric, kernel and determinant suppliers; no full Axiom of Choice is used.
The model kernels are and (Bergman kernels of the disc, ball and polydisc, and Szegő kernels of the disc and ball).
The Bergman metric form is , its matrix has entries , and is real 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).
For , , and the usual product, quotient and chain rules hold; Wirtinger operators are the first-order operators of Wirtinger operators in (The natural logarithm as the inverse of the exponential function, The natural logarithm has derivative 1/x and equals the integral from 1 to x of 1/t, Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm, The chain rule for total derivatives: ).
Under the complex Euclidean dictionary, , and for these first-order operators (Complex -space and its real coordinate dictionary, Wirtinger operators in ).
For a commutative ring, and columns , ; the adjugate is the transpose of the cofactor matrix, and a diagonal matrix has determinant the product of its diagonal entries (For and columns over a commutative ring, , 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).
For with , each diagonal cofactor equals , including the empty minor when . If , deleting row and column leaves the original row present but zero, so its determinant is zero by the Leibniz formula. Thus (Deleted-row-and-column minors, cofactors, the cofactor matrix and the adjugate over a commutative ring, For , the determinant over a commutative ring by the Leibniz formula, and for a real matrix, The determinant of a triangular matrix is the product of its diagonal entries).
The invariant quotient agrees under biholomorphisms, and diagonal kernel values are positive on bounded domains (The determinant quotient is a biholomorphic invariant, Smoothness of the Bergman kernel and positivity of its diagonal on bounded domains).
Factorials of naturals are positive and (The factorial and the falling factorial , defined by recursion in ).
In the Leibniz determinant formula every term contains exactly matrix entries, so for a complex scalar (For , the determinant over a commutative ring by the Leibniz formula, and for a real matrix).
Proof
Given: , , the unit ball and the unit polydisc with the model kernels of [F1], and in the respective domain.
By [F1], . Using [F3] and [F4], and hence ; in matrix form , where has entries .
By [F1], . Each summand depends only on its own coordinate, so [F3] and [F4] give for and ; the matrix is diagonal, and [F5] gives , the second displayed determinant.
Put and . By [F6], , so the rank-one update [F5] with , gives Taking determinants in step 1.1 with [F9] therefore gives , the first displayed determinant.
Dividing by the model kernel diagonals of [F1] cancels the and coordinate factors and gives and ; the divisions use the positive diagonal values, and by [F7] the quotients are the biholomorphic invariants of the two domains.
It remains to compare the two constants. Their quotient is , a product of positive real factors. Pair the factor with the factor ; the pair contributes , because , with strict inequality unless . If is even, every one of the pairs has strict inequality, so the product exceeds . If is odd, the middle factor contributes while the pair with contributes for , so again the product exceeds . Hence for every , and the two invariant constants are distinct.
Depends on
- The Bergman metric form on a bounded domain
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- For $n\ge1$, the determinant over a commutative ring by the Leibniz formula, and $|\det A|$ for a real matrix
- The factorial $n!$ and the falling factorial $n^{\underline{k}}$, defined by recursion in $\mathbb{N}$
- Deleted-row-and-column minors, cofactors, the cofactor matrix and the adjugate over a commutative ring
- The natural logarithm as the inverse of the exponential function
- Wirtinger operators in $\mathbb{C}^m$
- The determinant quotient $\det g_\Omega/K_\Omega$ is a biholomorphic invariant
- Smoothness of the Bergman kernel and positivity of its diagonal on bounded domains
- For $A\in M_n(R)$ and columns $u,v$ over a commutative ring, $\det(A+uv^{T})=\det(A)+v^{T}\operatorname{adj}(A)u$
- Complex $m$-space and its real coordinate dictionary
- The chain rule for total derivatives: $D(g\circ f)(a)=Dg(f(a))\circ Df(a)$
- The determinant of a triangular matrix is the product of its diagonal entries
- The natural logarithm has derivative 1/x and equals the integral from 1 to x of 1/t
- Bergman kernels of the disc, ball and polydisc, and Szegő kernels of the disc and ball
- Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm
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
- Zbigniew Błocki, The Bergman Kernel and Metric (lecture notes) (standard reference, not scraped)