Alphabeta Math
Pipeline-generated
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.

Character varieties and the A-polynomial — Examples and Counterexamples

1 · Prerequisites

2 · Logical flowchart

3 · Definitions, theorems and proofs

None yet.

4 · Examples, counterexamples and false statements

CounterexampleConstruction: Literature-sourcedVerification: AI-generatedjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)Open item page →

The eigenvalue equation does not imply the matrix relation

Statement refuted

Let U,V∈SL2(C) commute and have a common invariant line on which their eigenvalues are M,L, respectively. For every primitive pair (p,q)∈Z2, if MpLq=1, then UpVq=I2.

Facts & Assumptions

Given: N=(0100), U=I2+N, V=I2, and the primitive pair (p,q)=(1,0).

[F1]

N2=0, so U is upper-triangular unipotent with determinant one and is not the identity.

[F2]

The identity matrix commutes with every matrix, and the eigenvalues of an upper-triangular matrix are its diagonal entries.

Counterexample

1.1F1F2givenalgebra

Since N2=0, U=(1101), so U∈SL2(C), has only eigenvalue 1, and is not I2. Also V=I2∈SL2(C). By [F2], the pair commutes and has common eigenline C(1,0) with eigenvalues M=L=1.

2.1F1givenstep 1.1algebra∎

For (p,q)=(1,0), the eigenvalue equation gives MpLq=1110=1, while UpVq=U≠I2. This refutes the statement. The example is only a matrix pair and does not claim to extend to any knot-group representation.

ExampleConstruction: Literature-sourcedVerification: AI-generatedverified 2026-10-22 (gpt-6.1-sol)Open item page →

Figure-eight A-polynomial calculation

Example

Let K=J(2,−2) be the figure-eight knot with its positive meridian μ and preferred longitude λ. The enhanced A-polynomial is A~K(M,L)=M4L2+(−M8+M6+2M4+M2−1)L+M4, and the ordinary A-polynomial is (L−1)A~K(M,L), up to a Laurent unit.

Facts & Assumptions

Given: The standard figure-eight knot, its positive meridian and preferred longitude, and the eigenvalue convention in which the peripheral matrices have diagonal entries (M,M−1) and (L,L−1) on a common invariant line.

[F1]

On the one-dimensional irreducible character component, x=tr⁡(ρ(μ)) and tr⁡(ρ(λ))=x4−5x2+2 (Figure-eight character curve and longitude trace).

[F2]

On a common invariant line of the commuting peripheral pair, tr⁡(ρ(μ))=M+M−1 and tr⁡(ρ(λ))=L+L−1 (SL2 character variety and peripheral eigenvalues; Two commuting complex 2x2 matrices are simultaneously triangularizable).

[F3]

The Laurent polynomial ring over C is a localization of the finite-variable polynomial UFD (Every finite-variable polynomial ring over a field is a UFD, with prime irreducibles and principal height-one primes); Gauss's lemma passes irreducibility from its fraction field to a primitive polynomial over this UFD (Gauss lemma over a UFD).

[F4]

The concrete two-meridian presentation and preferred longitude are proved in A two-meridian figure-eight presentation and its preferred longitude word. A reducible representation is upper triangular with equal diagonal characters on u,v, and this explicit longitude has exponent sum zero. Hence its longitude eigenvalue is one. Conversely u=v=diag⁡(M,M−1) realizes (M,1) for every M≠0.

Verification

1.1F1F2constructalgebra

Put x=M+M−1. By [F1] and [F2], L+L−1=x4−5x2+2. Since x2=M2+2+M−2 and x4=M4+4M2+6+4M−2+M−4, the right side is M4−M2−2−M−2+M−4. Multiplying by the unit M4L gives Q(M,L)=M4L2+(−M8+M6+2M4+M2−1)L+M4=0. Thus every eigenvalue pair from an irreducible representation lies on this explicit Laurent curve.

2.1F3step 1.1constructalgebra

Irreducibility is checked by an exact factorization. Put X=M2 and B(X)=−X4+X3+2X2+X−1. As a quadratic in L, Q=X2L2+B(X)L+X2 has discriminant B(X)2−4X4=(X−1)2(X+1)2(X2+X+1)(X2−3X+1). This follows by factoring B−2X2=−(X−1)2(X2+X+1) and B+2X2=−(X+1)2(X2−3X+1). A root r of X2−3X+1 is nonzero, is simple, and is neither 1,−1 nor a root of X2+X+1: subtracting the two quadratics at a common root would give 4r=0. Each square root M of r is consequently a simple zero of the discriminant after substitution X=M2, since 2M≠0. Thus the discriminant is not a square in C(M). The quadratic Q is irreducible over C(M), and [F3] gives its irreducibility in the Laurent polynomial ring; its nonzero constant term excludes an inverted L factor.

2.2F2F4step 1.1constructalgebra

There are actual representations with infinitely many meridian values. Use the presentation ⟨u,v∣vw=wu⟩, w=uv−1u−1v, from [F4]. For M≠0, put a=M2+M−2−3, F=t2+at−a and A=(M10M−1),B=(M0tM−1),W=AB−1A−1B. Both matrices have determinant one. Multiplication gives BW−WA=(0−FtF0), so each root of F=0 defines an actual representation with ρ(u)=A, ρ(v)=B. Exclude M=±1 and the finitely many solutions of a=0. The monic quadratic F has a complex root t, and F(0)=−a≠0 makes t≠0. Write d=M−M−1≠0. The only eigenlines of A are C(1,0) and C(1,−d). The first is not B-invariant since t≠0; the second is B-invariant exactly when t=−d2. Since d2=a+1, substitution gives F(−d2)=1, excluding that case. Thus the representation is irreducible. Commutation with A makes the preferred longitude preserve its M-eigenline, producing an eigenvalue pair (M,L). Infinitely many distinct M remain, and their pairs satisfy Q=0 by step 1.1. No normal-form converse or image-completeness theorem is assumed.

3.1F3step 1.1step 2.1step 2.2constructalgebra

The exact curve vanishing ideal follows by polynomial Euclid. Suppose a Laurent polynomial P(M,L) vanishes on all those irreducible eigenvalue pairs. If Q does not divide P in C(M)[L±1], step 2.1 makes their gcd one. The finite Euclidean algorithm gives a Bezout identity there. Clearing its finitely many nonzero denominators in M, while retaining the already allowed Laurent powers of L, gives Laurent coefficients U,V and a nonzero Laurent polynomial h(M) with UP+VQ=h(M). Step 2.2 would make h(M) vanish at infinitely many nonzero meridian values, impossible for a nonzero one-variable Laurent polynomial. Therefore Q divides P. Its primitive irreducible Laurent equation from step 2.1 and [F3] then divides P in C[M±1,L±1] itself. The converse is step 1.1. Hence the vanishing ideal of the full irreducible peripheral eigenvalue locus is exactly (Q), and its reduced closure is the whole Q curve. This includes any exceptional central or parabolic pairs, since they too satisfy step 1.1, while the dense family already forces this ideal.

4.1F3F4step 2.1step 3.1constructalgebra∎

Reducible representations contribute precisely L=1 by [F4]. Since Q(M,1)=−M8+M6+4M4+M2−1 is not identically zero, Q and L−1 are distinct irreducible Laurent factors. The defining reduced union has ideal (Q)∩(L−1)=((L−1)Q) by [F3]. By the ordinary and enhanced definitions, the enhanced equation is Q and the ordinary one is (L−1)Q, up to a Laurent unit. The displayed integer polynomials are primitive and square-free. This proves both formulas using the actual representation family and preferred longitude, rather than an assumed image-completeness premise.

Diagram

The braid box records the word σ1σ2−1σ1σ2−1 whose closure is J(2,−2). In each positive crossing the left incoming strand passes over the right incoming strand; in each negative crossing the right incoming strand passes over the left. The boxes are read from top to bottom. The closure arcs outside the box are omitted, and the algebraic verification does not rely on the diagram.

¾1¾¡12¾1¾¡12threebraidstrands;matchingendpointsareclosedoutsidethebox

Sources