Concept

Carathéodory's theorem (conformal mapping)

In mathematics, Carathéodory's theorem is a theorem in complex analysis, named after Constantin Carathéodory, which extends the Riemann mapping theorem. The theorem, first proved in 1913, states that any conformal mapping sending the unit disk to some region in the complex plane bounded by a Jordan curve extends continuously to a homeomorphism from the unit circle onto the Jordan curve. The result is one of Carathéodory's results on prime ends and the boundary behaviour of univalent holomorphic functions. The first proof of Carathéodory's theorem presented here is a summary of the short self-contained account in ; there are related proofs in and . Carathéodory's theorem. If f maps the open unit disk D conformally onto a bounded domain U in C, then f has a continuous one-to-one extension to the closed unit disk if and only if ∂U is a Jordan curve. Clearly if f admits an extension to a homeomorphism, then ∂U must be a Jordan curve. Conversely if ∂U is a Jordan curve, the first step is to prove f extends continuously to the closure of D. In fact this will hold if and only if f is uniformly continuous on D: for this is true if it has a continuous extension to the closure of D; and, if f is uniformly continuous, it is easy to check f has limits on the unit circle and the same inequalities for uniform continuity hold on the closure of D. Suppose that f is not uniformly continuous. In this case there must be an ε > 0 and a point ζ on the unit circle and sequences zn, wn tending to ζ with |f(zn) − f(wn)| ≥ 2ε. This is shown below to lead to a contradiction, so that f must be uniformly continuous and hence has a continuous extension to the closure of D. For 0 < r < 1, let γr be the curve given by the arc of the circle | z − ζ | = r lying within D. Then f ∘ γr is a Jordan curve. Its length can be estimated using the Cauchy–Schwarz inequality: Hence there is a "length-area estimate": The finiteness of the integral on the left hand side implies that there is a sequence rn decreasing to 0 with tending to 0.

À propos de ce résultat
Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.