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.

Equal irreducible SL2 trace characters determine conjugacy

Statement

Let G be any group and ρ,ρ′:G→SL2(C) be representations with tr⁡ρ(g)=tr⁡ρ′(g)(g∈G). If ρ is irreducible, then ρ′ is irreducible and there is P∈SL2(C) such that ρ′(g)=Pρ(g)P−1 for every g. If ρ is reducible, it has the same trace character as its diagonal semisimplification g↦diag⁡(χ(g),χ(g)−1), where χ:G→C∗ is the character on a common invariant line. The two diagonal characters χ,χ−1 determine the same semisimple conjugacy class. This is a pointwise statement; it does not assert that an irreducible character component admits a tautological representation over its function field or prove rational quotient descent.

Facts & Assumptions

Given: The group and two representations with the stated equal traces. A representation is irreducible if it has no common invariant complex line in C2.

[F1]

The complex span of the matrices in a group representation is a unital matrix algebra, since products of image matrices are image matrices. Every complex 2×2 characteristic polynomial splits, by its explicit quadratic formula and existence of complex square roots.

Proof

1.1F1givencasesconstructalgebra

The actual rank-two matrix-algebra argument. Let A⊆M2(C) be a unital subalgebra acting irreducibly. It contains a nonscalar element, since scalar matrices preserve every line. If some T∈A has distinct eigenvalues, conjugate to an eigenbasis. Its two rank-one spectral projections belong to A, being degree-one polynomials in T, so E11,E22∈A. Irreducibility forces an element B∈A with b12≠0, since otherwise every element preserves the second coordinate line; it also forces C∈A with c21≠0, since otherwise every element preserves the first coordinate line. Thus E11BE22=b12E12 and E22CE11=c21E21 put all four matrix units in A. If no element initially has distinct eigenvalues, take a nonscalar T and subtract its repeated eigenvalue. The resulting nonzero nilpotent is conjugate, after scaling one basis vector, to N=E12. Irreducibility again supplies B with b21≠0. Then NB=(b21b2200) has distinct eigenvalues b21,0 and reduces to the previous case. Hence every such algebra is M2(C). In particular an irreducible group image spans the full matrix algebra by [F1].

2.1givenstep 1.1constructalgebra

Irreducibility is detected by the trace character. Choose four group elements gi whose images under an irreducible ρ are a basis of M2; such a finite basis can be extracted from its spanning image in step 1.1. The trace pairing ⟨A,B⟩=tr⁡(AB) is nondegenerate: pairing with Eij reads the (j,i) matrix entry. Therefore its Gram matrix (tr⁡ρ(gigj))i,j=14 is invertible. The equal character gives the identical Gram matrix for the four ρ′(gi). Those four matrices are independent, because a dependence would give a kernel vector of that Gram matrix. A reducible representation is triangular in an invariant-line basis and its image spans at most the three-dimensional upper-triangular algebra. Thus ρ′ cannot be reducible.

3.1givenstep 1.1step 2.1constructalgebra

Trace equality defines an algebra isomorphism. Both images now span M2. Define on finite linear combinations Φ(∑iciρ(gi))=∑iciρ′(gi). This is well defined. Indeed if the source combination is zero, its proposed image pairs to zero with every ρ′(h), since ∑icitr⁡ρ′(gih)=∑icitr⁡ρ(gih)=0. The second image spans M2 and its trace pairing is nondegenerate, so that proposed image is zero. The inverse construction with the representations exchanged proves bijectivity. Multiplication on the group image, then bilinearity, proves that Φ is a unital algebra isomorphism and Φ(ρ(g))=ρ′(g).

4.1F1step 3.1constructalgebra

The algebra isomorphism is explicitly inner. Put Qij=Φ(Eij). The nonzero proper idempotent Q11 has rank one, because Q112=Q11 and Q22=I−Q11 is also nonzero. Choose v1≠0 in its image and put v2=Q21v1. The identity Q12Q21=Q11 implies v2≠0 and Q12v2=v1. Also Q11v1=v1 and Q11v2=0, so v1,v2 are independent. The matrix-unit identities now show Qijvk=δjkvi. Hence, for the invertible matrix P0 with these columns, Φ(A)=P0AP0−1 for every A. Multiplying P0 by a scalar whose square is (det⁡P0)−1 makes its determinant one without changing conjugation; a nonzero complex number has such a square root. Thus the asserted P∈SL2(C) exists. These selections involve only finitely many nonempty sets.

5.1givenstep 1.1step 2.1step 3.1step 4.1constructalgebra∎

The reducible character is its diagonal one. In a basis beginning with a common invariant-line vector, write ρ(g)=(χ(g)c(g)0χ(g)−1). The product law makes χ a multiplicative map to C∗, and the trace of every group word is χ(g)+χ(g)−1, exactly the trace of the diagonal representation. Conjugation by (01−10)∈SL2 exchanges its two diagonal characters. This proves the semisimplification assertions, not conjugacy of every triangular representative to its diagonal part. Steps 1.1–4.1 prove the irreducible conclusion. All spans, bases, roots and matrix operations used are finite, so no choice axiom is introduced.

Used by

Dependency tree · 0 levels

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

Sources