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 ordinary knot A-polynomial
Definition
Assume full AC and let be a smooth oriented knot with exterior , positive meridian , and preferred longitude . Define to consist of all pairs for which some representation has a common invariant line on which acts by and acts by . The Zariski closure is the smallest Zariski-closed algebraic subset containing ; let be the union of its one-dimensional irreducible components, where an irreducible component is a maximal irreducible closed subset. Zero-dimensional image components are omitted. The ordinary A-polynomial is the Laurent polynomial generating the vanishing ideal of , chosen square-free (no repeated irreducible factors) and with primitive integer coefficients (their greatest common divisor is one). It is determined up to multiplication by for . Its reduced curve includes the abelian component ; equivalently, its representative in is divisible by .
Depends on
Used by
- Character-variety logarithmic slope Definition
- The enhanced A-polynomial Definition
- Figure-eight A-polynomial calculation Example
- Baldwin–Sivek instanton-surgery and Newton-polygon input module Lemma
- Boundary eigenvalue curve elimination for the A-polynomial Lemma
- Rationality of the adjoint-twisted slope Lemma
- A-polynomial Newton parallelogram characterization Open problem
- A-polynomial questions for knots in other 3-manifolds Open problem
- Does the ordinary A-polynomial detect torus knots? Open problem
- Jones polynomial unknot-detection status Remark
- Adjoint logarithmic Gauss slope on an affine character component Theorem
- Bénard–Florens–Rodau logarithmic Gauss formula and ideal-point slope Theorem
- Boundary restriction and the surgery detector Theorem
- Newton polygon edge slopes are boundary slopes Theorem
- The enhanced A-polynomial Newton polygon detects torus knots Theorem
Dependency tree · two levels
27 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
- John A. Baldwin and Steven Sivek, Torus knots, the A-polynomial, and SL(2,C), §2.3 (standard reference, not scraped)
- Cooper, Culler, Gillet, Long, and Shalen, Plane curves associated to character varieties of 3-manifolds, §§2–3 (standard reference, not scraped)