In complex analysis, de Branges's theorem, or the Bieberbach conjecture, is a theorem that gives a necessary condition on a holomorphic function in order for it to map the open unit disk of the complex plane injectively to the complex plane. It was posed by and finally proven by. The statement concerns the Taylor coefficients a_n of a univalent function, i.e. a one-to-one holomorphic function that maps the unit disk into the complex plane, normalized as is always possible so that a_0=0 and a_1=1. That is, we consider a function defined on the open unit disk which is holomorphic and injective (univalent) with Taylor series of the form Such functions are called schlicht. The theorem then states that The Koebe function (see below) is a function for which a_n=n for all n, and it is schlicht, so we cannot find a stricter limit on the absolute value of the nth coefficient.

Schlicht functions

The normalizations mean that This can always be obtained by an affine transformation: starting with an arbitrary injective holomorphic function g defined on the open unit disk and setting Such functions g are of interest because they appear in the Riemann mapping theorem. A schlicht function is defined as an analytic function f that is one-to-one and satisfies f(0)=0 and f'(0)=1. A family of schlicht functions are the rotated Koebe functions with \alpha a complex number of absolute value 1. If f is a schlicht function and |a_n|=n for some n\geq 2, then f is a rotated Koebe function. The condition of de Branges' theorem is not sufficient to show the function is schlicht, as the function shows: it is holomorphic on the unit disc and satisfies |a_n|\leq n for all n, but it is not injective since .

History

A survey of the history is given by Koepf (2007). proved |a_2|\leq 2, and stated the conjecture that |a_n|\leq n. and independently proved the conjecture for starlike functions. Then Charles Loewner proved |a_3|\leq 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. proved that for all n, showing that the Bieberbach conjecture is true up to a factor of Several authors later reduced the constant in the inequality below e. If is a schlicht function then is an odd schlicht function. showed that its Taylor coefficients satisfy b_k\leq 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, who showed there is an odd schlicht function with , and that this is the maximum possible value of b_5. Isaak Milin later showed that 14 can be replaced by 1.14, and Hayman showed that the numbers b_k have a limit less than 1 if f is not a Koebe function (for which the b_{2k+1} are all 1). So the limit is always less than or equal to 1, meaning that Littlewood and Paley's conjecture is true for all but a finite number of coefficients. A weaker form of Littlewood and Paley's conjecture was found by. The Robertson conjecture states that if is an odd schlicht function in the unit disk with b_1=1 then for all positive integers 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 proved |a_4|\leq 4, and proved |a_6|\leq 6, and proved |a_5|\leq 5. proved that the limit of a_n/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 schlicht function on the unit disk, and for all positive integers n, where the logarithmic coefficients \gamma_n of f are given by 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 proved |a_n|\leq n for all n.

De Branges's proof

The proof uses a type of Hilbert space of entire functions. The study of these spaces grew into a sub-field of complex analysis and the spaces have come to be called de Branges spaces. De Branges proved the stronger Milin conjecture on logarithmic coefficients. This was already known to imply the Robertson conjecture about odd univalent functions, which in turn was known to imply the Bieberbach conjecture about schlicht functions. 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 whether he knew of any similar inequalities. Askey pointed out that 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 seminar on Geometric Function Theory (Leningrad Department of Steklov Mathematical Institute) when de Branges visited in 1984. De Branges proved the following result, which for \nu=0 implies the Milin conjecture (and therefore the Bieberbach conjecture). Suppose that \nu > -3/2 and \sigma_n are real numbers for positive integers n with limit 0 and such that is non-negative, non-increasing, and has limit 0. Then for all Riemann mapping functions univalent in the unit disk with the maximum value of is achieved by the Koebe function z/(1-z)^2. A simplified version of the proof was published in 1985 by Carl FitzGerald and Christian Pommerenke, and an even shorter description by Jacob Korevaar.