Bloch's theorem (complex variables)
In complex analysis, a branch of mathematics, Bloch's theorem describes the behaviour of holomorphic functions defined on the unit disk. It gives a lower bound on the size of a disk in which an inverse to a holomorphic function exists. It is named after André Bloch. Statement. Let "f" be a holomorphic function in the unit disk |"z"| ≤ 1 for which Define "B" as the radius of the largest disk over which "f" is biholomorphic. That is, there exists an analytic function φ in the disk such that "f"(φ("z")) = "z" for all  z in this disk. Bloch's theorem states that there is a constant "B" defined as the infimum of "B" over all such functions "f", and this constant has a lower bound "B" > 1/72. Landau's theorem. If "f" is a holomorphic function in the unit disk with the property |"f′"(0)| = 1, then let "L" be the radius of the largest disk contained in the image of "f". Landau's theorem states that there is a constant "L" defined as the infimum of "L" over all such functions "f", and that "L" ≥ "B". This theorem is named  after Edmund Landau. Valiron's theorem. Bloch's theorem was inspired by the following theorem of Georges Valiron: Theorem. If "f" is a non-constant entire function then there exist disks "D" of arbitrarily large radius and analytic functions φ in "D" such that "f"(φ("z")) = "z" for "z" in "D". Bloch's theorem corresponds to Valiron's theorem via the so-called Bloch's Principle. Proof. Landau's theorem. We first prove the case when "f"(0) = 0, "f′"(0) = 1, and |"f′"("z")| ≤ 2 in the unit disk. By Cauchy's integral formula, we have a bound By  Rouché's theorem, the range of "f" contains the disk of radius 1/6 around 0. Let "D"("z", "r") denote the open disk of radius "r" around "z". For an analytic function "g" : "D"("z", "r") → C such that "g"("z") ≠ 0, the case above applied to ("g"("z" + "rz") − "g"("z")) / ("rg′"(0)) implies that the range of "g" contains "D"("g"("z"), |"g′"(0)|"r" / 6). For the general case, let "f" be an analytic function in the unit disk such that |"f′"(0)| = 1, and "z" = 0. Repeating this argument, we either find a disk of radius at least 1/24 in the  range of "f", proving the theorem, or find an infinite sequence ("z") such that |"z" − "z"| < 1/2 and |"f′"("z")| > 2|"f′"("z")|. In the latter case the sequence is in "D"(0, 1/2), so "f′" is unbounded in "D"(0, 1/2), a contradiction. Bloch's Theorem. In the proof of Landau's Theorem above, Rouché's theorem implies that not only can we find a disk "D" of radius at least 1/24 in the range of "f", but there is also a small disk "D" inside the unit disk such that for every "w" ∈ "D" there is a unique "z  ∈ D" with "f"("z") = "w". Thus, "f" is a bijective analytic function from "D" ∩ "f"("D") to "D", so its inverse φ is also analytic by the inverse function theorem. Bloch's and Landau's constants. The number "B" is called the Bloch's constant. The lower bound 1/72 in Bloch's theorem is not the best possible. Bloch's theorem tells us "B" ≥ 1/72, but the exact value of "B" is still unknown. The best known bounds for "B" at present are where Γ is the Gamma function. The lower bound was proved by Chen and Gauthier , and the upper bound dates back to Ahlfors and Grunsky. The similarly defined optimal constant "L" in Landau's theorem is called the Landau's constant. Its exact value is also unknown, but it is known that In their paper, Ahlfors and Grunsky conjectured that their upper bounds are actually the true values of "B" and "L". For injective holomorphic functions on the unit disk, a constant "A" can similarly be defined. It is known that