Alphabeta Math
CounterexampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-01
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 M3={0,p,q,r,1} with 0<p,q,r<1 and p,q,r pairwise incomparable.

[L1]

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

[L2]

In a lattice, binary meets exist and are written ∧ (Lattices, distributive lattices, and order ideals).

[L3]

Right closed means that, for each fixed object X, the functor −⊗X has a right adjoint (Left-closed, right-closed, and biclosed monoidal categories).

Counterexample

technique · direct
1.1givenL1L2

In M3, the meet operation satisfies p∧q=0, p∧r=0, and p∧1=p, while q and r are incomparable below 1. By [L1] and [L2], the associated poset-category is a strict monoidal category with tensor product ∧ and unit 1.

2.1step 1.1givenalgebra

Fix X:=p and Y:=q. An object a satisfies a∧p≤q exactly when a∈{0,q,r}: this holds for 0,q,r, fails for 1 because 1∧p=p≰q, and fails for p because p∧p=p≰q.

3.1step 2.1L3algebra∎

The set {0,q,r} has no greatest element, since q and r are incomparable and both dominate 0. Therefore there is no object [p,q] with a≤[p,q] iff a∧p≤q, so the functor −∧p has no right adjoint. By [L3], this monoidal category is not right closed and hence not closed.

Depends on

Used by

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