Table of Contents
Fetching ...

An elementary definition of opetopic sets

Taichi Uemura

TL;DR

The paper delivers an elementary, axiomatic framework for opetopic sets and opetopes, providing definitions that avoid heavy prerequisites and proving equivalence with the established polynomial-monad and generator-relations formulations. It shows that the category of opetopic sets is a presheaf category over the opetope category $\mathbb{O}$, and that $\mathbb{O}$ is terminal in $\mathbf{OSet}$ with $\mathbf{OSet} \simeq \mathbf{DFib}(\mathbb{O})$, enabling straightforward colimit computations. By developing boundaries, pasting diagrams, substitution, and grafting, the work unifies multiple viewpoints and demonstrates that the elementary opetopes coincide with the KJBM definition and with Ho Thanh’s presentation. The framework is constructive within Univalent Foundations, providing a clear, accessible path to higher-dimensional categorical structures and their presheaf semantics. Overall, the paper offers a concise, rigorous synthesis that clarifies and connects diverse definitions of opetopes and opetopic sets, with practical tools for computation and comparison across theories.

Abstract

We propose elementary definitions of opetopes and opetopic sets. We directly define opetopic sets by a simple structure and several axioms. Opetopes are then opetopic sets satisfying one more axiom. We show that our definition is equivalent to the polynomial monad definition given by Kock, Joyal, Batanin, and Mascari. We also show that our category of opetopes is equivalent to the one given by Ho Thanh.

An elementary definition of opetopic sets

TL;DR

The paper delivers an elementary, axiomatic framework for opetopic sets and opetopes, providing definitions that avoid heavy prerequisites and proving equivalence with the established polynomial-monad and generator-relations formulations. It shows that the category of opetopic sets is a presheaf category over the opetope category , and that is terminal in with , enabling straightforward colimit computations. By developing boundaries, pasting diagrams, substitution, and grafting, the work unifies multiple viewpoints and demonstrates that the elementary opetopes coincide with the KJBM definition and with Ho Thanh’s presentation. The framework is constructive within Univalent Foundations, providing a clear, accessible path to higher-dimensional categorical structures and their presheaf semantics. Overall, the paper offers a concise, rigorous synthesis that clarifies and connects diverse definitions of opetopes and opetopic sets, with practical tools for computation and comparison across theories.

Abstract

We propose elementary definitions of opetopes and opetopic sets. We directly define opetopic sets by a simple structure and several axioms. Opetopes are then opetopic sets satisfying one more axiom. We show that our definition is equivalent to the polynomial monad definition given by Kock, Joyal, Batanin, and Mascari. We also show that our category of opetopes is equivalent to the one given by Ho Thanh.

Paper Structure

This paper contains 16 sections, 82 theorems, 18 equations, 5 figures, 1 table.

Key Result

Lemma 3.1

[axiom]prop-oset-tree Let $A$ be an opetopic set and let $x : A$ be an object of degree $\ge 1$.

Figures (5)

  • Figure 1: Examples of opetopes of dimension $0$, $1$, and $2$
  • Figure 2: Example of opetope of dimension $3$, the pasting diagram of sources on the left and the target on the right.
  • Figure 3: Illustration of \ref{['ax-oset-homo', 'ax-oset-hetero']}. In Case \ref{['item-ss-st']}, $y$ is a source of the source $s$ of $x$ and a source of the target $t$ of $x$. In Case \ref{['item-ss-ts']}, $y$ is a source of the source $s'$ of $x$ and the target of the source $s$ of $x$. In Case \ref{['item-tt-st']}, $y$ is the target of the target $t$ of $x$ and a source of the target $t$ of $x$. In Case \ref{['item-tt-ts']}, $y$ is the target of the target $t$ of $x$ and the target of the source $s$ of $x$.
  • Figure 4: Illustration of \ref{['ax-oset-path']}. The pasting diagram on the left has the tree structure on the right. Dots and lines in the tree correspond to $2$-dimensional cells and $1$-dimensional cells, respectively, in the pasting diagram.
  • Figure 5: Examples of pasting diagrams and boundaries. $A$ is a $2$-pasting diagram, $\partial(A)$ is its boundary, and $\Lambda^{\mathrm{s}}(A)$ is its source horn. Leaves in pasting diagrams are marked with "$l$". The roots in pasting diagrams are marked with "$r$". The targets in boundaries are marked with "$t$".

Theorems & Definitions (179)

  • Definition 2.1
  • Remark 2.1
  • Definition 2.2
  • Definition 2.3
  • Definition 2.4
  • Definition 2.5
  • Definition 2.6
  • Definition 3.1
  • Lemma 3.1
  • proof
  • ...and 169 more