Alphabeta Math
TheoremStatement: Literature-sourcedProof: 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.

A lax monoidal functor carries monoid objects to monoid objects

Statement

Let F:CD be a lax monoidal functor. If (M,μ,η) is a monoid object in C, then F(M) is a monoid object in D with multiplication

F(M)F(M)F2;M,MF(MM)F(μ)F(M)

and unit

1F0F(1)F(η)F(M).

Facts & Assumptions

Given: A lax monoidal functor F:CD and a monoid object (M,μ,η) in C.

[L1]

A lax monoidal functor has structure maps F2 and F0 satisfying associativity and unit compatibility (Lax, strong, and strict monoidal functors).

[L2]

A monoid object is defined by multiplication and unit maps satisfying associativity and unit diagrams (Monoid objects and comonoid objects in a monoidal category).

Proof

technique · direct
1.1

Define μ:=F(μ)F2;M,M and η:=F(η)F0. These are the only typed maps with the displayed source and target.

givenL1L2construct
2.1

For associativity, paste the lax associativity square for F with the image under F of the monoid-object associativity square for μ. Both composites from (F(M)F(M))F(M) to F(M) equal F(μ(1Mμ)αM,M,M) with the same inserted F2-maps. Hence μ is associative.

step 1.1L1L2
2.2

The left and right unit diagrams for η are obtained in the same way by pasting the lax unit squares with the image under F of the two unit diagrams for (M,μ,η). Thus η is a two-sided unit for μ.

step 1.1L1L2
3.1

Therefore (F(M),μ,η) is a monoid object in D.

step 2.1step 2.2L2

Depends on

Used by

Nothing in the library uses this result yet.

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