Cycle¶

Version: v1 · 2026-08-24 · History
Prime #: 774
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomain: Graph Theory → Mathematics

Core Idea¶

A closed path through a network that returns to its starting point without repeating any other element. From the Closure three consequences travel together: closure permits return (feedback, lock-in), forecloses ordering (no topological sort), and creates a loop invariant (a quantity conserved around the loop).

How would you explain it like I'm…

Back To Start

Think about a merry-go-round: you ride all the way around and end up back where you started. A cycle is any path like that — a loop that comes back to its beginning. The big deal is that whatever travels around the loop can come back and visit the start again.

The Closed Loop

A Cycle is a closed loop: a path of steps that returns to where it began without repeating any spot in between. The important thing isn't how long the loop is — it's that it CLOSES. Closing the loop has big effects: whatever travels around (water, money, energy, even blame) comes back, so it can build up or feed on itself. It also means you can't put the steps in a clean order, because in a loop nothing is truly first or last — that's why circular definitions and 'I'm waiting on you, you're waiting on me' deadlocks get stuck. And going all the way around adds up to its own total — like a lap counter — that limits what can happen on the loop.

Closure Permits Return

A cycle is a closed loop — a sequence of steps through a network, or through a chain of dependencies, events, or transformations, that returns to its starting point without repeating any intermediate element. The structural commitment is the existence of a path along which an effect can revisit its origin, and the defining feature is the closure, not the length. Three consequences travel together. Closure permits return: state, mass, money, energy, blame, or precedent can come back to where it started, enabling accumulation, feedback, lock-in, and stable recurrence. Closure forecloses ordering: a graph with a cycle cannot be topologically ordered, because the cycle's entries have no first or last — which is why dependency cycles, deadlocks, and circular definitions share one pathology. And closure creates a new conserved object: the sum or composition accumulated around the loop — a loop integral, a holonomy, a winding number — is itself a quantity that constrains what the loop can do.

A cycle is a closed loop: a sequence of steps through a directed or undirected network — or through a sequence of dependencies, events, or transformations — that returns to its starting point without repeating any other element along the way. The structural commitment is the existence of a path along which an effect can revisit its origin, and the central diagnostic of any cycle-bearing system is what changes because the path closes; the closure, not the path length, is the defining feature, and three consequences follow that travel together. First, closure permits return: state, information, mass, money, energy, blame, or precedent that flows around the cycle comes back, opening the door to accumulation, feedback, lock-in, and stable recurrence. Second, closure forecloses ordering: a graph containing a cycle cannot be topologically ordered, because among the cycle's entries there is no first or last, so any partial ordering of the system must break the cycle or live alongside it — which is why dependency cycles, deadlocks, and circular definitions share one structural pathology. Third, closure creates a new conserved object: the sum, product, or composition accumulated around the loop — a loop integral, a holonomy, a winding number — is itself a quantity whose value constrains what can happen on the cycle, as in circuit laws or fixed points on a circle. Cycle is a prime because this graph-theoretic skeleton is the backbone of feedback loops, business cycles, hermeneutic circles, deadlocks, vicious and virtuous spirals, ritual cycles, citation rings, and life cycles alike.

Broad Use¶

Graph theory: Hamiltonian cycles, Eulerian circuits, the cycle space, and girth are foundational cycle objects.
Systems and control: every feedback loop is a cycle; a positive cycle amplifies, a negative one counters.
Computer science: cycle detection identifies deadlocks, infinite recursion, and circular imports that break topological ordering.
Economics and biology: business, debt, predator–prey, circadian, and life cycles, each a closed loop of state-change.
Hermeneutics: the hermeneutic circle — interpreting the whole requires interpreting the parts and vice versa — navigated by spiralling iteration.
Algebra and topology: cycles in chain complexes found homology, with cycles-modulo-boundaries measuring topological holes.

Clarity¶

Separates the structural fact (cycle) from the ethical decoration (vicious or virtuous) and the dynamical detail (limit cycle, oscillation), and disambiguates a cycle in a state space from a cycle in a dependency graph.

Manages Complexity¶

Compresses an arbitrarily complex feedback web into one object whose presence determines orderability, stability, conservation, and lock-in — reasoning reduces from "trace every interaction" to "list the cycles and characterize each."

Abstract Reasoning¶

Supports reusable templates: acyclicity equals orderability, the sign of a cycle (product of edge signs predicts amplify vs. stabilize), loop integrals and conservation, and cycles versus boundaries (homology).

Knowledge Transfer¶

Across systems: the cycle-inventory diagnostic ports from ecology (predator–prey) to macroeconomics (debt) to climate (carbon).
Acyclicity as discipline: forbidding circular module dependencies ports to no-circular-reporting, DAG causal models, no-circular-reasoning.
Cycle-breaking: "break the cycle, dampen the loop gain, decouple the variables" transfers from systems dynamics to debt restructuring to inflammatory disease.

Example¶

A build dependency graph with A→B, B→C, C→A admits no topological sort — there is no first or last among them — so the build system cannot order compilation, and removing any single edge (sever C→A) restores a sortable chain.

Relationships to Other Abstractions¶

Current abstraction Cycle Prime

Parents (1) — outgoing typed relations

Cycle presupposes Network Prime

Cycle presupposes Network, whose structure must already obtain for the child mechanism to be meaningful or operational.

Children (19) — abstractions linked here by typed relations

Biogeochemical Cycling Domain-specific is a kind of Cycle

Biogeochemical cycling is a conserved-material cycle specialized to Earth-system reservoirs connected by transformation and flux pathways.
Citric acid cycle Domain-specific is a kind of Cycle

It remains its own entry because its identity is fixed by the organism and cellular compartment, substrate entry and oxaloacetate carrier, ordered reaction identities and stoichiometry, carbon balance, reducing-equivalent and nucleotide outputs, regenerated intermediate and anaplerotic or variant branches.
Cycle Button Domain-specific is a kind of Cycle

cycle: the last option transitions back to the first.
Cyclic Number Domain-specific is a kind of Cycle

Cycle is the strict parent because rotations form a closed orbit under consecutive multiplication, eventually returning to the original digit arrangement.
Dungey Cycle Domain-specific is a kind of Cycle

The system-level Dungey circulation has recurrent opening, transport, closure and return.

▸ Show 14 more

Girth (Graph Theory) Domain-specific is a kind of Cycle
**Cycle** is the strict parent because finite girth is defined by the shortest cycle and infinite girth by the absence of cycles.
Modular arithmetic Domain-specific is a kind of Cycle
What makes it its own entry: the domain-specific identity determined by the modulus is fixed and positive, equality means congruence modulo it, and division or cancellation is used only when the relevant residue is invertible.
Navigation loop Domain-specific is a kind of Cycle
A Navigation Loop is a Cycle specialized to an interface transition graph whose closed path excludes the user's goal state.
SECI model of knowledge dimensions Domain-specific is a kind of Cycle
What makes it its own entry: An organizational knowledge-creation model cycling between socialization, externalization, combination and internalization to convert tacit and explicit knowledge.
Zak phase Domain-specific is a kind of Cycle
It remains its own entry because its identity is fixed by the periodic Hamiltonian and isolated band, Brillouin-zone loop and orientation, Bloch gauge and unit cell, Berry connection, phase integral modulo convention, symmetry protection and related polarization or edge-state statement.
Deadlock Prime is a kind of Cycle
Deadlock's essential commitment is a circular waiting dependency, which is precisely a closed loop returning to origin in the dependency graph, the structure cycle names.
Begging the Question Domain-specific includes Cycle
The canonical fallacy contains a closed path in its justification graph: the conclusion depends on a premise whose warrant returns to the conclusion.
Business Cycle Domain-specific includes Cycle
The business-cycle identity contains a closed state-transition path through expansion, peak, contraction, trough, and recovery back to expansion.
Kondratiev wave Domain-specific includes Cycle
The Kondratiev schema contains a closed phase path from installation through crash, deployment, saturation, depressive gestation, and successor handover back to installation.
Kuznets swing Domain-specific includes Cycle
The Kuznets schema contains a closed phase path from demographic demand pulse through delayed build-out and overhang lull to the next cohort-driven restart.
Mesoscale Eddy Domain-specific includes Cycle
A mesoscale eddy contains closed streamline cycles around its rotating core.
Milk Run Domain-specific includes Cycle
A milk run contains a closed route that visits distributed points and returns to its origin on every circuit.
Rock Cycle Prime includes Cycle
The rock-cycle pattern contains at least one closed transformation path through which the persisting substance can return to a prior phase-state.
Circular Reasoning Domain-specific is a decomposition of Cycle
Removing the argumentative frame leaves a directed dependency path that returns to its origin without an external anchor.

Hierarchy path (1) — routes to 1 parentless root

Cycle → presupposes Network

Not to Be Confused With¶

Cycle is not Feedback because a cycle is the closed path in a graph that makes return possible (defined even if nothing flows), whereas feedback is the dynamic process of routing output back, with gain and delay.
Cycle is not Recurrence because a cycle is structural closure of a path (which may sit dormant), whereas recurrence is repeated return to a state over time; a circular import deadlocks without anything recurring.
Cycle is not Oscillation because a cycle in a dependency graph produces no motion at all, whereas oscillation is sustained back-and-forth motion in a state variable.