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 be coprime integers, choose integers with , and put , , and . Consider all irreducible representations , where irreducible means having no common invariant complex line. The common peripheral eigenvalue pairs have reduced Zariski closure with vanishing ideal More precisely, with when and when ; each permitted sign occurs in a family realizing every point of the graph 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 , not a simultaneous selection of roots.
A two-by-two matrix satisfies , as entrywise multiplication verifies. A determinant-one matrix with two distinct eigenvalues is diagonalizable by its two eigenvectors.
Proof
Only the specified scalar signs can occur. The element commutes with and , 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 would provide a line invariant under both generator matrices, contradicting irreducibility. Consequently , and determinant one forces . If and , the equation for makes diagonalizable because has distinct roots. Its determinant one forces its two eigenvalues to be equal, so or . An eigenline of would then be invariant under both generators. Hence only is possible for . In every case , so every common peripheral eigenvalue pair satisfies , including nonsemisimple meridian matrices.
Choose noncentral roots with noncentral meridian powers. Fix a permitted sign. For a positive integer choose when and when . The first case is used only for , since is permitted only when . Set and . They satisfy and neither is . Also and . Indeed the Bezout identity gives . In the positive-sign case equality of the two powers would imply or , impossible for the relevant integer greater than two. In the negative-sign case the roots have orders ; equality would imply or , also impossible. These explicit roots require no choice family.
An actual irreducible matrix family. Put and, for , define The second matrix has determinant one and trace , hence distinct eigenvalues . Therefore , and these are actual representations of the displayed presentation for every . Since has distinct eigenvalues, a common invariant line must be one of its coordinate lines. The upper-right entry of is , so the second coordinate line is never invariant. The first is invariant exactly when , whose two roots are . Thus the representation is irreducible for every other than these two values.
The meridian trace varies with a nonzero linear coefficient. Polynomial division modulo gives for constants independent of , including negative because both eigenvalues are nonzero. Explicitly and . With , one obtains The coefficient is nonzero by step 1.2. For each there is consequently exactly one giving meridian trace . The two forbidden values of step 2.1 exclude at most four meridian values, since each equation is a quadratic after multiplication by . Discard also . For every remaining the meridian has distinct eigenvalues , so an eigenline with eigenvalue exists and the longitude, being , acts there by . This gives the claimed cofinite graph family for each permitted sign.
Exact ideals, including all exceptional representations. Evaluation defines a surjection . Its kernel is : multiplying by a monomial reduces any expression to a polynomial in , and division by the monic over 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 the single sign gives . For put ; the two ideals and are comaximal since their difference is , an invertible scalar. Their intersection equals their product: writing with in one and in the other expresses an element of the intersection as a sum of two product elements. Thus their intersection is . 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
- Baldwin and Sivek, Torus knots, the A-polynomial, and SL(2,C) (standard reference, not scraped)