Concept

Biholomorphism

In the mathematical theory of functions of one or more complex variables, and also in complex algebraic geometry, a biholomorphism or biholomorphic function is a bijective holomorphic function whose inverse is also holomorphic. Formally, a biholomorphic function is a function defined on an open subset U of the -dimensional complex space Cn with values in Cn which is holomorphic and one-to-one, such that its is an open set in Cn and the inverse is also holomorphic. More generally, U and V can be complex manifolds. As in the case of functions of a single complex variable, a sufficient condition for a holomorphic map to be biholomorphic onto its image is that the map is injective, in which case the inverse is also holomorphic (e.g., see Gunning 1990, Theorem I.11). If there exists a biholomorphism , we say that U and V are biholomorphically equivalent or that they are biholomorphic. If every simply connected open set other than the whole complex plane is biholomorphic to the unit disc (this is the Riemann mapping theorem). The situation is very different in higher dimensions. For example, open unit balls and open unit polydiscs are not biholomorphically equivalent for In fact, there does not exist even a proper holomorphic function from one to the other. In the case of maps f : U → C defined on an open subset U of the complex plane C, some authors (e.g., Freitag 2009, Definition IV.4.1) define a conformal map to be an injective map with nonzero derivative i.e., f’(z)≠ 0 for every z in U. According to this definition, a map f : U → C is conformal if and only if f: U → f(U) is biholomorphic. Notice that per definition of biholomorphisms, nothing is assumed about their derivatives, so, this equivalence contains the claim that a homeomorphism that is complex differentiable must actually have nonzero derivative everywhere. Other authors (e.g., Conway 1978) define a conformal map as one with nonzero derivative, but without requiring that the map be injective.

À 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.