The Unpluggable Hole: Dao, Time and the Logic of Persistence

We have become extraordinarily capable of describing the world while remaining surprisingly poor at explaining how its forms persist. Organisms replace their material, languages change their expressions, and institutions replace their participants. Something remains recognisable through these changes, but that continuity cannot be explained by pointing to constituents that are themselves continually disappearing.

My starting point is relational. Systems do not begin with separate things that later form relations, but with unresolved relations, differences, delays, dependencies and absences that invoke and sustain the temporary identities we mistake for things. Persistence is the recurrent reconstruction of those relationships. What a system does changes the conditions under which its further activity becomes possible.

This document brings together definitions developed across the corpus, particularly the accounts of relational invariance, temporal propagation and continuity. The mathematical expressions describe connected aspects of this argument. Each is explained in ordinary language, with a distinction between foundational premises, consequences that follow from them, and models whose behaviour requires further specification.

The Dao and the impossibility of final closure

The opening of the Dao De Jing distinguishes the enduring Dao from any description capable of finally naming it. The relevance here concerns the relationship between reality and the descriptions produced within it. Every description establishes distinctions. Those distinctions depend upon relationships that the description does not exhaust.

A wheel depends on its empty centre, a vessel on its hollow, and a room on the space through which it can be inhabited. Absence participates in what these forms make possible. The deeper argument concerns constitutive absence: the conditions sustaining a local identity cannot all become an independent possession contained within that identity.

In The Big Empty, absence is the generative condition through which difference, self-reference and coherence become possible. The apparent centre is not a hidden object directing the whole. It is an unresolved relational condition through which further activity remains possible.

This does not prevent precise descriptions. A model can rigorously specify selected relationships while depending on conditions beyond its chosen terms. Precision within a description and the exhaustion of reality are different achievements.

Reading the foundational notation

Let 𝒮 represent the set of admissible relational configurations. A configuration is a particular arrangement of relationships distinguished within the account. “Admissible” means that it satisfies the conditions under which the account is being developed.

Let S name one such configuration. Let D(S) represent the set of unresolved constitutive relations associated with it. The parentheses indicate that D is being applied to S: we are considering the unresolved relations of this configuration.

The foundational premise is:

∀S ∈ 𝒮, D(S) ≠ ∅

Read this as: every admissible configuration retains unresolved constitutive relations.

• ∀ means “for every”.
• ∈ means “belongs to” or “is a member of”.
• ≠ means “is not equal to”.
• ∅ denotes the empty set: a set containing no members.
• D(S) denotes the unresolved constitutive relations associated with S.

The expression says that D(S) is never empty. It does not say that every configuration contains an error, an unanswered practical question or an unknown measurement. It states the framework’s constitutive incompleteness: local identities depend upon relations whose conditions they cannot fully contain.

A relationship can be accurately measured while remaining constitutive. Knowing its value does not eliminate the dependence it describes. However, dependence alone is not a formal proof of inexhaustibility. The stronger premise is that no configuration exhausts its constituting relations. The argument begins with that premise and makes its consequences explicit.

What follows from constitutive incompleteness

Define complete closure, written C(S), as the absence of unresolved constitutive relations:

C(S) ⇔ D(S) = ∅

The symbol ⇔ means “if and only if”. A configuration is completely closed exactly when D(S) is empty.

The foundational premise says that D(S) is never empty. The definition says that complete closure requires it to be empty. Consequently:

¬∃S ∈ 𝒮 : C(S)

Read this as: there is no admissible configuration that is completely closed. The symbol ∃ means “there exists”, ¬ means “not”, and the colon means “such that”.

This is a valid consequence of the premise and definition. It is not an independent mathematical proof of the premise about reality. The notation shows what accepting the premise entails.

Now consider an admissible transformation F that takes a configuration to another configuration within 𝒮. Its output is written F(S). Because the foundational premise applies to every admissible configuration, it also applies to this output:

D(F(S)) ≠ ∅

Read this as: after transformation, constitutive incompleteness remains. A particular problem can be solved, a difference resolved or a computation completed. Those achievements change the configuration without eliminating the relational conditions through which the resulting configuration exists.

This is the unpluggable hole. It is not an overlooked variable inside an otherwise finished reality. It names the impossibility, within the framework, of relational existence becoming independent of its constituting conditions. It does not require an environment outside the universe: constitutive non-closure is distinct from physical exchange across a boundary.

From incompleteness to consequential activity

Incompleteness and change are connected in the framework, but they are not interchangeable statements. An incomplete mathematical description does not automatically generate another event. The dynamical connection must be made explicit.

Let d identify a particular unresolved relation within D(S). Write G(d,S) to mean that this relation is generative in configuration S. The generative premise is:

∀S ∈ 𝒮, ∃d ∈ D(S) : G(d,S)

Read this as: every configuration in the generative account contains at least one unresolved relation that produces consequential activity.

Let T(S,S′) represent a consequential transition from S to another configuration S′. The prime mark distinguishes the second configuration from the first. The consequence of calling a relation generative is expressed as:

G(d,S) ⇒ ∃S′ ≠ S : T(S,S′)

The symbol ⇒ means “implies”. If d is generative in S, a consequential transition to a distinct configuration follows. The successor is understood to remain within the admissible domain.

Combining these premises gives:

∀S ∈ 𝒮, ∃S′ ≠ S : T(S,S′)

Every admissible configuration in this generative account has a consequential successor. This conclusion depends on generativity being included among the premises. It does not follow from the nonempty set D(S) alone.

The remaining foundational question is whether the generative implication can be derived from constitutive incompleteness under specified conditions. Retaining that distinction prevents the notation from claiming more than it establishes.

Time as the finite propagation of relation

In System Time, time is the finite propagation of relation. Occurrence, propagation, registration and response occupy different positions within that propagation. Their non-coincidence permits sequence, comparison, anticipation and further response.

This is why delay is constitutive. A response depends upon what has happened elsewhere, what has arrived and what remains unavailable. These conditions are consequential without being fully present together in a single local expression.

A sequence of configurations can be written:

S₀ → S₁ → S₂ → ⋯

The subscripts distinguish successive positions in the sequence. The arrow represents a consequential transition, and the dots indicate further transitions. The numbers do not yet represent seconds or any other measured duration.

A configuration can recur without its occurrences becoming the same event. If a process passes from A to B and then returns to A, the second occurrence of A follows a history that the first did not. The selected description can repeat while the wider field carries accumulated difference.

Arrows between configurations do not alone establish a temporal order without distinguishing their occurrences. The sequence records that order; a physical account of duration must additionally specify how propagation intervals and clocks are measured. A clock itself registers an organised recurrence.

The traffic-wave example in System Time makes the distinction accessible. Vehicles move forwards or stop while a wave of slowing travels backwards through their successive responses. The pattern propagates through changes in constituents whose individual motion differs from its own. Its continuity lies in the relations carrying consequences from one occurrence to another.

The categorical sketch: composing transformations

Category theory provides a language for how transformations connect. Its technical term “object” does not require an independently complete substance. Here, objects represent relational configurations or organised distinctions.

Suppose:

f : A → B

g : B → C

The transformation f takes A to B. The transformation g takes B to C. Because the output domain of the first matches the input domain of the second, they can be composed:

g ∘ f : A → C

Read g ∘ f as “apply f, then apply g”. The operation on the right is applied first. When these arrows are functions, the same operation is written:

(g ∘ f)(x) = g(f(x))

Start with x, apply f, then apply g to the result. The parentheses show which output becomes the next input.

A category also includes identity transformations and associative composition. Identity transformations preserve an object within the description. Associativity means compatible compositions can be regrouped without changing their result. It does not mean their order can be exchanged.

The categorical sketch describes admissible compositions. It does not automatically specify physical duration, transition probabilities, phase relationships or the preservation of identity through a sequence. Those require the additional relationships developed elsewhere in the account.

The orbit frame and the logical orbit

The definitions in Mathematical Foundations distinguish local expression from the conditions through which it continues. A local description of the logical orbit is:

O = (L, H, R(L,H))

The parentheses group three related terms. L denotes local organisation. H denotes the distributed relational horizon. R(L,H) denotes their recursively maintained relation. This expression records their interdependence; it does not, by itself, calculate their dynamics.

The frame is the local orientation through which a process organises its activity. The anti-frame comprises the wider conditions, dependencies and possibilities that this orientation requires and cannot exhaust. Binding absence names the structured non-coincidence through which they remain distinct and consequential to one another.

The logical orbit names the constitutive logical incompleteness of this relationship. Its dynamical expression is recursive displacement: continuing activity reconstructs the dependencies through which further activity becomes possible. The organisation persists through changing expressions of a dependence that no local expression completes.

The paired frame is a minimal handle, rather than a claim that every system has only two parts. As developed in Persistence of Reality, each apparent pole can itself express further relational organisation. What appears as a relation at one resolution can become a locally distinguished process at another.

The orbit is consequently neither a hidden centre nor necessarily a circular trajectory. What recurs is a recognisable organisation of relationships. Its constituents, states and circumstances can change while those relationships remain consequential.

Antisymmetry and reciprocal change

For an appropriately defined relational quantity A, antisymmetry is expressed as:

A(f,g) = −A(g,f)

Reversing the order of the terms reverses the sign of the oriented quantity. The minus sign marks this reversal. It does not establish that the processes cancel, become identical or necessarily sustain one another.

Mutual influence is represented separately through coupled updates:

x_n+1 = f(x_n, y_n)

y_n+1 = g(y_n, x_n)

The subscript n identifies the current step; n + 1 identifies the next. The functions f and g specify how the next conditions are produced from the current conditions. Where both inputs are consequential, each process changes through its relationship with the other.

The results of an interaction become conditions of subsequent interaction. This is the recursive connection. The equations express coupling, but the particular functions determine whether that coupling sustains coherence, produces instability or dissolves the relation.

In Order and Entropy, the central formulation is that what persists is neither order nor entropy, but the organised difference through which each continually transforms the conditions of the other. Complete coincidence would erase the selected distinction. Complete separation would erase its coupling. Persistence depends upon the continuing organisation of their non-coincidence.

The harmonic and spectral substructure

Harmonic structure concerns the recurrent coordination of difference. Interval introduces delay; delay gives recurrence relative timing; relative phase permits reinforcement, interference, entrainment, synchronisation and displacement. No individual process contains these relationships by itself.

The spectral account follows recurrent activity across different frequencies and scales. In the strict mathematical sense, harmonics are integer multiples of a fundamental frequency. The wider account also includes incommensurate rhythms, changing coordination, beats and transient relations. It does not require every system to behave as a single periodic oscillator.

In Many Spaces, behavioural, physiological, morphological and symbolic domains are selective expressions of a continuous relational field. Their coherence concerns how activity expressed in one domain remains consequential in another. Phase, lag, resonance and interference describe aspects of that coordination where suitable measurements can be defined.

For processes with meaningful cyclic phases, delayed coupling can be written:

dθ_i/dt = ω_i + ∑_j K_ij sin(θ_j(t − τ_ij) − θ_i(t))

The equation can be read in parts:

• θ_i is the phase of process i: its position within a cycle.
• dθ_i/dt is the rate at which that phase changes.
• ω_i is its intrinsic angular frequency.
• ∑_j means add the influences contributed by processes indexed j.
• K_ij specifies the strength of the relevant coupling.
• τ_ij specifies the propagation delay.
• θ_j(t − τ_ij) is the phase of j at the earlier time whose influence reaches i.
• sin converts the phase difference into a signed contribution to the receiving process’s rate of change.

The current rate combines the process’s intrinsic frequency with delayed influences from other processes. Depending on the phase differences and coupling, those influences can speed or slow it.

This is a model of a particular class of coupled oscillators. Entrainment depends on its parameters and initial conditions; it is not guaranteed by writing the equation. Where processes maintain a characteristic phase difference, their coordination is expressed as:

θ_i(t) − θ_j(t) ≈ φ_ij

The symbol ≈ means “approximately equal”. The term φ_ij names the maintained phase offset. Phase is understood cyclically, so full turns do not change the represented position. A nonzero offset allows the processes to remain distinguishable while sustaining coherent activity.

The analytical task is to identify which temporal relations carry continuity, how much variation they permit, and how changing them alters subsequent possibilities. Harmonic coordination describes one aspect of persistence. The logical orbit also concerns how realised activity changes the conditions of future coordination.

What remains recognisable through transformation?

The criterion of continuity is already developed in Relational Invariance. An invariant is a feature preserved across a specified family of transformations. A mathematical account must identify what is preserved, which transformations are included and how preservation is assessed.

A language persists through recurrent relations among expressions, expectations and responses. An institution persists through practices reproducing roles, obligations and authority. Their constituents change, and their relationships also develop. Continuity concerns which transformations preserve the organisation being examined.

Calling something an invariant supplies a requirement to demonstrate. It does not explain the mechanism of continuation. The explanation follows how activity maintains or reconstructs the dependencies carrying that invariant through change.

This distinction prevents mere succession from being mistaken for persistence. Further events can occur after a particular organisation has disappeared. The relevant question is which relationships those events reproduce, rather than whether activity continues somewhere.

In the probability expression used below, Ω identifies a region of configurations associated with recognisable recurrent organisation. Its meaning must come from the specified relational criterion. It cannot be left as an unexplained label for whatever outcome happens to occur.

Probability and recursive displacement

Probability describes the structured tendencies among possible continuations. Present constraints make some transitions more accessible than others. Activity reconstructs those constraints, changing the possibilities inherited by subsequent activity.

The recursive relationship is written:

S_n+1 ∼ P_n(· | S_n)

P_n+1 = Φ(P_n, S_n, S_n+1)

The first line describes a transition. The symbol ∼ means “is drawn according to”. P_n describes the transition probabilities at step n. The vertical bar means “given”, and the dot is a placeholder for possible successor configurations. The next configuration is selected according to probabilities conditioned upon the current configuration.

The second line describes the update of those probabilities. The function Φ takes the current probability rule, the current configuration and the realised next configuration, then gives the updated probability rule.

In ordinary language: what a system does changes what it is subsequently likely to do. The update function must be specified in a quantitative application. If the next transition depends upon further history, the description must retain that history or include its relevant consequences.

The equations permit both continuation and dissolution. Persistence occurs where the reconstruction of constraints supports the relational organisation under examination. An increase in its probability requires comparison with specified alternatives under comparable conditions. Favouring continuation changes its likelihood; it does not guarantee endurance.

Endpoint occupancy and uninterrupted continuity

The original probability expression is:

Π_Ω(S, t, Δt) = Pr(S_t+Δt ∈ Ω | S_t = S; P_t:t+Δt)

Π_Ω names the measure. Pr means probability. The expression S_t = S specifies the starting configuration at time t. The interval Δt is the duration under consideration. P_t:t+Δt denotes the transition dynamics operating across that interval, including changes to them.

Read the expression as: given the starting configuration and the transition dynamics, what is the probability that the system is in the recognisable region Ω at the end of the interval?

This measures endpoint occupancy. It does not establish that the organisation continued without interruption between the endpoints. A pattern can disappear and later be reconstructed. A pair of similar snapshots does not resolve that difference.

The distinction is addressed explicitly in Towards Continuity. Let X_n describe the system at its nth modelled transition, and let V contain descriptions satisfying the chosen criterion of viability. The description must retain the history and environmental relations needed to assess that criterion.

Assume the system begins viable. Let C_n mean that its organisation has continued through every transition from the beginning through step n. This event includes the preceding history; it is not simply a statement that the latest configuration looks viable.

Whenever the conditioning event has positive probability, define:

q_n = P(C_n+1 | C_n)

Read this as: given continuity through step n, what is the probability of continuity through the next transition? Here P means probability. It has a different role from the transition rule P_n above; the surrounding notation identifies which meaning is intended.

Continuity through N transitions then has probability:

P(C_N) = q₀ × q₁ × ⋯ × q_N−1

Each factor is the probability of continuing through one more transition, conditional on having continued so far. Multiplying them gives the probability of the complete finite sequence. This is the chain rule of probability. It does not assume that successive transitions are independent.

If each conditional continuation probability is at least as large as the corresponding probability in a specified comparable baseline, the cumulative probability at the same finite horizon is also at least as large. That gives a precise interpretation of activity favouring its own continuation.

The cumulative probability can nevertheless fall as the required history becomes longer. The example in Towards Continuity uses a continuation probability of 0.99 at every step:

P(C_N) = 0.99^N

This approaches zero as the number of required transitions increases without bound. Repeatedly having a good chance of continuing is different from having a guaranteed, or even positive-probability, indefinite future.

The continuity theorem already developed in the corpus

Towards Continuity gives a stronger sufficient condition for indefinite continuation within its model. Let ε_n denote the conditional probability of losing continuity at the next transition:

ε_n = 1 − q_n

The continuation and failure probabilities add to one. The symbol ε, pronounced “epsilon”, records the remaining risk after q_n has been specified.

The conditions are:

0 ≤ ε_n < 1 for every n

∑_n=0^∞ ε_n < ∞

The first condition excludes certain failure at any finite step. The second requires the sum of conditional failure probabilities to be finite. The summation symbol ∑ means add the successive terms. The later risks must diminish sufficiently fast; merely approaching zero is not enough.

Under these conditions:

P(C_∞) = ∏_n=0^∞ (1 − ε_n) > 0

The product symbol ∏ means multiply the successive continuation probabilities. C_∞ means continuity through every modelled transition. The result establishes a strictly positive probability of indefinite continuation within the stated model.

The proof has two parts. First, continuity through every transition is the intersection of the progressively longer finite continuity events. Its probability is the limit of their probabilities. Second, the finite sum of failure probabilities ensures that the infinite product of continuation probabilities remains positive.

The second step can be seen through logarithms. Because the failure probabilities have a finite sum, they eventually become no larger than one half. For those later terms:

ln(1 − ε_n) ≥ −2ε_n

The natural logarithm turns products into sums. This inequality bounds the sum of the later logarithms below by a finite quantity, so the corresponding product does not collapse to zero. The finitely many earlier factors are also positive.

This is a positive probability, not a guarantee. Interpreting infinitely many transitions as indefinite physical duration also requires their times to extend without bound. Applying the theorem requires a justified continuity criterion, an adequate transition description and evidence supporting the assigned probabilities.

The theorem does not derive its conditions from constitutive incompleteness. It states what follows when those additional probabilistic conditions hold. The logical orbit supplies the relational account; the theorem makes one specified aspect of continuation mathematically explicit.

Order, entropy and the wider field

Persistent activity constrains possible futures. Each constraint also alters the surrounding field, producing further differences, dependencies and possibilities. Local coherence can coexist with, generate and depend upon wider dispersal.

Order, Entropy and the Antisymmetry of Persistence distinguishes this relational argument from an undifferentiated claim that entropy always increases in every local description. In material systems, maintaining organisation away from equilibrium requires exchanges. Irreversible processes generate entropy, while heat and material flows carry it across boundaries.

The mathematical foundations give Shannon entropy, for specified alternatives and probabilities, as:

ℋ(p) = −∑_i p_i log₂ p_i

The term p_i is the probability of alternative i. The probabilities are nonnegative and sum to one. The summation adds their contributions. The logarithm base two gives the result in bits, with a zero-probability term contributing zero by the usual limiting convention.

Calligraphic ℋ denotes entropy here. Plain H denotes the relational horizon in the orbit expression. The different symbols prevent the two roles from being confused.

Shannon entropy measures the distribution of probability across the specified alternatives. A thermodynamic application additionally requires a physical model. Neither quantity alone identifies which relationships constitute persistence.

The relational criterion remains central: what persists is organised difference through transformation. Too much closure becomes rigidity; too much openness becomes dispersal. Coherence depends upon the continuing reconstruction of relations through which differences remain consequential.

The observer and the description remain inside

An observation is represented schematically as:

O : S → (S′, m)

Here O denotes an observational operation. It takes configuration S and produces a resulting configuration S′ together with a representation m. The representation can be a measurement, recorded distinction or description.

The letter O is being used locally for observation, rather than for the orbit tuple introduced earlier. These are separate expressions. Their meanings come from their definitions, rather than from the letter alone.

The operation locates observation within the relational field. It does not assert that every observation disturbs every measured property. Nor does participation alone constitute a proof that every representation is incomplete. The stronger premise is that no local description exhausts all the constitutive conditions through which it is constructed, interpreted and used.

A model selects variables and admissible transformations. Its precision depends on that selection. It remains accountable to the relationships its boundaries leave outside the description, particularly when its use changes those relationships.

This is also why constitutive incompleteness must remain distinct from formal undecidability. Formal undecidability concerns a specified proposition that neither follows nor has its negation follow from specified axioms and inference rules. An unanswered question has not thereby been shown undecidable. The relational account does not need to substitute that technical claim for its own foundational premise.

What the account establishes

Constitutive incompleteness excludes complete closure within the framework. The generative premise connects unresolved relations with consequential transitions. Temporal propagation distinguishes occurrence, registration and response, while a measured account of duration requires its own physical specification.

The categorical sketch explains composition. Harmonic and spectral descriptions examine recurrent coordination across meaningful temporal relations. Relational invariance identifies what remains recognisable through specified transformations. Recursive probability updates describe how realised activity changes subsequent possibilities.

The continuity account distinguishes a viable endpoint from uninterrupted continuation. Its finite product and infinite-horizon condition establish particular consequences of specified conditional probabilities. These are connected descriptions of persistence, rather than interchangeable proofs of one another.

The practical inquiry follows the same order: identify what continues, which transformations it survives, how its dependencies are renewed, and how that renewal changes the possibilities of the wider field. The definitions already provide this direction. Their application must retain the mechanisms, boundaries and timescales particular to each domain.

The way that cannot be completed

The Dao cannot become a final object directing existence from outside. Such a reduction would turn a generative relational condition into another supposedly complete thing. The correspondence lies in the impossibility of separating identity from difference, presence from absence, or form from the transformations through which it becomes possible.

In Global Systems, the resistance of certain realities to complete definition belongs to their mode of existence. Their significance is not abolished by the failure of a bounded description to contain them. Further description extends the relations through which they become intelligible without delivering a final external position.

The unpluggable hole is neither a defect to repair nor an independent force guaranteeing that every system survives. It is the constitutive non-closure through which local identity remains dependent on further relation. Persistence occurs through the recurrent reconstruction of those dependencies.

What continues is sufficiently coherent for consequences to propagate and sufficiently differentiated for further activity to remain possible. Complete coincidence would erase the distinction; complete separation would erase the relation. Their continuing interdependence sustains the interval through which transformation can carry identity forward.