Return Counts, Commitment Counts, the Completion-Density Order, and a Reuse-Monotonicity Theorem for Finite Closure Dynamics
One of the recurring themes throughout the VERSF programme is that nature appears to organise itself into hierarchies. We see this most clearly in the three generations of matter, where particles appear in families that share the same underlying structure but differ dramatically in mass. Previous papers introduced the idea that these hierarchies may be related to a quantity called completion density, but until now that quantity had largely been treated as a named concept rather than a mathematically constructed object.
This paper changes that.
The first half of the paper builds the machinery needed to talk about completion density in a precise way. It shows that for any self-sustaining closure cycle there are three natural quantities that can be counted: the number of steps required for the cycle to return to its starting point, the amount of irreversible commitment accumulated during that journey, and the ratio between the two. These are called the return count, the commitment count, and the completion density. Importantly, the paper proves that these quantities are not arbitrary choices or fitted parameters. They are intrinsic properties of the cycle itself.
The second half of the paper asks a deeper question. If one closure structure is a refinement of another, why should its completion density be higher? Rather than simply assuming that deeper structures have larger densities, the paper proves the exact condition under which this happens. Density increases when refinement adds new commitment more efficiently than it increases the length of the cycle. In simple terms, a refinement that successfully reuses existing structure becomes more productive rather than merely more complicated.
This is important because it transforms a central idea of the hierarchy programme from an assertion into a testable condition. Instead of saying “deeper levels have higher completion density,” the programme can now state exactly what must be true of the underlying dynamics for that increase to occur.
The paper also makes an important distinction between two ideas that had previously been easy to confuse. A hierarchy can continue to rise while the spacing between successive levels either narrows or widens. The paper proves that these are separate questions. Density growth and density compression are not the same thing. This turns out to be particularly relevant when comparing the observed particle families, where some sectors appear to compress while others expand.
In the broader VERSF sequence, this paper sits between the abstract hierarchy framework and the future construction papers that must derive the hierarchy from the closure algebra itself. Earlier papers established distinguishability, ownership, assignment, generation structure, and the Eigenmode Decision framework. Those papers defined what would ultimately need to be explained. This paper provides the counting machinery and the structural rules needed to perform that explanation.
Perhaps the most important achievement is what the paper does not claim. It does not derive the three generations. It does not produce particle masses. It does not identify the physical refinement operator. Instead, it isolates exactly what a successful future construction must demonstrate. By freezing those requirements in advance, the programme prevents itself from changing the rules later to fit the answer.
In that sense, this paper is less about producing a result and more about building the measuring instrument that future results must satisfy. It converts a qualitative hierarchy idea into a quantitative framework, and narrows the remaining problem to a single question: can the closure algebra generate a refinement process whose computed orbit counts reproduce the observed structure of the particle generations?
That is the challenge now handed to the next stage of the programme.