Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6-luna)
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.

Weak monoidal 2-category

Definition

A weak monoidal 2-category is a weak 2-category B together with the following data.

  1. A bilinear tensor pseudofunctor ⊗:B×B→B. On 1- and 2-morphisms it has invertible comparison 2-morphisms for composition and identities, natural in each variable and satisfying the pseudofunctor composition and unit equations.
  2. A unit object I.
  3. Pseudonatural equivalences aA,B,C:(A⊗B)⊗C→A⊗(B⊗C) and ℓA:I⊗A→A, rA:A⊗I→A. A pseudonatural transformation has a 1-morphism component at every object and an invertible naturality 2-morphism for every 1-morphism; the naturality squares for composites and identities commute. A modification between pseudonatural transformations has a 2-morphism component at every object, and its naturality square for each 1-morphism commutes. “Equivalence” means that an inverse pseudonatural transformation and invertible unit and counit modifications are supplied.
  4. An invertible pentagonator modification ΠA,B,C,D from the composite aA,B,C⊗D∘aA⊗B,C,D to (1A⊗aB,C,D)∘aA,B⊗C,D∘(aA,B,C⊗1D). There are three invertible unit modifications, with sources and targets λA,B:ℓA⊗B∘aI,A,B⟹ℓA⊗1B, ρA,B:rA⊗B⟹(1A⊗rB)∘aA,B,I, τA,B:(1A⊗ℓB)∘aA,I,B⟹rA⊗1B.

All pseudofunctor comparison maps, transformations, and modifications are natural in their object, 1-morphism, and 2-morphism inputs. Their equations are part of the structure: the pentagonator obeys the five-object coherence equation (the two pastings between the endpoints of the 4-dimensional associahedron agree); the three unit modifications obey the triangle and double-unit equations; and inserting a unit in the five-object equation agrees with those unit equations. The tensor pseudofunctor comparisons satisfy their composition, unit, and naturality equations. These are equalities of parallel 2-morphisms; they are not consequences of object-level associativity.

The ordinary associator pentagon is represented schematically below. In a weak monoidal 2-category its two boundary composites are compared by Π, rather than required to be literally equal.

diagram failed to render:
& (A\otimes B)\otimes(C\otimes D) \arrow[rr,"a_{A,B,C\otimes D}"] & & A\otimes(B\otimes(C\otimes D)) \\
((A\otimes B)\otimes C)\otimes D \arrow[ur,"a_{A\otimes B,C,D}"] \arrow[dr,"a_{A,B,C}\otimes 1_D"'] & & & \\
& (A\otimes(B\otimes C))\otimes D \arrow[r,"a_{A,B\otimes C,D}"'] & A\otimes((B\otimes C)\otimes D) \arrow[ur,"1_A\otimes a_{B,C,D}"'] &

This definition uses the weak presentation directly. It invokes no global strictification theorem.

Semistrict presentation

A Gray-monoid presentation is an alternative set of specified data; no strictification assertion is needed here. Its underlying linear 2-category is strict. It has an object I, strict linear 2-functors LA=A□− and RA=−□A for every object A, and invertible 2-cells ϕf,g:(f□B′)∘(A□g)⟹(A′□g)∘(f□B) for f:A→A′ and g:B→B′. Write a dot for vertical composition, with the rightmost factor applied first, and ∘ for horizontal composition and whiskering. The complete semistrict equations are as follows.

  1. LAB=RBA, denoted A□B.
  2. LI=RI=id, LALB=LA□B, RBRA=RA□B, and LARB=RBLA, as equalities of 2-functors.
  3. ϕf,1B=1f□B and ϕ1A,g=1A□g.
  4. For composable f,f′ and g,g′, ϕf′∘f,g=(ϕf′,g∘(f□B))⋅((f′□B′)∘ϕf,g), ϕf,g′∘g=((A′□g′)∘ϕf,g)⋅(ϕf,g′∘(A□g)).
  5. For α:f⇒f′ and β:g⇒g′, ϕf′,g⋅((α□B′)∘(A□g))=((A′□g)∘(α□B))⋅ϕf,g, ϕf,g′⋅((f□B′)∘(A□β))=((A′□β)∘(f□B))⋅ϕf,g.
  6. ϕA□g,h=A□ϕg,h, ϕf□B,h=ϕf,B□h, and ϕf,g□C=ϕf,g□C.

Thus even in this semistrict presentation the two tensors of 1-morphisms are compared by the specified interchanger; it is not discarded. The weak presentation above is used directly for the module-category and graded-vector-space constructions on this page.

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