Английская Википедия:Grunsky's theorem

Материал из Онлайн справочника
Перейти к навигацииПерейти к поиску

In mathematics, Grunsky's theorem, due to the German mathematician Helmut Grunsky, is a result in complex analysis concerning holomorphic univalent functions defined on the unit disk in the complex numbers. The theorem states that a univalent function defined on the unit disc, fixing the point 0, maps every disk |z| < r onto a starlike domain for r ≤ tanh π/4. The largest r for which this is true is called the radius of starlikeness of the function.

Statement

Let f be a univalent holomorphic function on the unit disc D such that f(0) = 0. Then for all r ≤ tanh π/4, the image of the disc |z| < r is starlike with respect to 0, , i.e. it is invariant under multiplication by real numbers in (0,1).

An inequality of Grunsky

If f(z) is univalent on D with f(0) = 0, then

<math>\left|\log {zf^\prime(z)\over f(z)}\right|\le \log {1+|z|\over 1-|z|}.</math>

Taking the real and imaginary parts of the logarithm, this implies the two inequalities

<math>\left|{zf^\prime(z)\over f(z)}\right|\le {1+|z|\over 1-|z|}</math>

and

<math>\left|\arg {zf^\prime(z)\over f(z)}\right| \le \log {1+|z|\over 1-|z|}.</math>

For fixed z, both these equalities are attained by suitable Koebe functions

<math> g_w(\zeta)={\zeta\over (1-\overline{w}\zeta)^2},</math>

where |w| = 1.

Proof

Шаблон:Harvtxt originally proved these inequalities based on extremal techniques of Ludwig Bieberbach. Subsequent proofs, outlined in Шаблон:Harvtxt, relied on the Loewner equation. More elementary proofs were subsequently given based on Goluzin's inequalities, an equivalent form of Grunsky's inequalities (1939) for the Grunsky matrix.

For a univalent function g in z > 1 with an expansion

<math> g(z) = z + b_1 z^{-1} + b_2 z^{-2} + \cdots.</math>

Goluzin's inequalities state that

<math> \left|\sum_{i=1}^n\sum_{j=1}^n\lambda_i\lambda_j \log {g(z_i)-g(z_j)\over z_i-z_j}\right| \le \sum_{i=1}^n\sum_{j=1}^n \lambda_i\overline{\lambda_j}\log {z_i\overline{z_j}\over z_i\overline{z_j}-1},</math>

where the zi are distinct points with |zi| > 1 and λi are arbitrary complex numbers.

Taking n = 2. with λ1 = – λ2 = λ, the inequality implies

<math> \left| \log {g^\prime(\zeta)g^\prime(\eta) (\zeta-\eta)^2\over (g(\zeta)-g(\eta))^2}\right|\le \log {|1-\zeta\overline{\eta}|^2\over (|\zeta|^2 -1 )(|\eta|^2 -1)}.</math>

If g is an odd function and η = – ζ, this yields

<math> \left| \log {\zeta g^\prime(\zeta) \over g(\zeta)}\right| \le {|\zeta|^2 + 1\over |\zeta|^2 -1}.</math>

Finally if f is any normalized univalent function in D, the required inequality for f follows by taking

<math> g(\zeta)=f(\zeta^{-2})^{-{1\over 2}}</math>

with <math>z=\zeta^{-2}.</math>

Proof of the theorem

Let f be a univalent function on D with f(0) = 0. By Nevanlinna's criterion, f is starlike on |z| < r if and only if

<math> \Re {zf^\prime(z)\over f(z)} \ge 0</math>

for |z| < r. Equivalently

<math>\left|\arg {zf^\prime(z)\over f(z)}\right| \le {\pi\over 2}.</math>

On the other hand by the inequality of Grunsky above,

<math> \left|\arg {zf^\prime(z)\over f(z)}\right|\le \log {1+|z|\over 1-|z|}.</math>

Thus if

<math> \log {1+|z|\over 1-|z|} \le {\pi\over 2},</math>

the inequality holds at z. This condition is equivalent to

<math>|z|\le \tanh {\pi\over 4} </math>

and hence f is starlike on any disk |z| < r with r ≤ tanh π/4.

References

Партнерские ресурсы
Криптовалюты
Магазины
Хостинг
Разное

Источник — http://wikihandbk.com/ruwiki/index.php?title=Английская_Википедия:Grunsky%27s_theorem&oldid=15047243