Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-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.

Signed Brauer contraction functor and bending isomorphism

Statement

Let k be algebraically closed of characteristic zero. Let V have dimension m≥1 with a nondegenerate symmetric bilinear form B and G=O(V,B):={g∈GL(V):B(gv,gw)=B(v,w)}, or dimension m=2n≥2 with a nondegenerate alternating bilinear form B and G=Sp(V,B):={g∈GL(V):B(gv,gw)=B(v,w)}; here GL(V) is the group of invertible linear maps. Symmetric means B(v,w)=B(w,v); alternating means B(v,v)=0 for every v; nondegenerate means B(v,w)=0 for every w only when v=0. Put ϵ=1 in the symmetric case and ϵ=−1 in the alternating case. The assignments I↦id⁡V, X↦ϵP (where P(v⊗w)=w⊗v), A↦B, and U↦c define the usual G-equivariant Brauer contraction maps at parameter δ=ϵm. Bending gives a linear isomorphism Hom⁡G(V⊗a,V⊗b)≅(V⊗(a+b))G.

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.

[F1]

Typed Brauer and partition diagram categories: Brauer morphisms are typed perfect matchings composed by stacking with one factor δ per removed loop.

[F2]

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

1.1givenconstructalgebra

Choose a basis b1,…,bm and its B-dual basis bˉ1,…,bˉm, so B(bˉi,bj)=δij, and set c=∑ibi⊗bˉi. Nondegeneracy gives v=∑iB(v,bi)bˉi=∑iB(bˉi,v)bi, hence (B⊗id⁡)(id⁡⊗c)=id⁡V and (id⁡⊗B)(c⊗id⁡)=id⁡V. Invariance of B implies invariance of its inverse tensor c. Symmetry or alternation gives BP=ϵB and Pc=ϵc, while B(c)=∑iB(bi,bˉi)=ϵm.

2.1F1F2step 1.1

The maps P satisfy P2=1 and the braid relation because they permute tensor factors. Thus ϵP satisfies the crossing-square and braid relations; B(ϵP)=B and (ϵP)c=c give the cap-crossing and cup-crossing relations. On v⊗w⊗u, both sides of the cap-slide relation (A⊗I)(I⊗X)=(I⊗A)(X⊗I) equal ϵB(v,u)w. The dual slide relation (I⊗X)(U⊗I)=(X⊗I)(I⊗U) sends v on both sides to ϵ∑ibi⊗v⊗bˉi. Reflections give the other slide conventions. Both snake identities from step 1.1 and B(c)=ϵm give the straightening and loop relations. Therefore the assignments satisfy every relation in [F2] and extend to a monoidal functor with δ=ϵm.

3.1step 1.1algebra∎

For a basis multi-index I=(i1,…,ia) write bI=bi1⊗⋯⊗bia and bˉI=bˉi1⊗⋯⊗bˉia. Map a G-equivariant linear map T:V⊗a→V⊗b to ∑IbI⊗T(bˉI). The inverse sends a tensor ∑IbI⊗wI to x↦∑IB⊗a(x,bI)wI; the dual-basis identities in step 1.1 show both composites are identities. The maps commute with G because B and c 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