Equivalence between lax algebras for parametrised endofunctors and iterated monads
Equivalence between lax algebras for parametrised endofunctors and iterated monads
Let be a cartesian monoidal category, let be an -actegory, and let be a strong endofunctor on such that and satisfy the hypotheses of the stated Kelly theorem. For a lax algebra for , let carry the comonoid structure
Equivalence conjecture. The assignment sending to the corresponding lax algebra for ,
defines an equivalence of categories
The claim identifies lax algebras for parametrised endofunctors with lax algebras for the associated iterated monad, using the induced comonoid of parameters. Its resolution depends on the hypotheses invoked from the Kelly theorem and the construction of the displayed lax limit; the supplied text gives no status evidence beyond the statement itself.
Sources & referencesView supporting material
Primary source
Bruno Gavranović, Paul Lessard, Andrew Dudzik, Tamara von Glehn, João G. M. Araújo and Petar Veličković, “Position: Categorical Deep Learning is an Algebraic Theory of All Architectures”, arXiv:2402.15332 (2024).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.