Alphabeta Math
TheoremStatement: 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.

Brauer diagram centralizers for full orthogonal and symplectic groups

Statement

Assume the Axiom of Choice (The Axiom of Choice).

Let k be algebraically closed of characteristic zero, and let V be as in Signed Brauer contraction functor and bending isomorphism: dimension m≥1 with a nondegenerate symmetric form and G=O(V), or dimension 2n≥2 with a nondegenerate alternating form and G=Sp(V). Use the full-group contraction functor from that item. For all nonnegative integers a,b, its image is Hom⁡G(V⊗a,V⊗b). Its kernel is the subspace obtained by bending the multilinear determinant relations of size m+1 in the orthogonal case, or the multilinear Pfaffian relations of size 2n+2 in the symplectic case. In particular, the endomorphism map Br(ϵm)→End⁡G(V⊗r) is surjective for every r≥0 and is injective exactly when r≤m for O(V) or r≤n for Sp(V). The kernel in each fixed algebra is the span of all bent relations in that rank. The tensor ideal generated by these relations means the family of subspaces in all morphism spaces closed under composition on either side and tensoring by arbitrary diagrams. No reverse-commutant theorem is asserted here.

Facts & Assumptions

Given: The Axiom of Choice and the full-group multilinear FFT/SFT and the Brauer contraction/bending maps.

[F1]

Multilinear orthogonal and symplectic FFT/SFT: multilinear contractions span, with the exact determinant/Pfaffian relation spans and stable ranges.

[F2]

Signed Brauer contraction functor and bending isomorphism: Brauer diagrams act by invariant contractions, and bending identifies intertwiners with invariant tensors.

Proof

1.1givenF1F2algebra

Put t=a+b. The snake identities in [F2] bend all input factors into output factors, giving inverse isomorphisms on diagram morphism spaces and on equivariant linear-map spaces. Identify invariant tensors with invariant multilinear forms by the nondegenerate form on each factor. Each bent basis diagram is then its matching contraction times a sign in {1,−1}, because crossings act by ϵ times the flip and caps by the form. The signs are units and the matching assignment is a bijection: bending changes boundary labels and introduces no closed component. Thus the linear map from the free matching space to the invariant forms is exactly the map of [F1], after invertible diagonal sign and boundary-order changes.

2.1F1F2step 1.1algebra

If t is odd the diagram space is zero, and [F1] makes the invariant target zero as well. If t is even, [F1] says that every invariant form is a sum of matching contractions. Bend their diagrams back using step 1.1 to obtain a preimage of every intertwiner. A linear combination maps to zero exactly when its bent contraction combination belongs to the determinant/Pfaffian relation span in [F1]. Undoing the same bend gives exactly the kernel asserted in the Statement. This holds for all a,b, including a=0 or b=0.

3.1F1F2step 2.1algebra∎

At a=b=r, the map is an algebra map because [F2] is a functor. The first isomorphism theorem gives Br(ϵm)/ker⁡ρr≅End⁡G(V⊗r). Injectivity is equivalent, by the invertible bends in step 1.1, to independence of the contractions on 2r labels. By [F1] this holds exactly for r≤m in the orthogonal branch and r≤n in the symplectic branch. The empty case r=0 is the scalar identity. The kernels in all boundary types form a tensor ideal since the functor sends a composite or tensor product containing a zero image to zero. Within each fixed algebra the described span is therefore automatically a two-sided ideal.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

10 results within two dependency steps 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