Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passaudited 2026-10-02
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.

A compact free affine plane quotient comes from a rank-two lattice

Statement

Assume the Axiom of Choice. Let G be a group of biholomorphisms of the complex plane acting freely and properly discontinuously, and suppose the quotient C/G is compact. Then every nonidentity element of G is a translation z↦z+λ with λ≠0, the translation group G is a rank-two lattice Zv+Zw with v,w linearly independent over R, and C/G is a complex torus of genus one.

Facts & Assumptions

Given: The Axiom of Choice is assumed. A group G of biholomorphisms of C acts freely and properly discontinuously, and the quotient C/G, with its quotient topology, is compact. Write g⋅z for the action, q:C→C/G for the quotient map, and Λ:={λ∈C:(z↦z+λ)∈G}.

[F1]

The Axiom of Choice: every family of nonempty sets has a choice function (The Axiom of Choice).

[F2]

Every biholomorphic self-map of the complex plane is affine: f(z)=az+b with a,b∈C and a≠0 (Every biholomorphic self-map of the complex plane is affine).

[F3]

The action of G is free when no nonidentity element fixes a point, and properly discontinuous when for every compact subset K⊆C the set {g∈G:g⋅K∩K≠∅} is finite (Free and properly discontinuous group actions).

[F4]

A covering map p:E→B is a continuous surjection such that every point of B has an evenly covered neighbourhood U whose preimage is a disjoint union of open sheets each mapped homeomorphically onto U (Covering maps, evenly covered neighbourhoods, fibres, sheets, and trivial coverings).

[F5]

A deck transformation of a covering is an isomorphism over the base, and for a covering with connected total space two deck transformations agreeing at one point are equal (Deck transformations and the deck-transformation group of a covering, On a connected covering space, a deck transformation is determined by one point and the deck action is free).

[F6]

A space is compact when every open cover has a finite subcover; a compact subset carries the intrinsic compactness of its subspace topology (Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right). Ambient open covers of a compact subset have finite subcovers (A subspace is compact exactly when every family of open subsets of the ambient space covering it, indexed or not, has finitely many members covering it).

[F8]

For the quotient map q with the quotient topology on C/G, a subset V⊆C/G is open if and only if q−1(V) is open in C (The quotient topology of a surjection, quotient maps, saturated sets, and the quotient of a space by an equivalence relation with its canonical projection).

[F9]

For n≥1, c∈Rn and r>0 the Euclidean closed ball B‾2(c,r) is compact (For n≥1, every Euclidean closed ball and every Euclidean sphere of positive radius is compact).

[F10]

On a compact Riemann surface the genus is the number g with X≅#gT2 in the homeomorphism type supplied by the topological classification of compact surfaces; the definition assumes the Axiom of Choice (Genus and Euler characteristic of a compact Riemann surface).

Proof technique: direct.

Proof

1.1F2given

Every g∈G is a biholomorphism of C, so g(z)=az+b with a,b∈C, a≠0.

1.2F6F8givencontradiction

G is nontrivial: if G={e} then the quotient map q is a bijection, so [F8] makes q a homeomorphism and C/G≅C. The discs D(0,n) for n≥1 cover C, while any finitely many of them, D(0,n1),…,D(0,nk), are all contained in D(0,N) with N:=max⁡1≤i≤kni, a proper subset of C; so no finite subfamily covers C, and C is not compact. This contradicts the hypothesis that C/G is compact.

2.1F2F3step 1.1algebra

Suppose a≠1 for some g∈G of the form g(z)=az+b. Then z0:=b/(1−a) satisfies g(z0)=z0, so freeness forces g=e; but the identity map is z↦1⋅z+0, whose linear coefficient is a=1, a contradiction. Hence a=1 for every g∈G, that is, every element of G is a translation z↦z+λ, and the identity corresponds to λ=0 while every nonidentity element corresponds to a nonzero λ.

3.1step 1.2step 2.1algebra

Composition of translations adds vectors and inverses subtract them, so Λ={λ∈C:(z↦z+λ)∈G} is a subgroup of (C,+) containing 0, and G={tλ:λ∈Λ} where tλ(z)=z+λ; in particular g⋅z=z+λ for g=tλ. By step 1.2 this subgroup is nontrivial, so Λ≠{0}.

4.1F3F9step 3.1algebra

The closed unit disc K:=D(0,1)‾⊆C is compact. Proper discontinuity applied to K makes S:={g∈G:g⋅K∩K≠∅} finite. If λ∈Λ with ∣λ∣≤2, then z:=λ/2 has ∣z∣≤1 and ∣z−λ∣=∣−λ/2∣≤1, so z∈K and z−λ∈K, whence z=(z−λ)+λ∈(K+λ)∩K=tλ⋅K∩K≠∅ and tλ∈S. Therefore Λ∩D(0,2)‾ is contained in the set of translation vectors of the finite set S, so it is finite.

4.2F8step 3.1algebra

The quotient map q is open: for open V⊆C one has q−1(q(V))=⋃λ∈Λ(V+λ), a union of open sets, hence open in C, so q(V) is open in C/G by [F8].

5.1F3F6step 4.1algebra

The finite set Λ∩D(0,2)‾ is either {0} or contains an element of positive modulus; in the first case put ρ:=1, and in the second case put ρ:=min⁡{∣λ∣:λ∈Λ, 0<∣λ∣≤2}>0, a minimum of a finite nonempty set of positive real numbers. In both cases Λ∩D(0,ρ)={0}. Since Λ is an additive subgroup, every λ0∈Λ then satisfies Λ∩D(λ0,ρ)={λ0}: if λ∈Λ with ∣λ−λ0∣<ρ, then λ−λ0∈Λ∩D(0,ρ)={0}. Thus distinct elements of Λ have distance at least ρ, and Λ is discrete. Every compact subset of C is covered by finitely many discs of radius ρ/3, each meeting Λ in at most one point, so it meets Λ in a finite set. In particular, if Λ≠{0} and w∈Λ∖{0}, the set Λ∩D(0,∣w∣)‾ is finite and nonempty, and its element of least positive modulus is an element of Λ∖{0} of least modulus overall.

6.1step 5.1step 3.1choose

By step 5.1 and step 3.1 choose v∈Λ∖{0} of least modulus. Let L:=Rv, let P:C→L⊥ be the orthogonal projection onto the real line perpendicular to v, and let H:=P(Λ), a subgroup of (L⊥,+), which we identify with (R,+).

6.2step 5.1algebra

A discrete subgroup Γ of (R,+) is either {0} or of the form Zγ for some γ≠0: if Γ≠{0} and x1∈Γ∖{0}, then Γ∩[−∣x1∣,∣x1∣] is finite by discreteness, so there is γ∈Γ∖{0} of least modulus, and for arbitrary x∈Γ Euclidean division gives m∈Z with ∣x−mγ∣≤∣γ∣/2<∣γ∣; the element x−mγ∈Γ therefore vanishes and x=mγ.

6.3F4step 5.1step 4.2algebra

The quotient map q is a covering map. Let ε:=inf⁡{∣λ∣:λ∈Λ∖{0}}>0, where positivity holds by step 5.1. For z∈C put Dz:=D(z,ε/3) and Uz:=q(Dz). If w,w′∈Dz with q(w)=q(w′) then w−w′∈Λ and ∣w−w′∣<2ε/3<ε, so w=w′; thus q∣Dz is a bijection onto Uz, and it is a homeomorphism because for open A⊆Dz the set q(A) is open in C/G by step 4.2, hence open in Uz. Moreover q−1(Uz)=⋃λ∈ΛD(z+λ,ε/3): a point of D(z+λ,ε/3) has the form u+λ with u∈Dz and maps to q(u)∈Uz, and conversely q(w)∈Uz means w=u+λ with u∈Dz, λ∈Λ. These discs are pairwise disjoint, because D(z+λ,ε/3)∩D(z+λ′,ε/3)≠∅ with λ≠λ′ would give ∣λ−λ′∣<2ε/3<ε; and on the disc with index λ the map q equals q∣Dz∘t−λ, a homeomorphism onto Uz. Hence Uz is an evenly covered neighbourhood of q(z) and q is a covering map.

7.1step 6.1step 5.1choosecontradiction

The subgroup H is discrete. If it were not, then taking σ=∣v∣/2 there would be 0≠h∈H with ∣h∣<∣v∣/2; choose λ∈Λ with P(λ)=h and write λ=tv+h with t∈R, choose m∈Z with ∣t−m∣≤1/2, and set λ′:=λ−mv∈Λ. Then λ′=(t−m)v+h≠0 because h≠0, while ∣λ′∣2≤∣v∣2/4+∣h∣2<∣v∣2/2, so ∣λ′∣<∣v∣, contradicting the minimality of ∣v∣ among nonzero elements of Λ. Hence H∩D(0,∣v∣/2)={0}, and the finite-minimum argument of step 5.1 applied inside the line L⊥≅R shows that H is discrete.

7.2F8step 5.1step 6.3step 4.2given

The maps φz:=(q∣Dz)−1:Uz→Dz⊆C of step 6.3 are homeomorphisms onto open subsets of C, and the sets Uz cover C/G. If W:=Uz∩Uz′≠∅, then on each connected component C0 of φz(W) the difference u↦φz′(q(u))−u is a continuous map into the discrete group Λ, hence is constant. Thus each transition map is a translation on each component of its domain, so these charts define a compatible holomorphic atlas; in each chart the local expression of q is the identity. The quotient is second countable: since q is open by step 4.2, the images of a countable basis of C form a basis of C/G. Hausdorffness is established after the lattice structure is determined.

8.1F6F7F8step 7.1contradiction

H≠{0}: suppose H={0}, so that Λ⊆L. Choose a nonzero R-linear functional ℓ:C→R vanishing on L. Since ℓ(λ)=0 for every λ∈Λ, the formula ℓˉ([z]):=ℓ(z) defines a map ℓˉ:C/G→R; it is surjective because ℓ is a surjective linear map, and it is continuous: for every open interval (a,b)⊆R its preimage satisfies q−1(ℓˉ−1(a,b))=ℓ−1(a,b), which is open in C, so ℓˉ−1(a,b) is open in C/G by [F8]. Then R=ℓˉ(C/G) is a continuous image of the compact space C/G, hence compact. But the open cover {(−n,n):n≥1} of R has no finite subcover, since a finite subcover is contained in (−N,N) for the largest index N and omits N+1; this contradiction shows H≠{0}.

9.1step 7.1step 6.2step 8.1choosealgebra

Choose w∈Λ with P(w)=h, where h≠0 generates H=Zh as in step 6.2, and let m∈Z with P(λ)=mh for a given λ∈Λ. Then λ−mw∈Λ∩ker⁡P=Λ∩L, a discrete subgroup of the line L containing v; applying step 6.2 inside L≅R and using the minimality of ∣v∣ gives Λ∩L=Zv, so λ=mw+nv for some n∈Z. Hence Λ=Zv+Zw. Finally v and w are linearly independent over R: if tv+sw=0 with s≠0, then projecting onto L⊥ gives 0=P(tv+sw)=tP(v)+sP(w)=sP(w)=sh≠0, a contradiction; hence s=0, and then tv=0 with v≠0 gives t=0. So the only real relation is the trivial one.

10.1F5step 6.3step 9.1

The deck group of the covering q is exactly {tλ:λ∈Λ}. Each tλ with λ∈Λ satisfies q∘tλ=q, so it is a deck transformation. Conversely, if h is a deck transformation, then q(h(0))=q(0), so h(0)∈q−1(q(0))=Λ, and the translation th(0) is a deck transformation with th(0)(0)=h(0); the total space C is connected, so h=th(0) by [F5].

10.2F7step 5.1step 9.1step 4.2step 7.2given

Let T:R2→C be the R-linear isomorphism T(s,t):=sv+tw of step 9.1; it carries Z2 bijectively onto Λ, so the formula Tˉ([(s,t)]):=q(T(s,t)) is well defined, and it is a bijection Tˉ:R2/Z2→C/G because T and q are onto and T(x)−T(y)∈Λ forces x−y∈Z2; it is continuous because Tˉ composed with the quotient map is the continuous map q∘T. The set Λ is closed in C: if x were a limit of points of Λ outside Λ, two nearby points λ,λ′∈Λ would give 0<∣λ−λ′∣<ρ with the ρ of step 5.1, contradicting Λ∩D(0,ρ)={0}. Hence for distinct classes [z]≠[z′] the number δ:=dist⁡(z−z′,Λ) is positive, and the open sets q(D(z,δ/2)), q(D(z′,δ/2)) are disjoint: a common class would give u∈D(z,δ/2), u′∈D(z′,δ/2) with u−u′∈Λ, forcing dist⁡(z−z′,Λ)<δ. So C/G is Hausdorff. The quotient R2/Z2 is compact, being a continuous image of the compact square [0,1]2. A continuous bijection from a compact space onto a Hausdorff space is a homeomorphism, so Tˉ is a homeomorphism and C/G is compact and Hausdorff; together with step 7.2's second-countable topology and holomorphic atlas, this makes C/G a compact Riemann surface.

11.1F1F10step 2.1step 9.1step 10.1step 10.2∎

The standard torus S1×S1 is the connected sum of one copy of itself, hence is #1T2 in the notation of [F10], and step 10.2 identifies the compact Riemann surface C/G with it. By the definition of genus [F10] and the uniqueness of the homeomorphism type in the topological classification, the genus of C/G is 1. Steps 2.1, 9.1, 10.1 and 10.2 therefore exhibit C/G as the complex torus C/(Zv+Zw) whose deck group of translations is the rank-two lattice Λ=Zv+Zw≅G. The only use of the Axiom of Choice is through the genus definition [F10], which assumes it; every choice made in the argument itself was finite.

Depends on

Used by

Dependency tree · two levels

57 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