Alphabeta Math
Pipeline-generated
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.

Brauer, BMW, and Partition Diagram Algebras: Examples and Counterexamples

1 · Prerequisites

2 · Summary

These finite examples calculate the two distinct orthogonal/symplectic stable boundaries, the partition orbit-basis kernel, the loop scalar, and the distinction between the BMW cubic and its cup-cap-zero Hecke quotient. Every calculation uses the A-page conventions; none supplies an A-page theorem.

Companion: brauer-bmw-and-partition-diagram-algebras. The diagram on the A page is schematic and does not enter these verifications.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-generatedVerification: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Brauer and partition loops contribute their parameters

Example

For a Brauer cup U:0→2 and cap A:2→0, A∘U=δ 10. For the partition algebra P1(δ), let d={{1},{1′}}. Then d2=δd: the glued middle singleton blocks form one removed component, while the two outer singleton blocks remain.

Facts & Assumptions

Given: The cup, cap, and singleton partition diagrams with the stacking convention in Typed Brauer and partition diagram categories, and optional substitutions δ=m or δ=−2n.

[F1]

Typed Brauer and partition diagram categories: each closed component removed in stacking contributes one factor δ.

Verification

1.1givenF1construct

Gluing the two vertices of U to the two vertices of A closes one matched component and leaves no outer vertex, so the result is one loop times the empty identity diagram, namely δ 10.

2.1F1step 1.1algebra∎

In d∘d, the two middle singleton blocks are identified with each other and with no outer vertex, so they form exactly one removed class. The outer vertices remain two singleton blocks, giving δd. Substituting δ=m or δ=−2n gives those same loop scalars in the respective classical branches.

ExampleConstruction: AI-generatedVerification: AI-adaptedjudge pass (gpt-6-luna)Open item page →

The orthogonal Brauer action has a kernel at dimension one and rank two

Example

Take k=Q, V=Qe with B(e,e)=1, G=O(V)={1,−1}, and tensor rank r=2. Then B2(1) has three distinct pairing basis diagrams, while End⁡G(V⊗2)≅Q is one-dimensional. The orthogonal contraction map sends all three diagrams to the scalar 1, so it is not injective. This is the first orthogonal failure, since r=2>m=1.

Facts & Assumptions

Given: The Brauer diagram basis convention and the contraction assignment, specialized to m=1 and r=2.

[F1]

Typed Brauer and partition diagram categories and Ranks of the Brauer and partition diagram bases: B2(1) is free on the three perfect matchings of its four boundary points.

[F2]

Typed Brauer and partition diagram categories: the product of two basis diagrams is obtained by stacking and contributes one factor δ per removed loop.

Verification

1.1givenF1algebra

Name the three matchings I (through identity), X (crossed through strands), and E (top cup and bottom cap). The orthogonal tensor assignment sends them to id⁡, P, and cB, respectively. On e⊗e, each is the identity because P(e⊗e)=e⊗e and cB(e⊗e)=e⊗e. Also O(V)={1,−1} acts trivially on V⊗2, whose endomorphism algebra is one-dimensional.

2.1F1F2step 1.1algebra∎

At δ=1, stacking any two of I,X,E gives one of these basis diagrams with coefficient 1 (the possible closed loop also has coefficient δ=1). Since all three images are the identity, this defines the contraction algebra map and its image is one-dimensional. Its domain has rank three by [F1] and Ranks of the Brauer and partition diagram bases, so the map has a two-dimensional kernel. For r=0 the map is Q→End⁡(Q) sending identity to identity, and for r=1 both B1(1) and End⁡O(V)(V) are one-dimensional with identity mapping to identity. Thus r=2=m+1 is the first failure.

ExampleConstruction: AI-generatedVerification: AI-adaptedjudge pass (gpt-6-luna)Open item page →

The first symplectic Brauer relation in dimension two

Example

Let V=Q2 with ω((x,y),(x′,y′))=xy′−yx′, and put G=Sp(V,ω)={g∈GL(V):ω(gv,gw)=ω(v,w)}. For four vectors, write pij=ω(vi,vj). Then p12p34−p13p24+p14p23=0. This is a nonzero linear combination of the three distinct pairing basis vectors in B2(−2), so the symplectic contraction map is not injective at r=2>n=1.

Facts & Assumptions

Given: The symplectic contraction convention, the standard form above, and the three pairings of four boundary labels.

[F1]

Typed Brauer and partition diagram categories and Ranks of the Brauer and partition diagram bases: the three pairings form distinct basis vectors of B2(−2).

[F2]

Typed Brauer and partition diagram categories: at parameter δ=−2, stacking the cup-cap diagram with itself contributes one loop and hence coefficient −2.

Verification

1.1givenalgebra

Write vi=(xi,yi). Then pij=xiyj−yixj. Expanding the left side gives six cancelling pairs of monomials: x1x3y2y4 with −x1x3y2y4, −x1x4y2y3 with x1x4y2y3, −x1x2y3y4 with x1x2y3y4, −x2x3y1y4 with x2x3y1y4, x2x4y1y3 with −x2x4y1y3, and −x3x4y1y2 with x3x4y1y2. Thus the multilinear contraction combination vanishes.

1.2givenF2algebra

Name the three endomorphism diagrams I,X,E as in the companion convention. In the symplectic tensor representation they act as id⁡,−P,cω, where c=−e1⊗e2+e2⊗e1. The map respects their multiplication table: X2=I, XE=EX=E, and E2=−2E, the last equality following from ω(c)=−2 and [F2]. Moreover I+X+E annihilates e1⊗e1, e2⊗e2, e1⊗e2, and e2⊗e1, so it is the zero operator.

2.1F1step 1.2algebra∎

The element I+X+E is nonzero in the free Brauer module because its three coefficients on distinct basis diagrams are nonzero; [F1] gives the matching count three. At r=0 the action is Q→End⁡(Q) and is an isomorphism. At r=1, B1(−2) is spanned by the identity diagram. For a 2×2 matrix M, MT(01−10)M=(det⁡M)(01−10), so both diag⁡(2,1/2) and (1101) lie in Sp2(Q). A matrix commuting with the first is diagonal; if it also commutes with the second, its diagonal entries are equal. Hence End⁡Sp2(V)=Qid⁡ and the rank-one diagram action is an isomorphism. Therefore the nonzero kernel at r=2=n+1 is the first failure, exactly outside the symplectic stable range.

ExampleConstruction: AI-generatedVerification: AI-adaptedjudge pass (gpt-6-luna)Open item page →

A partition orbit-basis element vanishes below the stable range

Example

Take N=1 and r=1, so N<2r. In the partition algebra P1(1) let d be the discrete partition {{1},{1′}} and let c={{1,1′}} be the one-block partition. The orbit-basis element xd=d−c is nonzero in the free diagram module but acts as zero on W=Q1.

Facts & Assumptions

Given: The two partition diagrams and the permutation action on W⊗1.

[F1]

Typed Brauer and partition diagram categories: distinct set partitions are a free basis, and composition weights a removed middle block by the parameter.

[F2]

Partition-diagram orbit basis and symmetric-group centralizer: the orbit-basis element for a pattern with more than N blocks maps to zero.

Verification

1.1F1algebra

The discrete partition has two blocks, while the one-block partition coarsens it. Möbius inversion on this two-element interval gives xd=d−c; by [F1] it is nonzero because d and c are distinct basis vectors.

2.1F2step 1.1algebra∎

The one-dimensional tensor basis has only the index 1, so its equality pattern is c and it cannot realize the two-block pattern d. Equivalently, both d and c act by the 1×1 matrix (1), so xd acts by zero. Since 2>N=1, this is the below-stable-range kernel predicted by [F2].

ExampleConstruction: AI-generatedVerification: AI-adaptedjudge pass (gpt-6-luna)Open item page →

One BMW generator takes three scalar values across representations

Example

In BMW2 take q=2, ρ=3, z=q−q−1=3/2, and δ=25/9, which satisfies z(δ−1)=ρ−ρ−1. There are three one-dimensional representations with (g1,e1)=(2,0), (−1/2,0), and (1/3,25/9). Thus the generator takes all three distinct roots of its cubic across these representations. The third representation shows e1≠0 in the full algebra, so the quotient by e1 is proper; the Hecke quotient imposes the quadratic that fails in the third representation.

Facts & Assumptions

Given: The BMW2 presentation from BMW algebra in a fixed Kauffman skein convention and the cubic/quotient relation from The BMW braid generators satisfy a cubic, with a Hecke quotient.

[F1]

BMW algebra in a fixed Kauffman skein convention: for n=2, the defining relations are the loop, skein, untwisting, and inverse relations for g1,e1.

[F2]

The BMW braid generators satisfy a cubic, with a Hecke quotient: the full generator satisfies the cubic, while setting e1=0 gives the Hecke quadratic.

Verification

1.1F1algebra

For (g,e)=(2,0) and (−1/2,0), g−g−1=3/2=z(1−e) and the loop and untwisting relations hold because e=0. For (g,e)=(1/3,25/9), g−g−1=−8/3=z(1−e), ge=eg=25/27=ρ−1e, and e2=625/81=δe. Every g is invertible, and BMW2 has no adjacent-index relations, so these are valid one-dimensional representations.

2.1F2step 1.1algebra∎

The three representations evaluate g1 at the distinct numbers 2,−1/2,1/3. Since the third sends e1 to 25/9≠0, the ideal generated by e1 is nonzero, so the canonical map to the quotient by that ideal is not injective. The quadratic (g1−2)(g1+1/2) evaluates to −25/18≠0 in the third representation, whereas setting e1=0 forces that quadratic by [F2].

Sources