Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-generatedverified 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.

A quadratic generic character model specializes on a dense principal open

Statement

Assume full AC. Let G be finitely presented, let its reduced complex SL2 representation variety have its trace-coordinate affine character quotient, and let X be a nonempty irreducible closed subset of that quotient containing an irreducible character. Write A=C[X] and K=Frac⁡(A). There is a field L/K of degree at most two and an absolutely irreducible representation σ:G→SL2(L) whose every word trace is the corresponding function on X.

More precisely, for some 0≠f∈A there is a subring B⊂L which is either Af or the free rank-two algebra Af[ξ]=Af[T]/(T2−aT+1), where a is one word trace and a2−4 is a unit. All generator matrices lie in SL2(B). Every χ∈DX(f) admits a homomorphism B→C extending evaluation at χ; every resulting representation has character χ and is irreducible. This is an actual family of representatives, not merely agreement of formal traces. One can enlarge f to make any specified finite list of nonzero elements of L and their inverses belong to B.

If [L:K]=2, its nonidentity automorphism τ acts on σ by simultaneous conjugation with an explicit matrix P∈GL2(L). Consequently any projective point obtained from σ by finite field operations that commute with field automorphisms and whose value is invariant under simultaneous GL2 conjugation is defined over K. This clause presumes that the construction is actually defined and invariant; it supplies no homological rank, tangent-space or essential-surface assertion.

Facts & Assumptions

Given: Full AC, the finite presentation, its trace quotient and X.

[F1]

The representation set is the reduced closed determinant/relator set for every finite presentation; its invariant algebra is generated by word traces. Finite trace coordinates give the actual quotient model. SL2 matrix invariants from epsilon contractions and traces Finite trace-coordinate model on the stated loci

[F2]

The affine quotient map is surjective. Affine algebraic sets have finitely many irreducible closed components under the stated AC/DC branch; full AC supplies DC by choosing a successor function and recursion. Finite generation of invariants and the affine categorical quotient A classical affine algebraic set has a unique finite irredundant decomposition AC implies DC implies countable choice

[F3]

An absolutely irreducible SL2 representation has the explicit quadratic trace-field normal form, with a semisimple word A0, a word B0 meeting both its eigenlines, and explicit quadratic conjugator. Equal irreducible complex word traces determine simultaneous conjugacy and preserve irreducibility. An absolutely irreducible SL2 representation has a quadratic trace-field model Equal irreducible SL2 trace characters determine conjugacy

Proof

1.1F1F2givenconstructalgebra

A dominant source and an actual generic representation. Let R be the representation set and π:R→R/ ⁣/SL2 its quotient. For this arbitrary finitely presented group, finite trace coordinates follow directly from [F1] and [F2]: express each of a finite list of invariant algebra generators as a polynomial in finitely many word traces and take the union of those finite word lists. They generate the same coordinate algebra and hence give its closed affine model. The closed set π−1(X) has finitely many irreducible components Zi by [F2]. The closures of their images cover X, because π is onto. A nonempty irreducible set cannot be the union of finitely many proper closed subsets: split the union into its first member and the rest and repeat the defining irreducibility condition. Hence one Z has dense image in X. Pullback injects A into C[Z], since a function vanishing on that dense image vanishes on X. Put F=Frac⁡C[Z], so K⊂F. The coordinate generator matrices over F satisfy determinant and relator identities by [F1]; thus they give an actual representation ρ:G→SL2(F), whose word traces are the corresponding elements of K. No section of the quotient has been asserted.

1.2F1F3step 1.1constructalgebra

A trace certificate for absolute irreducibility. Choose an irreducible complex character of X and a representative using [F2]. The construction in [F3] supplies two words a0,b0 whose matrices have a=tr⁡(a0) different from ±2 and whose normalized second matrix has both off-diagonal entries nonzero. Write b=tr⁡(b0), c=tr⁡(a0b0) and D=a2−4. In a basis diagonalizing the first word with eigenvalues ξ,ξ−1, the product of the off-diagonal entries of the second is q=abc−c2−b2−a2+4a2−4. Indeed its diagonal entries are (c−ξ−1b)/(ξ−ξ−1) and their complementary entry in trace b; their product minus one is the displayed expression by ξ+ξ−1=a. Thus D and the numerator of q are nonzero regular functions on X. They remain nonzero in F. Over any field extension diagonalizing the first word, the nonzero product q makes both off-diagonal entries of the second word nonzero. A common invariant line would have to be one of the two eigenspaces of the first, neither preserved by the second. This proves absolute irreducibility of the actual generic ρ, and also gives the same certificate at every complex character where these two regular functions do not vanish.

2.1F3step 1.1step 1.2constructalgebra

Recover the model over at most a quadratic extension of K. Adjoin one root ξ of T2−aT+1 to F and put L=K(ξ)⊂F(ξ). Apply the explicit normalization and recovery equations of [F3] to ρ and these two words. Their coefficients are word traces in K, so they give generator matrices in SL2(L). These are the actual conjugated matrices over F(ξ), since the four trace equations for each generator have nonzero determinant q(ξ−1−ξ). Their determinant, relator and word-trace identities therefore hold in L, which injects into F(ξ). Denote this representation by σ. Absolute irreducibility follows from the same two-word certificate. If L≠K, the explicit matrix P=(01q0) conjugates every σ(g) to τσ(g): the recovery equations and the proof of [F3] apply unchanged with the larger coefficient field K. No assertion that K equals its prime-field trace subfield is needed.

3.1F1step 1.2step 2.1constructalgebra

Spread the actual matrices and specialize every point of an open set. If L=K, express the finitely many generator entries and the required nonzero elements and their inverses as fractions in A and invert the product of their nonzero denominators. Also invert D and the numerator of q. This gives B=Af. If [L:K]=2, each entry has a unique form u+vξ with u,v∈K. Clearing their finitely many coefficient denominators gives B=Af[ξ]⊂L. The monic equation reduces every polynomial to degree at most one, and independence of 1,ξ over K proves that this ring is exactly the displayed free rank-two quotient. For any additional nonzero z∈L, first clear its coefficient denominators. Its norm zτ(z)∈K∗ is nonzero; after clearing and inverting its numerator, z−1=τ(z)/(zτ(z)) belongs to B. Thus any finite further localization of B can be achieved by enlarging f in A. All matrix identities remain identities in B because it is a subring of L. At a point χ∈DX(f), in the quadratic case choose either complex root of T2−a(χ)T+1; evaluation gives a homomorphism B→C. In the degree-one case evaluate directly. The specialized determinant and relator identities give an actual representation. Its finite trace-coordinate list equals χ, since those identities already hold in B; [F1] then gives equality of every word trace. The nonzero D,q certificate proves irreducibility. The same argument works for every root and every point in this principal open, rather than merely for a constructible dense set.

4.1F3step 2.1step 3.1givenalgebra∎

Projective descent with no quotient shortcut. In the quadratic case the assumed compatibility and step 2.1 give τz=z for the constructed projective point. Normalize one nonzero homogeneous coordinate to one. Each other coordinate is fixed by τ; writing it as u+vξ, with u,v∈K, gives v(ξ−ξ−1)=0, and hence v=0. The normalized coordinates lie in K. In the degree-one case this is automatic. They define a rational map on X by clearing their finitely many denominators; one normalized coordinate is one, so they have no simultaneous zero there. Step 3.1 permits simultaneous clearing of any prescribed additional matrix or kernel-chart denominators, so later actual specializations may be checked on one smaller dense principal open. This proves all family and descent assertions, with no claim that a merely pointwise invariant assignment was rational before a construction was given.

Depends on

Used by

Dependency tree · two levels

38 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