Alphabeta Math
False statementConstruction: AI-adaptedVerification: AI-generatedprecheck pass
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.

FALSE: the left and right traces always agree

Statement

The left and right traces always agree.

Facts & Assumptions

Given: The tensor category of finite-dimensional Z-graded vector spaces and a scalar q∈k× with q≠±1.

[L1]

In spherical tensor categories over an algebraically closed field the left and right traces agree (In a spherical category the left and right traces agree).

Refutation

technique · direct
1.1givenconstruct

Let C be the tensor category of finite-dimensional Z-graded vector spaces over a field k, and fix q∈k× with q≠±1. The usual double-dual map is a pivotal structure, and multiplying its component on degree-n vectors by qn gives another pivotal structure a′.

2.1step 1.1algebra

Let X=k[1] be the one-dimensional object concentrated in degree 1. Then X∨=k[−1], so dim⁡a′(X)=q,dim⁡a′(X∨)=q−1. Since q≠q−1, the pivotal structure a′ is not spherical.

3.1step 2.1L1∎

For the identity endomorphism 1X, the two trace expressions are exactly those two dimensions: Tr⁡L(aX′1X)=q,Tr⁡R(1X(aX′)−1)=q−1. They are unequal, so left and right traces do not always agree. This also supplies a witness over k=C, within the ground-field convention of In a spherical category the left and right traces agree; the pivotal structure is deliberately non-spherical.

Depends on

Used by

Dependency tree · two levels

6 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