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.
Grothendieck-ring multiplication is well-defined
Statement
The rule is a well-defined unital associative product on .
Facts & Assumptions
Given: A tensor category .
Tensoring is exact in each variable (Tensor product in a multitensor category is biexact).
is the quotient by short-exact-sequence relations (The Grothendieck ring of a tensor category).
Proof
If is exact, then [F1] makes each of its tensors with exact. Thus , and similarly in the other variable.
Hence the bilinear rule on generators descends through the relations of [F2]. The associator and unitors identify with and with , so the descended product is associative with unit .
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
8 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
- Etingof, Gelaki, Nikshych, Ostrik, Tensor Categories, Lemma 4.5.1 (standard reference, not scraped)