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: v1 · 2026-08-30 · History
Domain-specific #: 1612
Origin domain: mathematics
Subdomain: ordered group theory
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.^[1]^[2]

The locked identity is group operation + cyclic ternary order + cyclicity, asymmetry, transitivity, and totality axioms + left-translation invariance + right-translation invariance -> a group whose algebra and circular order coexist. A group and an unrelated circular drawing do not qualify. A cyclic group does not automatically carry the intended structure merely because one generator cycles through its elements; it must be supplied with a compatible cyclic order. Conversely, the class is not limited to cyclic groups.

The circle group is the canonical example. Regard the real numbers modulo integers as points on an oriented circle and use addition modulo one. Rotating every point by the same amount preserves the cyclic order, so the group operation and order are compatible. Finite cyclic groups inherit the analogous orientation, and a linearly ordered group can induce a cyclic order by forgetting which point is “first.” The resulting class unifies linear-order and circle-order perspectives without collapsing them.

A major representation insight is that circular order can be “unwrapped” into linear order. Rieger and Świerczkowski developed constructions in which a cyclically ordered group is represented through a linearly ordered covering group with a central cofinal cyclic subgroup; quotienting by that subgroup wraps the line into a circle. Conversely, cyclically ordered groups embed into products involving the circle group and a linearly ordered group under standard representation results.^[1]

Structural Signature¶

the carrier set — the elements supporting both algebraic and order structure;
the group operation — an associative binary operation with identity and inverses;
the cyclic-order relation — a ternary orientation relation, often written [a,b,c];
cyclicity — if [a,b,c], then [b,c,a];
asymmetry — [a,b,c] excludes [c,b,a];
transitivity — compatible oriented triples combine to preserve relative circular placement;
totality on distinct triples — one of the two orientations holds for any three distinct elements;
left invariance — [a,b,c] implies [xa,xb,xc] for every group element x;
right invariance — [a,b,c] implies [ax,bx,cx] for every x;
translation action — group multiplication acts by orientation-preserving permutations of the cyclically ordered set;
the identity cut — selecting a cut at the identity can induce a local or partial linear perspective, while the global structure remains cyclic;
the unwinding group — when used, a linearly ordered cover that restores successive turns around the circle;
the central cofinal element — a distinguished translation in the cover whose powers represent full turns;
the quotient relation — identifying points separated by full turns recovers the cyclic order;
the representation class — embeddings into a circle-group times linearly ordered-group setting;
additional properties — abelian, Archimedean, complete, compact, or lattice-like variants studied in ordered algebra.

Recognition requires both structures and their compatibility. Checking the group axioms or the order axioms separately is insufficient.

What It Is Not¶

Not a cyclic group. “Cyclic” there means generated by one element; “cyclically ordered” means equipped with a circular ternary order.
Not a circularly drawn Cayley graph. A diagram's geometry does not supply a compatible order relation.
Not a linearly ordered group. A linear order has endpoints only relative to subsets and a binary comparison; a cyclic order has rotation-invariant ternary orientation.
Not a partially ordered group. Partial order expresses comparability and monotonicity, not circular betweenness.
Not the circle group alone. The circle group is a central example, while the class includes many other groups.
Not an ordered set with a group acting on it. The ordered set must be the group carrier and multiplication itself must preserve the order on both sides.
Not one-sided cyclic orderability. Right- or left-invariant variants are weaker when both sides are not required.
Not merely a quotient group. The quotient must inherit a well-defined compatible cyclic order from the ordered cover.
Not a topological group by definition. A cyclic order can induce order-topological considerations, but topology is additional structure.

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.^[1]^[3]

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. The circle group and its subgroups supply examples genuinely native to circular geometry rather than simply linear groups viewed through a weaker relation.

Representation theorems make the class tractable. By lifting to a linearly ordered group, questions about repeated circular turns can be studied through an order with an integer-like central translation. Quotienting forgets the turn count while retaining orientation. This is analogous to the universal-cover relationship between the real line and circle, expressed algebraically.

Connections with MV-algebras and other ordered algebraic structures arise only under additional hypotheses. These equivalences should be presented as specialized relations, not included in the base definition.

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.

Left and right invariance are separately stated because groups need not be abelian. In an abelian group they coincide, but in a noncommutative group preserving order under one side does not automatically express preservation under the other.

Inducing a cyclic order from a linear order forgets the distinguished beginning. For distinct a,b,c, the cyclic relation holds when their order is one of the cyclic rotations a<b<c, b<c<a, or c<a<b. This explains why linearly ordered groups fall inside the broader class while not exhausting it.

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. It also explains why many examples look like a line modulo a period.

Abstract Reasoning¶

If [a,b,c] holds, left multiplying by any x preserves the orientation of the triple.
If right invariance fails, the structure is not a cyclically ordered group under the two-sided definition even if left translations preserve order.
If a group is abelian, the distinction between left and right translation disappears.
If a cyclic order is induced by a linear order, changing the arbitrary cut does not change the circular orientation relation.
If an ordered cover is quotiented by a central cofinal cyclic subgroup, the identified full turns can yield a well-defined circular order.
If the subgroup is not central, multiplication can make representatives induce inconsistent cyclic orientations.
If the distinguished subgroup is not cofinal, the quotient may fail to represent the intended wrapping of the whole ordered group.
If a group embeds into orientation-preserving circle transformations, the ambient circular orientation can supply a compatible cyclic order when the action is faithful and appropriate.
If a cyclically ordered group is Archimedean in the relevant sense, representation inside the circle group becomes especially restrictive.
If topology is added from order intervals, compactness imposes strong constraints beyond the algebraic definition.

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.

Examples¶

finite cyclic group: residues modulo n arranged in their natural circular orientation;
circle group: real numbers modulo integers with counterclockwise order and addition modulo one;
rational points on the circle: a subgroup inheriting group operation and cyclic orientation;
linearly ordered additive reals: the linear order induces a compatible cyclic order;
unwinding: the real line covers the circle group, with integer translation representing full turns;
product representation: a subgroup of a product of the circle group and a linearly ordered group carries a cyclic order;
non-example—permutation group with arbitrary list: the list order is not preserved by multiplication;
non-example—cyclic group without chosen orientation: single generation alone does not specify the relevant ternary relation;
failure—one-sided preservation: left multiplication preserves orientation but some right multiplication reverses it.

Structural Tensions¶

circular symmetry vs. linear tools — no origin is intrinsic, while many proofs use a chosen cut or ordered cover;
algebraic generality vs. two-sided invariance — noncommutative groups are broad while compatibility on both sides is restrictive;
quotient economy vs. lost winding information — wrapping captures circular position while erasing turn count;
intrinsic order vs. chosen orientation — clockwise and counterclockwise structures are dual, and an orientation must be fixed;
discrete examples vs. topological intuition — finite groups have no continuous circle while still support cyclic order;
base definition vs. enriched variants — compactness, completeness, Archimedeanness, and lattice structure add powerful but nonessential assumptions.

Structural–Framed Character¶

Cyclically Ordered Group is structural. Its membership is determined entirely by formal axioms and compatibility relations. Historical terminology and notation are conventional, but they do not affect the mathematical identity.

Structural Core vs. Domain Accent¶

The structural core is reversible composition + orientation on triples + invariance of orientation under all translations. The domain accent is group axioms, cyclic-order axioms, quotient groups, central cofinal elements, embeddings, and ordered algebra. Removing it yields a generic compatibility between transformation and order.

Group — the carrier has associative composition, identity, and inverses.
Order — a ternary relation organizes elements around an oriented cycle.
Symmetry — every left and right translation preserves the cyclic order.
Quotient — ordered covers can wrap into cyclically ordered groups by identifying full turns.
Representation — embeddings and covers make the structure intelligible in established models.

The minimal prospective DAG uses a strict subsumption edge to prime:group. A cyclically ordered group is literally a specialized group, with compatible cyclic order as additional structure.

Relationships to Other Abstractions¶

Current abstraction Cyclically Ordered Group Domain-specific

Parents (1) — more general patterns this builds on

Cyclically Ordered Group is a kind of Group Prime

the carrier has associative composition, identity, and inverses.

Neighborhood in Abstraction Space¶

Cyclically Ordered Group sits in a sparse region of the domain-specific corpus (66^th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Unclustered & Miscellaneous (1565 abstractions)

Nearest neighbors

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

Not to Be Confused With¶

cyclic group;
circle group;
linearly ordered group;
partially ordered group;
circular order on a set;
cyclic group action;
Cayley graph drawn in a circle;
left- or right-cyclically ordered group under one-sided definitions;
topological group;
MV-algebra equivalences that require extra hypotheses.

References¶

[1] Stanisław Świerczkowski, “On Cyclically Ordered Groups,” Fundamenta Mathematicae 47(2) (1959), 161–166, https://doi.org/10.4064/fm-47-2-161-166. registry ↩a ↩b ↩c

[2] László Fuchs, Partially Ordered Algebraic Systems, chapter IV.6, “Cyclically Ordered Groups,” Pergamon Press, 1963. registry ↩

[3] Daniel Gluschankof, “Cyclic Ordered Groups and MV-Algebras,” Czechoslovak Mathematical Journal 43(2) (1993), 249–263, https://doi.org/10.21136/CMJ.1993.128391. registry ↩

[4] “Cyclically ordered group,” Wikipedia, frozen revision 1351307566, https://en.wikipedia.org/wiki/Cyclically_ordered_group. registry