symmetric monoidal (∞,1)-category of spectra
An indexing system is a combinatorial datum which uniquely determines an N-∞ operad.
In the following definition, fix an orbital ∞-category and its finite-coproduct closure; for instance, may be the orbit category of a finite group, in which case is the category of finite G-sets.
A subcategory is called an indexing system if
(-action) contains the core .
(Segal condition and restrictions) is stable under binary coproducts and pullbacks along arbitrary morphisms.
(Binary multiplications) contains the fold map for all .
Recall that induction yields an equivalence for each subgroup . Given an indexing system, and we refer to the corresponding subcategory
The following was proved in Blumberg-Hill 16.
There is a unique -subcategory ; furthermore, this outlines an equivalence between the poset of indexing systems and the poset of full -subcategories which contain trivial -sets and are closed under coproducts, finite limits, and self-induction.
Let be the subgroup lattice of . We say that a subposet is a \emph{transfer system} if it is closed under conjugation and restriction.
Given an indexing system, we let denote the subposet consisting of inclusions such that the corresponding map is in . The following theorem was independently proved by Rubin and Balchin-Barnes-Roitzheim.
is a transfer system, and this outlines an equivalence of posets
The poset of subcommutative G-∞ operads containing corresponds with ; these are called N-∞ operads (see the linked page for details).
(…)
(…)
Originally,
Further characterization,
Andrew Blumberg, Michael Hill, Incomplete Tambara functors, (arXiv:1603.03292)
Jonathan Rubin, Characterizations of equivariant Steiner and linear isometries operads, (arXiv:1903.08723v2)
Scott Balchin, David Barnes, Constanze Roitzheim, -operads and associahedra, (arXiv:1905.03797)
Over orbital categories,
Last revised on May 12, 2024 at 00:32:03. See the history of this page for a list of all contributions to it.