Section 2 — Local Dynamics of Binary Relations
Temporal Flow Physics v12.8
John Gavel
2.0 Overview
Section 1 established the irreducible primitives:
- The unbounded relational domain — no imposed boundary on where comparison can occur (§1.1)
- Comparison as the primitive act — the domain relating to itself (§1.2)
- Binary relational states as the outcome of comparison: $F_i \in \{+1, -1\}$ (§1.2)
- Sites as loci of resolved comparison, not prior entities (§1.3)
- Primitive adjacency relations $i \sim j$ (§1.4–1.5)
- Relational difference as the sole primitive observable (§1.4)
- Discrete update steps (§1.7)
- Finite relational capacity per site (§1.7)
- Determinacy via overlapping relational closure (§1.6)
- The Summation Principle: distinct parallel differences sum; never log discrete events (§1.8)
Section 2 derives all local dynamics from these primitives alone, within the minimal adjacency structure: each site has exactly two neighbors, the minimum required for difference propagation beyond direct adjacency. No coordinates, no metric, no spatial embedding, no dimensionality are introduced here. Every quantity is expressed purely in terms of sites, adjacency relations, binary states, and update counts. All distances are summations of discrete differences — never logarithms, which are statistical approximations inappropriate for a discrete substrate.
Why $K=2$ is the minimum: $K=1$ allows only trivial reflection $A \to B \to A$ — no propagation, nothing to derive. $K=2$ is the first structure where $A \to B \to C$ exists, mediated lag appears, and accumulated differences build across more than one hop. $K=2$ is therefore not assumed but derived as the minimum non-trivial adjacency structure from Axioms 1–10. The derivation of higher coordination numbers — culminating in $K=12$ — begins in Section 3.
Within this minimal structure three levels arise naturally:
- Level 0: Binary substrate dynamics (§2.1–2.4)
- Level 1: Relational accumulation and memory (§2.5–2.6)
- Level 2: Emergent proto-temporal structure (§2.7–2.9)
Where a construct requires loops, triangles, or coordination beyond two neighbors, it is noted explicitly and deferred to Section 3, where geometry, distance, and higher coordination emerge from the correlation structure produced here.
Sections 2.0.1–2.0.3 establish three foundational results that precede the binary dynamics: the domain within which the $K=2$ structure operates (§2.0.1), the conservation law governing any comparison (§2.0.2), and the minimum scale at which a comparison resolves into a stable discrete event (§2.0.3). These three results ground the flip — the primitive operation of §2.1 — in the structure of comparison itself rather than in assumption.
2.0.1 The Unbounded Domain and Ranged Comparison
Section 1 established that the relational domain has no imposed boundary — comparison can occur anywhere within it, and no preferred center or edge exists (§1.1). Section 2 operates within this domain using the minimal $K=2$ adjacency structure. No boundary conditions are needed; the $K=2$ chain can extend without limit.
Two aspects of this domain are worth making precise before the dynamics begin:
Unbounded: The domain as a whole has no imposed edge. There is no wall beyond which comparison cannot occur, no preferred origin, no finite extent. Any site can in principle have adjacent sites; no site is special by position.
Ranged: Any specific comparison has finite reach — a local causal horizon. From Axiom 9 (finite relational capacity), a site can engage only a finite number of adjacency relations per update step. The influence of any site on the rest of the domain is therefore bounded at each tick. Information propagates at a finite rate through the adjacency structure — one hop per tick in the minimal $K=2$ chain.
These two aspects are not in tension. The whole domain is without limit; any process within it is locally bounded. The $K=2$ chain is locally ranged (each site reaches exactly two neighbors per tick) and globally unbounded (the chain can extend in either direction without end).
What is discrete and what is not:
Discreteness is not a property of the domain. It is what the comparison operation produces. Before comparison occurs, the domain is undifferentiated — not "smooth" in the geometric sense, but simply not yet structured by any distinction. Each comparison crystallizes a discrete distinction (a binary state, a site, a difference) within the domain. What has not been compared remains undifferentiated.
The $K=2$ chain is locally discrete: each update is a discrete event, each state is binary, each hop is a unit step. But the domain in which this chain is embedded does not acquire those properties globally. The chain is a discrete structure within an undifferentiated background — not a discrete approximation to a continuous manifold.
This distinction matters for what follows. The Pythagorean structure of §2.0.2 and the Euler coherence floor of §2.0.3 are both properties of the comparison operation within this domain — not properties of a pre-existing geometric space.
Operational hierarchy:
Unbounded relational domain (no edge, undifferentiated before comparison)
│
├─> Any comparison: finite reach (causal horizon of that comparison)
│ │
│ ├─> Discrete event (binary state resolves)
│ └─> Observable difference (local to that comparison)
│
└─> Beyond causal reach: undifferentiated until further comparison occurs2.0.2 The Comparison Operation and Pythagorean Conservation
Any comparison is irreducibly triadic. Two aspects of the domain (call their relational extents $a$ and $b$) are compared; the result $c$ is what the comparison produces — distinct from either input alone. This triadic structure is not imported from geometry. It is what comparison IS: two things in relation, and the relation itself as a third thing.
Defining relational extent.
The first question is how to measure the "extent" of a binary relational process. Two candidates present themselves: the count of difference events, and the spread of the binary state distribution. The count is governed by the Summation Principle (§1.8) — it accumulates additively across sequential events in the same channel. A different quantity is needed here, because the comparison combines two independent processes into one result, not two sequential events in one process.
For two independent processes, the natural combination law is not addition of counts but addition of variances. This is not a choice — it is a theorem that holds for any two independent random quantities:
$$ \text{Var}(X + Y) = \text{Var}(X) + \text{Var}(Y) \quad \text{when } X \text{ and } Y \text{ are independent} \quad \text{[D]} $$Independence holds at the instant of primitive comparison, prior to any closure-induced correlations (Axiom 4, Axiom 5). The combination of two comparison processes at a single site is therefore governed by variance addition, not count addition.
Variance of a binary process.
For a binary $\{+1, -1\}$ variable with equal probability (the symmetric case forced by Axiom 1, which specifies no preferred state), the variance is exactly 1:
This is not a choice or approximation. It is the unique second moment of a symmetric binary distribution. The variance of any binary relational process is therefore fixed at 1 per process — by the process being binary, not by any geometric assumption.
Defining relational extent as standard deviation.
We define the relational extent of a binary process as its standard deviation:
For a single binary process, $\sigma = 1$. For a compound process built from $n$ independent binary comparisons, $\sigma^2 = n$. This definition is forced by the requirement that relational extent combine correctly under independence: only standard deviation satisfies $\sigma^2(\text{combined}) = \sigma^2(a) + \sigma^2(b)$ for independent $a, b$.
The triadic variance identity.
Consider a comparison between two independent binary relational processes with extents $a$ and $b$, producing result $c$. Applying variance addition (Axiom 4):
In terms of relational extents ($\sigma(a) = a$, $\sigma(b) = b$, $\sigma(c) = c$ by definition):
$$ a^2 + b^2 = c^2 \quad \text{[D]} $$This is a substrate-internal identity. It follows from Axiom 1 (binary states, fixing $\text{Var} = 1$ per process), Axiom 4 (locality — independence of non-adjacent processes at the moment of comparison), and the definition of relational extent as standard deviation. No geometric embedding, no Euclidean norm, no metric is assumed. The quadratic form emerges because variance — not count — is the correct measure of relational extent for independent parallel processes, and variance addition is an exact theorem, not an approximation.
Why not $a + b = c$?
Linear addition holds for counts of sequential discrete events (Summation Principle, §1.8): two sequential disagreements accumulate as $1 + 1 = 2$. But the comparison operation combines two independent processes into a single result — not two sequential events. Independence is the key distinction. For independent processes, counts do not add to give the result's count; variances do. The Summation Principle and the variance identity govern different structural regimes and are complementary, not conflicting.
Why not $\max(a,b) = c$?
The max-norm would hold if one process completely dominated the comparison and the other contributed nothing to the result. By Axiom 1, the binary comparison has no preferred state and no preferred input — both aspects $a$ and $b$ contribute independently and symmetrically to $c$. When both contribute, neither dominates, and the correct combination is variance addition, not max.
The causal horizon and budget.
The comparison is bounded by its causal horizon — the ranged reach established in §2.0.1. The horizon places an upper bound on $c$: no single comparison can produce a result whose relational extent exceeds what the causal reach can support. When a comparison uses its full available budget, $c$ is at this ceiling and the budget equation reads:
The comparison partitions $c^2$ between $a^2$ and $b^2$. Nothing is created; the budget is partitioned, not generated. The horizon fixes the scale; the variance identity fixes the partition rule.
The flip (§2.1) is where the partition $a^2:b^2$ reaches an extremum — a turning point in how the budget is distributed between the two input processes. The delta-budget framework of Sections 4–5 is the direct expression of this conservation law across assembled stable motifs.
2.0.3 The Euler Coherence Floor and the Origin of $\lambda_p$
A turning point requires a neighborhood. Euler's condition (Methodus Inveniendi, 1744) states that a minimum or maximum is inseparable from the interval over which the reversal is established. Applied to the comparison operation of §2.0.2: the partition $a^2:b^2$ cannot reach a stable extremum without a minimum interval over which the reversal can be confirmed. Below that interval, the partition does not stabilize; no discrete event resolves; no flip occurs.
That minimum interval is $\lambda_p$ — the scale at which the comparison operation first closes on a stable Euler extremum:
$$ \text{Minimum coherent comparison scale:} \quad \lambda_p \quad \text{[D]} $$ $$ \text{Total conserved comparison budget:} \quad c^2 \quad \text{[D]} $$ $$ \text{Flip} = \text{Euler extremum in } c^2\text{-partition at scale} \ge \lambda_p \quad \text{[D]} $$Below $\lambda_p$: no stable discrete structure. At $\lambda_p$: one flip, the simplest stable event. Above $\lambda_p$: compound motifs built from multiple independent flips.
$\lambda_p$ is not a physical scale imported from outside the framework. It is a structural property of the comparison operation: the minimum relational extent required for a comparison to resolve into a stable discrete event. Its identification with the physical Planck length is established in Section 7 through calibration.
The domain has two Euler extrema: the maximum budget per single comparison (the Planck scale) and the minimum stable closed structure (the proton assembly scale, §4). Conservation lives in $c^2$, so the ratio of these two extrema gives:
$$ \alpha_G = \left(\frac{m_p}{m_{\text{Planck}}}\right)^2 \approx 5.9 \times 10^{-39} \quad [\to\text{§7.4.1}] $$This ratio is a consequence of the two-extremum structure of the comparison operation. Its derivation is completed in §7.4.1, where the physical identification of both scales is established.
2.1 Binary Relational States and Primitive Tension
Each site $i$ carries a binary state:
$$ F_i(t) \in \{+1, -1\} $$where $t$ is the discrete update index — a proto-time counter, not physical time. The binary state is the outcome of comparison (§1.2); it is the discrete label produced when a comparison in the unbounded domain (§2.0.1) resolves at scale $\ge \lambda_p$ (§2.0.3).
For any adjacent pair $(i, j)$ with $i \sim j$, the primitive relational difference is:
$$ x_{ij}(t) = F_i(t) \text{ XOR } F_j(t) \in \{0, 1\} $$Equivalently and exactly:
$$ x_{ij}(t) = \frac{1 - F_i(t) \cdot F_j(t)}{2} $$$x_{ij} = 0$ means agreement. $x_{ij} = 1$ means disagreement. This is exact for all four combinations of $\{+1,-1\}$ states with no approximation.
Local tension at site $i$:
$$ T_i(t) = \sum_{j \sim i} x_{ij}(t) $$In the minimal adjacency structure, each site has exactly two neighbors. Therefore $T_i \in \{0, 1, 2\}$:
- $T_i = 0$: both neighbors agree with $i$ (fully aligned)
- $T_i = 1$: one neighbor agrees, one disagrees
- $T_i = 2$: both neighbors disagree with $i$ (fully anti-aligned)
Alignment minimizes tension. Tension is the sole primitive measure of local relational stress.
2.2 Primitive Update Rule (Local Action Descent)
Define the discrete action functional on the adjacency structure:
$$ S = \sum_{\text{edges } (i,j)} \frac{1}{2}(F_i - F_j)^2 $$For $F_i, F_j \in \{+1,-1\}$ this reduces to: $0$ if $F_i = F_j$ (agreement), $2$ if $F_i \neq F_j$ (disagreement). So $S = 2 \times$ (number of disagreeing edges). Minimizing $S$ is equivalent to minimizing total tension.
Charge conservation:
Define global charge $Q = \sum_i F_i$. The only admissible elementary operation is a simultaneous pairwise flip of an adjacent disagreeing pair:
Since $F_i \neq F_j$ implies $F_i + F_j = 0$ exactly, $\Delta Q = -2(F_i + F_j) = 0$. Charge is exactly conserved per flip.
Local action change for a potential flip of pair $(i, j)$:
$$ \Delta S_{ij} = -8 \times (A_i + A_j - D_i - D_j) $$where $A_i =$ agreements at $i$ excluding $j$, $D_i =$ disagreements at $i$ excluding $j$.
Note: The formula $\Delta S = -8 \times (A_i+A_j-D_i-D_j)$ is expressed in action units where each disagreeing edge contributes 2. In counting units (each edge contributes 1), the acceptance criterion reduces to: accept the flip when $D_i+D_j > A_i+A_j$. Both forms describe identical dynamics.
Accept flip $(i,j)$ when: $D_i + D_j > A_i + A_j$ (both sites are "social outliers")
which follows directly from $\Delta S_{\text{actual}} = (A_i-D_i) + (A_j-D_j) < 0$.
In the minimal structure, each site has exactly one other neighbor beyond the flip partner. The four configurations and their $\Delta S$ values:
| Left neighbor | Right neighbor | $\Delta S_{ij}$ | Interpretation |
|---|---|---|---|
| $i$ agrees with left | $j$ agrees with right | 0 | Neutral — neither helps nor costs |
| $i$ disagrees w. left | $j$ agrees with right | +16 | Costly — flip increases action |
| $i$ agrees with left | $j$ disagrees w. right | −16 | Favorable — flip decreases action |
| $i$ disagrees w. left | $j$ disagrees w. right | 0 | Neutral — costs cancel |
Note on interval and pairing structure: The outcome of any flip depends not on the pair in isolation but on the full local configuration. Over the complete range of configurations the outcomes are symmetric (sum to zero). Within any given configuration they are asymmetric. This sensitivity to interval and pairing structure is the mechanism by which stable patterns resist flipping and persist across ticks. Table uses counting-unit normalization ($\pm 1$ per edge). Action units scale by factor 8. Acceptance criterion $D_i+D_j > A_i+A_j$ is identical in both representations.
Deterministic zero-temperature limit:
- If $\Delta S_{ij} < 0$ and $F_i \neq F_j$: flip executes
- Otherwise: state unchanged
Properties proven: binary constraint preserved, global charge conserved, total tension non-increasing for $T_{\text{eff}} = 0$, all dynamics strictly local and asynchronous.
2.3 Stochastic Extension
To include substrate fluctuations, introduce effective temperature $T_{\text{eff}} \ge 0$. Each adjacent pair $(i,j)$ fires according to its local process. When a firing event occurs, the flip is accepted with probability:
$$ P(\text{flip} \mid \text{firing}) = 1 \quad \text{if } \Delta S_{ij} < 0 $$ $$ P(\text{flip} \mid \text{firing}) = \exp(-\Delta S_{ij} / T_{\text{eff}}) \quad \text{if } \Delta S_{ij} \ge 0 $$Temperature regimes: $T_{\text{eff}} = 0$ (fully deterministic), $T_{\text{eff}} \to \infty$ (effectively random), $T_{\text{eff}} \sim \mathcal{O}(1)$ (critical fluctuating). Equilibrium distribution: $P_{\text{eq}} \propto \exp(-T_{\text{total}} / T_{\text{eff}})$. Detailed balance holds locally.
2.4 Proto-Mass and Directed Transport
2.4.1 Flip indicator and proto-mass
Define the flip indicator at site $i$:
$$ R_i(t) = \begin{cases} 1 & \text{if } F_i(t + \tau_0) \neq F_i(t) \\ 0 & \text{else} \end{cases} $$Time-averaged flip rate (proto-mass density):
$$ M_i = \frac{1}{W} \sum_{n=0}^{W-1} R_i(t_0 + n\tau_0) $$$M_i \in [0, 1]$, dimensionless. Mass is operational — it counts sustained relational activity. Mass is not substance. It is the summation of flip events over an interval — the accumulated cost of relational difference maintained across ticks. In the language of §2.0.3, it is the accumulated count of Euler extrema resolved at site $i$ per unit window.
2.4.2 Directed transport bias (proto-velocity)
Flip activity need not be symmetric across adjacency. Define signed transport across edge $(i \to j)$:
$$ T_{ij}(t) = R_i(t) \cdot x_{ij}(t) $$Net propagation bias at site $i$:
$$ v_i(t) = \frac{1}{|\text{Adj}(i)|} \sum_{j \sim i} \text{sgn}(i \to j) \cdot T_{ij}(t) $$2.4.3 Proto-momentum
$$ p_i(t) = M_i \cdot v_i(t) $$Momentum is conserved locally up to boundary flux and saturation-induced stutter:
$$ \sum_{i \in \Omega} p_i(t + \tau_0) - \sum_{i \in \Omega} p_i(t) = -\Phi_{\text{boundary}}(t) + S_{\text{stutter}}(t) $$2.5 Accumulated Differences — Relational Memory
2.5.1 Accumulated relational difference (summation)
$$ A_{ij}(t) = \sum_{n=0}^{t} x_{ij}(n) $$This is a running integer count of disagreements between $i$ and $j$ across all ticks up to $t$. It is the primary measure of relational history. This is the correct form of relational distance in the discrete substrate — a direct application of the Summation Principle (§1.8). $A_{ij}(t)$ is always a non-negative integer. No approximation.
Operational distance between adjacent sites $i$ and $j$:
$$ d_{ij}(t) = \frac{A_{ij}(t)}{t} = \text{time-averaged disagreement rate} \in [0, 1] $$For a mediated path $i \to k \to j$: the minimum cost is 2 ticks. The lag is a physical fact about the discrete structure, not a statistical property.
2.5.2 Proto-time ordering (local causal order)
Each accepted local flip defines a primitive causal update event: Event $n \to$ Event $n+1$. Causality arises because State($n$) determines State($n+1$) through the local flip rule.
Coarsening order parameter:
$$ S_{\text{coarse}}(t) = -\frac{1}{N} \sum_i T_i(t) $$$S_{\text{coarse}}$ is non-decreasing under local dynamics for $T_{\text{eff}} = 0$, non-decreasing on average for $T_{\text{eff}} > 0$.
2.5.3 Why this is not the arrow of time
The monotonic tendency of $S_{\text{coarse}}$ does not imply fundamental time asymmetry. The microscopic rules are locally reversible. Irreversibility appears only statistically, from combinatorial bias toward tension-reducing moves, local acceptance asymmetry, and domain coarsening dynamics. The apparent arrow arises from ensemble bias, not from an imposed global direction.
2.6 Domain Structure and Coarsening
Under tension minimization, disagreeing pairs flip toward agreement, driving domain coarsening. Domain merging is favored; fragmentation is suppressed.
Coarsening dynamics: For $T_{\text{eff}} \sim 0$: $R_{\text{domain}}(t) \sim (D \cdot t)^{1/2}$ (Allen-Cahn). For $T_{\text{eff}} > 0$: $R_{\text{domain}}(t) \sim (D \cdot t)^{1/z}$, $z \ge 2$. $R_{\text{domain}}$ is measured in adjacency steps. [D]
Continuum approximation of discrete domain-wall motion. Exact substrate scaling verified in §3.2 via $K=2$ chain enumeration.
2.7 Relational Correlations
Temporal cross-correlation between sites $i$ and $j$:
$$ C_{ij}(\tau) = \langle x_{ij}(t) \cdot x_{ij}(t + \tau) \rangle $$This measures how persistently $i$ and $j$ maintain a disagreement relationship across $\tau$ update steps. Operational relational similarity:
$$ d_{ij} = \frac{1}{t} \sum_{n=0}^{t} x_{ij}(n) $$Sites that persistently agree have small $d_{ij}$ (approaching 0). Sites that persistently disagree have large $d_{ij}$. Mediated paths accumulate cost additively: $d_{AC} \ge d_{AB} + d_{BC}$.
The correlation structure $C_{ij}(\tau)$ is the seed from which Section 3 derives geometry.
2.8 Reflection Phase and Minimal Relational Closure
In the minimal adjacency structure, sites $A$, $B$, $C$ form a chain: $A \sim B \sim C$. There are no closed triangles. The only closed relational loop is reflection: $A \to B \to A$.
Reflection phase: $\phi_{i \to j} = \pi \cdot x_{ij}$. For a reflection $A \to B \to A$: $H_{ABA} = \phi_{A \to B} + \phi_{B \to A} = 2\pi \equiv 0 \pmod{2\pi}$. Holonomy in the minimal structure is always trivially zero. Curvature requires genuine triangular loops, first appearing in Section 3.
The mediated lag encoded by reflection:
$$ \text{cost}(A \to C) = \text{cost}(A \to B) + \text{cost}(B \to C) = 1 + 1 = 2 \text{ ticks minimum} $$This is the irreducible lag of the minimal adjacency structure and the foundation from which Section 3 derives $c$.
The minimal propagation pattern in the $K=2$ chain is the standing wave $A \to B \to C \to B \to A$ (period 4 ticks): the excitation bounces between non-adjacent endpoints $A$ and $C$ via the mediating site $B$. Forward and backward strokes are equal — no net winding accumulates. This is consistent with trivial holonomy in the $K=2$ structure. Directed chirality (non-zero net winding) requires genuine triangular loops, first appearing in Section 3.
2.9 Stability and Informational Friction
$$ \delta_i = \frac{1}{W} \sum_{t=0}^{W} \frac{T_i(t)}{K_{1D}} $$$\delta_i \in [0, 1]$: 0 = always aligned (stable), 1 = always in tension (unstable). This is a pure summation over ticks — no eigenvalues, no logarithm.
Stable coherent motifs persist when the sustained disagreement fraction $\delta$ remains below the threshold determined by the pairing structure of the local interval. The precise characterization of flip-resistant pairing structures is developed in Section 3.
2.10 Finite Relational Capacity and the Mediated Lag
From Axiom 9, each site has finite relational capacity:
$$ K_{1D} = 2 \quad (\text{exactly two neighbors}) $$ $$ H_{1D} = K_{1D} \cdot (K_{1D} - 1) = 2 \times 1 = 2 $$Each site can maintain two adjacency relations but can actively resolve only one per tick. The stutter: when both neighbors demand updates in the same tick, only one can be served. The other accumulates as unresolved latency.
Tick 1: B resolves with A
Tick 2: B resolves with C
A's influence on C costs a minimum of 2 ticksStutter sink in the momentum balance:
$$ p_i(t + \tau_0) - p_i(t) + \sum_{j \sim i} J_{ij}(t) = -s_i(t) $$ $$ s_i(t) = \kappa_s \cdot \delta_i(t) \cdot p_i(t) $$When $\delta_i = 0$: capacity is not exceeded, momentum locally conserved. When $\delta_i > 0$: directed transport converts to unresolved relational latency — the primitive origin of inertia.
§2.10.1 Sequential Engagement and the Relay Mechanism
The stutter of §2.10 describes what happens when both neighbors demand resolution simultaneously. Before that limit is reached, a more fundamental dynamic governs how a site with two neighbors moves through its comparisons. This dynamic is the relay — and it is the origin of all propagation in the $K=2$ structure.
The Sequential Engagement Rule
A site $B$ with neighbors $A$ and $C$ cannot resolve both adjacency relations in the same tick (Axiom 9, finite capacity). The two engagements are therefore sequential: $B$ resolves with one neighbor in tick $t$, and with the other in tick $t+1$.
The order of engagement is governed by local tension. In each tick, $B$ directs its relational capacity toward whichever neighbor presents the higher unresolved tension:
$$ \text{If } T_{BA}(t) > T_{BC}(t): \quad B \text{ engages } A \text{ in tick } t, C \text{ in tick } t+1 $$ $$ \text{If } T_{BC}(t) > T_{BA}(t): \quad B \text{ engages } C \text{ in tick } t, A \text{ in tick } t+1 $$ $$ \text{If } T_{BA}(t) = T_{BC}(t): \quad \text{tied; one is selected by local state parity} $$ $$ \text{(} F_B \text{ determines priority when tensions are equal)} $$This is not a scheduling rule imposed from outside. It is the direct consequence of Axiom 9 (each site resolves one comparison per tick) and Axiom 4 (all updates are local) operating on the available tension at each adjacency.
What the Waiting Neighbor Receives
While $B$ is engaged with $A$ in tick $t$, site $C$ is not disconnected from $B$. $C$ continues to carry its current relational state and experience tension relative to $B$'s current state. The difference $x_{BC}(t)$ is still defined; $C$'s tension $T_C(t)$ still accumulates.
What $C$ cannot do in tick $t$ is act on that tension through $B$ — it cannot flip with $B$ while $B$ is otherwise occupied. The tension at $C$'s $B$-side accumulates as unresolved demand:
$$ \text{demand}_C(t) = T_{CB}(t) \quad \text{while } B \text{ is engaged with } A $$This unresolved demand is what $B$ faces when it turns to $C$ in tick $t+1$. If $\text{demand}_C$ has grown large enough ($D_C > A_C$ in counting units), $B$ will flip with $C$.
The Relay: B Carries A's Resolution to C
The critical structural fact is this:
$$ B\text{'s state at the end of tick } t \text{ — after resolving with } A \text{ — is the state } C \text{ reads when } B \text{ engages } C \text{ in tick } t+1. $$This is not a separate transport mechanism. It is a direct consequence of how states update sequentially. $B$ compares with $A$, updates (or does not update) $F_B$, and then presents that updated $F_B$ to $C$. $A$'s influence on $C$ travels through $B$'s state, not through any direct channel.
The relay therefore has a fixed cost structure:
Tick t: B resolves with A → F_B(t) updated (or confirmed)
Tick t+1: B resolves with C, presenting F_B(t) → C updates (or confirms)
Minimum cost for A's influence to reach C via B: 2 ticks [D]This is not an approximation. It is exact: there is no mechanism by which $A$'s tick-$t$ state can reach $C$ in fewer than 2 ticks through a $B$ that has only one comparison capacity per tick.
Chain Extension: Operational Distance from Sequential Relays
The relay logic extends along the full $K=2$ chain. Consider a longer chain $A \sim B \sim C \sim D$.
If $B$ relays $A$'s influence to $C$ in 2 ticks, and $C$ must then relay to $D$, $C$ faces the same constraint $B$ did: $C$ is already occupied with its $B$-side engagement when $D$'s demand arrives, or vice versa.
The minimum cost for $A$'s influence to reach $D$:
A→B: 1 tick (direct adjacency, one comparison)
B→C: 1 tick (B relays; C reads B's updated state)
C→D: 1 tick (C relays; D reads C's updated state)
Total: 3 ticks minimumGeneralizing: for a chain of $n$ sites, $A$'s influence reaches the $n$th site in $n-1$ ticks minimum. This is the discrete operational distance:
$$ d_{\text{chain}}(n) = n - 1 \text{ ticks minimum} \quad \text{[D]} $$Each adjacency hop costs exactly one tick of relay delay. The accumulated difference count $A_{ij}(t)$ of §2.5.1 is the time-integral of this relay cost — the running record of how many times $B$ has carried a disagreement from $A$'s side to $C$'s side. Relational distance is accumulated relay cost, not a pre-existing metric.
Why the Relay Is Not the Stutter
The stutter (§2.10) occurs when both neighbors demand resolution in the same tick and only one can be served — the other is deferred. The relay is the normal operating condition: $B$ moves sequentially through its two neighbors, each tick resolving with one and implicitly updating the state that the other will read next.
Relay: B's sequential engagement, one neighbor per tick.
Both neighbors are eventually served; the information propagates.
This is the mechanism of propagation.
Stutter: B's capacity is exceeded because both demands arrive together.
One comparison is deferred beyond its natural relay position.
This is the mechanism of effective inertia — §2.10's stutter sink.The stutter is the relay breaking down under demand overload. When the relay runs cleanly — each neighbor served in its natural sequential turn — propagation is smooth and the 2-tick minimum holds exactly. When the relay overloads — both neighbors demanding the same tick — the latency exceeds the minimum, and the excess becomes the unresolved accumulation that §2.10 quantifies as $s_i(t)$.
The Internal/External Reading of the Relay
The relay mechanism is where the internal/external distinction of §1.9 first becomes concrete.
$B$'s comparison with $A$ is internal to the $A$–$B$ relation. It produces a state change at $B$. $B$'s subsequent comparison with $C$ is the external propagation of that state change — the relational result leaving $B$'s immediate vicinity and entering $C$'s local domain.
The relay is therefore the mechanism by which internal comparison becomes external propagation. A comparison that resolves at $B$ stays internal if $C$ never reads $B$'s updated state (no relay). A comparison that relays through $B$ becomes external when $C$ reads and responds to $B$'s new state.
This is not metaphorical. In a $K=2$ chain:
Internal: The B-site flip (or non-flip) in response to A.
The tension T_B changes; A's influence is absorbed at B.
External: B's updated state reaching C in the next tick.
A's influence propagates beyond B into C's domain.The ratio of absorbed-to-propagated comparison outcomes is the primitive expression of the $\delta / \Psi_{\text{sph}}$ split that Section 3 derives from icosahedral geometry. Here, at the $K=2$ level, the split is not yet quantifiable — but its mechanism exists in every relay.
Axiomatic Trace
| Construct | Source | Axiom |
|---|---|---|
| Sequential engagement order | Tension-directed, one comparison per tick | A4, A9 |
| Waiting neighbor accumulates demand | State persists; tension defined even when idle | A2, A3, A9 |
| $B$ carries $A$'s state to $C$ | $F_B(t)$ is $B$'s state after tick $t$; $C$ reads it | A2, A5, A8 |
| 2-tick minimum relay cost | One tick per hop; sequential not parallel | A8, A9 |
| Chain distance = accumulated relay | $d = n-1$ hops, each 1 tick; summation not metric | A6, A8, A9 |
| Stutter = relay overload | Both demands same tick; one deferred | A9 |
| Internal/external split first concrete | Relay = propagation; non-relay = absorption | A9, §1.9 |
2.11 Anchoring and Global Stability
Without a stabilizing constraint, the global orientation $\Theta = \sum_i F_i$ undergoes a random walk. Anchoring modifies flip probability:
$$ P(\text{flip at } i) \to P(\text{flip at } i) \cdot [1 + \lambda \cdot \text{sign}(F_i) \cdot (\Theta - \Theta_0)] $$where $\lambda \ll 1/N$ (weak coupling) and $\Theta_0$ is the reference orientation. This is the unique lowest-order perturbation that breaks global $F_i \to -F_i$ symmetry while preserving all local axioms. Anchoring is the seed of what later becomes mass normalization and gauge fixing.
2.12 Emergent Effective Parameters
From the substrate quantities derived above:
Intrinsic causal rate:
$$ c_{\text{int}} = 1 \text{ adjacency-step per tick} $$This is exact and derives directly from the minimal adjacency structure — from the ranged reach of a single comparison (§2.0.1) and the discrete update structure (Axiom 8). No faster rate is possible: a site can compare with at most one adjacent site per tick. In the language of §2.0.2, $c_{\text{int}} = 1$ is the unit of causal reach — the minimum interval a comparison spans per tick. The full physical speed $c$ is calibrated in Section 5.
Effective inertia:
$$ I_{\text{eff}} \sim \delta $$The full expression $I_{\text{eff}} \sim \delta \cdot \text{TF} \cdot R_{\text{domain}}^2$ requires spatial extent and loop structure not yet available in Section 2.
Effective coupling:
$$ G_{\text{eff}} \sim \delta $$The full coupling requires Section 3's geometric structure. All three quantities are dimensionless. Physical calibration is deferred to Section 5.
2.13 Axiomatic Closure
Every construct in Section 2 traces to Section 1 primitives. Entries from §2.0.1–2.0.3 are marked:
| Construct | Origin | Axiom |
|---|---|---|
| Unbounded domain / ranged comparison [§2.0.1] | No imposed boundary; finite causal reach | A1, A4, A9 |
| $c^2$ — conserved comparison budget [§2.0.2] | Causal horizon upper bound per comparison | A1, A3, A9 |
| Triadic comparison structure: $a^2+b^2=c^2$ [§2.0.2] | Variance addition of independent binary processes (A1, A4) | A1, A2, A3 |
| $\lambda_p$ — minimum coherent comparison scale [§2.0.3] | Euler extremum condition; Axiom 9 capacity | A3, A8, A9 |
| $\alpha_G = (m_p/m_{\text{Pl}})^2$ [→§7.4.1] | Two-extremum structure of comparison | §2.0.3, §7.4.1 |
| $T_i$ (tension) | Binary disagreement count | A2, A3 |
| $x_{ij} = (1-F_iF_j)/2$ | Exact algebraic form | A2 |
| Pairwise flip rule | Action minimization on graph | A3, A7, A9 |
| Charge conservation | $\Delta Q = 0$ proven exactly | A2 |
| $M_i$ (proto-mass) | Time-averaged flip rate (summation) | A2, A8, A9 |
| $v_i$ (proto-velocity) | Directed transport bias | A3, A4, A5 |
| $p_i$ (proto-momentum) | $M_i \cdot v_i$ | Derived |
| $A_{ij}$ (memory) | Accumulated disagreement count (summation) | A6, A8 |
| $d_{ij}$ (relational cost) | $A_{ij}/t$ — summation, not log | A6, A8 |
| $S_{\text{coarse}}$ (ordering) | $-$mean tension, monotonic | A7, A8 |
| $C_{ij}$ (correlation) | Temporal persistence of $x_{ij}$ | A2, A8 |
| $\delta$ (stability) | Time-averaged tension fraction | A9 |
| $H_{1D} = 2$ | $K_{1D}(K_{1D}-1)$, $K_{1D}=2$ | A9 |
| $s_i$ (stutter sink) | Capacity overflow latency | A9 |
| $c_{\text{int}} = 1$ step/tick | Direct adjacency rate; ranged comparison | A3, A8 |
No free parameters. No spatial embedding. No metric. No dimensionality assumption. No logarithms.
2.14 Bridge to Section 3
Section 2 delivers to Section 3 the following purely relational ingredients:
- Binary states $F_i(t)$ and their update dynamics
- Proto-mass $M_i$ and proto-momentum $p_i$ per site
- Accumulated differences $A_{ij}(t)$ as exact integer counts of relational history
- Temporal correlations $C_{ij}(\tau)$ between site pairs
- Operational relational cost $d_{ij} = A_{ij}/t$ as summation
- Stability margin $\delta_i$ as time-averaged tension fraction
- Causal ordering from event sequence
- Intrinsic rate $c_{\text{int}} = 1$ step/tick
- The mediated lag: minimum 2 ticks for non-adjacent influence
From §2.0.1–2.0.3, Section 3 additionally receives:
- The unbounded relational domain — no boundary conditions required (§1.1, §2.0.1)
- The triadic comparison structure $a^2+b^2=c^2$ as the conservation law for any comparison (§2.0.2)
- The minimum coherent comparison scale $\lambda_p$ at which discrete events first resolve (§2.0.3)
- The gravitational coupling ratio $\alpha_G$ as a two-extremum structural property, to be completed in §7.4.1
Section 3 uses the full ingredient set to derive:
- Emergent spatial geometry from the correlation structure of $d_{ij}$ across multiple interacting chains
- The transition from $K_{1D}=2$ to $K=12$ via ternary closure requirements
- Distance as a full metric tensor rather than a scalar cost
- Curvature from non-trivial holonomy around genuine triangular loops
- Dimensionality from the minimum closure structure: $D=3$
- Motifs as flip-resistant pairing structures — the foundation of particle stability
- The speed $c$ from the mediated lag structure, and its invariance from saturation of the tick budget
Section 2 operates within the minimal adjacency structure ($K=2$). All geometry, dimensionality, and multi-chain structure begins in Section 3.
Section 2 — End
Temporal Flow Physics v12.8 · John Gavel
No comments:
Post a Comment