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.

Structural Signature

Sig role-phrases:

• Object Λn — Represents a cyclic order with n+1 marked positions. It is carrier. Counterfactual: Using n positions rather than n+1 breaks the convention.
• Integer lift — Represents a monotone map on universal covers of circles. It is representation. Counterfactual: An arbitrary finite-set function need not preserve cyclic degree.
• Period equation — Forces source-period translation to map to one target period. It is constraint. Counterfactual: Another degree defines a different morphism class.
• Translation quotient — Identifies lifts giving the same circle map. It is equivalence. Counterfactual: Counting all lifts separately overcounts morphisms.
• Composition — Composes representatives compatibly with periodicity and quotient. It is operation. Counterfactual: A collection without associative composition is not the category.
• Contravariant functor — Defines cyclic sets or cyclic objects in a chosen target category. It is use. Counterfactual: A cyclic object is not itself an object Λn.

What It Is Not

• 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.
• Closest near-miss. The simplex category encodes finite linear orders and face/degeneracy maps; Λ extends this organization with cyclic rotation while changing its morphism structure.

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.

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.

Examples

Applied / In Practice

A nondecreasing integer map satisfying the period equation represents an oriented necklace map; translating its values by n+1 yields the same Λ-morphism.

Mapped back: degree → 1; quotient → target period.

Applied / In Practice

A contravariant functor from Λ to sets assigns compatible faces, degeneracies, and cyclic operators.

Mapped back: variance → contravariant; target → Set.

Applied / In Practice

A homomorphism between cyclic groups concerns algebraic operations and is not a morphism of Λ merely because both objects are cyclic.

Mapped back: category → groups.

Structural Tensions

T1 — Integer Representatives versus Geometric Circle Maps. Lifts support calculation while degree-one maps explain cyclic order.

Diagnostic: Has the translation equivalence been applied?

T2 — Linear Order versus Cyclic Symmetry. Adding rotation enriches the simplex pattern without choosing a permanent first point.

Diagnostic: Which operators depend on a basepoint?

Structural–Framed Character

Cyclic Category is structural: a formally presented category whose applications are framed by topology, homological algebra, and functor choice.

Structural Core vs. Domain Accent

The core is objects indexed by finite cyclic orders and degree-one monotone morphism classes. The domain supplies universal-cover lifts, period equations, functors, cyclic sets, self-duality, classifying spaces, and homology.

Instantiates / Related Primes

This entry is a kind of Mathematical structure.

• Approved root. The frozen graph lacks a category-theoretic parent licensed for Λ.

• Related — simplex category, cyclic set, cyclic object, circle group, classifying space, and cyclic homology. These supply comparison and applications.

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

Not to Be Confused With

• Cyclic Group. Tell: An algebraic group generated by one element, not this indexing category.
• Cycle Category in Graphs. Tell: Graph cycles and their maps use different objects and morphisms.
• Simplex Category. Tell: Uses finite linear orders and lacks the full cyclic operator.
• Circle Category. Tell: A loose phrase that does not specify Λ's periodic morphisms.

References

• Frozen Wikipedia discovery revision: https://en.wikipedia.org/wiki/Cyclic_category (revision 1222632796).
• Preserved source candidate: http://www.alainconnes.org/docs/n83.pdf
• Preserved source candidate: https://web.archive.org/web/20160304212700/http://www.alainconnes.org/docs/n83.pdf
• Preserved source candidate: http://www.alainconnes.org/docs/2000.pdf
• Preserved source candidate: https://books.google.com/books?id=KaLshoPoSlsC
• Preserved source candidate: http://ncatlab.org/nlab/show/cycle+category

The frozen Wikipedia revision is discovery provenance. The retained source set was reviewed for identity, formal or operational relation, and scope. The encyclopedia's structural synthesis is bounded to those claims; a thin authority surface is recorded as a nonblocking source-strengthening repair rather than concealed.