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.

BMW closure trace and stabilization scalars

Statement

For n≥1, let Φn be the BMW-to-Dubrovnik tangle homomorphism over T, let t^ denote closure of an (n,n) tangle by joining corresponding top and bottom endpoints without a twist, and define τn(x)=d−nP ⁣(Φn(x)^),x∈BMWn(T;q,ρ,δ). Then τn is a cyclic T-linear trace, compatible with the tower inclusion ιn:BMWn→BMWn+1 that adds one straight strand, and for every x∈BMWn, τn+1(ιn(x))=τn(x),τn+1(ιn(x)gn)=ad−1τn(x),τn+1(ιn(x)gn−1)=a−1d−1τn(x),τn+1(ιn(x)en)=d−1τn(x), where a=ρ and d=δ.

Facts & Assumptions

Given: The BMW tower, its tangle realization, the scalar Dubrovnik evaluation, and closure by untwisted endpoint arcs.

[F1]

The natural assignment from the BMW presentation to the Dubrovnik tangle skein algebra is a well-defined algebra homomorphism for each n (The BMW presentation maps to the Dubrovnik tangle algebra).

[F2]

The scalar P is invariant under regular isotopy, multiplies by a and a−1 under positive and negative curls, and by d under addition of a disjoint trivial circle (Scalar evaluation of framed Kauffman link diagrams).

[F3]

gn is the positive Artin crossing, gn−1 its negative crossing, and en the adjacent cup-cap tangle (The BMW presentation maps to the Dubrovnik tangle algebra).

[F4]

The Dubrovnik parameters satisfy a=ρ and d=δ under the specified coefficient map (BMW relations in the Dubrovnik parameter convention).

Proof

1.1F1F2

By [F1], the tangle class Φn(x) depends only on the BMW algebra element x, so closing it and applying P defines a T-linear scalar. For x,y∈BMWn, the two closed tangles obtained by closing the stacked products Φn(x)Φn(y) and Φn(y)Φn(x) differ only by moving the chosen cut between the factors once around the closed tangle. This is an isotopy of the closed diagram and preserves its framing; therefore P(Φn(xy)^)=P(Φn(yx)^), proving cyclicity after multiplication by d−n.

2.1F1F2step 1.1algebra

Under tower inclusion, the new straight strand closes to a disjoint trivial circle. By [F2], P(Φn+1(ιn(x))^)=dP(Φn(x)^). Thus d−(n+1)dP(Φn(x)^)=τn(x), which proves tower compatibility.

2.2F2F3F4step 1.1algebra

Closing ιn(x)gn turns the added positive crossing into a positive curl on the last closure arc of Φn(x)^; closing ιn(x)gn−1 gives a negative curl on the same arc. By [F2] and [F3], the respective scalar factors are a and a−1. Normalization by d−(n+1) gives ad−1τn(x) and a−1d−1τn(x).

3.1F1F2F3step 1.1algebra∎

In the closure of ιn(x)en, the added cup and cap and the two added closure arcs form a detour joining the top and bottom ends of the last strand of Φn(x). Following that component through the cup, cap, and closure arcs gives exactly the same connection as the untwisted closure arc for Φn(x); the other components and crossings are unchanged. Pulling this detour into the closing collar is a planar isotopy, so the unnormalized evaluations agree. The normalization changes from d−n to d−(n+1), giving d−1τn(x).

Depends on

Used by

Dependency tree · two levels

13 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