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.

Finite source normal form over the Dubrovnik coefficient extension

Statement

Let S=Z[a±1,z,d±1]/(z(d−1)−(a−a−1)) and T=S[q±1]/(q−q−1−z). Put ρ=a and δ=d. For every n≥0, the abstract presented algebra BMWn(T;q,ρ,δ) has a finite basis indexed by the perfect matchings of 2n endpoints. In particular it is spanned by Nn elements, where N0=1 and Nn=(2n−1)!! for n≥1. This is a source-module assertion about the generators-and-relations algebra, independently of any proposed map to a Dubrovnik tangle algebra.

Facts & Assumptions

Given: The abstract BMW presentation over T and the finite matching index set.

[F1]

Over R=Z[q±1,r±1,Δ±1]/((q−q−1)(Δ−1)−(r−r−1)), the abstract BMW presentation has a matching-indexed basis. Its local proof establishes tower absorption, nested-cap identities, the through-strand ideal filtration, and shuffle stability before the double-induction injectivity argument (BMW basis by descending Kauffman tangles, Proof phases 6–18).

[F2]

The BMW presentation uses gi−gi−1=(q−q−1)(1−ei), giei=eigi=ρ−1ei, eigi±1ei=ρei, and ei2=δei, with the displayed braid and cup-slide relations; ranks zero and one are the scalar algebra (BMW algebra in a fixed Kauffman skein convention).

[F3]

In T, q−q−1=z, ρ=a, δ=d, and z(d−1)=a−a−1 (BMW relations in the Dubrovnik parameter convention).

Proof

1.1F3constructalgebra

Define f:R→T by q↦q, r↦a, Δ↦d. Its defining relation maps to zero by [F3], and its unit generators map to units. Conversely define h:T→R by a↦r, d↦Δ, q↦q, and z↦q−q−1. The relation of S maps to the relation of R, and q−q−1−z maps to zero. On each displayed ring generator, both composites are the identity. Thus f,h are inverse ring isomorphisms, without inverting z or requiring a flatness argument.

2.1F1F2F3step 1.1algebra

Transport the source presentation along f. Send each gi±1 and ei to the identically named generator over T. The braid, commutation and cup-slide relations are literally identical, while the remaining coefficients become q−q−1, a−1, a, and d, exactly as in [F2] and [F3]. The inverse coefficient map h gives an inverse map of presented algebras, because it fixes the generator names and reverses each coefficient substitution. This verifies the source comparison without assuming that either tangle realization is injective.

3.1F1F2step 2.1algebra∎

Transport the basis in [F1] through this algebra isomorphism. If bm denotes the transported basis element with matching index m, every source element has one expression ∑mtmbm with tm∈T, and these expressions are unique. This is the finite source normal form supplied by the already proved local universal theorem, whose ideal/shuffle proof concerns the abstract algebra rather than a dimension inference from a tangle quotient. A perfect matching pairs the first endpoint in 2n−1 ways and then matches the remaining endpoints; hence there are Nn=(2n−1)!! indices, and one empty index at n=0. The scalar definitions give the same rank-one conclusion at n=1.

Depends on

Used by

Dependency tree · two levels

10 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