Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-adaptedPipeline-generatedprecheck passjudge pass (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.

Writhe normalization cancels a ribbon kink

Example

Assume the Axiom of Choice. In the ribbon category of Z/2-graded finite-dimensional vector spaces over a field k of characteristic ≠2 with the sign braiding and the parity twist, let X be the odd one-dimensional object, so λ=θX=−1 and dX=Tr⁡L(jX)=1. For β=e∈B1 and its positive stabilization σ1∈B2, The scalar twist controls the two Markov stabilizations gives t1(e)=1 and t2(σ1)=(−1) t1(e)=−1, so the unnormalized values differ by the factor λ−1=−1. The exponent sums are w(e)=0 and w(σ1)=1 (Exponent sum and writhe of a braid), so the normalized values

JX(e^)=λ−0t1(e)=1,JX(σ1^)=λ−1t2(σ1)=(−1)−1⋅(−1)=1

agree: the writhe factor cancels the kink and produces the invariant of the unframed unknot predicted by The writhe-normalized ribbon trace is an unframed link invariant. The common value is 1 here; since dX=1 is a unit, the further normalization dX−1JX is trivial and also gives 1 on the unknot.

Facts & Assumptions

Given: AC; the field k with char⁡k≠2; the category of Z/2-graded finite-dimensional vector spaces with the sign braiding and the parity twist; its odd one-dimensional object X; the braid e∈B1 and its positive stabilization σ1∈B2.

[L1]

The model is a ribbon category with End⁡(1)=k and X absolutely simple, θX=λid⁡X, so the stabilization lemma gives tn+1(ιn(β)σn±1)=λ±1tn(β); that lemma is stated under countable choice, which AC supplies here (AC implies DC implies countable choice); in this model λ=−1 and the odd line has dX=Tr⁡L(jX)=1, so t1(e)=1 and t2(σ1)=−1 (The scalar twist controls the two Markov stabilizations, Absolutely simple objects).

[F1]

A ribbon twist satisfies balancing and dual-compatibility (Twist and ribbon structure); the Drinfeld composite and left trace are those of A braided rigid category has a Drinfeld morphism and The categorical trace of a morphism into the double dual.

[F2]

The trivial one-braid closes to the unknot, and stabilization preserves its oriented closure under countable choice (The closure of a geometric braid, Markov moves preserve the oriented closure up to isotopy). AC supplies that choice assumption as recorded in [L1].

[L2]

The exponent sum satisfies w(σ1)=w(ι1(e)σ1)=w(e)+1=1 and w(e)=0 (Exponent sum and writhe of a braid); the positive stabilization is β↦ιn(β)σn (Markov conjugation and stabilization moves).

[L3]

Assume AC: the writhe-normalized trace JX(β^)=λ−w(β)tn(β) is an invariant of oriented unframed link types of closures (The writhe-normalized ribbon trace is an unframed link invariant, The Axiom of Choice).

Verification

1.1F1givenalgebra

Verify the model and dimension. Even linear maps and graded duals give the rigid k-linear category, with the ordinary evaluation and basis coevaluation satisfying the zig-zags. The sign braiding is natural; its hexagons are (−1)p(q+r)=(−1)pq(−1)pr and the analogous identity in the first variable, and its square is the identity. Parity is natural, multiplicative on tensor products and unchanged on duals, so it is a ribbon twist by [F1]. The odd line has only scalar endomorphisms and twist −1. For a dual basis e,e∨, the Drinfeld composite gives uX(e)=−e∨∨, hence jX(e)=e∨∨; coevaluation 1↦e⊗e∨ and evaluation e∨∨⊗e∨↦1 give dX=1.

1.2L2given

The writhe exponents. The trivial one-braid has exponent sum w(e)=0, and its positive stabilization σ1 has w(σ1)=1 by [L2].

2.1L1L2F2step 1.1given

The unnormalized values and the kink. By [L1], t1(e)=1 and t2(σ1)=λt1(e)=−1. By [F2], the closures both represent the unknot, so the unnormalized evaluation changes by the factor −1 under the positive stabilization, the kink contribution modelled by the scalar twist λ=−1.

3.1L3step 2.1step 1.2algebra

The normalized values agree. Substituting steps 2.1 and 1.2, JX(e^)=λ−w(e)t1(e)=(−1)0⋅1=1,JX(σ1^)=λ−w(σ1)t2(σ1)=(−1)−1⋅(−1)=1. The two normalized values are equal, in accordance with [L3].

4.1step 2.1step 1.2step 3.1∎

Conclusion. The writhe factor λ−w cancels exactly the kink contribution λ contributed by the stabilization, so the normalized evaluation is the same on the closure of e and on its positive stabilization, as the invariant theorem predicts; the common value is 1, and the dimension normalization by dX=1 is trivial here. All computations are finite; the Axiom of Choice is assumed through [L3] and supplies the countable-choice input to [L1], as recorded there.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

44 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