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

Reduction of orbits to the standard domain

Statement

Let Γ′=⟨S,T⟩≤PSL2(Z) and D‾={τ∈H:∣ℜτ∣≤1/2, ∣τ∣≥1}. (a) Every τ∈H is Γ′-equivalent to a point of D‾: among the points of the orbit Γ′⋅τ some point τ0 has maximal imaginary part; after applying a power of T one has ∣ℜτ0∣≤1/2, and then necessarily ∣τ0∣≥1. (b) For fixed τ∈H and N>0 there are only finitely many pairs (c,d)∈Z2 with ∣cτ+d∣≤N.

Facts & Assumptions

Given: τ=x+iy∈H, so y>0, and the action of Γ′ with ℑ(γ⋅τ)=ℑτ/∣cτ+d∣2 for the bottom row (c,d) of γ; T⋅τ=τ+1, S⋅τ=−1/τ (The modular group and its action on the upper half-plane).

[F1]

For z∈C, ∣Re⁡z∣≤∣z∣, ∣Im⁡z∣≤∣z∣, and ∣z∣2=zzˉ (Conjugation is an involutive real-field automorphism, zz‾=∣z∣2, and modulus is definite, multiplicative, and subadditive, Real and imaginary parts, complex conjugation, and modulus).

[F2]

A nonempty subset of Z that is bounded above has a greatest element and one that is bounded below has a least element; in particular the integers in a bounded interval form a finite set (A nonempty set of integers bounded above has a greatest element, and a nonempty set of integers bounded below has a least element). Every real has an integer part ⌊u⌋ with ⌊u⌋≤u<⌊u⌋+1 (Integer part: for every real x there is exactly one integer m with m≤x<m+1).

[F3]

If 0<r<1 then 1/r2>1 (Basic properties of the absolute value).

Proof

1.1F1F2givenalgebra

Fix N>0 and suppose ∣cτ+d∣≤N. Since Im⁡(cτ+d)=cy and Re⁡(cτ+d)=cx+d, [F1] gives ∣c∣y≤N, that is ∣c∣≤N/y; by [F2] only finitely many integers c satisfy this. For each such c, [F1] gives ∣cx+d∣≤N, so −N−cx≤d≤N−cx, and [F2] leaves only finitely many integers d. Hence only finitely many pairs (c,d) satisfy ∣cτ+d∣≤N.

2.1F1F2F3step 1.1givenalgebra∎

The set V:={∣cτ+d∣:γ∈Γ′ with bottom row (c,d)} is nonempty (the identity has value ∣0⋅τ+1∣=1) and every element is positive. Applying 1.1 with N=1 shows that the elements of V are among the finitely many numbers ∣cτ+d∣ attached to pairs with ∣cτ+d∣≤1, together with values >1; hence V has a least element m>0, realized by some γ0∈Γ′. Since ℑ(γ⋅τ)=y/∣cτ+d∣2, the point τ0:=γ0⋅τ of the orbit has maximal imaginary part y/m2: for every γ∈Γ′ with bottom row (c,d) one has ∣cτ+d∣≥m, so ℑ(γ⋅τ)=y/∣cτ+d∣2≤y/m2=ℑτ0. Choose n∈Z with ∣ℜτ0−n∣≤1/2, possible by taking n=⌊ℜτ0+1/2⌋ [F2]; then τ1:=T−n⋅τ0 satisfies ℑτ1=ℑτ0 (translation does not change the imaginary part) and ∣ℜτ1∣=∣ℜτ0−n∣≤1/2. If ∣τ1∣<1, then Sτ1∈Γ′⋅τ and ℑ(Sτ1)=ℑτ1/∣τ1∣2>ℑτ1 by [F1] and [F3], contradicting the maximality of ℑτ0=ℑτ1. Hence ∣τ1∣≥1, and τ1∈D‾ is the required Γ′-equivalent point.

Depends on

Used by

Dependency tree · two levels

64 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