Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: 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 canonical reduced basis for a complex lattice

Example

Call a ratio τ reduced when

Im⁡τ>0,−12<Re⁡τ≤12,∣τ∣≥1,andRe⁡τ≥0 whenever ∣τ∣=1,

and let R be the set of reduced ratios. Every full complex lattice Λ admits an oriented basis (ω1,ω2) with τ=ω2/ω1∈R, this reduced ratio is uniquely determined by Λ, and the number of oriented bases of Λ realizing it is two in general, four when τ=i, and six when τ=eiπ/3=12+32i. The lattices Z+iZ and Z+Zeiπ/3 realize the exceptional ratios i and eiπ/3.

Facts & Assumptions

Given: A full complex lattice Λ=Zω1+Zω2 with ω1,ω2 real-linearly independent, and τ:=ω2/ω1.

[F1]

ω1,ω2 are real-linearly independent, the pair (ω1,ω2) is an oriented basis when Im⁡(ω2/ω1)>0, two oriented bases of one lattice differ by a matrix in SL2(Z), and all lattice-theoretic structure depends on the set Λ alone (Complex lattice and quotient torus).

[F2]

Every z∈C has unique real coordinates z=a+bi; Re⁡z=a, Im⁡z=b, z‾=a−bi and ∣z∣=a2+b2 (Real and imaginary parts, complex conjugation, and modulus).

[F3]

For all z,w∈C: zz‾=∣z∣2, ∣z∣≥0, ∣z∣=0 exactly when z=0, ∣zw∣=∣z∣ ∣w∣ and ∣z+w∣≤∣z∣+∣w∣; conjugation is an involutive real-field automorphism (Conjugation is an involutive real-field automorphism, zz‾=∣z∣2, and modulus is definite, multiplicative, and subadditive).

[F4]

For every real x there is exactly one integer m=⌊x⌋ with m≤x<m+1, hence an integer m with ∣x−m∣≤12, namely m=⌊x+12⌋ (Integer part: for every real x there is exactly one integer m with m≤x<m+1).

Verification

technique · direct
1.1F1algebra

Real-linear independence of ω1,ω2 gives τ∉R, so after exchanging the two vectors if necessary one has Im⁡τ>0 and (ω1,ω2) is an oriented basis of Λ; every oriented basis of Λ is (aω1+bω2,  cω1+dω2) with integers a,b,c,d satisfying ad−bc=1, and conversely every such tuple yields an oriented basis, the coefficients being unique because ω1,ω2 are real-linearly independent.

1.2F2F3algebra

Writing τ=x+iy with x,y∈R and y>0, the form q(a,b):=∣a+bτ∣2=a2+2abx+b2(x2+y2) equals (a+xb)2+y2b2 and also x2+y2 times a square plus y2a2/(x2+y2), so q(a,b)≥y2b2 and q(a,b)≥y2a2/(x2+y2); hence q(a,b)≥ε2max⁡(a2,b2) with ε2:=y2/max⁡(1,x2+y2)>0 for all real a,b.

1.3F2F3algebra

A matrix A∈SL2(Z) fixes τ0 exactly when bτ02+(a−d)τ0−c=0; if b=0 this equation and ad=1 give a=d=±1, c=0, so A=±I. If b≠0, the discriminant (a−d)2+4bc=(a+d)2−4 is negative, so the trace t=a+d lies in {−1,0,1}; writing τ0=u+iv with v>0, the fixed point equation reads b(u2−v2)+(a−d)u−c+(2bu+a−d)v i=0, so u=(d−a)/(2b) and v2=−((a−d)2+4bc)/(4b2)=(4−t2)/(4b2).

2.1F2F3step 1.1algebra

For the basis of step 1.1 the ratio is τA=(c+dτ)/(a+bτ) with A=(abcd)∈SL2(Z), and Im⁡τA=Im⁡τ/∣a+bτ∣2.

2.2step 1.3F2F3algebra

For trace t=0, d=−a, so step 1.3 gives u=−a/b and v2=1/b2. At a reduced fixed point, ∣u∣≤12 and ∣τ0∣≥1, whence 4a2≤b2≤a2+1. Thus 3a2≤1, forcing the integer a=0, then ∣b∣=1 and τ0=i. Now d=0 and −bc=1, giving precisely A=±(01−10)=∓S, where S=(0−110); both fix i directly.

2.3step 1.3F3algebra

For trace t=±1: replacing A by −A changes the sign of t and leaves the fixed points unchanged, so take t=1; then d=1−a and v2=3/(4b2), so with B=∣b∣≥1 and σ=b/B∈{−1,1} one has τ0=σ(1−2a)/(2B)+32Bi, and the constraints ∣Re⁡τ0∣≤12 and ∣τ0∣≥1 give ∣1−2a∣≤B and B2≤a2−a+1, hence 3a2−3a≤0 and a∈{0,1}. For a=0 the determinant condition gives c=−σ and τ0=σ/2+32i, which lies in R only for σ=1, giving τ0=eiπ/3 and A=(01−11); for a=1 it gives c=−σ, τ0=−σ/2+32i, which lies in R only for σ=−1, giving again τ0=eiπ/3 and A=(1−110). Together with their negatives and ±I these six matrices form the stabiliser of eiπ/3, and both displayed matrices are checked directly to fix eiπ/3.

3.1step 2.1step 1.2algebra

Only finitely many values Im⁡τA satisfy Im⁡τA≥12Im⁡τ: by steps 2.1 and 1.2 that condition implies ∣a+bτ∣2≤2, hence a2+b2≤4/ε2, which has only finitely many integer solutions (a,b). The value Im⁡τA=Im⁡τ/∣a+bτ∣2 depends only on (a,b); the determinant equation may have infinitely many solutions (c,d).

3.2step 2.1F2F3algebra

For uniqueness let τ,τ′∈R and suppose τ′=(c+dτ)/(a+bτ) with A=(abcd)∈SL2(Z); replacing A by A−1=(d−b−ca), which also lies in SL2(Z) and expresses τ through τ′ in the same form, we may assume Im⁡τ′≥Im⁡τ, and then step 2.1 gives ∣a+bτ∣≤1; moreover Im⁡τ≥3/2, because Im⁡2τ=∣τ∣2−Re⁡2τ≥1−14.

3.3step 1.1step 2.1algebra

Fix an oriented basis (ω1,ω2) of Λ with reduced ratio τ0∈R. By step 1.1 the oriented bases of Λ are exactly the (aω1+bω2,cω1+dω2) with A∈SL2(Z), and by step 2.1 such a basis again has ratio τ0 exactly when A lies in the stabiliser Stab⁡(τ0)={A∈SL2(Z):(c+dτ0)/(a+bτ0)=τ0}; the assignment A↦(aω1+bω2,cω1+dω2) is injective, so the oriented bases of Λ with reduced ratio τ0 are in bijection with Stab⁡(τ0).

4.1step 2.1step 3.1algebra

Some oriented basis of Λ has maximal imaginary part of its ratio: the set of values Im⁡τA over A∈SL2(Z) contains Im⁡τ (take A=I), so it meets [12Im⁡τ,∞), and by step 3.1 the values in that interval form a nonempty finite set; its maximum is attained at some matrix A0 and dominates every value, because a value outside the interval is <12Im⁡τ≤Im⁡τ.

4.2step 3.2algebra

If b=0, then ad=1 forces a=d=±1 and τ′=(c+aτ)/a=τ+c/a; both Re⁡τ and Re⁡τ′ lie in (−12,12], so c/a=0, hence τ′=τ.

4.3step 3.2algebra

If b≠0, then replacing A by −A leaves τ′ unchanged, so we may assume b≥1; by step 3.2, bIm⁡τ≤∣a+bτ∣≤1, so b≤1/Im⁡τ≤2/3<2 and therefore b=1.

5.1F4step 1.1step 4.1algebra

Let (ω1∗,ω2∗) realize the maximum of step 4.1, with ratio τ∗. Replacing ω2∗ by kω1∗+ω2∗ changes the ratio to τ∗+k without changing its imaginary part or orientation. Choose k=−⌊Re⁡τ∗+12⌋; if the resulting real part is −12, add one more copy of ω1∗. Thus we may suppose −12<Re⁡τ∗≤12, still with maximal imaginary part.

5.2step 4.2step 4.3F2F3algebra

With b=1 the bound ∣a+τ∣≤1 of step 3.2 reads a2+2aRe⁡τ+∣τ∣2≤1, hence a(a+2Re⁡τ)≤1−∣τ∣2≤0, and we distinguish three cases. If a≥1, then a+2Re⁡τ≤0 gives Re⁡τ≤−12, contradicting τ∈R. If a=0, then ∣τ∣=1; the determinant condition ad−bc=1 gives c=−1 and τ′=(c+dτ)/τ=d−τ‾, and τ′∈R forces d=0, τ=i or d=1, τ=eiπ/3, in both cases τ′=τ. If a≤−1, then a+2Re⁡τ≥0 gives Re⁡τ≥−a2≥12, so Re⁡τ=12; then a2+a+∣τ∣2≤1 and ∣τ∣≥1 give a∈{−1,0} and ∣τ∣=1, so a=−1, τ=eiπ/3, and with d=−c−1 one computes τ′=−c+e2πi/3∈R, which forces c=−1 and τ′=τ∈R. Hence τ′=τ in every case of b≠0.

6.1step 5.1F3algebra

If ∣τ∗∣<1, then (−ω2∗,ω1∗) is an oriented basis of Λ whose ratio −1/τ∗ has Im⁡(−1/τ∗)=Im⁡τ∗/∣τ∗∣2>Im⁡τ∗, contradicting maximality; hence ∣τ∗∣≥1.

7.1step 5.1step 6.1F3algebra

The ratio now has positive imaginary part, −12<Re⁡τ∗≤12 and ∣τ∗∣≥1. It is reduced unless ∣τ∗∣=1 and Re⁡τ∗<0. In that case the oriented basis (−ω2∗,ω1∗) has ratio −1/τ∗=−τ∗‾, with real part in (0,12), modulus 1 and the same positive imaginary part, hence lies in R.

8.1step 7.1step 4.2step 5.2

Steps 4.2 and 5.2 prove that two reduced ratios related by a basis change are equal; with step 7.1 this gives existence and uniqueness of the reduced ratio of Λ, and shows it is realized by at least one oriented basis.

9.1step 3.3step 2.2step 2.3algebra∎

By steps 1.3, 2.2 and 2.3 the stabiliser of τ0∈R is {±I,±S}, of order four, when τ0=i, the six-element set {±I,±(01−11),±(1−110)} when τ0=eiπ/3, and {±I}, of order two, for every other reduced τ0; by step 3.3 these are exactly the numbers of oriented bases of Λ with reduced ratio τ0. Finally Z+iZ has the reduced oriented basis (1,i) with ratio i, and Z+Zeiπ/3 has the reduced oriented basis (1,eiπ/3) with ratio eiπ/3, so the exceptional cases occur.

The reduction uses the basis changes τ↦τ+k and τ↦−1/τ. Positive definiteness of ∣a+bτ∣2 makes the relevant denominator pairs finite; step 5.2 handles the boundary of the modular fundamental domain.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

26 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