Alphabeta Math
False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passaudited 2026-08-31
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.

Every monoidal category is strictly monoidally isomorphic to a strict one

Statement

False claim: every monoidal category is strictly monoidally isomorphic to a strict monoidal category.

Facts & Assumptions

Given: The strictification theorem and its scope boundary.

[L1]

Every monoidal category is monoidally equivalent to a strict monoidal category (Mac Lane strictification).

[L2]

Strictification does not turn a category into a strict one by merely identifying isomorphic objects (Strictification gives equivalence, not on-the-nose identification).

[L3]

The category of sets is monoidal under cartesian product (A category with finite products is monoidal).

Refutation

technique · direct
1.1

Suppose a strict monoidal isomorphism F:SetD existed with D strict. Strict preservation and strict associativity in D would give F((A×B)×C)=(F(A)F(B))F(C)=F(A)(F(B)F(C))=F(A×(B×C)). Since F is injective on objects, this would force (A×B)×C=A×(B×C) as literal sets for all A,B,C.

L2L3assume-contraalgebra
2.1

For nonempty sets under the usual ordered-pair construction, these two nested cartesian products are not literally equal: their elements have different bracketed pair shapes. This contradicts step 1.1.

step 1.1contradiction
3.1

Thus cartesian Set is not strictly monoidally isomorphic to a strict monoidal category, even though [L1] supplies a monoidal equivalence to one. Therefore the claim is false.

L1L3step 2.1discharge-contradiction

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

16 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