Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-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.

SL2 character variety and peripheral eigenvalues

Definition

Assume full AC. Let G=π1(EK) be the group of a smooth oriented knot exterior, with positive meridian μ and preferred longitude λ. For a finite presentation G=⟨g1,…,gn∣r1,…,rm⟩, the SL2(C) representation variety is the algebraic set of tuples (A1,…,An)∈SL2(C)n for which every relator matrix rj(A1,…,An) equals the identity. The group SL2(C) acts on this set by simultaneous conjugation. Its affine categorical quotient, whose coordinate ring is the invariant ring of regular functions, is the SL2(C) character variety X(EK). For a representation ρ, its character is the function γ↦tr⁡(ρ(γ)). A representation is reducible if its matrices preserve a common one-dimensional subspace of C2; otherwise it is irreducible. The peripheral torus group is π1(TK)≅Z2, generated by the meridian and preferred longitude; its image in G is generated by their commuting classes and need not be isomorphic to Z2. Their image under any representation is a commuting pair of matrices, so it has a common invariant line and is simultaneously triangularizable over C. Choosing a common invariant line gives meridian and longitude eigenvalues (M,L)∈(C∗)2; the unordered boundary character identifies (M,L) with (M−1,L−1). Simultaneous diagonalizability is stronger than simultaneous triangularizability.

Depends on

Used by

Dependency tree · two levels

47 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