Papers
Topics
Authors
Recent
Search
2000 character limit reached

Pita Factorisation in Operadic Categories

Updated 4 January 2026
  • Pita factorisation is a canonical morphism decomposition technique in strictly factorisable operadic categories that uniquely factors any morphism into a quasi-bijection and an order-preserving map.
  • The method constructs a disjoint union of fibres with a canonical reordering, ensuring uniqueness via the universal property of the left adjoint reflection.
  • This factorisation underpins the construction of the pita nerve, guaranteeing coherent operadic nerves and enabling incidence bialgebra structures when quasi-bijections are invertible.

Pita factorisation is a canonical and uniquely determined morphism decomposition technique in strictly factorisable operadic categories. Given any morphism f:TSf:T\to S in such a category, pita factorisation expresses ff uniquely as a composite f=ηfπff = \eta_f \circ \pi_f, where πf\pi_f is a quasi-bijection (whose fibres are category-local terminal objects and is fibrewise order-preserving relative to ηf\eta_f) and ηf\eta_f is strictly order-preserving. This structure has substantial implications for the simplicial and algebraic behaviour of operadic categories, yielding the pita nerve (an oplax simplicial object in Cat), guaranteeing coherence properties of the operadic nerve, and, when quasi-bijections are invertible, a decomposition-space structure enabling incidence bialgebra constructions (Batanin et al., 28 Dec 2025).

1. Strictly Factorisable Operadic Categories and the Pita Factorisation Theorem

An operadic category O\mathcal O, in the sense of Batanin–Markl, consists of a category equipped with designated local terminal objects per component, a cardinality functor  ⁣ ⁣:OFin|\!-\!|:\mathcal O \to \mathsf{Fin} (where Fin\mathsf{Fin} refers to the skeletal category of finite ordinals), and fibre-objects/fibre-maps compatible with standard operadic axioms.

A morphism σ:TS\sigma:T\to S in O\mathcal O is a quasi-bijection if each fibre is a chosen local terminal object; λ:TS\lambda:T\to S is order-preserving if λ|\lambda| is order-preserving on the ordinal level.

The category O\mathcal O is strictly factorisable if each morphism f:TSf:T \to S admits a unique factorisation TπfTηfST \xrightarrow{\pi_f} T' \xrightarrow{\eta_f} S so that πf\pi_f is a quasi-bijection, ηf\eta_f is order-preserving, and πf\pi_f acts fibrewise order-preserving relative to ηf\eta_f.

The precise result: In strictly factorisable operadic categories, every morphism ff decomposes uniquely as f=ηfπff = \eta_f \circ \pi_f with πf\pi_f quasi-bijection and fibrewise order-preserving, ηf\eta_f strictly order-preserving. This is designated the pita factorisation.

2. Construction and Uniqueness of πf\pi_f and ηf\eta_f

Given f:TSf:T \to S where S={1,,n}|S| = \{1,\dots, n\}:

  • Each fibre f1(i)f^{-1}(i) has a cardinality and an order-preserving injection ϵf,i:f1(i)dom(f)\epsilon_{f,i}: f^{-1}(i) \longrightarrow \mathrm{dom}(f).
  • The sum of fibres T=iSf1(i)T' = \sum_{i\in |S|} f^{-1}(i) is formed as a disjoint union.
  • The canonical "re-ordering" bijection πf:TT\pi_f:T\to T' aligns elements of TT blockwise into the order structure of TT'.
  • The induced ηf:TS\eta_f: T' \to S maps each fibre-block entirely to the corresponding iSi \in |S| monotonically.

By the category axioms, (πf,ηf)(\pi_f, \eta_f) genuinely factors ff, and uniqueness follows because any other possible factorisation with the correct properties must coincide on cardinalities and thus on the underlying categorical structure in O\mathcal O due to the universal property of the left adjoint reflection rSr_S to the subcategory of order-preserving arrows over SS.

3. Key Properties and Supporting Lemmas

The pita factorisation displays several critical properties:

  • Identity under order-preservation: If ff is order-preserving, then πf=id\pi_f = \mathrm{id} and ηf=f\eta_f = f.
  • Naturality: In appropriate commutative diagrams arising from factorisations of composites gfgf, both horizontal arrows are quasi-bijections, and the relevant square is fibrewise order-preserving.
  • Idempotence and interaction: The assignments π( ⁣ ⁣)\pi(\!-\!), η( ⁣ ⁣)\eta(\!-\!) obey

π(π(f))=id,π(η(f))=id,η(π(f))=id,η(η(f))=η(f),\pi(\pi(f)) = \mathrm{id},\quad \pi(\eta(f)) = \mathrm{id},\quad \eta(\pi(f)) = \mathrm{id},\quad \eta(\eta(f)) = \eta(f),

and for composable f,gf, g: η(g)η(f/g)=η(gf)\eta(g)\,\eta(f/g) = \eta(gf).

These relations emanate from the reflection functor formalism and the universal property of the canonical factorisation.

4. The Pita Nerve as an Oplax (Top-Lax) Simplicial Category

Consider the category WnW_n of chains TnfnTn1fn1f1T0T_n \xrightarrow{f_n} T_{n-1} \xrightarrow{f_{n-1}} \dots \xrightarrow{f_1} T_0 and morphisms are fibrewise order-preserving quasi-bijection diagrams. The subcategory PnWnP_n \subset W_n consists of chains where each composite TkT0T_k \to T_0 is order-preserving.

The inclusions in:PnWni_n: P_n \hookrightarrow W_n admit left adjoints rnr_n, which iteratively apply the pita factorisation at the chain's final map; thus, PnP_n is a reflective subcategory of WnW_n.

The simplicial structure respects PnP_n except for the “top” face map, which instead requires passage via the monad tn1=in1rn1t_{n-1} = i_{n-1} r_{n-1} and the composite dn=rn1dnind_n = r_{n-1} d_n i_n.

A top-lax simplicial object in Cat\mathsf{Cat}, in this context, has categories XnX_n with standard face and degeneracy maps preserving all simplicial identities except those involving consecutive top-faces; replacement is via non-invertible comparison 2-cells βn\beta_n subject to coherence axioms.

For a strictly factorisable operadic category O\mathcal O, the sequence P(O)=(P0,P1,)P(\mathcal O)_\bullet = (P_0, P_1,\dots) with face-degeneracy maps and the βn\beta_n comparison 2-cells forms a top-lax simplicial category

P(O):ΔopCatP(\mathcal O): \Delta^{\mathrm{op}} \to \mathsf{Cat}

5. Coherence of the Operadic Nerve via Pita Factorisation

The operadic nerve Nop(O)N_{\mathrm{op}}(\mathcal O) is constructed as a simplicial object in the Kleisli category for the free symmetric strict monoidal category monad. Its pattern of non-strictness aligns precisely with the top-lax pattern of the pita nerve P(O)P(\mathcal O). Pita factorisation supplies the coherence data that lifts the top-lax structure to a coherent pseudo-simplicial groupoid—a normal oplax simplicial object in Gpd\mathsf{Gpd}.

Hence, all higher simplicial identities in the operadic nerve are controlled by invertible 2-cells dictated by the factorisation axioms, ensuring coherence necessary for applications such as the theory of decomposition spaces.

6. Invertible Quasi-Bijections and Decomposition Spaces

When all quasi-bijections in O\mathcal O are invertible:

  • Each Pn(O)P_n(\mathcal O) is a groupoid.
  • The top-lax simplicial category P(O):ΔopGpdP(\mathcal O):\Delta^{\mathrm{op}}\to\mathsf{Gpd} is a pseudo-simplicial groupoid with invertible comparison cells (Jardine’s supercoherence theorem applies).
  • P(O)P(\mathcal O) then becomes a decomposition space (aka 2-Segal space), characterized by strict Segal groupoid structure in the upper decalage Decu(P(O))\operatorname{Dec}^u(P(\mathcal O)) and pullback-square conditions rooted in the uniqueness of pita factorisation.

Such decomposition spaces possess well-behaved incidence coalgebras and bialgebras, enabling combinatorial enumerative and algebraic applications.

7. Worked Examples

Skeletal Finite Sets Fin\mathsf{Fin}

For O=Fin\mathcal O = \mathsf{Fin}, morphisms f:mnf: \underline m \to \underline n admit pita factorisation as blockwise reorderings—the “cut-and-reorder” paradigm. πf\pi_f establishes the block ordering, and ηf\eta_f is the monotone assignment by cardinalities.

Surjections Surj\mathsf{Surj}

For the category of surjective maps between finite sets, pita factorisation produces a bijection πf\pi_f and a monotone surjection ηf\eta_f. All quasi-bijections are invertible, so the pita nerve is a decomposition space; the associated incidence bialgebra relates to factorial-weighted Faà di Bruno structures.

Connected Graphs

In the category of connected graphs, morphisms combine edge contractions and indexing. Pita factorisation splits a morphism into a permutation-like reindexing (quasi-bijection) followed by edge-monotone contraction (order-preserving). The category supports strict factorisability and invertible quasi-bijections.


For further details, see Batanin–Kock–Weber “Pita factorisation in operadic categories” (Batanin et al., 28 Dec 2025), Batanin–Markl “Operadic categories and Koszul duality,” Garner–Kock–Weber “Operadic categories and decalage,” Galvez‐Carrillo–Kock–Tonks “Decomposition spaces, incidence algebras,” and Jardine “Supercoherence.”

Definition Search Book Streamline Icon: https://streamlinehq.com
References (1)

Topic to Video (Beta)

No one has generated a video about this topic yet.

Whiteboard

No one has generated a whiteboard explanation for this topic yet.

Follow Topic

Get notified by email when new papers are published related to Pita Factorisation.