Table of Contents
Fetching ...

Quasi Modular Operads

Michelle Strumila

TL;DR

Quasi Modular Operads develops a graphical framework for infinity modular operads by equipping graphical sets with an inner Kan condition and proving its equivalence to the Segal condition. It constructs the graphical nerve and its left adjoint (modular realisation), then proves a Nerve Theorem linking graphical sets satisfying Segal or inner Kan conditions to modular operads, thereby providing a homotopy-coherent model for higher-genus operadic structures. The approach generalizes dendroidal and asteroidal formalisms to the modular setting and, with cyclic operads treated in Appendix, establishes a foundational bridge between graphical presheaves and classical operadic notions. The results enable robust, model-categorical treatments of infinity modular operads and their cyclic variants, with potential applications to surface-based operad theories and related algebraic topology constructs.

Abstract

Modular operads are an extension of operads. In the same way that operads, as dendroidal sets, can be considered as presheaves over the category of trees, so can modular operads be considered as presheaves over a category of graphs. This paper contains a definition of the Kan condition for infinity modular operads, as well as a proof of the Nerve Theorem for modular operads, and the equivalence of the modular Kan and Segal conditions. Appendix A contains the same material for cyclic operads.

Quasi Modular Operads

TL;DR

Quasi Modular Operads develops a graphical framework for infinity modular operads by equipping graphical sets with an inner Kan condition and proving its equivalence to the Segal condition. It constructs the graphical nerve and its left adjoint (modular realisation), then proves a Nerve Theorem linking graphical sets satisfying Segal or inner Kan conditions to modular operads, thereby providing a homotopy-coherent model for higher-genus operadic structures. The approach generalizes dendroidal and asteroidal formalisms to the modular setting and, with cyclic operads treated in Appendix, establishes a foundational bridge between graphical presheaves and classical operadic notions. The results enable robust, model-categorical treatments of infinity modular operads and their cyclic variants, with potential applications to surface-based operad theories and related algebraic topology constructs.

Abstract

Modular operads are an extension of operads. In the same way that operads, as dendroidal sets, can be considered as presheaves over the category of trees, so can modular operads be considered as presheaves over a category of graphs. This paper contains a definition of the Kan condition for infinity modular operads, as well as a proof of the Nerve Theorem for modular operads, and the equivalence of the modular Kan and Segal conditions. Appendix A contains the same material for cyclic operads.

Paper Structure

This paper contains 25 sections, 13 theorems, 36 equations, 4 figures.

Key Result

Lemma 3.8

Let $\phi: G \to G'$ be a graphical map, and denote by $\phi_v: H_v \hookrightarrow G'$ each $\phi_1(v) \in Emb(G')$. Then there is an embedding $G\{H_v\} \hookrightarrow G'$ which factors through each $\phi_v$.

Figures (4)

  • Figure 1: This map is an example of a map between graphs which is not étale.
  • Figure 2: This map is an example of a map between graphs which is étale but not an embedding. It sends $u_i$ to $u$, $v_i$ to $v$, and both $e$'s and $f$'s to $e$ and $f$
  • Figure 3: This map is not allowed by condition 3
  • Figure 4: The graph in brackets in inserted into the red vertex to form the new graph.

Theorems & Definitions (67)

  • Definition 2.1: Modular operad
  • Definition 2.2: Category of Modular operads, $\mathbf{ModOpd}$
  • Example 2.3: Monochromatic modular operad
  • Definition 3.1: Graph
  • Definition 3.2: barbell
  • Definition 3.3: Étale
  • Definition 3.4: Embedding
  • Definition 3.5: Emb
  • Definition 3.6: Vertex sum $\varsigma$
  • Definition 3.7: Graphical map
  • ...and 57 more