A portal · the functional-graph spine

Nowhere New to Go

Run a rule a child could follow — square and take a remainder; flip the top cards; deal and gather — in a world with only so many states, and the same thing happens every time: sooner or later you land on a state you have already been in, and from there it repeats forever. There is nowhere new to go. So every path is the Greek letter ρ — a one-way tail draining into a loop. Three layers of this place each discovered this in their own finite world. They are one theorem.

I · The reason — a finite world leaves no room

Pick a finite set of states — the whole numbers below a million, every order of a deck of cards, every way to break a number into a sum. Pick a rule that sends each state to exactly one next state. Now start anywhere and follow the rule.

You are tracing a path, and every step lands on one state. But there are only so many states. Take more steps than there are states and you must step onto one you have visited before — there is no room for a longer path of all-new places. This is the pigeonhole principle, and it is the whole story: the moment you revisit a state, the rule — being fixed — does from there exactly what it did last time, so you are caught in a loop you can never leave. A deterministic rule on a finite set is eventually periodic. Always. No exceptions, no escape, nothing to prove beyond counting.

II · The shape — a tail into a loop, the letter ρ

Draw an arrow from every state to the one the rule sends it to. Because the rule is a function, every state has exactly one arrow leaving it — and that single fact forces a beautiful picture, the same in every finite world. Each path runs forward, never branching, until it joins a cycle and goes round forever. Everything that drains into that cycle and isn't on it is a tail. A lone orbit traces the Greek letter ρ: a straight stroke that curls into a loop. The whole state space is a functional graph — a handful of disjoint loops, each wearing a forest of trees that pour into it, with Garden-of-Eden states (no arrow coming in — a state the rule can never produce) at the very tips.

III · The one engine, made playable

Below is a single instrument. It does not know which world it is drawing. Hand it a rule and a finite set of states and it draws the functional graph — loops at the centres, tails draining in. Switch the rule among the three layers of this place and watch the same shape appear, wearing three different signatures.

IV · Three faces of one theorem

Each of these started as its own layer of the Wasteland, and none of them, alone, says the load-bearing thing: that they are the same fact about finite worlds. The shapes differ only in how the rule fills the picture — pure tails, structured loops, or a generic scatter — and the instrument above draws all three from one piece of code.

V · One detector for every finite rule

Because every finite rule makes this same shape, one trick finds the loop in any of them — Floyd's tortoise and hare. Send two markers from the start; the hare steps twice for every step the tortoise takes. Inside the loop the fast one laps the slow one, and they collide — proving the cycle exists using no memory at all, just two positions. (A second phase then walks them to the loop's entrance.) It is the same detector that makes Pollard's factoring practical, and it works unchanged on the card game and the solitaire. Press ⊙ tortoise & hare above and watch the two markers race into the loop and meet. One detector, because one shape, because one theorem.