Strictification¶
A coherence-backed replacement of a weak categorical structure by a stricter presentation under a specified structure-preserving equivalence.
Core Idea¶
Strictification replaces a weak categorical structure, whose associativity or unit laws hold up to coherent isomorphism, with a stricter presentation under a specified structure-preserving equivalence. Every monoidal category is monoidally equivalent to a strict one; every bicategory is biequivalent to a strict 2-category. These theorems do not say that the original structure itself becomes literally strict.[ref-3dc4a0cc9acc][ref-ee4a9e5ec42c]
Scope of Application¶
The construction applies where a scope-specific coherence theorem establishes the replacement and its equivalence. The monoidal case is already part of live Mac Lane’s Coherence Theorem; this entry captures the broader categorical replacement pattern. Not every tricategory is triequivalent to a strict 3-category, though a Gray-category replacement is available.[^ref-ee4a9e5ec42c]
Clarity¶
Ordinary vector-space tensor products \((U\otimes V)\otimes W\) and \(U\otimes(V\otimes W)\) are isomorphic through an associator, not literally identical. A strict monoidal replacement has equality in its own presentation and is related back by monoidal equivalence. The distinction between replacement equality and original isomorphism matters.[ref-2c86f104baf2][ref-3dc4a0cc9acc]
Manages Complexity¶
Strict replacement suppresses repeated coherence bookkeeping in suitable calculations and proofs. The comparison back to the original must be justified by the relevant equivalence, and any transferred property must be invariant under it.[ref-3dc4a0cc9acc][ref-ee4a9e5ec42c]
Abstract Reasoning¶
The pattern is coherent weak laws, a theorem-backed stricter object, and a level-appropriate equivalence between them. Monoidal equivalence and biequivalence are not interchangeable names. The general tricategorical limit prevents extrapolating a universal full strictification law from lower dimensions.[ref-3dc4a0cc9acc][ref-ee4a9e5ec42c]
Knowledge Transfer¶
Vector spaces under tensor supply the monoidal setting: associators/unitors are replaced by strict laws in an equivalent presentation. Spans composed by pullback supply a bicategory setting: associativity is only up to natural isomorphism, yet a biequivalent strict 2-category exists by the bicategory theorem. Both cases instantiate replacement under equivalence, not in-place equality.[ref-2c86f104baf2][ref-713d0140fd22][^ref-ee4a9e5ec42c]
[^ref-3dc4a0cc9acc]: Chris Heunen and Jamie Vicary, Categorical Quantum Mechanics: An Introduction (Oxford lecture notes, 2015), Chapter 1 §1.3.3, Theorem 1.31. [^ref-ee4a9e5ec42c]: Nick Gurski, “The Monoidal Structure of Strictification,” Theory and Applications of Categories 28(1), 1–23 (2013), Introduction. [^ref-2c86f104baf2]: John C. Baez, Week 12 categorical lecture, vector-space tensor and associator discussion. [^ref-713d0140fd22]: Michael Stay, Physics and Computation (University of Auckland PhD thesis, 2015), printed p. 115 / PDF p. 126.
Neighborhood in Abstraction Space¶
Strictification sits in a sparse region of the domain-specific corpus (66th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.
Family — Abstract Algebra & Category Theory (24 abstractions)
Nearest neighbors
- Mac Lane's coherence theorem — 0.86
- Basic Category — 0.84
- Prototype-matching — 0.84
- Coherency (homotopy theory) — 0.83
- S2P (complexity) — 0.83
Computed from structural-signature embeddings · 2026-10-08