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 orthogonal Brauer action has a kernel at dimension one and rank two

Example

Take k=Q, V=Qe with B(e,e)=1, G=O(V)={1,−1}, and tensor rank r=2. Then B2(1) has three distinct pairing basis diagrams, while End⁡G(V⊗2)≅Q is one-dimensional. The orthogonal contraction map sends all three diagrams to the scalar 1, so it is not injective. This is the first orthogonal failure, since r=2>m=1.

Facts & Assumptions

Given: The Brauer diagram basis convention and the contraction assignment, specialized to m=1 and r=2.

[F1]

Typed Brauer and partition diagram categories and Ranks of the Brauer and partition diagram bases: B2(1) is free on the three perfect matchings of its four boundary points.

[F2]

Typed Brauer and partition diagram categories: the product of two basis diagrams is obtained by stacking and contributes one factor δ per removed loop.

Verification

1.1givenF1algebra

Name the three matchings I (through identity), X (crossed through strands), and E (top cup and bottom cap). The orthogonal tensor assignment sends them to id⁡, P, and cB, respectively. On e⊗e, each is the identity because P(e⊗e)=e⊗e and cB(e⊗e)=e⊗e. Also O(V)={1,−1} acts trivially on V⊗2, whose endomorphism algebra is one-dimensional.

2.1F1F2step 1.1algebra∎

At δ=1, stacking any two of I,X,E gives one of these basis diagrams with coefficient 1 (the possible closed loop also has coefficient δ=1). Since all three images are the identity, this defines the contraction algebra map and its image is one-dimensional. Its domain has rank three by [F1] and Ranks of the Brauer and partition diagram bases, so the map has a two-dimensional kernel. For r=0 the map is Q→End⁡(Q) sending identity to identity, and for r=1 both B1(1) and End⁡O(V)(V) are one-dimensional with identity mapping to identity. Thus r=2=m+1 is the first failure.

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