Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedjudge pass (gpt-6.1-sol)
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 standard fundamental domain tessellates the upper half-plane

Example

The closed tiles γ⋅D‾, γ∈PSL2(Z), have union H, pairwise disjoint interiors, and any two distinct tiles have empty intersection or meet in a common edge, a half-edge or a vertex; the full edge identifications are τ∼τ+1 on the vertical sides and τ∼−1/τ on the circular arc. The tiling is PSL2(Z)-invariant and locally finite.

Facts & Assumptions

Given: D={τ∈H:∣ℜτ∣<1/2, ∣τ∣>1}, its closure D‾, and the action of G=PSL2(Z) (The modular group and its action on the upper half-plane).

[F1]

Every orbit meets D‾; no two distinct points of D are equivalent; two distinct points z,z′∈D‾ are equivalent if and only if z′=z±1 with ℜz=∓1/2, or z′=−1/z with ∣z∣=1; the points of D‾ with nontrivial stabiliser are only i,ω,ω+1 (The standard fundamental domain, boundary identifications and elliptic stabilisers, The orbit G⋅x and stabilizer Gx of a point in a group action).

[F2]

Each τ∈H has a neighbourhood meeting only the finitely many stabiliser translates of τ; equivalently the action is properly discontinuous and the quotient map is open (Local charts and the Riemann surface structure of a modular quotient).

Verification

1.1F1givenalgebra

Every point of H lies in some tile, because its orbit meets D‾ [F1]; thus ⋃γγD‾=H. If two tiles have a common interior point, then γz=γ′z′ with z,z′∈D, so z,z′ are equivalent points of D; by [F1] they are equal and γ−1γ′ stabilises z∈D, which by [F1] has trivial stabiliser, so γ=γ′. Hence distinct tiles have disjoint interiors.

1.2F1givenalgebra

T identifies the two vertical sides, and S identifies the two halves of the circular side, fixing i. To check incidence, translate one of two meeting tiles to D‾. At a boundary point other than i,ω,ω+1 the stabiliser is trivial; [F1] then forces the other tile to be TD‾, T−1D‾, or SD‾, according to the side containing that point. Direct substitution shows that these share respectively a full vertical side or the full circular side. Any other tile can meet D‾ only at the three exceptional points. Such an intersection has at most one point: each tile is an intersection of three half-planes bounded by vertical lines or circles orthogonal to the real axis, hence is convex along those real-orthogonal circular or vertical geodesics. Indeed, a real Möbius map sending a given geodesic to the imaginary axis carries each bounding half-plane to one whose intersection with that axis is an interval. Two distinct common points would therefore give a common segment, including a nonexceptional point, which is the already listed side case. Thus every nonempty intersection is a side or a vertex, as asserted.

2.1F1F2step 1.2givenalgebra∎

The tiles are invariant by construction. For local finiteness let K⊂H be compact and put a:=min⁡KIm⁡>0. If w=γz∈K with z∈D‾ and c≠0, then a≤Im⁡w≤1/(c2Im⁡z), so Im⁡z≤1/a. Therefore such a tile meets K through the compact set L:=D‾∩{Im⁡z≤1/a}; the compact-set finiteness proved in Local charts and the Riemann surface structure of a modular quotient, step 1.1, leaves only finitely many γ with γL∩K≠∅. For c=0 the maps are translations Tn, and the real-part bounds on K and ∣Re⁡z∣≤1/2 leave only finitely many n. Thus every compact K meets finitely many tiles; a compact disc neighbourhood at each point proves local finiteness.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

48 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