Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generated
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.

Finite semisimple 2-category

Definition

Let B be a weak linear 2-category. A monad on A in B is a 1-morphism T:A→A with 2-morphisms η:1A⇒T and μ:T∘T⇒T satisfying μ⋅(μ∗1T)=μ⋅(1T∗μ),μ⋅(η∗1T)=1T=μ⋅(1T∗η), where ⋅ is vertical composition, ∗ is horizontal composition, and the associator and unitors of B are inserted. Equivalently it is an algebra object in the monoidal endomorphism category B(A,A). This extends the ordinary-category definition in Monad on a category. It is separable if there is a 2-morphism σ:T⇒T∘T with μ⋅σ=1T,σ⋅μ=(μ∗1T)⋅(1T∗σ)=(1T∗μ)⋅(σ∗1T), again with coherent associators. The last two equalities say that σ is a map of regular T-bimodules.

An adjunction L⊣U in B, for L:A→B and U:B→A, consists of 2-morphisms η:1A⇒UL and ε:LU⇒1B with (ε∗1L)⋅(1L∗η)=1L,(1U∗ε)⋅(η∗1U)=1U, with associators and unitors inserted. These are the same triangle equations as in Adjunction by unit, counit, and the triangle identities, now for 1- and 2-morphisms of B. Its induced monad is (UL,η,1U∗ε∗1L).

A finite semisimple linear 2-category is a weak linear 2-category in which:

  • every hom category is a finite semisimple k-linear category (it has finitely many simple isomorphism classes, finite-dimensional hom spaces, and every object is a finite direct sum of simples);
  • there is a zero object, and each pair A,B has a biproduct A⊕B with inclusions and projections ιA,ιB,πA,πB satisfying πi∘ιj≅0 for i≠j, πi∘ιi≅1, and ιA∘πA⊕ιB∘πB≅1A⊕B; finite biproducts are preserved by composition;
  • every 1-morphism has both a left and a right adjoint (Adjunction by unit, counit, and the triangle identities), with unit and counit 2-morphisms satisfying the two triangle identities;
  • every separable monad has a separable splitting: a separable monad T:A→A is represented by an object AT and an adjunction L⊣U, where L:A→AT and U:AT→A, in the sense of Adjunction by unit, counit, and the triangle identities. Its induced monad UL is isomorphic to T as a monad, and its counit ε:LU⇒1AT has a section s:1AT⇒LU as a 2-morphism in B(AT,AT), with ε∘s=11AT (in a bimodule presentation this section is a bimodule map);
  • there are finitely many equivalence classes of simple objects, where an object A is simple when its identity 1-morphism is simple in B(A,A).

The splitting condition concerns monads in the 2-category; it is stronger than the existence of finite direct sums in each hom category. A choice of separable splitting is not part of the property.

Depends on

Used by

Dependency tree · two levels

12 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