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

BMW relations in the Dubrovnik parameter convention

Statement

Let S=Z[a±1,z,d±1]/(z(d−1)−(a−a−1)) be the Dubrovnik coefficient ring, and let T=S[q±1]/(q−q−1−z). In T put ρ=a, δ=d, and zB=q−q−1. Then the natural map S→T is injective and T is a free S-module with basis 1,q. Moreover, the BMW coefficient relation zB(δ−1)=ρ−ρ−1 holds, and the substitution a=ρ, zD=zB, d=δ converts the BMW skein, curl, adjacent untwisting, and loop coefficients to the Dubrovnik relations in the specified chart: D+−D−=zD(D0−D∞), the curl factors are a,a−1, and a disjoint trivial circle contributes d. Here D0 is through and D∞ is cup-cap. No skein parameter is divided out.

Facts & Assumptions

Given: The BMW presentation over RB, its units q,ρ,δ, and the Dubrovnik chart and parameters a,zD,d.

[F1]

The BMW relation is gi−gi−1=zB(1−ei), the coefficient relation is zB(δ−1)=ρ−ρ−1, and the local generators satisfy giei=eigi=ρ−1ei, eigi±1ei=ρei, and ei2=δei (BMW algebra in a fixed Kauffman skein convention).

[F2]

In the chosen Dubrovnik chart, D0 is the through smoothing, D∞ is the cup-cap smoothing, the crossing rule is D+−D−=zD(D0−D∞), and the two curl factors are a,a−1 (Kauffman regular-isotopy and Dubrovnik conventions).

[F3]

The bracket chart labels the left/right pairing as the A-smoothing and the top/bottom pairing as the B-smoothing for an over-strand directed southwest to northeast (Kauffman bracket smoothing and loop value).

[F4]

The coefficient extension is T=S[q±1]/(q−q−1−z), with zB=q−q−1, zD=zB, ρ=a, and δ=d (BMW coefficient extension for Dubrovnik parameters).

Proof

1.1F4givenconstructalgebra

The relation defining T is q−q−1=z, hence q2−zq−1=0 and q−1=q−z. Therefore T≅S[q]/(q2−zq−1). Division by this monic quadratic gives a unique remainder u+vq with u,v∈S, so T is free over S on 1,q and the constant inclusion is injective.

2.1F1F2F4step 1.1algebra

With ρ=a, δ=d and zB=zD=z, the BMW coefficient relation becomes exactly z(d−1)=a−a−1, the defining relation of S. Thus every coefficient assignment is compatible. No skein variable is inverted.

3.1F1F2F3F4step 2.1algebra

In the fixed chart the downward positive Artin crossing has over-strand from top right to bottom left. Its determinant sign is positive, and its orientation-preserving smoothing is the through pairing D0; the other smoothing is the cup-cap D∞. Consequently the BMW relation maps to Gi−Gi−1=zB(1−Ei)=zD(D0−D∞), as required. The bracket's names A and B remain those of [F3]; in this chart the Dubrovnik names D0,D∞ are respectively A,B.

4.1F1F2step 3.1algebra∎

Composing the positive crossing with a cup-cap reverses the direction of exactly one incident branch when the resulting self-crossing is oriented along its strand. The determinant sign is therefore negative and its curl coefficient is a−1=ρ−1, agreeing with giei=eigi=ρ−1ei. The inverse crossing gives a=ρ. In EiGi±1Ei the surviving self-curl has the opposite sign and coefficient a=ρ, agreeing with the adjacent untwisting relation. A double cup-cap creates one trivial circle, so its coefficient is d=δ. These checks distinguish a curl after bending from a positive braid closure, whose strands retain their downward orientations and whose curl coefficient is a.

Depends on

Used by

Dependency tree · two levels

9 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