Alphabeta Math
TheoremStatement: Literature-sourcedProof: 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, boundary identifications and elliptic stabilisers

Statement

Let D={τ∈H:∣ℜτ∣<1/2, ∣τ∣>1} and let D‾ be its closure in H. (a) D is a fundamental domain for PSL2(Z): every orbit meets D‾, no two points of D are equivalent, and two distinct points z,z′∈D‾ are equivalent if and only if either z′=z±1 with ℜz=∓1/2, or z′=−1/z with ∣z∣=1. (b) The only points of D‾ with nontrivial stabiliser are i, ω:=e2πi/3 and ω+1=eiπ/3: Stab⁡(i)=⟨S⟩ has order 2, Stab⁡(ω)=⟨ST⟩ has order 3, and Stab⁡(ω+1)=⟨TS⟩ has order 3 in PSL2(Z). (c) PSL2(Z)=⟨S,T⟩.

Facts & Assumptions

[F1]

Every Γ′-orbit meets D‾ (Reduction of orbits to the standard domain), and for γ=(abcd)∈SL2(Z) one has ℑ(γ⋅z)=ℑz/∣cz+d∣2, so ℑ(γ⋅z)≥ℑz is equivalent to ∣cz+d∣≤1 (The modular group and its action on the upper half-plane).

[F2]

Every z∈D‾ satisfies ∣ℜz∣≤1/2 and ∣z∣≥1, hence Im⁡z≥3/2 (The modular group and its action on the upper half-plane, Reduction of orbits to the standard domain).

Proof

1.1F1F2givenalgebra

Every Γ-orbit meets D‾, because Γ′≤Γ and every Γ′-orbit does [F1]. Suppose z,z′∈D‾ satisfy z′=γ⋅z with γ=(abcd)∈SL2(Z) and Im⁡z′≥Im⁡z; replacing γ by −γ, which gives the same element of Γ, we may assume c≥0. Then ∣cz+d∣≤1 by [F1], while Im⁡z≥3/2 by [F2]; hence ∣c∣ 32≤∣c∣Im⁡z=∣Im⁡(cz+d)∣≤∣cz+d∣≤1, so ∣c∣≤2/3<2 and therefore c∈{0,1}.

2.1F1F2step 1.1givencasesalgebra

Case c=0. Then d=±1 and γ=±(1m01), so z′=z+m with m∈Z. Since both points lie in D‾, ∣m∣=∣ℜz′−ℜz∣≤1. If m=0 then z′=z. If m=1 then ℜz′=ℜz+1≤1/2 and ℜz≥−1/2 force ℜz=−1/2; conversely for z∈D‾ with ℜz=−1/2 the point z′=z+1 lies in D‾, since 1/2≥ℜz′ and ∣z′∣=∣z−(−1)∣=∣ ∣z∣ ∣=∣z∣ holds because ∣z′∣2=∣z∣2+2Re⁡z+1=∣z∣2. The case m=−1 is the mirror image with ℜz=1/2.

2.2F1F2step 1.1givencasesalgebra

Case c=1. First suppose d=0. Then b=ad−1=−1 and ∣z∣=∣cz+d∣≤1≤∣z∣ shows ∣z∣=1; the map is z′=a−1/z=a−zˉ with a∈Z, and ∣ℜz′∣≤1/2, ∣ℜz∣≤1/2 give ∣a∣≤1. For a=0 this is z′=−1/z with ∣z∣=1; for a=−1 the condition ℜz′=−1−ℜz≥−1/2 forces ℜz=−1/2, so z=ω and z′=−1−zˉ=z; for a=1 we get ℜz′=1−ℜz≥1/2, forcing ℜz′=1/2 and ℜz=1/2, after which ∣z′∣2=1−2ℜz+∣z∣2=∣z∣2=1 and z′=1−zˉ=1−(12−iy)=12+iy=z. So for d=0 the only new identification is z′=−1/z when ∣z∣=1. Now suppose d≥1. Since ∣cz+d∣2−∣z∣2=2dRe⁡z+d2≤1−1=0, we get ℜz≤−d/2≤−1/2, so d=1 and ℜz=−1/2; then ∣z+1∣2=∣z∣2 and 1≤∣z∣, ∣z+1∣≤1 force ∣z+1∣=1=∣z∣, whence z=ω. Here b=a−1 and z′=a+ω (because 1/(1+ω)=−ω), so ℜz′=a−1/2∈[−1/2,1/2] gives a∈{0,1}: for a=0 one has z′=z, and for a=1 one has z′=ω+1=z+1. If d≤−1, write d=−k, k≥1; then ∣cz+d∣2−∣z∣2=−2kℜz+k2≤0 gives ℜz≥k/2≥1/2, so k=1, d=−1, ℜz=1/2, and ∣z−1∣=∣z∣=1 forces z=ω+1; with b=−a−1 and ω=ω+1−1 one computes z′=a+1+ω, so ℜz′=a+1/2∈[−1/2,1/2] gives a∈{−1,0}: for a=0 one has z′=z, and for a=−1 one has z′=ω=z−1.

3.1F1F3step 2.1step 2.2givenalgebra

Combining 1.1, 2.1 and 2.2: for any two Γ-equivalent points z,z′∈D‾ one of them, say the one with larger imaginary part, is of the listed shape; the case analysis gives either z′=z, or z′=z±1 with ℜz=∓1/2, or z′=−1/z with ∣z∣=1. Since the two identifications force ∣z∣=1 or ∣ℜz∣=1/2, neither can occur for two distinct points of D, whose points have ∣ℜz∣<1/2 and ∣z∣>1; this proves (a). For (b), a stabiliser element is a case with z′=z in the same analysis: besides the identity, this happens exactly for z=i with γ=±S, for z=ω with γ representing ST or (ST)2, and for z=ω+1 with γ representing TS or (TS)2. Since S2=(ST)3=(TS)3=1 in Γ and S≠1, ST≠1, these give Stab⁡(i)=⟨S⟩ of order 2 and Stab⁡(ω)=⟨ST⟩, Stab⁡(ω+1)=⟨TS⟩ of order 3, by [F3]; all other points of D‾ have trivial stabiliser.

4.1F3step 3.1givenalgebra∎

For (c) let γ∈Γ and fix z0:=2i∈D. By 1.1 there is γ1∈Γ′ with γ1⋅(γ⋅z0)∈D‾; set δ:=γ1γ∈Γ. Then z0∈D⊆D‾ and δ⋅z0∈D‾ are equivalent, so by (a) either δ⋅z0=z0 or one of the two boundary identifications holds; the latter are impossible because ∣z0∣=2>1 and ∣ℜz0∣=0<1/2. Hence δ stabilises z0, and by (b) the only points of D‾ with nontrivial stabiliser are i,ω,ω+1, none of which equals z0; so δ=1 and γ=γ1−1∈Γ′. Therefore Γ=Γ′=⟨S,T⟩.

Depends on

Used by

Dependency tree · two levels

41 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