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

The BMW Markov trace gives the Dubrovnik link invariant

Statement

Assume the Axiom of Choice. For every nonempty oriented link K⊂S3 and every finite signed Artin braid word β whose oriented closure represents K, the corrected BMW trace value Q(β)=−(−1)c(β)a−w(β)dn−1τn(β), where n is the strand count, c(β) is the number of closure components, and w(β) is the determinant writhe, is independent of the braid representative. It equals the declared writhe-normalized Kauffman ambient-isotopy invariant of K at A=ia, Z=−iz.

Here τn(β) denotes τn(bβ), where bβ is obtained by replacing each letter σi±1 by gi±1 in the same order.

Facts & Assumptions

Given: AC, a nonempty oriented link in S3, and a finite signed Artin braid word whose closure represents it.

[A1]

Assume the Axiom of Choice (The Axiom of Choice).

[F1]

Every oriented link is equivalent to the closure of a finite geometric braid; AC is the stated hypothesis (Alexander's theorem: every link is a closed braid).

[F2]

Two braids have equivalent oriented closures if and only if they are related by finitely many conjugations and positive or negative stabilizations/destabilizations; AC is the stated hypothesis (Markov's theorem for braid closures).

[F3]

The trace is cyclic, tower-compatible, and has stabilization factors ad−1,a−1d−1 for gn,gn−1 (BMW closure trace and stabilization scalars).

[F4]

The closure has one component for each cycle of its strand permutation; the Markov-move convention identifies each Artin generator with the positive geometric half twist, which contributes determinant sign +1, and its inverse contributes −1. The word exponent sum is the signed sum of these generator exponents (The closure of a geometric braid, Markov conjugation and stabilization moves, Oriented crossing signs, diagram writhe, and blackboard framing, The exponent sum of a braid).

[F5]

The Markov moves are conjugation and the two signed stabilizations, with inverses allowed (Markov conjugation and stabilization moves).

[F6]

The scalar Dubrovnik value on a nonempty diagram is D=P/d, and DK(a,z)=−i−w(K)(−1)c(K)LK(ia,−iz) while FK(A,Z)=A−w(K)LK(A,Z) (Kauffman regular-isotopy and Dubrovnik conventions, Kauffman and Dubrovnik writhe-component conversion).

[F7]

The BMW-to-tangle homomorphism sends each gi±1 to the corresponding positive or negative Artin crossing (The BMW presentation maps to the Dubrovnik tangle algebra).

[F8]

AC implies ACω by restriction to countable indexed families, and under ACω equivalent oriented link diagrams are connected by finitely many planar isotopies and oriented Reidemeister moves (The Axiom of Choice, Reidemeister's theorem for oriented diagrams).

Proof

1.1A1F1givenchoose

Fix an oriented link K. By [F1], choose a finite signed braid word β0 whose oriented closure represents K. This use of existence is valid under [A1], as required by [F1]. Define Q(β) by the formula in the statement for every braid word with closure equivalent to K.

2.1F3F4F5step 1.1algebra

A conjugation β↦γβγ−1 leaves the closure component count unchanged because the strand permutation is conjugated, and leaves writhe unchanged because the exponent sum of γ cancels with that of γ−1. Cyclicity in [F3] gives τn(γβγ−1)=τn(β). Thus Q is unchanged by conjugation.

2.2F3F4F5step 1.1algebra

For positive stabilization β′=ιn(β)σn, the new transposition involving strand n+1 joins that new strand to the cycle containing strand n, so c(β′)=c(β). The exponent sum increases by one, hence w(β′)=w(β)+1. By [F3], τn+1(β′)=ad−1τn(β). Therefore Q(β′)=−(−1)ca−(w+1)dn ad−1τn(β)=Q(β). For negative stabilization the cycle count is again unchanged, the writhe becomes w−1, and τn+1(βσn−1)=a−1d−1τn(β); substituting gives −(−1)ca−(w−1)dna−1d−1τn(β)=Q(β). Thus both stabilizations and their inverse moves preserve Q.

3.1A1F1F2F3F6F7F8step 2.1step 2.2∎

By [F2], any two braid words whose oriented closures represent K are Markov equivalent. Each move in a finite Markov sequence preserves Q by steps 2.1 and 2.2, so Q is independent of the braid representative. For a representative β, [F7] identifies Φn(bβ)^ with its oriented closure diagram. By [F3], τn(β)=d−nP(Φn(bβ)^). Hence dn−1τn(β)=d−1P(Φn(bβ)^)=Dβ^(a,z) by [F6]. Applying the conversion in [F6] gives Fβ^(ia,−iz)=(ia)−wLβ^(ia,−iz)=−(−1)ca−wDβ^(a,z)=Q(β). The scalar conversion lemma proves that F is unchanged by each oriented Reidemeister move; [F8] therefore identifies this fixed-diagram value with the declared ambient-isotopy value of K. AC is used in [F1], [F2], and [F8]; the trace and local formula calculations are choice-free.

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