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.
Signed Brauer contraction functor and bending isomorphism
Statement
Let be algebraically closed of characteristic zero. Let have dimension with a nondegenerate symmetric bilinear form and , or dimension with a nondegenerate alternating bilinear form and ; here is the group of invertible linear maps. Symmetric means ; alternating means for every ; nondegenerate means for every only when . Put in the symmetric case and in the alternating case. The assignments , (where ), , and define the usual -equivariant Brauer contraction maps at parameter . Bending gives a linear isomorphism
Facts & Assumptions
Given: The diagram convention and composition from Typed Brauer and partition diagram categories, with its associativity lemma and the generator presentation used only to establish that the assignments respect all defining relations.
Typed Brauer and partition diagram categories: Brauer morphisms are typed perfect matchings composed by stacking with one factor per removed loop.
Generators and defining relations for the Brauer diagram category: the displayed generator relations present the Brauer category. The regular-expression reduction supplies its local presentation proof.
Proof
Choose a basis and its -dual basis , so , and set . Nondegeneracy gives , hence and . Invariance of implies invariance of its inverse tensor . Symmetry or alternation gives and , while .
The maps satisfy and the braid relation because they permute tensor factors. Thus satisfies the crossing-square and braid relations; and give the cap-crossing and cup-crossing relations. On , both sides of the cap-slide relation equal . The dual slide relation sends on both sides to . Reflections give the other slide conventions. Both snake identities from step 1.1 and give the straightening and loop relations. Therefore the assignments satisfy every relation in [F2] and extend to a monoidal functor with .
For a basis multi-index write and . Map a -equivariant linear map to . The inverse sends a tensor to ; the dual-basis identities in step 1.1 show both composites are identities. The maps commute with because and are invariant, so this restricts to the stated invariant and intertwiner spaces.
Depends on
Used by
Dependency tree · one level
3 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 3.1, Theorem 3.4, and Lemma 3.6 (standard reference, not scraped)
- Goodman, Multiplicity-Free Spaces and Schur-Weyl-Howe Duality, §§6.4–7.1 (standard reference, not scraped)