Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: 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.

The complex torus as a Riemann surface

Example

Let ω1,ω2∈C be R-linearly independent, so that Im⁡(ω2/ω1)≠0, and let Λ=Zω1+Zω2. Then C/Λ, the quotient of C by the translation action of Λ, is a compact Riemann surface: the quotient map is open, the small discs on which it is injective provide the charts, and all transition functions of those charts have the form z↦z+λ with λ∈Λ.

Facts & Assumptions

Given: R-linearly independent ω1,ω2∈C and the lattice Λ=Zω1+Zω2⊆C; the quotient map q:C→C/Λ with the quotient topology.

[F1]

A Riemann surface is a nonempty connected Hausdorff second-countable space with a holomorphic atlas: charts are homeomorphisms onto open subsets of C and compatible charts have holomorphic transitions in both directions (Riemann surfaces and holomorphic atlases).

[F2]

For a surjection q the quotient topology is {V:q−1(V) open}, so q is continuous; hence q−1(q(W))=⋃λ∈Λ(W+λ) is open for every open W, and therefore q(W) is open (The quotient topology of a surjection, quotient maps, saturated sets, and the quotient of a space by an equivalence relation with its canonical projection, The initial topology of a family of maps into spaces and the final topology of a family of maps out of spaces, and the subspace topology as the model initial topology).

[F3]

The bijection Φ(a+bi)=(a,b) identifies C with R2, so C is read as R2; every linear map Rm→Rn is bounded: there is K≥0 with ∥Lh∥≤K∥h∥ for all h (C is the real coordinate plane, with coordinate arithmetic, Every Euclidean linear map has a unique matrix and satisfies ∥Lh∥2≤K∥h∥2 for some K≥0).

Verification

technique · direct
1.1F3given

(A gap constant exists.) The map T(s,t)=sω1+tω2 is an R-linear isomorphism R2→C, because ω1,ω2 are R-linearly independent, and Λ=T(Z2); applying [F3] to the inverse of T gives c>0 with ∣T(s,t)∣≥cmax⁡(∣s∣,∣t∣), hence ∣λ∣≥c for every nonzero λ∈Λ.

1.2F2

(q is continuous and open.) The quotient topology makes q continuous, and for open W⊆C the preimage q−1(q(W))=⋃λ∈Λ(W+λ) is open as a union of translates of an open set, so q(W) is open by the definition of the quotient topology.

2.1F5F6step 1.1

(Lattice points in a disc are finite.) If λ≠λ′ are in Λ then ∣λ−λ′∣≥c>0 by step 1.1, so Λ is discrete: each {λ} is open in Λ; for every R>0 the set Λ∩D(0,R)‾ is closed and bounded in C=R2, hence compact by [F5] and discrete as a subspace, hence finite by [F6].

2.2F4step 1.2

(Connectedness.) The space C is convex, hence connected, and q is continuous and surjective, so C/Λ=q(C) is connected by [F4].

2.3F4F5step 1.1step 1.2

(Compactness.) The map F(s,t)=q(T(s,t)) is continuous on the compact square [0,1]2, so its image is compact by [F4] and [F5]; every z∈C equals T(s,t) for some (s,t)∈R2, and subtracting the integer parts of s and t exhibits z as an element of T([0,1]2)+Λ, so F([0,1]2)=C/Λ; hence C/Λ is compact.

2.4step 1.1step 1.2

(Small discs give charts.) Fix any z∈C and put W=D(z,c/4); if q(w)=q(w′) for w,w′∈W then w−w′∈Λ and ∣w−w′∣<c/2<c, so w=w′ by step 1.1; thus q restricted to W is an injective continuous open map onto the open set q(W) of C/Λ, and its inverse φ=q∣W−1 is a homeomorphism q(W)→W⊆C, that is, a chart; the sets q(D(z,c/4)) over z∈C cover C/Λ.

2.5F7step 1.2

(Second countability.) Let B be a countable base of C; the family {q(B):B∈B} is countable and consists of open sets by step 1.2, and it is a base of C/Λ: given [z]∈V with V open, the set q−1(V) is an open neighbourhood of z, so some B∈B satisfies z∈B⊆q−1(V), whence [z]∈q(B)⊆V.

3.1step 1.2step 2.1given

(Hausdorffness.) Let [z]≠[z′], so z−z′∉Λ; the distance d=inf⁡{∣z−z′−λ∣:λ∈Λ} is positive, because otherwise points of Λ would accumulate at z−z′ inside some disc D(0,R)‾ containing z−z′ and infinitely many distinct lattice points, contradicting the finiteness in step 2.1; with r=d/3, the open sets q(D(z,r)) and q(D(z′,r)) of step 1.2 are disjoint, since u−v∈Λ for u∈D(z,r), v∈D(z′,r) would give ∣z−z′−(u−v)∣<2d/3<d.

3.2step 1.1step 2.4

(Transition functions are translations.) Let φ=q∣W−1 and φ′=q∣W′−1 be two charts as in step 2.4; on the overlap of their images, φ′(φ−1(w))=w+λ(w) with λ(w)=φ′(q(w))−w∈Λ, and w↦λ(w) is continuous because both φ−1 and q are; since distinct lattice points are at distance at least c by step 1.1, λ is locally constant, so near each point the transition is w↦w+λ for a fixed λ∈Λ, which is holomorphic.

4.1F1step 2.2step 2.3step 2.4step 2.5step 3.1step 3.2∎

(Conclusion.) The quotient C/Λ is nonempty, connected by step 2.2, compact by step 2.3, Hausdorff by step 3.1 and second countable by step 2.5, and the charts of step 2.4 have the holomorphic transition functions w↦w+λ of step 3.2, so they form a holomorphic atlas; by [F1], C/Λ is a compact Riemann surface.

Remarks

For the lattices Λ used here no nonconstant holomorphic function on C descends to C/Λ; meromorphic functions are supplied later by the Weierstrass ℘ function on a different page. The proof above is choice free: the only selections are single points and single basic open sets in proofs of inclusions, and no countable family of choices is made. The examples C, the unit disc and the annulus of Atlases on the sphere, plane, disc and annulus are noncompact, while the torus is compact, and the sphere is both compact and simply connected.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

76 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