Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-generatedjudge pass (gpt-6-luna)verified 2026-10-22 (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.

Irreducible peripheral eigenvalue curves of a torus presentation

Statement

Let a>b≥2 be coprime integers, choose integers α,β with aα+bβ=1, and put G=⟨x,y∣xa=yb⟩, h=xa=yb, μ=yαxβ and λ=hμ−ab. Consider all irreducible representations ρ:G→SL2(C), where irreducible means having no common invariant complex line. The common peripheral eigenvalue pairs (M,L)∈(C∗)2 have reduced Zariski closure with vanishing ideal (1+M2aL)if b=2,(M2abL2−1)if b>2. More precisely, ρ(h)=ϵI with ϵ=−1 when b=2 and ϵ∈{1,−1} when b>2; each permitted sign occurs in a family realizing every point of the graph L=ϵM−ab except possibly finitely many meridian values. The displayed ideal is the ideal of the entire irreducible eigenvalue locus, not just of the exhibited families. No choice axiom is assumed.

Facts & Assumptions

Given: The finite presentation and words in the Statement, with ordinary complex matrix algebra. Every nonconstant one-variable complex polynomial has a complex root; this is the fixed algebraic closure of C, not a simultaneous selection of roots.

[F1]

A two-by-two matrix satisfies A2−tr⁡(A)A+det⁡(A)I=0, as entrywise multiplication verifies. A determinant-one matrix with two distinct eigenvalues is diagonalizable by its two eigenvectors.

Proof

1.1F1givenalgebra

Only the specified scalar signs can occur. The element h commutes with x and y, since it is a power of each. A nonscalar two-by-two complex matrix either has two distinct eigenvalues or has a repeated eigenvalue and a unique one-dimensional eigenspace. In the first case every commuting matrix preserves each eigenspace; in the second it preserves the kernel of the nonzero nilpotent part, which is that unique line. Thus a nonscalar ρ(h) would provide a line invariant under both generator matrices, contradicting irreducibility. Consequently ρ(h)=ϵI, and determinant one forces ϵ=±1. If b=2 and ϵ=1, the equation Y2=I for Y=ρ(y) makes Y diagonalizable because (z−1)(z+1) has distinct roots. Its determinant one forces its two eigenvalues to be equal, so Y=I or −I. An eigenline of ρ(x) would then be invariant under both generators. Hence only ϵ=−1 is possible for b=2. In every case ρ(λ)=ϵρ(μ)−ab, so every common peripheral eigenvalue pair satisfies L=ϵM−ab, including nonsemisimple meridian matrices.

1.2givenconstructalgebra

Choose noncentral roots with noncentral meridian powers. Fix a permitted sign. For a positive integer n≥2 choose ζn=exp⁡(2πi/n) when ϵ=1 and ζn=exp⁡(πi/n) when ϵ=−1. The first case is used only for n≥3, since ϵ=1 is permitted only when a,b>2. Set ξ=ζa and η=ζb. They satisfy ξa=ηb=ϵ and neither is ±1. Also ξβ≠ξ−β and ηα≠η−α. Indeed the Bezout identity gives gcd⁡(β,a)=gcd⁡(α,b)=1. In the positive-sign case equality of the two powers would imply a∣2β or b∣2α, impossible for the relevant integer greater than two. In the negative-sign case the roots have orders 2a,2b; equality would imply a∣β or b∣α, also impossible. These explicit roots require no choice family.

2.1F1step 1.2constructalgebra

An actual irreducible matrix family. Put s=η+η−1 and, for v∈C, define X=(ξ00ξ−1),Yv=(v1v(s−v)−1s−v). The second matrix has determinant one and trace s, hence distinct eigenvalues η,η−1. Therefore Xa=Yvb=ϵI, and these are actual representations of the displayed presentation for every v. Since X has distinct eigenvalues, a common invariant line must be one of its coordinate lines. The upper-right entry of Yv is 1, so the second coordinate line is never invariant. The first is invariant exactly when v(s−v)−1=0, whose two roots are η,η−1. Thus the representation is irreducible for every v other than these two values.

3.1F1step 1.2step 2.1constructalgebra

The meridian trace varies with a nonzero linear coefficient. Polynomial division modulo (z−η)(z−η−1) gives Yvα=cYv+dI for constants c,d independent of v, including negative α because both eigenvalues are nonzero. Explicitly c=(ηα−η−α)/(η−η−1)≠0 and d=ηα−cη. With r=ξβ, one obtains tr⁡(YvαXβ)=c(r−r−1)v+cr−1s+d(r+r−1). The coefficient is nonzero by step 1.2. For each M≠0 there is consequently exactly one v giving meridian trace M+M−1. The two forbidden v values of step 2.1 exclude at most four meridian values, since each equation M+M−1=q is a quadratic after multiplication by M. Discard also M=±1. For every remaining M the meridian has distinct eigenvalues M,M−1, so an eigenline with eigenvalue M exists and the longitude, being ϵμ−ab, acts there by L=ϵM−ab. This gives the claimed cofinite graph family for each permitted sign.

4.1step 1.1step 3.1constructalgebra∎

Exact ideals, including all exceptional representations. Evaluation L↦ϵM−ab defines a surjection C[M±1,L±1]→C[M±1]. Its kernel is (LMab−ϵ): multiplying by a monomial reduces any expression to a polynomial in L, and division by the monic L−ϵM−ab over C[M±1] leaves exactly its evaluated constant remainder. A Laurent polynomial vanishing on the cofinite graph family of step 3.1 therefore has zero evaluated remainder, since a nonzero one-variable Laurent polynomial has only finitely many nonzero roots. Its ideal is precisely this graph ideal. Step 1.1 puts every irreducible eigenvalue pair, including all exceptional meridian values, in the permitted graphs, and step 3.1 supplies a dense family in each. The ideal of the entire locus and of its closure is consequently the intersection of these graph ideals. For b=2 the single sign gives (LM2a+1). For b>2 put q=LMab; the two ideals (q−1) and (q+1) are comaximal since their difference is 2, an invertible scalar. Their intersection equals their product: writing 1=A+B with A in one and B in the other expresses an element of the intersection as a sum of two product elements. Thus their intersection is (q2−1)=(M2abL2−1). Each graph ideal is prime because its quotient is the Laurent domain just displayed; their intersection is radical. This proves the exact reduced closure assertions by finite algebra with no assumption about completeness of an unspecified image.

Used by

Dependency tree · 0 levels

Nothing. This result depends on no other item in the library.

Sources