Foundations of (A∞,2)-categories: from flow to linear

Abstract

This paper provides a blueprint for the construction of a symplectic (A∞,2)-category, Symp. We develop two ways of encoding the information in Symp -- one topological, one algebraic. The topological encoding is as an (A∞,2)-flow category, which we define here. The algebraic encoding is as a linear (A∞,2)-category, which we extract from the topological encoding. In upcoming work, we plan to use the adiabatic Fredholm theory developed by us to construct Symp as an (A∞,2)-flow category, which thus induces a linear (A∞,2)-category. The notion of a linear (A∞,2)-category developed here goes beyond the proposal of Bottman and Carmeli. The recursive structure of the 2-associahedra identifies faces with fiber products of 2-associahedra over associahedra, which led Bottman and Carmeli to associate operations to singular chains on 2-associahedra. The innovation in our new definition of linear (A∞,2)-category is to extend the family of 2-associahedra to include all fiber products of 2-associahedra over associahedra. This allows us to associate operations to cellular chains, which in particular enables us to produce a definition that involves only one operation in each arity, governed by a collection of (A∞,2)-equations.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…