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.
Lax, strong, and strict monoidal functors
Definition
Let and be monoidal categories (Monoidal category).
A lax monoidal functor is a functor (Covariant functor, identity functor, composite functor, and contravariant functor) together with natural transformations (Natural transformation and its components)
and
the morphism
such that, for all ,
A lax monoidal functor is strong monoidal when the natural transformation is a natural isomorphism (Natural isomorphism)—equivalently, every component is an isomorphism—and is an isomorphism.
A strong monoidal functor is strict monoidal when the functor preserves the unit and tensor on the nose and every structure map above is an identity.
Depends on
Used by
- Monoidal equivalence and monoidal quasi-inverse data Definition
- Monoidal natural transformation Definition
- The power-set functor is lax monoidal but not strong Example
- FALSE: every lax monoidal functor has invertible structure maps False statement
- Why the bare phrase 'monoidal functor' is ambiguous across sources Remark
- A lax monoidal functor carries monoid objects to monoid objects Theorem
- Lax monoidal functors compose, and composition preserves strength and strictness Theorem
Dependency tree · two levels
10 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
- P. Etingof, S. Gelaki, D. Nikshych, and V. Ostrik, Tensor Categories, Definitions 2.4.1 and 2.4.5 (standard reference, not scraped)
- S. Mac Lane, Categories for the Working Mathematician, Chapter XI.2 (standard reference, not scraped)