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 be any group and be representations with If is irreducible, then is irreducible and there is such that for every . If is reducible, it has the same trace character as its diagonal semisimplification , where is the character on a common invariant line. The two diagonal characters 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.
Statement references
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 .
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 characteristic polynomial splits, by its explicit quadratic formula and existence of complex square roots.
Proof
The actual rank-two matrix-algebra argument. Let be a unital subalgebra acting irreducibly. It contains a nonscalar element, since scalar matrices preserve every line. If some has distinct eigenvalues, conjugate to an eigenbasis. Its two rank-one spectral projections belong to , being degree-one polynomials in , so . Irreducibility forces an element with , since otherwise every element preserves the second coordinate line; it also forces with , since otherwise every element preserves the first coordinate line. Thus and put all four matrix units in . If no element initially has distinct eigenvalues, take a nonscalar and subtract its repeated eigenvalue. The resulting nonzero nilpotent is conjugate, after scaling one basis vector, to . Irreducibility again supplies with . Then has distinct eigenvalues and reduces to the previous case. Hence every such algebra is . In particular an irreducible group image spans the full matrix algebra by [F1].
Irreducibility is detected by the trace character. Choose four group elements whose images under an irreducible are a basis of ; such a finite basis can be extracted from its spanning image in step 1.1. The trace pairing is nondegenerate: pairing with reads the matrix entry. Therefore its Gram matrix is invertible. The equal character gives the identical Gram matrix for the four . 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.
Trace equality defines an algebra isomorphism. Both images now span . Define on finite linear combinations This is well defined. Indeed if the source combination is zero, its proposed image pairs to zero with every , since The second image spans 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 .
The algebra isomorphism is explicitly inner. Put . The nonzero proper idempotent has rank one, because and is also nonzero. Choose in its image and put . The identity implies and . Also and , so are independent. The matrix-unit identities now show . Hence, for the invertible matrix with these columns, for every . Multiplying by a scalar whose square is makes its determinant one without changing conjugation; a nonzero complex number has such a square root. Thus the asserted exists. These selections involve only finitely many nonempty sets.
The reducible character is its diagonal one. In a basis beginning with a common invariant-line vector, write The product law makes a multiplicative map to , and the trace of every group word is , exactly the trace of the diagonal representation. Conjugation by 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
- Cooper, Culler, Gillet, Long and Shalen, Plane Curves Associated to Character Varieties of 3-Manifolds (standard reference, not scraped)