Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-05
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 category enriched in the two-element lattice is a preordered set

Statement

Let 2={01} be the two-element lattice, regarded as a monoidal preorder with tensor product and unit 1. Then a 2-enriched category is exactly a preordered set.

Facts & Assumptions

Given: A 2-enriched category A or a preorder (P,).

[L1]

A preorder is a reflexive and transitive relation on a set (Preorder and monotone map).

[L2]

A V-category has a set of objects, hom-objects, enriched composition, and enriched identities (Enriched category over a monoidal base).

Proof

technique · direct
1.1

Let A be 2-enriched. Define a relation on its object set by ABA(A,B)=1. Because the unit object of the base is 1, the identity morphism of [L2] forces A(A,A)=1 for every A, so the relation is reflexive. Since composition in the base is , the composition morphism A(B,C)A(A,B)A(A,C) implies that if both hom-objects on the left are 1, then A(A,C)=1 on the right. So the relation is transitive. By [L1], it is a preorder.

L1L2given
1.2

Conversely, given a preorder (P,), put the object set equal to P and define the hom-object by A(x,y)=1 when xy and A(x,y)=0 otherwise. Reflexivity gives the identity maps, and transitivity gives the composition morphism because 11=1 exactly in the composable case. Thus the preorder data satisfy [L2].

L1L2algebra
2.1

The two constructions are inverse restatements of the same information, so 2-enrichment and preorder structure are equivalent.

step 1.1step 1.2

Depends on

Used by

Dependency tree · two levels

4 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