ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 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.

The cartesian monoidal structure on sets computed

Example

In $S e t$ , the tensor product is cartesian product and the unit object is a singleton set. For $X = {a, b}$ , $Y = {0, 1}$ , and $Z = {⋆, ⋄}$ one has

$X \otimes Y = X \times Y = {(a, 0), (a, 1), (b, 0), (b, 1)},$

and the associator and unitors are the usual rebracketing and projection bijections:

$α_{X, Y, Z} (((x, y), z)) = (x, (y, z)),$

$λ_{X} (*, x) = x, ρ_{X} (x, *) = x .$

Facts & Assumptions

Given: The cartesian monoidal structure on $S e t$ .

[L1]

$S e t$ is cartesian monoidal (Set, Cat, and every complete category are cartesian monoidal).

Verification

technique · direct

1.1L1

By [L1], tensor in $S e t$ is cartesian product, so the displayed set for $X \otimes Y$ is correct.

2.1step 1.1

The map $α_{X, Y, Z}$ sends each element of $((X \times Y) \times Z)$ to the same triple with the other bracketing, and its inverse is $(x, (y, z)) \mapsto ((x, y), z)$ .

3.1step 2.1∎

The maps $λ_{X} (*, x) = x$ and $ρ_{X} (x, *) = x$ are bijections with inverses $x \mapsto (*, x)$ and $x \mapsto (x, *)$ . So this concrete example realizes the cartesian monoidal structure exactly as claimed.

Depends on

Set, Cat, and every complete category are cartesian monoidal

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

5 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.