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.
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.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · one level
2 results 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
- Lehrer and Zhang, The Brauer Category and Invariant Theory, Lemma 4.4 and Theorem 4.6 (standard reference, not scraped)