Alphabeta Math
TheoremStatement: 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.

Riemann–Hurwitz formula for compact Riemann surfaces

Statement

Assume the Axiom of Choice. Let f:X→Y be a nonconstant holomorphic map between compact connected Riemann surfaces (Holomorphic maps and meromorphic functions on Riemann surfaces), let d=deg⁡f be its degree and ex=ex(f) the ramification index at x∈X (Degree of a proper holomorphic map of Riemann surfaces, Ramification index, ramification order and branch value). Then the ramification sum is finite and 2g(X)−2=d(2g(Y)−2)+∑x∈X(ex−1), with genus and Euler characteristic as in Genus and Euler characteristic of a compact Riemann surface.

The proof is a finite cell count: a chartwise topological triangulation of Y, subdivided so that every branch value is a vertex and no triangle has two branch-value vertices, is lifted through the covering f:X→Y off the vertices, and the vertex deficit ∑(ex−1) appears there. The local analytic interface Pullback order formula for a branched holomorphic map records the same deficit as the order formula for pulled-back differentials; no global canonical differential and no Stokes or de Rham input is assumed. The Axiom of Choice enters only through the genus-classification interface of Genus and Euler characteristic of a compact Riemann surface.

Facts & Assumptions

Given: A nonconstant holomorphic map f:X→Y of compact connected Riemann surfaces.

[F1]

Since X is compact and Y is Hausdorff, and holomorphic maps are continuous, f is proper: for compact K⊆Y the preimage f−1(K) is closed in the compact space X, hence compact (A closed subspace of a compact space is compact, and a finite union of compact subspaces is compact, Holomorphic maps and meromorphic functions on Riemann surfaces).

[F2]

Degree theory of proper maps: f is onto with finite fibres, has a degree d with d=∑x∈f−1(y)ex(f) for every y∈Y, its branch values are locally finite and finite because Y is compact, and off the branch locus f is a finite-sheeted covering of degree d; moreover at every x there are centred charts in which f is z↦zex (Degree of a proper holomorphic map of Riemann surfaces, Ramification index, ramification order and branch value).

[F3]

Chartwise triangulation: for every finite F⊆Y there are finitely many chart-contained closed topological triangles, each supplied with a homeomorphism from the standard closed triangle; they cover Y, meet face to face in full edges or vertices, and avoid F on their edges (Finite chartwise triangulation of a compact Riemann surface). This is the topological refinement supplied by the chart lemma; its new edges carry no asserted analytic regularity.

[F4]

The homeomorphism from a standard closed triangle in [F3] transports the elementary face and edge subdivisions of that triangle to topological subdivisions of its image. A face insertion changes (V,E,F) by (1,3,2); an edge insertion in the boundaryless surface changes it by (1,3,2). Thus each operation preserves V−E+F. Choose the new arcs to avoid the finitely many other prescribed points and use the same split on both sides of a shared edge. These are finite topological cell operations; no smooth-edge subdivision claim is needed.

[F5]

Simply connected bases: every nonempty convex subset of Rn is simply connected (Every nonempty convex subset of Rn is simply connected), and every connected covering of a locally path-connected simply connected space is one-sheeted and isomorphic to the identity covering (A connected covering of a locally path-connected simply connected space is one-sheeted and trivial).

[F6]

Euler characteristic and genus: a finite face-to-face topological triangulation gives a finite CW structure by taking its vertices, open edges and open faces as cells. Hence for a compact Riemann surface Z, χ(Z)=V−E+F=2−2g(Z) (Genus and Euler characteristic of a compact Riemann surface, Euler characteristic of a finite CW complex).

[F7]

The Axiom of Choice (The Axiom of Choice).

Proof

technique · direct
1.1F2

(Properness and finiteness of the ramification.) By [F1], f is proper, so [F2] applies. The branch values of f form a finite set B⊆Y because Y is compact [F2]. The set f−1(B) is a finite union of finite fibres, hence finite. Every ramification point lies in f−1(B), although a fibre over a branch value can also contain unramified points. Thus ∑x∈X(ex−1) has only finitely many nonzero terms.

2.1F3F4F6step 1.1

(A topological triangulation with isolated branch vertices.) Apply [F3] with F=B to obtain a finite face-to-face topological triangulation T whose edges avoid B. Insert each b∈B into the open face containing it by joining it to that face's three vertices, choosing the arcs to avoid the other finitely many points of B [F4]. Call the resulting triangulation T0; every branch value is now a vertex. Next choose one interior point on every edge of T0 and perform the edge subdivision of [F4], including the matching splits in its two incident faces. Call the final triangulation T′ and its counts V′,E′,F′. Every old edge has been split, while an edge newly drawn during subdivision has its split point as an endpoint. Thus no edge of T′ joins two vertices of T0, although a new edge may join two split points. In particular no edge, and hence no triangular face, has two branch-value vertices. Every subdivision preserves the topological cell count, so V′−E′+F′=χ(Y) by [F4] and [F6].

3.1F2step 2.1

(f is a degree-d covering off the vertex set.) Let V′ be the vertex set of T′ and put Y∗:=Y∖V′. By step 2.1 the branch locus is contained in V′, so no point of Y∗ is a branch value; by [F2] the restriction f∗:f−1(Y∗)→Y∗ is then a covering map of degree d: every point of Y∗ has an evenly covered neighbourhood on which f is a d-sheeted covering.

3.2F2step 2.1

(Vertices above the vertices.) For each v∈V′ the degree formula of [F2] gives ∑x∈f−1(v)ex=d, and every x there satisfies ex≥1; hence ∣f−1(v)∣=d−∑x∈f−1(v)(ex−1). Summing over the finitely many vertices v∈V′ gives VX=∣f−1(V′)∣=dV′−∑x∈X(ex−1), because a point with ex>1 is a ramification point and its image in B is a vertex of T′ by step 2.1, while a point with ex=1 contributes nothing.

4.1F5step 3.1

(Each open cell has exactly d lifts.) Let C⊆Y∗ be the relative interior of an edge or an open face of T′. An open edge is homeomorphic to the convex open interval, hence simply connected, and an open face is homeomorphic to an open triangle, which is convex, hence simply connected [F5]; a homeomorphism transports null-homotopies of loops, so both are simply connected in the sense of [F5]. Each connected component of (f∗)−1(C) is a connected covering of C, hence is one-sheeted over C by [F5]; since every fibre of f∗ over C has exactly d points, (f∗)−1(C) has exactly d components, each mapped homeomorphically onto C by f.

5.1F2F3F5step 2.1step 4.1

(The lifted cells form a finite topological triangulation of X.) Fix a closed target triangle T of T′. By step 2.1, T contains at most one branch value v, and if present it is a vertex. Put T†=T∖{v} in that case and T†=T otherwise. The homeomorphism from a Euclidean closed triangle in [F3] transports its straight-line contraction away from one vertex, so T† is connected and simply connected. The covering of Y∖B supplied by [F2], restricted to T†, therefore has d components, each mapped homeomorphically to T† by [F5]. At an unramified vertex the local inverse of f extends the sheet uniquely. At a branch vertex v, choose a small coordinate disk D about v such that f−1(D) is the disjoint union of coordinate disks about the finitely many points of f−1(v), with f on each given by z↦zex; compactness of X excludes further preimage components after shrinking D. The closed-triangle homeomorphism gives a neighbourhood basis of v inside T whose punctured members are connected. Take one such punctured corner neighbourhood contained in D. Its image under any one sheet inverse T†→X is connected and therefore lies in one of those disjoint source disks, centred at some x∈f−1(v). As points of that corner approach v, the local equation zex=w forces their inverse images to approach x. Thus this sheet inverse extends continuously to v by assigning it x. The extended map from compact T to Hausdorff X is injective, since it was injective on T† and x lies over the omitted target point, and is therefore a homeomorphism onto a closed topological triangle. The same corner argument closes each lifted open edge to an interval, including at a ramified endpoint.

6.1F2F3F6step 2.1step 4.1step 5.1

These closed lifted triangles meet face to face. Two different lifts of one target triangle have disjoint interiors and open edge lifts; by the local inverse at every unramified point they can meet only over its possible single branch vertex, hence in at most one vertex. For different target triangles, their images meet in at most one full target edge or one target vertex by [F3]. Over the interior of a common edge, the covering has exactly one lifted face on each local side of each lifted edge. An edge has at most one branch-value endpoint by step 2.1. If two closed lifted faces over adjacent target faces meet above both endpoints of that edge, they meet above an unramified endpoint; its unique local inverse makes their lifted edge germs coincide, and uniqueness of lifting along the connected open edge makes the whole lifted edge coincide. Thus they cannot meet in two vertices without sharing the full edge. Since each closed lifted triangle maps homeomorphically to its target triangle, two lifted triangles either share that one full lifted edge, share one vertex above a target vertex, or are disjoint. The local sectors of z↦zex occur cyclically around a ramified source vertex, and ordinary local inverses give the usual circle links elsewhere. The lifted data therefore give a finite topological triangulation and hence a finite CW structure on X by [F6]. There are VX:=∣f−1(V′)∣ vertices, EX=dE′ open edges and FX=dF′ open faces by step 4.1, so χ(X)=VX−EX+FX.

7.1step 2.1step 6.1step 3.2

(The cell count.) Combining steps 6.1 and 3.2, χ(X)=VX−EX+FX=dV′−∑x∈X(ex−1)−dE′+dF′=d(V′−E′+F′)−∑x∈X(ex−1)=d χ(Y)−∑x∈X(ex−1), using χ(Y)=V′−E′+F′ from step 2.1.

8.1F6step 7.1

(Substituting χ=2−2g.) By [F6], χ(X)=2−2g(X) and χ(Y)=2−2g(Y); substituting into step 7.1 gives 2−2g(X)=d(2−2g(Y))−∑x∈X(ex−1), and rearranging yields 2g(X)−2=d(2g(Y)−2)+∑x∈X(ex−1).

9.1F7step 1.1step 8.1∎

(Conclusion.) The formula holds, and the ramification sum is finite by step 1.1. The Axiom of Choice is used exactly through the genus interface [F6] of [F7], that is, through the topological classification theorem on which it rests; the triangulation, its subdivision, the covering triviality over the simply connected cells and the local model are choice-free, every selection being made from finitely many explicit cells and fibres.

Remarks

The two interfaces of the statement are deliberately separated. The covering side is Degree of a proper holomorphic map of Riemann surfaces, which supplies the degree and the local model z↦ze; the genus side is Genus and Euler characteristic of a compact Riemann surface. The local analytic bridge to the divisor language is Pullback order formula for a branched holomorphic map, whose formula ord⁡x(f∗η)=exord⁡f(x)(η)+ex−1 produces the same deficit ex−1 as the cell count above, without requiring a global nonzero differential on Y. For the sphere case g(Y)=0 the formula reads 2g(X)−2=−2d+∑(ex−1), which is the count 2−2g=d⋅2−∑(ex−1) of the sources. The hypothesis that X is compact is essential here only through properness and finite ramification; the proper degree theorem already supplies the latter, so no separate finiteness argument for critical points is needed beyond step 1.1.

Depends on

Used by

Dependency tree · two levels

53 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