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 , with , , and tensor rank . Then has three distinct pairing basis diagrams, while is one-dimensional. The orthogonal contraction map sends all three diagrams to the scalar , so it is not injective. This is the first orthogonal failure, since .
Facts & Assumptions
Given: The Brauer diagram basis convention and the contraction assignment, specialized to and .
Typed Brauer and partition diagram categories and Ranks of the Brauer and partition diagram bases: is free on the three perfect matchings of its four boundary points.
Typed Brauer and partition diagram categories: the product of two basis diagrams is obtained by stacking and contributes one factor per removed loop.
Verification
Name the three matchings (through identity), (crossed through strands), and (top cup and bottom cap). The orthogonal tensor assignment sends them to , , and , respectively. On , each is the identity because and . Also acts trivially on , whose endomorphism algebra is one-dimensional.
At , stacking any two of gives one of these basis diagrams with coefficient (the possible closed loop also has coefficient ). 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 the map is sending identity to identity, and for both and are one-dimensional with identity mapping to identity. Thus 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
- Lehrer and Zhang, The Brauer Category and Invariant Theory, Theorem 4.6 (standard reference, not scraped)