Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6-luna)
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 algebra in a fixed Kauffman skein convention

Definition

Let R be a commutative unital ring, let q,ρ∈R×, put z=q−q−1, and choose δ∈R with z(δ−1)=ρ−ρ−1. For n≥2, the BMW algebra BMWn(R;q,ρ,δ) is the unital associative R-algebra generated by invertible gi and elements ei for 1≤i<n, subject to the following relations (an adjacent relation is imposed only when both indices exist):

  • braid and distant braid: gigi+1gi=gi+1gigi+1 and gigj=gjgi for ∣i−j∣≥2;
  • distant cups and caps: giej=ejgi and eiej=ejei for ∣i−j∣≥2;
  • adjacent cup-cap: eiei±1ei=ei, gigi±1ei=ei±1ei, and eigi±1gi=eiei±1;
  • Kauffman skein and untwisting: gi−gi−1=z(1−ei), giei=eigi=ρ−1ei, and eigi±1ei=ρei;
  • loop: ei2=δei.

For the boundary ranks, set BMW0(R;q,ρ,δ)=BMW1(R;q,ρ,δ)=R, with the empty and single straight tangle as their respective units.

If z is invertible, the parameter relation reads δ=1+(ρ−ρ−1)/z. If z is not invertible, the presentation uses the universal coefficient relation z(δ−1)=ρ−ρ−1 and does not divide by z. The quotient by the two-sided ideal generated by all ei is the cup-cap-zero Hecke quotient; this definition does not assert a BMW diagram-basis theorem or a BMW quantum-centralizer theorem.

Depends on

Used by

Dependency tree · one level

1 result within one dependency step 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