Cyclic Category

The category of finite cyclically ordered sets and degree-one monotone maps, represented by periodic integer lifts modulo target-period translation.

Version

v1 · 2026-09-28 · History

Domain-specific #

8823

Domain group

Formal Sciences

Origin domain

Mathematics

Subdomains

Category Theory, Algebraic Topology → Mathematics

Core Idea

The cyclic category Λ has a standard object Λn for each n≥0, viewed as n+1 cyclically ordered positions. A morphism Λm→Λn can be calculated using a nondecreasing integer lift whose value advances by n+1 whenever its argument advances by m+1.

Different lifts that differ by a target-period translation represent the same map. This category extends simplicial organization with cyclic symmetry, and contravariant functors from it define cyclic sets and cyclic objects used in cyclic homology.

How would you explain it like I'm…

Bead Bracelet Pointing

Imagine bracelets with beads on them, some with more beads and some with fewer. You make rules for pointing each bead on one bracelet to a bead on another bracelet, always moving around the same way and going around just once, never backward. The cyclic category is the whole collection of these bracelets and all those pointing rules.

Maps Between Circles of Points

Mathematicians have a way of organizing lists of points in a row, and the rules for matching one row to another while keeping them in order. The cyclic category does the same thing for points arranged in a circle, like seats around a round table. It has one circle of seats for each size, and its maps move seats of one circle onto seats of another, keeping them in clockwise order, which can wrap around the circle. To work a map out, you can unroll the circles into lines that repeat forever and use a rule that only goes forward. Two unrolled rules that differ just by a full lap describe the same map.

Category of Cyclic Orders

The cyclic category, written Λ, has one standard object Λn for each n ≥ 0, which you can think of as n+1 positions arranged in a cycle. A map from Λm to Λn sends positions of the first cycle to positions of the second while respecting cyclic order. To calculate such a map, you unroll both cycles onto the integers and use a nondecreasing function that advances by n+1 whenever its input advances by m+1, so going once around the source means going once around the target. Two such lifts that differ by shifting by a full period of the target describe the same map. The cyclic category extends the simplicial category, which handles ordered lists, by adding cyclic symmetry. Functors out of it (contravariantly) are called cyclic sets or cyclic objects, and they are the basic tool for defining cyclic homology.

 

The cyclic category Λ is a small category with one object Λn for each n ≥ 0, thought of as n+1 points in cyclic order. A morphism Λm → Λn can be encoded by a nondecreasing function f: ℤ → ℤ satisfying f(i + m + 1) = f(i) + n + 1, i.e., a lift that advances by one full target period whenever its argument advances by one full source period. Lifts that differ by a translation by a multiple of n+1 represent the same morphism, so a morphism is an equivalence class of such lifts. Λ contains the simplicial category Δ of finite linear orders and adds cyclic symmetry, notably the rotation automorphisms of each Λn. Contravariant functors from Λ into a category—cyclic sets, cyclic objects—refine simplicial objects with a compatible cyclic action and are the organizing structure behind cyclic homology.

Scope of Application

• Cyclic homology. Uses cyclic objects to encode rotation-compatible algebraic data.
• Category theory. Studies Λ's self-duality and classifying space.
• Simplicial methods. Relates cyclic and simplicial operators.
• Topological models. Interprets morphisms as degree-one monotone circle maps.
• Combinatorics. Counts morphism classes between finite cyclic orders.

Clarity

State the Λn indexing convention, direction of morphism, monotonicity, periodicity equation, translation equivalence, and variance of any functor. Distinguish a lift from its equivalence class. Inclusion test: Require the standard objects Λn and degree-one monotone morphism classes with the periodic-lift equation and translation equivalence, composed categorically. Exclusion test: Exclude the cyclic group category, a single cyclic order, arbitrary maps of necklaces, the simplex category without cyclic operators, and degree-k circle maps when k differs from one. Nearest boundary: The simplex category encodes finite linear orders and face/degeneracy maps; Λ extends this organization with cyclic rotation while changing its morphism structure. Exit condition: The identity fails if periodic degree-one compatibility or the quotient on lifts is removed. Common misclassifications: It is not the category of cyclic groups. It is not one finite cycle graph. It is not the simplex category unchanged. It is not arbitrary continuous maps of the circle. Nearest named distinctions: Cyclic Group: An algebraic group generated by one element, not this indexing category. Cycle Category in Graphs: Graph cycles and their maps use different objects and morphisms. Simplex Category: Uses finite linear orders and lacks the full cyclic operator. Circle Category: A loose phrase that does not specify Λ's periodic morphisms.

Manages Complexity

The category packages all finite cyclic subdivisions and compatible maps into one algebraic index. It lets cyclic symmetry be manipulated functorially without choosing coordinates on every necklace.

Abstract Reasoning

1. Choose source Λm and target Λn.
2. Represent a proposed map by a nondecreasing integer lift.
3. Verify the source-to-target period equation.
4. Quotient lifts by target-period translation.
5. Compose representatives and confirm independence of choice.
6. Apply the resulting category through a covariant or contravariant functor as declared.

Knowledge Transfer

The transferable cargo is cyclic order encoded by periodic lifts and a quotient. It transfers to cyclic objects in different target categories; group-theoretic cyclicity and graph cycles do not inherit these morphisms.

Relationships to Other Abstractions

Current abstraction Cyclic Category Domain-specific

Parents (1) — more general patterns this builds on

• Cyclic Category is a kind of Mathematical structure Domain-specific

  Cyclic Category is a strict kind of Mathematical structure: its frozen identity entails the parent's defining structure while adding domain-specific restrictions.

Hierarchy path (1) — routes to 1 parentless root

• Cyclic Category → Mathematical structure → Set and Membership

Neighborhood in Abstraction Space

Cyclic Category sits in a crowded region of the domain-specific corpus (35^th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Algebraic Structures & Homological Invariants (15 abstractions)

Nearest neighbors

• Cohomology Ring — 0.88
• Rauzy Fractal — 0.88
• Mapping Cylinder — 0.88
• Semidirect Product — 0.88
• Prism graph — 0.88

Computed from structural-signature embeddings · 2026-10-08