# de Branges's theorem

﻿
de Branges's theorem

In complex analysis, the Bieberbach conjecture or de Branges's theorem, posed by Ludwig Bieberbach (1916) and proven by Louis de Branges (1985), states a necessary condition on a holomorphic function to map the open unit disk of the complex plane injectively to the complex plane.

The statement concerns the Taylor coefficients an of such a function, normalized as is always possible so that a0 = 0 and a1 = 1. That is, we consider a holomorphic function of the form

$f(z)=z+\sum_{n\geq 2} a_n z^n$

which is defined and injective on the open unit disk (such functions are also called univalent or schlicht functions). The theorem then states that

$\left| a_n \right| \leq n \quad \text{for all }n\geq 2.\,$

## Schlicht functions

The normalizations

a0 = 0 and a1 = 1

mean that

f(0) = 0 and f '(0) = 1;

this can always be assured by a linear fractional transformation: starting with an arbitrary injective holomorphic function g defined on the open unit disk and setting

$f(z)=\frac{g(z)-g(0)}{g'(0)}.\,$

Such functions g are of interest because they appear in the Riemann mapping theorem.

A family of schlicht functions are the rotated Köbe functions

$f_\alpha(z)=\frac{z}{(1-\alpha z)^2}=\sum_{n=1}^\infty n\alpha^{n-1} z^n$

with α a complex number of absolute value 1. If f is a schlicht function and |an| = n for some n ≥ 2, then f is a rotated Köbe function.

The condition of de Branges' theorem is not sufficient to show the function is schlicht, as the function

$f(z)=z+z^2 = (z+1/2)^2 - 1/4\;$

shows: it is holomorphic on the unit disc and satisfies |an|≤n for all n, but it is not injective since f(−1/2 + z) = f(−1/2 − z).

## History

Bieberbach (1916) proved |a2| ≤ 2, and stated the conjecture that |an| ≤ n. Then Charles Loewner (Löwner (1923)) proved |a3| ≤ 3, using the Löwner equation. His work was used by most later attempts, and is also applied in the theory of Schramm–Loewner evolution.

Littlewood (1925, theorem 20) proved that |an| ≤ en for all n, showing that the Bieberbach conjecture is true up to a factor of e = 2.718... Several authors later reduced the constant in the inequality below e.

If f(z) = z + ... is a schlicht function then φ(z) = f(z2)1/2 is an odd schlicht function. Paley and Littlewood (1932) showed that bk ≤ 14 for all k. They conjectured that 14 can be replaced by 1 as a natural generalization of the Bieberbach conjecture. The Littlewood–Paley conjecture easily implies the Bieberbach conjecture using the Cauchy inequality, but it was soon disproved by Fekete & Szegö (1933), who showed there is an odd schlicht function with b5 = 1/2 + exp(−2/3) = 1.013..., and that this is the maximum possible value of b5. (Milin later showed that 14 can be replaced by 1.14., and Hayman showed that the numbers bk have a limit less than 1 if φ is not a Koebe function, so Littewood and Paley's conjecture is true for all but a finite number of coefficients of any function.) A weaker form of Littlewood and Paley's conjecture was found by Robertson (1936).

The Robertson conjecture states that if

$\phi(z) = b_1z+b_3z^3+b_5z^5+\cdots$

is an odd schlicht function in the unit disk with b1=1 then for all positive integers n,

$\sum_{k=1}^n|b_{2k+1}|^2\le n.$

Robertson observed that his conjecture is still strong enough to imply the Bieberbach conjecture, and proved it for n = 3. This conjecture introduced the key idea of bounding various quadratic functions of the coefficients rather than the coefficients themselves, which is equivalent to bounding norms of elements in certain Hilbert spaces of schlicht functions.

There were several proofs of the Bieberbach conjecture for certain higher values of n, in particular Garabedian & Schiffer (1955) proved |a4| ≤ 4, Ozawa (1969) and Pederson (1968) proved |a6| ≤ 6, and Pederson & Schiffer (1972) proved |a5| ≤ 5.

Hayman (1955) proved that the limit of an/n exists, and has absolute value less than 1 unless f is a Koebe function. In particular this showed that for any f there can be at most a finite number of exceptions to the Bieberbach conjecture.

The Milin conjecture states that for each simple function on the unit disk, and for all positive integers n,

$\sum^n_{k=1} (n-k+1)(k|\gamma_k|^2-1/k)\le 0$

where the logarithmic coefficients γn of f are given by

$\log(f(z)/z)=2 \sum^\infty_{n=1}\gamma_nz^n.$

Milin (1977) showed using the Lebedev–Milin inequality that the Milin conjecture (later proved by de Branges) implies the Robertson conjecture and therefore the Bieberbach conjecture.

Finally De Branges (1985) proved |an| ≤ n for all n.

## De Branges's proof

The proof uses a type of Hilbert spaces of entire functions. The study of these spaces grew into a sub-field of complex analysis and the spaces come to be called de Branges spaces and the functions de Branges functions. De Branges proved the stronger Milin conjecture (Milin 1971) on logarithmic coefficients. This was already known to imply the Robertson conjecture (Robertson 1936) about odd univalent functions, which in turn was known to imply the Bieberbach conjecture about simple functions (Bieberbach 1916). His proof uses the Loewner equation, the Askey–Gasper inequality about Jacobi polynomials, and the Lebedev–Milin inequality on exponentiated power series.

De Branges reduced the conjecture to some inequalities for Jacobi polynomials, and verified the first few by hand. Walter Gautschi verified more of these inequalities by computer for de Branges (proving the Bieberbach conjecture for the first 30 or so coefficients) and then asked Richard Askey if he knew of any similar inequalities. Askey pointed out that Askey & Gasper (1976) had proved the necessary inequalities eight years before, which allowed de Branges to complete his proof. The first version was very long and had some minor mistakes which caused some skepticism about it, but these were corrected with the help of members of the Leningrad Department of Steklov Mathematical Institute when de Branges visited in 1984.

De Branges proved the following result, which for ν = 0 implies the Milin conjecture (and therefore the Bieberbach conjecture). Suppose that ν > −3/2 and σn are real numbers for positive integers n with limit 0 and such that

$\rho_n=\frac{\Gamma(2\nu+n+1)}{\Gamma(n+1)}(\sigma_n-\sigma_{n+1})$

is non-negative, non-increasing, and has limit 0. Then for all Riemann mapping functions F(z) = z + ... univalent in the unit disk with

$\frac{F(z)^\nu-z^\nu} {\nu}= \sum_{n=1}^{\infty} a_nz^{\nu+n}$

the maximinum value of

$\sum_{n=1}^\infty(\nu+n)\sigma_n|a_n|^2$

is achieved by the Koebe function z/(1 − z)2.

## References

Wikimedia Foundation. 2010.

### Look at other dictionaries:

• Louis de Branges de Bourcia — (born August 21, 1932 in Paris, France) is a French American mathematician. He is the Edward C. Elliott Distinguished Professor of Mathematics at Purdue University in West Lafayette, Indiana. He is best known for proving the long standing… …   Wikipedia

• Bieberbach conjecture — In complex analysis, the Bieberbach conjecture or de Branges s theorem, asked by harvs|txt|first=Ludwig |last=Bieberbach|authorlink=Ludwig Bieberbach|year=1916 and proved by harvs|txt|authorlink=Louis de Branges de Bourcia|first=Louis |last=de… …   Wikipedia

• Clausen's formula — In mathematics, Clausen s formula, found by Thomas Clausen (1828), expresses the square of a Gaussian hypergeometric series as a generalized hypergeometric series. It states In particular it gives conditions for a hypergeometric series to be …   Wikipedia

• Riemann hypothesis — The real part (red) and imaginary part (blue) of the Riemann zeta function along the critical line Re(s) = 1/2. The first non trivial zeros can be seen at Im(s) = ±14.135, ±21.022 and ±25.011 …   Wikipedia

• List of theorems — This is a list of theorems, by Wikipedia page. See also *list of fundamental theorems *list of lemmas *list of conjectures *list of inequalities *list of mathematical proofs *list of misnamed theorems *Existence theorem *Classification of finite… …   Wikipedia

• Timeline of mathematics — A timeline of pure and applied mathematics history. Contents 1 Before 1000 BC 2 1st millennium BC 3 1st millennium AD 4 1000–1500 …   Wikipedia

• Invariant subspace problem — In the field of mathematics known as functional analysis, one of the most prominent open problems is the invariant subspace problem, sometimes optimistically known as the invariant subspace conjecture. It is the question whether the following… …   Wikipedia

• List of mathematics articles (D) — NOTOC D D distribution D module D D Agostino s K squared test D Alembert Euler condition D Alembert operator D Alembert s formula D Alembert s paradox D Alembert s principle Dagger category Dagger compact category Dagger symmetric monoidal… …   Wikipedia

• List of conjectures — This is an incomplete list of mathematical conjectures. They are divided into four sections, according to their status in 2007. See also: * Erdős conjecture, which lists conjectures of Paul Erdős and his collaborators * Unsolved problems in… …   Wikipedia

• Timeline of calculus and mathematical analysis — A timeline of calculus and mathematical analysis 1000 to 1500 * 1020 Abul Wáfa Discussed the quadrature of the parabola and the volume of the paraboloid. * 1021 Ibn al Haytham completes his Book of Optics , which formulated and solved “Alhazen s… …   Wikipedia