Alphabeta Math
ExampleConstruction: AI-generatedVerification: 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.

The first symplectic Brauer relation in dimension two

Example

Let V=Q2 with ω((x,y),(x′,y′))=xy′−yx′, and put G=Sp(V,ω)={g∈GL(V):ω(gv,gw)=ω(v,w)}. For four vectors, write pij=ω(vi,vj). Then p12p34−p13p24+p14p23=0. This is a nonzero linear combination of the three distinct pairing basis vectors in B2(−2), so the symplectic contraction map is not injective at r=2>n=1.

Facts & Assumptions

Given: The symplectic contraction convention, the standard form above, and the three pairings of four boundary labels.

[F1]

Typed Brauer and partition diagram categories and Ranks of the Brauer and partition diagram bases: the three pairings form distinct basis vectors of B2(−2).

[F2]

Typed Brauer and partition diagram categories: at parameter δ=−2, stacking the cup-cap diagram with itself contributes one loop and hence coefficient −2.

Verification

1.1givenalgebra

Write vi=(xi,yi). Then pij=xiyj−yixj. Expanding the left side gives six cancelling pairs of monomials: x1x3y2y4 with −x1x3y2y4, −x1x4y2y3 with x1x4y2y3, −x1x2y3y4 with x1x2y3y4, −x2x3y1y4 with x2x3y1y4, x2x4y1y3 with −x2x4y1y3, and −x3x4y1y2 with x3x4y1y2. Thus the multilinear contraction combination vanishes.

1.2givenF2algebra

Name the three endomorphism diagrams I,X,E as in the companion convention. In the symplectic tensor representation they act as id⁡,−P,cω, where c=−e1⊗e2+e2⊗e1. The map respects their multiplication table: X2=I, XE=EX=E, and E2=−2E, the last equality following from ω(c)=−2 and [F2]. Moreover I+X+E annihilates e1⊗e1, e2⊗e2, e1⊗e2, and e2⊗e1, so it is the zero operator.

2.1F1step 1.2algebra∎

The element I+X+E is nonzero in the free Brauer module because its three coefficients on distinct basis diagrams are nonzero; [F1] gives the matching count three. At r=0 the action is Q→End⁡(Q) and is an isomorphism. At r=1, B1(−2) is spanned by the identity diagram. For a 2×2 matrix M, MT(01−10)M=(det⁡M)(01−10), so both diag⁡(2,1/2) and (1101) lie in Sp2(Q). A matrix commuting with the first is diagonal; if it also commutes with the second, its diagonal entries are equal. Hence End⁡Sp2(V)=Qid⁡ and the rank-one diagram action is an isomorphism. Therefore the nonzero kernel at r=2=n+1 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