Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 2026-09-30
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Ramification index, ramification order and branch value

Definition

Let f:X→Y be a nonconstant holomorphic map between Riemann surfaces and let x∈X (Holomorphic maps and meromorphic functions on Riemann surfaces). By Local power-map normal form on Riemann surfaces there are holomorphic coordinate charts φ centred at x and ψ centred at f(x) such that the chart expression is the power map ψ∘f∘φ−1(z)=zefor z near 0, with a unique positive integer e. Define:

  1. the ramification index of f at x to be this exponent, ex(f):=e≥1;
  2. the ramification order of f at x to be ex(f)−1≥0;
  3. x to be a critical point (or ramification point) of f when ex(f)>1, and f to be unramified at x when ex(f)=1;
  4. a branch value of f to be a point y∈Y for which there is a critical point x∈X with f(x)=y; the set of branch values is the branch locus of f, and the set of critical points is the critical locus.

Conventions. The index is well defined because the exponent of the normal form is unique; the proof below records this together with the equivalent descriptions ex(f)=deg⁡x(ψ∘f∘φ−1)=ord⁡x(f−f(x)) in any centred charts (Local degree of a nonconstant holomorphic map), and ex(f)=1 exactly when f is a local biholomorphism at x (Biholomorphic maps between complex domains). In particular a critical point is a point where f is not locally injective, and the set of critical points is discrete in X. A meromorphic function on X is a holomorphic map to the Riemann sphere (Holomorphic maps and meromorphic functions on Riemann surfaces), so the same index, order and branch language applies to it; a pole of a meromorphic function is a point where its value is the point at infinity, and says nothing by itself about ramification. No choice principle is used anywhere in this definition: an index is a single positive integer determined by local data.

Facts & Assumptions

Given: A nonconstant holomorphic map f:X→Y between Riemann surfaces and a point x∈X.

[F1]

There are charts φ at x, ψ at f(x) with φ(x)=0=ψ(f(x)) and ψ∘f∘φ−1(z)=ze near 0 for a unique positive integer e; with these coordinates e is the local degree deg⁡x of the chart expression, f is a local biholomorphism at x exactly when e=1, and for every other pair of centred charts the exponent equals the same e (Local power-map normal form on Riemann surfaces, Biholomorphic maps between complex domains).

[F2]

For a nonconstant holomorphic function F on a complex domain and a in the domain, deg⁡aF=ord⁡a(F−F(a))≥1 is the order of vanishing of F−F(a) at a, and deg⁡aF=1 exactly when F′(a)≠0 (Local degree of a nonconstant holomorphic map, The order of a zero is the exponent in its local holomorphic factorization).

[F3]

A map between Riemann surfaces is a local biholomorphism at x exactly when some, equivalently every, chart expression of it at x has nonzero derivative there (Holomorphic maps and meromorphic functions on Riemann surfaces, Biholomorphic maps between complex domains).

Proof technique: direct.

Proof

technique · direct
1.1F1given

(The index exists and is unique.) By [F1] centred charts exhibiting the normal form exist, with a unique positive exponent e; since the exponent of any such pair of charts equals e, the number ex(f):=e is independent of the charts, and it is the local degree of the chart expression by [F1].

2.1F2F3step 1.1

(Equivalent descriptions of the index.) Let F=ψ∘f∘φ−1 be a chart expression with φ(x)=0; by [F2], deg⁡0F=ord⁡0(F−F(0)), so ex(f)=deg⁡0F=ord⁡0(F−F(0)), and ex(f)=1 exactly when F′(0)≠0, which by [F3] is exactly the condition that f be a local biholomorphism at x.

3.1F1F2step 2.1

(Critical points are isolated, and the critical locus is discrete.) Fix x∈X and take the power-form charts of [F1] on a sufficiently small disc about 0, so the local expression is F(z)=ze with e≥1. Its derivative is F′(z)=eze−1. If e=1 this is nowhere zero on the disc; if e>1 it vanishes there only at z=0. By [F2] and step 2.1, the points with vanishing derivative are exactly the critical points in this chart neighbourhood. Thus every x has a neighbourhood containing no critical point other than possibly x itself, so the critical locus is discrete. By [F1], a critical point is exactly a point at which f is not a local biholomorphism.

4.1step 1.1step 2.1step 3.1∎

(Conclusion.) Steps 1.1–3.1 show that ex(f), the ramification order ex(f)−1, the critical points, and the branch values are well defined, that ex(f)≥1 with equality exactly at local biholomorphisms, and that the critical locus is discrete; a branch value is by definition the image of a critical point.

Remarks

The index ex(f) is the multiplicity used in Degree of a proper holomorphic map of Riemann surfaces, where a weighted fibre count ∑x∈f−1(y)ex(f) is shown to be independent of y, and in Riemann–Hurwitz formula for compact Riemann surfaces, where the numbers ex(f)−1 are summed over the critical locus. Both uses require the finiteness of the critical locus on a compact surface and not merely its discreteness; that finiteness is a consequence of compactness and is stated and used where it is needed. The local normal form theorem is the only place where the exponent is manufactured, and it is applied to a nonconstant map throughout; a constant map has no honest local power form and is excluded by hypothesis.

Depends on

Used by

Dependency tree · two levels

20 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources