Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedverified 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.

Figure-eight character curve and longitude trace

Statement

Assume full AC and let K=J(2,−2) be the figure-eight knot. Use the two-bridge group presentation π1(EK)=⟨u,v∣vw=wu⟩, where w=uv−1u−1v, and take μ=u. On the one-dimensional irreducible character component, define x(χ)=tr⁡(ρ(u))=tr⁡(ρ(v)) and y(χ)=tr⁡(ρ(uv)). Then 2x2+y2−x2y−y−1=0, and the preferred-longitude trace is tr⁡(ρ(λ))=x4−5x2+2. The displayed curve equation is irreducible over C, and x is nonconstant on it.

Facts & Assumptions

Given: Full AC, the standard figure-eight knot, its positive meridian and preferred longitude, and the two-bridge group presentation in the Statement.

[F1]

The four-crossing figure-eight code gives a one-component Wirtinger presentation (Explicit unknot and figure-eight oriented Wirtinger codes; Correctness of the Wirtinger presentation).

[F2]

A two-meridian figure-eight presentation and its preferred longitude word derives the exact two-meridian presentation from that actual four-crossing code and proves, using its crossing traversal and zero writhe, that the preferred longitude is C=X4u−1vX3−1 with X3=uvu−1 and X4=v−1uvu−1v. It is not inferred merely from commutation and zero exponent sum.

[F3]

Two-generator SL2 word traces reduce to three coordinates proves the actual four-matrix word table. In the equal-generator-trace case, every word trace is a polynomial in x=tr⁡u=tr⁡v and y=tr⁡uv.

[F4]

Word traces generate the character coordinate algebra by Trace-coordinate algebra for the SL2 character quotient. The actual quotient is onto and any finite algebra generators give its closed affine coordinate model by Finite generation of invariants and the affine categorical quotient.

Proof

1.1F1F2givenconstructalgebra

Every irreducible pair has the required concrete matrix form. Let A=ρ(u) and B=ρ(v). Relation vw=wu makes them conjugate, hence of equal trace x. Choose an eigenvalue M≠0 of A and an eigenvector for it, and choose an eigenvector of B with eigenvalue M−1. The two lines are distinct; otherwise they form a common invariant line for the two generators. In this basis A is upper triangular and B is lower triangular, with respective diagonals (M,M−1) in both cases. The upper entry of A is nonzero, for otherwise the second line is common; the lower entry of B is nonzero for the same reason on the first line. Rescale the second basis vector to make the upper entry of A equal to one. Thus every irreducible representation is conjugate to A=(M10M−1),B=(M0tM−1),t≠0. This works also at M=±1; no distinct-eigenvalue hypothesis was used. A scalar adjustment of the conjugating basis matrix gives determinant one if desired.

2.1step 1.1constructalgebra

All relator entries are computed. Put a=M2+M−2−3=x2−5 and F=t2+at−a. Direct multiplication gives W=AB−1A−1B=(t2+(M2−2)t+1M+M−1(t−1)t(M+M−1(t−1))1+M−2t),BW−WA=(0−FtF0). Thus the representation relation is exactly F=0, not a condition obtained after discarding an extra entry. Conversely a pair with F=0,t≠0 is irreducible. At M=±1 its two nontrivial unipotent matrices have distinct invariant lines. Otherwise a common line besides the two chosen eigenlines can occur only when t=−(M−M−1)2; solving the two eigenvector equations gives this equality. But F evaluated at that value is 1, since (M−M−1)2=a+1. So it never occurs on F=0. When t=0 the pair is upper triangular and reducible.

3.1step 2.1constructalgebra

The trace equation and its actual image. Matrix multiplication gives x=M+M−1,y=M2+M−2+t=x2−2+t. Substituting t=y−x2+2 into F gives f(x,y)=2x2+y2−x2y−y−1. Every irreducible representation therefore maps to f=0. Conversely, if f(x,y)=0 and t=y−x2+2≠0, choose a root M of M2−xM+1=0. It is nonzero, and step 2.1 constructs an irreducible representation with those traces. The excluded points with t=0 have x2=5,y=3, hence are only two points. In particular this is an actual dense realization of the curve, not merely a necessary trace equation.

4.1F3F4step 3.1constructalgebra

There is exactly one component containing irreducible characters. The discriminant of the monic quadratic f in y is (x2+1)2−4(2x2−1)=(x2−1)(x2−5). Each of its four zeros is simple, so it is not a square in C(x): a rational square has even zero order. Thus f is irreducible over C(x) as a quadratic in y, and is irreducible in C[x,y]. Indeed a factor of y-degree zero would divide the leading coefficient one, and two positive-y-degree factors would give a factorization over C(x). By [F3] and [F4], x,y generate the whole character algebra and give its actual closed planar model. Reducible representations have common triangular diagonal characters; the relation makes their u,v diagonal characters equal, so they lie on y=x2−2. Every point on this parabola is realized by the diagonal pair A=B=diag⁡(M,M−1). Step 3.1 realizes all of f=0 except its two intersection points with that parabola, which are also realized diagonally. Hence the full closed character model is precisely the union of that parabola and f=0. The latter is the unique irreducible component containing irreducible characters, and x is nonconstant on it because the monic quadratic f(x,y) has a complex root for every x.

4.2F2step 2.1step 3.1constructalgebra

The preferred word, not an unspecified centralizer element, is evaluated. Use exactly the preferred word C=X4A−1BX3−1 of [F2], with X3=ABA−1 and X4=B−1ABA−1B. Their matrices and the displayed A,B give the Laurent polynomial identity tr⁡C=(M4−M2−2−M−2+M−4)+F(x2(t+1)−tF). This identity is obtained by the four indicated matrix products and the entry formula for determinant-one inverses; equivalently multiply out with a=M2+M−2−3 to get tr⁡C=(x4−5x2+2)+F((a+5)(t+1)−tF). It is an identity before imposing the relator, so no denominator, exceptional parabolic point, or extra component has been canceled. On F=0 it gives tr⁡ρ(λ)=x4−5x2+2 for every irreducible representation.

5.1F4step 3.1step 4.1step 4.2construct∎

Word traces are regular functions in the actual character model by [F4]. The irreducible characters are dense in the irreducible curve by steps 3.1–4.1. Consequently the longitude-trace identity of step 4.2 holds on that entire component, including its reducible intersection points. Steps 3.1–4.1 supply exactly the irreducible curve and nonconstant coordinate required in the Statement, with its original full-AC branch retained. No generic trace-model, eigenvalue-image completeness or preferred-longitude calculation remains assumed in this finite computation.

Depends on

Used by

Dependency tree · two levels

52 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