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 lax monoidal functor induces change of base on enriched categories

Statement

Let F:V→W be a lax monoidal functor. Every V-category A determines a W-category F∗A with the same objects and hom-objects (F∗A)(A,B):=F(A(A,B)).

Facts & Assumptions

Given: A lax monoidal functor F:V→W and a V-category A.

[L1]

A lax monoidal functor provides comparison morphisms F(X)⊗F(Y)→F(X⊗Y) and 1W→F(1V) compatible with associativity and the unitors (Lax, strong, and strict monoidal functors).

[L2]

A V-category is specified by hom-objects, composition maps, and identity maps satisfying the usual enriched diagrams (Enriched category over a monoidal base).

Proof

technique · direct
1.1L2given

Keep the same object set as A and define the new hom-object from A to B to be F(A(A,B)).

1.2L1L2construct

Use the laxity morphism of [L1] to send F(A(B,C))⊗F(A(A,B)) into F(A(B,C)⊗A(A,B)), then follow with F(MA,B,C) to obtain the new enriched composition map. Use the unit morphism 1W→F(1V) followed by F(jA) for the new enriched identity.

2.1L1L2step 1.2∎

The coherence axioms of [L1] ensure that applying F to the associativity and unit diagrams of [L2] yields the corresponding diagrams in W. Thus the data of steps 1.1 and 1.2 define a W-category.

Depends on

Used by

Dependency tree · two levels

6 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