Skip to content

Cyclically Ordered Group

Equip a group with a ternary cyclic order that is preserved by multiplication on both sides, making the algebraic translations act as orientation-preserving symmetries of a circle-like order.

Version
v2 · 2026-09-19 · History
Domain-specific #
1612
Domain group
Formal Sciences
Origin domain
Mathematics
Subdomain
Ordered Group Theory → Mathematics
Aliases
Cyclic ordered group, Circle-ordered group

Core Idea

A Cyclically Ordered Group is a group equipped with a cyclic order that is invariant under multiplication on both the left and the right. A cyclic order is a ternary relation recording that three distinct elements occur in a specified orientation around a circle. Unlike a linear order, it has no first or last point. Compatibility requires every algebraic translation to preserve this orientation: multiplying all three entries by the same group element, on either side, does not reverse or disrupt their cyclic arrangement.

How would you explain it like I'm…

The Friendship Circle Group

Picture friends standing in a circle. Going around, you can say who comes after whom, but nobody is first. If everyone takes the same number of steps around the circle, the order going around stays exactly the same. A cyclically ordered group is a set of things that you can combine, arranged around a circle like that, where combining everything with the same thing never mixes up the going-around order.

Circle Order That Stays Put

A cyclically ordered group mixes two ideas. First, it is a group: things you can combine and undo, like turning a wheel by some amount. Second, it has a circular order: for any three different elements, you can say which way they go around a circle, clockwise or counterclockwise, but there is no first or last element. The two ideas must fit together: combining all three elements with the same element, on either side, never flips their direction around the circle. The main example is turning around a circle: if you rotate every point by the same amount, the clockwise order stays the same.

Group With Compatible Circular Order

A cyclically ordered group is a group together with a cyclic order that stays unchanged when you multiply on the left or on the right. A cyclic order is a relation on triples: it says whether three distinct elements a, b, c go around a circle in the order a → b → c, and unlike a linear order it has no first or last element. The compatibility rule says that multiplying all three by the same group element, on either side, never reverses their orientation. The standard example is the circle group, the real numbers modulo 1 with addition, where rotating every point by the same amount preserves circular order. Finite cyclic groups have a natural version too, and any linearly ordered group becomes cyclically ordered if you forget which point is 'first.' But having a generator that loops around doesn't by itself give this structure; the compatible order has to be supplied.

 

A cyclically ordered group is a group G equipped with a cyclic order, a ternary relation [a, b, c] indicating that three distinct elements occur in a given orientation around a circle, satisfying the cyclicity, asymmetry, transitivity, and totality axioms, such that the relation is invariant under both left and right translation: [a, b, c] implies [ga, gb, gc] and [ag, bg, cg]. The circle group R/Z under addition, with its orientation, is the canonical example; finite cyclic groups inherit an analogous orientation, and any linearly ordered group induces a cyclic order by forgetting which point is first. A group together with an unrelated circular arrangement does not qualify, and a cyclic group does not qualify automatically because a generator cycles through it; the compatible order must be supplied. A central structural result, due to Rieger and Świerczkowski, is that circular order can be unwrapped: a cyclically ordered group arises as a quotient of a linearly ordered covering group by a central cofinal cyclic subgroup, wrapping the line into a circle. Conversely, cyclically ordered groups embed into products involving the circle group and a linearly ordered group.

Scope of Application

The home domain is ordered group theory, at the intersection of group theory and order theory. The concept is used to classify groups acting faithfully by orientation-preserving transformations of circular orders, relate linearly ordered and circularly ordered algebra, study completions and products, and connect group structure with circle topology.

Finite cyclic groups illustrate discrete circular order. The infinite cyclic group can carry a cyclic order induced from its usual linear order, though its Archimedean behavior in the cyclic sense differs from the linear case. The additive rationals and reals provide linearly ordered examples whose order induces a cyclic one.

Clarity

A cyclic order applies to triples, not pairs. On a circle, “a comes before b” is incomplete until a cut or third reference point is supplied. [a,b,c] means that following the chosen orientation one encounters b after a and before c, up to cyclic rotation of the triple.

Manages Complexity

The abstraction lets circular geometry and reversible composition be reasoned about in one language. Group operations provide translations and inverses; cyclic order provides orientation without an arbitrary origin. Compatibility guarantees that algebraic manipulation does not invalidate order statements.

The unwinding/quotient representation converts a circular problem into a linear one while recording full turns through a central element. This separates local orientation from winding count and imports tools from linearly ordered groups.

Abstract Reasoning

  1. If [a,b,c] holds, left multiplying by any x preserves the orientation of the triple.
  2. If right invariance fails, the structure is not a cyclically ordered group under the two-sided definition even if left translations preserve order.
  3. If a group is abelian, the distinction between left and right translation disappears.
  4. If a cyclic order is induced by a linear order, changing the arbitrary cut does not change the circular orientation relation.

Knowledge Transfer

The concept transfers literally within ordered algebra, group actions on circularly ordered sets, circle dynamics, and algebraic logic when the same group-plus-cyclic-order axioms are present. It does not transfer merely because a process repeats in cycles or a team is arranged in a circle.

The portable residue belongs to Group, Order, Symmetry, Quotient, and Covering Representation. The exact coupling of a ternary cyclic order with two-sided group translations remains mathematical and domain-specific.

Relationships to Other Abstractions

Local relationship map for Cyclically Ordered GroupParents appear above the current abstraction, mutual partners to the right, and children below. Node labels state whether each abstraction is prime or domain-specific; colors identify relation types.CyclicallyOrdered GroupDOMAINPrime abstraction: Group — is a kind ofGroupPRIME

Current abstraction Cyclically Ordered Group Domain-specific

Parents (1) — outgoing typed relations

  • Cyclically Ordered Group is a kind of Group Prime

    the carrier has associative composition, identity, and inverses.

Hierarchy paths (5) — routes to 5 parentless roots

Neighborhood in Abstraction Space

Cyclically Ordered Group sits in a moderately populated region (57th percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.

Family — Algebraic Operations & Quasigroup Structures (13 abstractions)

Nearest neighbors

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