Alphabeta Math
False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passaudited 2026-09-04
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: a braiding suffices to define a trace

Statement

A braiding on a monoidal category, without rigidity, suffices to define a categorical trace.

Facts & Assumptions

Given: The symmetric monoidal category Vectk of all vector spaces and its infinite-dimensional object k[x].

[L1]

The trace formulas require evaluation and coevaluation maps (What is needed before a trace can be written).

[L2]

The symmetric monoidal category of all vector spaces has an infinite-dimensional object with no categorical dual (Not every monoidal category is rigid).

Refutation

technique · direct
1.1givenL2

The usual symmetry makes Vectk braided, but [L2] shows that its object k[x] has no evaluation and coevaluation satisfying the zig-zag identities.

2.1L1step 1.1

Consequently the trace composites described in [L1] cannot even be formed for k[x]. The braiding supplies swaps but does not supply the missing duality maps.

3.1step 2.1∎

Therefore braiding without rigidity does not suffice to define categorical trace. The statement is false.

Depends on

Used by

Nothing in the library uses this result yet.

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