Burnside category¶
An additive category of finite G-sets whose morphisms are group-completed equivalence classes of equivariant spans composed by pullback.
Core Idea¶
For a fixed finite group (G), the Burnside category has finite (G)-sets as objects and formalized equivariant spans (X\leftarrow U ightarrow Y) as morphisms. Spans are identified up to equivariant apex isomorphism, added by disjoint union and group-completed, then composed by pullback. Two spans represent the same morphism when their apexes are related by a (G)-equivariant bijection commuting with both legs. Two spans represent the same morphism when their apexes are related by a (G)-equivariant bijection commuting with both legs.
How would you explain it like I'm…
Connections Through a Middle Collection
Span Category of Finite G-Sets
Scope of Application¶
The construction applies to equivariant algebra and homotopy settings where both covariant transfers and contravariant restrictions must coexist. The construction applies in equivariant algebra and homotopy theory when restrictions and transfers must be represented together.
- Mackey functors. Additive functors out of A(G) encode restriction–transfer structure.
- Equivariant stable homotopy. Finite G-set suspension spectra realize the category homotopically.
- Burnside ring theory. Point endomorphisms recover the classical ring.
- Equivariant representation examples. G-maps into a representation can form Mackey-functor values.
- Categorification. Objectwise span data retains structure collapsed by the Burnside ring.
Clarity¶
Fix G, name the objects, and specify whether homs are span classes before or after group completion. Draw both span legs with directions, state equivariance, and compute composition by the correct pullback. Distinguish additive disjoint union from symmetric-monoidal Cartesian product. The closest near miss sets the boundary: The Burnside ring is the closest near miss: it is the endomorphism ring of the one-point G-set, whereas the category retains morphisms among all finite G-sets.
Manages Complexity¶
The category packages induction-like and restriction-like behavior in one correspondence calculus. Group completion converts geometric disjoint union into additive algebra, while pullback enforces compositional compatibility and the point object recovers the familiar Burnside ring. The central functions–correspondences tradeoff is this: Spans encode two-directional behavior but complicate morphism identity. A second geometric union–formal subtraction tension matters because G-sets add concretely while group completion introduces virtual differences.
Abstract Reasoning¶
Use three linked moves: choose finite G-sets X and Y and enumerate equivariant span representatives; quotient by apex isomorphisms commuting with both legs; use disjoint union and group completion to form the hom-group. As a collapse test, the case exits when G-actions, span morphisms, group completion, or pullback composition are removed. A fourth check is to compose representatives by pulling back over the shared G-set. A final check is to check resulting functors preserve addition when interpreting Mackey data.
Knowledge Transfer¶
The span-and-pullback pattern transfers to other correspondence categories, but the Burnside name requires finite G-sets and the specified additive completion. Categorification and correspondence carry broader structure without fixing a canonical parent. No canonical parent prime is currently asserted; broader structural comparisons remain related-prime analogies until separately adjudicated in the DAG. A span relates endpoints through an apex. Pullback joins compatible correspondences.
Relationships to Other Abstractions¶
Current abstraction Burnside category Domain-specific
Parents (1) — more general patterns this builds on
-
Burnside category is a kind of Mathematical Category Domain-specific
Burnside category satisfies the defining boundary of Mathematical Category: A mathematical category is a structure consisting of objects, morphisms between objects, identity morphisms, and an associative partial composition law with matching domains and codomains, optionally enriched or equipped with additional categorical structure.
Hierarchy path (1) — routes to 1 parentless root
- Burnside category → Mathematical Category → Mathematical structure → Set and Membership
Neighborhood in Abstraction Space¶
Burnside category sits in a moderately populated region (44th percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.
Family — Abstract Algebra & Category Theory (24 abstractions)
Nearest neighbors
- FinSet — 0.90
- Alternating group — 0.87
- Ring — 0.86
- Mac Lane's coherence theorem — 0.86
- Topos — 0.86
Computed from structural-signature embeddings · 2026-10-08