Branching theorem

Branching theorem

In mathematics, the branching theorem is a theorem about Riemann surfaces. Intuitively, it states that every non-constant holomorphic function is locally a polynomial.

tatement of the theorem

Let X and Y be Riemann surfaces, and let f : X o Y be a non-constant holomorphic map. Fix a point a in X and set b := f(a) in Y. Then there exist k in N and charts psi_{1} : U_{1} o V_{1} on X and psi_{2} : U_{2} o V_{2} on Y such that
* psi_{1} (a) = psi_{2} (b) = 0; and
* psi_{2} circ f circ psi_{1}^{-1} : V_{1} o V_{2} is z mapsto z^{k}.

This theorem gives rise to several definitions:
* We call k the "multiplicity" of f at a. Some authors denote this u (f, a).
* If k > 1, the point a is called a "branch point" of f.
* If f has no branch points, it is called "unbranched". See also unramified morphism.

References

*citation|first=Lars|last=Ahlfors|authorlink=Lars Ahlfors|title=Complex analysis|publisher=McGraw Hill|year=1953|publication-date=1979|edition=3rd|isbn=0-07-000657-1.


Wikimedia Foundation. 2010.

Игры ⚽ Нужен реферат?

Look at other dictionaries:

  • Monodromy theorem — Illustration of analytic continuation along a curve (only a finite number of the disks Ut are shown) …   Wikipedia

  • Milliken's tree theorem — In mathematics, Milliken s tree theorem in combinatorics is a partition theorem generalizing Ramsey s theorem to infinite trees, objects with more structure than sets. Let T be a finitely splitting rooted tree of height ω, n a positive integer,… …   Wikipedia

  • List of mathematics articles (B) — NOTOC B B spline B* algebra B* search algorithm B,C,K,W system BA model Ba space Babuška Lax Milgram theorem Baby Monster group Baby step giant step Babylonian mathematics Babylonian numerals Bach tensor Bach s algorithm Bachmann–Howard ordinal… …   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

  • Riemann surface — For the Riemann surface of a subring of a field, see Zariski–Riemann space. Riemann surface for the function ƒ(z) = √z. The two horizontal axes represent the real and imaginary parts of z, while the vertical axis represents the real… …   Wikipedia

  • NC (complexity) — Unsolved problems in computer science Is NC = P ? In complexity theory, the class NC (for Nick s Class ) is the set of decision problems decidable in polylogarithmic time on a parallel computer with a polynomial number of processors. In… …   Wikipedia

  • Restricted representation — In mathematics, restriction is a fundamental construction in representation theory of groups. Restriction forms a representation of a subgroup from a representation of the whole group. Often the restricted representation is simpler to understand …   Wikipedia

  • Dependence logic — is a logical formalism, created by Jouko Väänänen[1], which adds dependence atoms to the language of first order logic. A dependence atom is an expression of the form , where are terms, and corresponds to the statement that the value of is… …   Wikipedia

  • König's lemma — or König s infinity lemma is a theorem in graph theory due to Dénes Kőnig (1936). It gives a sufficient condition for an infinite graph to have an infinitely long path. The computability aspects of this theorem have been thoroughly investigated… …   Wikipedia

  • Many-worlds interpretation — The quantum mechanical Schrödinger s cat paradox according to the many worlds interpretation. In this interpretation every event is a branch point; the cat is both alive and dead, even before the box is opened, but the alive and dead cats are in… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”