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
Brauer and partition loops contribute their parameters
Example
For a Brauer cup and cap , . For the partition algebra , let . Then : 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 or .
Typed Brauer and partition diagram categories: each closed component removed in stacking contributes one factor .
Verification
Gluing the two vertices of to the two vertices of closes one matched component and leaves no outer vertex, so the result is one loop times the empty identity diagram, namely .
In , 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 . Substituting or gives those same loop scalars in the respective classical branches.
The orthogonal Brauer action has a kernel at dimension one and rank two
Example
Take , with , , and tensor rank . Then has three distinct pairing basis diagrams, while is one-dimensional. The orthogonal contraction map sends all three diagrams to the scalar , so it is not injective. This is the first orthogonal failure, since .
Facts & Assumptions
Given: The Brauer diagram basis convention and the contraction assignment, specialized to and .
Typed Brauer and partition diagram categories and Ranks of the Brauer and partition diagram bases: is free on the three perfect matchings of its four boundary points.
Typed Brauer and partition diagram categories: the product of two basis diagrams is obtained by stacking and contributes one factor per removed loop.
Verification
Name the three matchings (through identity), (crossed through strands), and (top cup and bottom cap). The orthogonal tensor assignment sends them to , , and , respectively. On , each is the identity because and . Also acts trivially on , whose endomorphism algebra is one-dimensional.
At , stacking any two of gives one of these basis diagrams with coefficient (the possible closed loop also has coefficient ). 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 the map is sending identity to identity, and for both and are one-dimensional with identity mapping to identity. Thus is the first failure.
The first symplectic Brauer relation in dimension two
Example
Let with , and put . For four vectors, write . Then This is a nonzero linear combination of the three distinct pairing basis vectors in , so the symplectic contraction map is not injective at .
Facts & Assumptions
Given: The symplectic contraction convention, the standard form above, and the three pairings of four boundary labels.
Typed Brauer and partition diagram categories and Ranks of the Brauer and partition diagram bases: the three pairings form distinct basis vectors of .
Typed Brauer and partition diagram categories: at parameter , stacking the cup-cap diagram with itself contributes one loop and hence coefficient .
Verification
Write . Then . Expanding the left side gives six cancelling pairs of monomials: with , with , with , with , with , and with . Thus the multilinear contraction combination vanishes.
Name the three endomorphism diagrams as in the companion convention. In the symplectic tensor representation they act as , where . The map respects their multiplication table: , , and , the last equality following from and [F2]. Moreover annihilates , , , and , so it is the zero operator.
The element is nonzero in the free Brauer module because its three coefficients on distinct basis diagrams are nonzero; [F1] gives the matching count three. At the action is and is an isomorphism. At , is spanned by the identity diagram. For a matrix , , so both and lie in . A matrix commuting with the first is diagonal; if it also commutes with the second, its diagonal entries are equal. Hence and the rank-one diagram action is an isomorphism. Therefore the nonzero kernel at is the first failure, exactly outside the symplectic stable range.
A partition orbit-basis element vanishes below the stable range
Example
Take and , so . In the partition algebra let be the discrete partition and let be the one-block partition. The orbit-basis element is nonzero in the free diagram module but acts as zero on .
Facts & Assumptions
Given: The two partition diagrams and the permutation action on .
Typed Brauer and partition diagram categories: distinct set partitions are a free basis, and composition weights a removed middle block by the parameter.
Partition-diagram orbit basis and symmetric-group centralizer: the orbit-basis element for a pattern with more than blocks maps to zero.
Verification
The discrete partition has two blocks, while the one-block partition coarsens it. Möbius inversion on this two-element interval gives ; by [F1] it is nonzero because and are distinct basis vectors.
The one-dimensional tensor basis has only the index , so its equality pattern is and it cannot realize the two-block pattern . Equivalently, both and act by the matrix , so acts by zero. Since , this is the below-stable-range kernel predicted by [F2].
One BMW generator takes three scalar values across representations
Example
In take , , , and , which satisfies . There are three one-dimensional representations with , , and . Thus the generator takes all three distinct roots of its cubic across these representations. The third representation shows in the full algebra, so the quotient by is proper; the Hecke quotient imposes the quadratic that fails in the third representation.
Facts & Assumptions
Given: The BMW 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.
BMW algebra in a fixed Kauffman skein convention: for , the defining relations are the loop, skein, untwisting, and inverse relations for .
The BMW braid generators satisfy a cubic, with a Hecke quotient: the full generator satisfies the cubic, while setting gives the Hecke quadratic.
Verification
For and , and the loop and untwisting relations hold because . For , , , and . Every is invertible, and BMW has no adjacent-index relations, so these are valid one-dimensional representations.
The three representations evaluate at the distinct numbers . Since the third sends to , the ideal generated by is nonzero, so the canonical map to the quotient by that ideal is not injective. The quadratic evaluates to in the third representation, whereas setting forces that quadratic by [F2].
Sources
- Lehrer and Zhang, The Brauer Category and Invariant Theory, §2.1
- Halverson and Ram, Partition Algebras, §2
- Lehrer and Zhang, The Brauer Category and Invariant Theory, Theorem 4.6
- Lehrer and Zhang, The Brauer Category and Invariant Theory, Lemma 4.4 and Theorem 4.6
- Halverson and Ram, Partition Algebras, Theorem 3.6(a)
- Goodman and Hauschild, Affine Birman-Wenzl-Murakami Algebras and Tangles in the Solid Torus, Remark 3.2 and Proposition 3.4