Alphabeta Math
TheoremStatement: 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.

Scalar twist correction removes the framing

Statement

Assume the Axiom of Choice. Let k be a field and let C be a k-linear ribbon category with k-bilinear tensor product and End⁡C(1)=k. Let X be absolutely simple, so its twist is θX=λid⁡X for a unique λ∈k×. For n≥1 and β∈Bn, let tn(β) be the value of the blackboard-framed X-colored closure and let w(β) be the exponent sum, with positive Artin generator and positive stabilization conventions fixed as in the supplied ribbon-trace formulas. Then JX(β^):=λ−w(β)tn(β) depends only on the oriented unframed link type of β^ when every component has color X. This statement makes no normalization by the categorical dimension.

Facts & Assumptions

Given: The Axiom of Choice; the k-linear ribbon category and absolutely simple color in the Statement; a braid β∈Bn with n≥1.

[F1]

The algebraic ribbon trace is Tr⁡L(jX⊗nρn(β)), where j=uθ is a natural pivotal comparison (The ribbon evaluation of an X-colored closed braid). Under countable choice, this equals the blackboard-framed closure value tn(β) used in the Statement (The ribbon trace equals the framed-closure evaluation).

[F2]

Categorical trace is cyclic: Tr⁡L(ac)=Tr⁡L(c∨∨a) for the stated typed morphisms (Basic properties of the categorical trace).

[F3]

The two stabilization values are tn+1(ιn(β)σn±1)=λ±1tn(β) when positive stabilization closes to the positive curl (The scalar twist controls the two Markov stabilizations).

[F4]

The exponent sum is unchanged by conjugation and satisfies w(ιn(β)σn±1)=w(β)±1 (Exponent sum and writhe of a braid).

[F5]

Two braids have equivalent oriented closures exactly when they are related by conjugations, stabilizations, and destabilizations (Markov's theorem for braid closures).

[F6]

The Axiom of Choice implies countable choice (AC implies DC implies countable choice).

[A1]

Absolute simplicity means End⁡C(X)=kid⁡X, so each automorphism of X is a unique nonzero scalar multiple of the identity (Absolutely simple objects).

[A2]

The Axiom of Choice is the assumption that every family of nonempty sets has a choice function (The Axiom of Choice).

Proof

technique · direct

Given: The hypotheses in the Statement and [F1]–[F6], [A1]–[A2].

1.1F1F2F4F6givenalgebra

By [F6], the assumed Axiom of Choice supplies countable choice, so [F1]'s closure comparison identifies every tn in the Statement with the algebraic trace. Fix γ∈Bn and put j=jX⊗n, ρ=ρn. Apply [F2] with a=jρ(γ)ρ(β) and c=ρ(γ)−1 to obtain tn(γβγ−1)=Tr⁡L((ρ(γ)−1)∨∨jρ(γ)ρ(β)). Naturality of j gives (ρ(γ)−1)∨∨j=jρ(γ)−1, so this is tn(β). The exponent sum is unchanged by [F4], hence JX is invariant under conjugation.

2.1F3F4A1step 1.1algebra

For a positive or negative stabilization, [F3] multiplies tn by λ±1 and [F4] changes w by ±1. Hence λ−w(ιnβσn±1)tn+1(ιnβσn±1)=λ−w(β)∓1λ±1tn(β)=λ−w(β)tn(β). The scalar is available because [A1] makes the invertible twist a unique λ∈k×; the positive sign is fixed by [F3]. Thus JX is invariant under both stabilizations and their inverses.

3.1F3F4F5F6A2step 1.1step 2.1given∎

By [F5], any two braids with equivalent oriented unframed closures are connected by finitely many conjugations, stabilizations, and destabilizations. Steps 1.1 and 2.1 preserve JX under each such move, so the corrected value depends only on the oriented unframed link type. The Axiom of Choice [A2] is used in [F5] and supplies the countable-choice hypothesis of [F3] by [F6]; no choice is used in the finite trace or scalar calculations.

Depends on

Used by

Dependency tree · two levels

39 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