Math 2.0

Functions of a complex variable Definition

Grunsky matrix

Builds on Univalent functionLaurent seriesComplex logarithm

Definition

Let Δ={z∈ℂ:∣z∣>1}\Delta = \set{z \in \C : \abs{z} > 1}. Let gg be an injective meromorphic function on Δ∪{∞}\Delta \cup \set{\infty} with a simple pole at ∞\infty and Laurent expansion g(z)=z+b0+∑n=1∞bnz−n,∣z∣>1.g(z) = z + b_0 + \sum_{n=1}^{\infty} b_n z^{-n}, \qquad \abs{z} > 1. The function Q(z,ζ)=g(z)−g(ζ)z−ζQ(z, \zeta) = \dfrac{g(z) - g(\zeta)}{z - \zeta} for z≠ζz \ne \zeta, with Q(z,z)=g′(z)Q(z, z) = g'(z), is holomorphic and nowhere zero on Δ×Δ\Delta \times \Delta and tends to 11 as z,ζ→∞z, \zeta \to \infty. So it has a holomorphic logarithm with value 00 at (∞,∞)(\infty, \infty), with an expansion log⁡g(z)−g(ζ)z−ζ=−∑m,n≥1cmn z−mζ−n,∣z∣,∣ζ∣>1.\log \frac{g(z) - g(\zeta)}{z - \zeta} = -\sum_{m, n \ge 1} c_{mn}\, z^{-m} \zeta^{-n}, \qquad \abs{z}, \abs{\zeta} > 1. The numbers cmnc_{mn} are the Grunsky coefficients of gg, and the infinite matrix (cmn)m,n≥1(c_{mn})_{m, n \ge 1} is the Grunsky matrix of gg.

Remarks

The Grunsky matrix is symmetric: cmn=cnmc_{mn} = c_{nm}, because Q(z,ζ)=Q(ζ,z)Q(z, \zeta) = Q(\zeta, z). The coefficients are polynomials in b1,b2,…b_1, b_2, \ldots; for example c11=b1c_{11} = b_1. The Grunsky inequalities say that for every finite sequence λ1,…,λN∈ℂ\lambda_1, \ldots, \lambda_N \in \C, ∣∑m,n=1Nmn cmnλmλn∣≤∑n=1N∣λn∣2.\Bigl| \sum_{m, n = 1}^{N} \sqrt{mn}\, c_{mn} \lambda_m \lambda_n \Bigr| \le \sum_{n=1}^{N} \abs{\lambda_n}^2. Example: g(z)=z+1/zg(z) = z + 1/z is injective on Δ\Delta, since g(z)=g(w)g(z) = g(w) with z≠wz \ne w forces zw=1zw = 1. Here Q(z,ζ)=1−1/(zζ)Q(z, \zeta) = 1 - 1/(z\zeta), so log⁡Q=−∑n≥11n(zζ)−n\log Q = -\sum_{n \ge 1} \frac{1}{n} (z\zeta)^{-n}, and cnn=1/nc_{nn} = 1/n while cmn=0c_{mn} = 0 for m≠nm \ne n. The weighted matrix (mn cmn)(\sqrt{mn}\, c_{mn}) is the identity, so the Grunsky inequalities reduce to ∣∑nλn2∣≤∑n∣λn∣2\abs{\sum_n \lambda_n^2} \le \sum_n \abs{\lambda_n}^2, with equality for real λn\lambda_n. Non-example: g(z)=z+2/zg(z) = z + 2/z is not injective on Δ\Delta, since g(i2)=g(−i2)=0g(i\sqrt{2}) = g(-i\sqrt{2}) = 0. Then Q(z,ζ)=1−2/(zζ)Q(z, \zeta) = 1 - 2/(z\zeta) vanishes at points of Δ×Δ\Delta \times \Delta, and no holomorphic logarithm exists there. Sign and normalisation conventions differ between authors; some use log⁡g(z)−g(ζ)z−ζ\log\frac{g(z) - g(\zeta)}{z - \zeta} with a plus sign or with the factors mn\sqrt{mn} built in.

Reading path

To understand this page from the ground up, read these 16 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Complex numbers object
  2. Real numbers object
  3. Set bounded above definition
  4. Univalent function concept
  5. Complex exponential definition
  6. Power series in the complex plane definition
  7. Real and imaginary parts definition
  8. Supremum definition
  9. Laurent series definition
  10. Completeness axiom statement
  11. Existence of square roots of nonnegative reals statement
  12. Square root definition
  13. Modulus of a complex number definition
  14. Argument of a complex number definition
  15. Complex logarithm definition
  16. Grunsky matrix definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Grunsky_matrix
About this page
TagVT98YJJJ47
URIm2://VT98YJJJ47
Kinddefinition
WritingW0 stub
MSC30C50, 30C55
DefinesGrunsky matrix
UsesUnivalent function, Laurent series, Complex logarithm
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.