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.
The SL2 representation variety is affine
Statement
Assume full AC and let be a finite presentation of a knot-exterior group. The set of homomorphisms is the affine algebraic subset of cut out by the matrix-entry equations for . After each inverse letter is replaced by the adjugate of its determinant-one matrix, these equations have integer coefficients in the matrix-entry coordinates.
Statement references
Facts & Assumptions
Given: Full AC and the finite presentation .
The knot group has a finite Wirtinger presentation (Correctness of the Wirtinger presentation).
If , then , an integer-polynomial expression in its entries: multiplying by the displayed matrix gives entrywise.
Proof
Work with the fixed finite presentation in the Statement. Fact [F1] ensures the existence of finite presentations for the knot group, but no change from the specified presentation to different Wirtinger generators is presumed here. Write each generator matrix as four coordinate variables and impose the polynomial determinant equation . These finitely many equations cut out in affine -space.
Evaluate each relator word by matrix multiplication, replacing each inverse letter by the adjugate matrix from [F2]. Every entry of is therefore a polynomial in the coordinates.
A tuple in satisfies all these matrix equations exactly when its generator assignment extends to a homomorphism from the presented group . Hence their common zero set is precisely , a closed algebraic subset of affine space.
Depends on
Used by
- Baldwin–Sivek instanton-surgery and Newton-polygon input module Lemma
- Boundary eigenvalue curve elimination for the A-polynomial Lemma
- The peripheral eigenvalue locus is defined over Q Lemma
- Trace functions are regular and conjugation invariant Lemma
- Trace-coordinate algebra for the SL2 character quotient Lemma
- Bénard–Florens–Rodau logarithmic Gauss formula and ideal-point slope Theorem
- Boundary restriction and the surgery detector Theorem
- The enhanced A-polynomial Newton polygon detects torus knots Theorem
Dependency tree · two levels
23 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
- Léo Bénard, François Florens, and Adrien Rodau, A slope invariant and the A-polynomial of knots, §2.1 (standard reference, not scraped)
- Stephan Tillmann, Varieties associated to 3-manifolds, §4.2 (standard reference, not scraped)