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.
A monoidal category need not be closed
Statement refuted
Every monoidal category is closed.
Facts & Assumptions
Given: The five-element diamond lattice with and pairwise incomparable.
A poset with top element and binary meets becomes a strict monoidal category under meet (A poset with finite meets is a strict monoidal category).
In a lattice, binary meets exist and are written (Lattices, distributive lattices, and order ideals).
Right closed means that, for each fixed object , the functor has a right adjoint (Left-closed, right-closed, and biclosed monoidal categories).
Counterexample
In , the meet operation satisfies , , and , while and are incomparable below . By [L1] and [L2], the associated poset-category is a strict monoidal category with tensor product and unit .
Fix and . An object satisfies exactly when : this holds for , fails for because , and fails for because .
The set has no greatest element, since and are incomparable and both dominate . Therefore there is no object with iff , so the functor has no right adjoint. By [L3], this monoidal category is not right closed and hence not closed.
Depends on
Used by
- FALSE: every monoidal category is closed False statement
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
- Emily Riehl, Category Theory in Context, 2nd ed., Section 4.4 (standard reference, not scraped)
- P. Etingof, S. Gelaki, D. Nikshych, and V. Ostrik, Tensor Categories, Example 2.3.12 (standard reference, not scraped)