Section 4 — Emergent Particles and Mass (TFP, v11.1)
Stable Motifs of the Discrete Substrate
By John Gavel
4.0 Overview
Particles are stable temporal recursions of the discrete binary-flow substrate. No external entities are postulated: motifs that satisfy the substrate update rules persist; motifs that do not decay.
All intrinsic particle properties derive directly from:
- Binary flows \(F_i \in \{+1,-1\}\) (A2 / Section 1)
- Adjacency graph with \(K = 12\) neighbors (A3 / Section 3)
- Synchronous update tick \(\tau_0\) (A5 / Section 2)
- Tension minimization (A6 / Section 2)
- Finite handshake capacity \(H = 132\) and total operational budget \(H_\text{total} = 140\) (A10 / Section 3.2)
Clarification on \(H_\text{total}\):
- Each node has \(K = 12\) neighbors. Directed pairwise handshakes per tick: \(H = K \times (K - 1) = 12 \times 11 = 132\).
- For 3D volumetric motifs, an additional \(2^3 = 8\) combinatorial states are required for addressing the corners of a local cube.
- Total operational per-tick budget: \(H_\text{total} = H + 8 = 140\).
All particle motifs are constrained by this total budget; exceeding it produces unavoidable latency (“stutter”) that gives rise to mass.
4.1 The Three Pillars of Particle Existence
A motif stabilizes into a particle when it satisfies three mechanical conditions:
- Temporal Oscillation: The motif repeats with frequency \(\omega\) determined by the eigenmodes of the local Jacobian \(J\) (Section 3.1.3).
- Topological Circulation (Spin): To avoid handshake collisions, the motif schedules updates around loops, producing a quantized winding number.
- Relational Stutter (Mass): Maintaining oscillation and circulation consumes the finite handshake budget \(H_\text{total}\), creating a recurring latency above the vacuum baseline \(\delta\) (Section 3.2.4).
4.2 Stable Recursions
A particle is a periodic solution on a finite motif \(M\):
\[ F_i(t + T) = F_i(t), \quad \forall i \in M \]
Stability: Linearized updates \[ \delta F(t + \tau_0) = J \cdot \delta F(t) \] are stable if \(|\lambda_j| < 1\) for all eigenvalues \(\lambda_j\) of \(J\). Perturbations decay according to local tension-minimizing dynamics.
Phase Slip: If the motif fails the stability criterion, synchronization errors exceed the coherence length \(L_c\), causing the motif to unravel into transient waves.
Recursion Depth \(d\):
- \(T = d \cdot \tau_0\)
- \(d = 1\): minimal loop (electron-class)
- \(d = 3\): volumetric closure (baryon-class)
4.3 Mass Derivation
Mass is not substance; it is the bit-consumption rate of a stable eigenmode within the finite handshake budget.
4.3.1 1-Tick Baseline (Electron)
The vacuum baseline stutter \(\delta\) is defined in Section 3.2.4 (Folding Tax).
Electron: minimal sustainable stutter above \(\delta\).
Mechanism: single-site closed loop flipping once per tick (\(d = 1\)).
Preserves identity (A7 / Section 1) and fits within \(H_\text{total} = 140\) (A10 / Section 3).
Operational anchor: 1 unit extra processing latency = 1 electron mass.
4.3.2 Volumetric Closure (Proton)
Proton: 3D volumetric motif coordinating all \(K = 12\) neighbors (A3 / Section 3).
Simplex Scaling: 3D closure projected onto 1D temporal flows (A5 / Section 2) introduces a volumetric synchronization cost.
Effective budget: only \(H_\text{effective} = H_\text{total} \times 11/12\) is usable per tick due to saturation constraints.
Mass ratio (symbolic):
\[ \frac{M_p}{M_e} \approx \frac{H_\text{effective} \cdot 1.25}{\delta} \]
Proton is heavier because volumetric synchronization consumes more of the operational budget.
4.4 Charge and Spin (Operational Definitions)
- Charge \(q\): Net alignment bookkeeping \[ q = \sum_i F_i \] Conservation follows from binary flow preservation (A2).
- Spin \(S\): Update scheduling around loops to avoid collisions (A8 / Section 2). Quantization arises from the discrete 12-neighbor shell (A3).
- Pauli Exclusion: Two motifs cannot occupy the same 12-neighbor shell unless update phases are orthogonal — a pigeonhole constraint on \(H_\text{total}\) (A10).
4.5 Summary of Particle Properties
| Property | Operational Basis | Source |
|---|---|---|
| Mass | Latency due to finite \(H_\text{total}\) | Section 3.2.4 |
| Charge | Alignment of binary flows \(F_i\) | A2 / Section 1 |
| Spin | Scheduled circulation in adjacency loops | A3, A8 / Section 2–3 |
| Stability | Eigenvalues of Jacobian \(J\) | Section 3.1.3 |
| Recursion Depth | Temporal period \(T = d \cdot \tau_0\) | A5 / Section 2 |
Key point: Every property is a logical consequence of Section 1–3 axioms, finite lattice topology, and discrete update rules. Nothing is added ad hoc.
4.5.1 Motifs as Directed Comparison Patterns
The substrate is the infinite 1D sequence of flow points \( f_n \) for all integers \( n \), each with a binary state \( F_n(t) \in \{+1, -1\} \). At each tick \( t \), a point \( f_n \) selects exactly one neighbor from its comparison set \( \{n\pm1, n\pm2, \dots, n\pm6\} \) and performs a comparison.
A local comparison at tick \( t \) is the signed product
\[ c_t = F_{n_t}(t)\, F_{m_t}(t), \]
where \( n_t \to m_t \) is the chosen comparison at that tick.
A history \( h \) of duration \( T \) is the ordered sequence
\[ h = \{(n_t, m_t, c_t)\}_{t=1}^{T}. \]
The sign structure of a history is
\[ \sigma(h) = \prod_{t=1}^{T} c_t. \]
Two histories share the same directed comparison pattern if:
- They use the same sequence of comparison types \( (n_t \to m_t) \), up to translation along the 1D manifold.
- They have the same ordered pattern of flip or no-flip outcomes (the same sequence of \( c_t \) values).
A path label \( p \) is a discrete identifier for a routing class through the comparison graph, such as slit A versus slit B, or distinct baryon routing patterns.
A motif \( M^{\alpha} \) is an equivalence class of histories that share both the same directed comparison pattern and the same path label. This is the minimal unit of propagation in the theory.
The amplitude of a motif is the signed sum
\[ A^{\alpha} = \sum_{h \in M^{\alpha}} \sigma(h). \]
Two histories \( h_i \) and \( h_j \) are compatible if:
- Their comparison choices do not violate the rule that a flow point may compare to only one neighbor per tick.
- Their sign structures do not violate local closure constraints.
Define
\[ S(h_i, h_j) = \begin{cases} 1 & \text{if the histories are compatible}, \\ 0 & \text{otherwise}. \end{cases} \]
The measurable quantity associated with motif \( M^{\alpha} \) is
\[ M^{\alpha} = \sum_{h_i, h_j \in M^{\alpha}} \sigma(h_i)\,\sigma(h_j)\,S(h_i,h_j). \]
If all histories in \( M^{\alpha} \) are mutually compatible, then \( S(h_i,h_j) = 1 \) for all pairs, and therefore
\[ M^{\alpha} = \left( \sum_{h \in M^{\alpha}} \sigma(h) \right)^2 = (A^{\alpha})^2. \]
This is the Born rule emerging from pairwise compatibility filtering.
4.5.2 Propagating Motifs and Directed Flow
A motif is not merely a static pattern of signs. A motif is a directed structure that propagates along the 1D flow through a sequence of comparisons.
Propagation occurs when the directed comparison pattern of a motif can be extended consistently across ticks without violating the one-comparison-per-tick rule. A propagating motif therefore encodes:
- A specific routing through the comparison graph.
- A specific ordered pattern of flips and no-flips.
- A specific path label identifying the geometric route.
Propagation is successful only when each extension of the motif remains compatible with all previous ticks. This sequential compatibility requirement is the mechanism that filters out unstable histories.
A propagating motif therefore represents a stable relational structure that persists across ticks. Particles, excitations, and interference patterns are all realized as propagating motifs.
4.5.3 Interference and Observable Coarse-Graining
Interference arises when an observable does not distinguish between multiple motif classes.
If two motifs \( M^{\alpha} \) and \( M^{\beta} \) have different path labels or different directed comparison patterns, they are distinct motifs and do not interfere. Their cross-terms vanish because histories from different motifs are incompatible under the one-comparison-per-tick rule.
However, an observable may intentionally merge multiple motifs into a single equivalence class. For example, a detector screen in a double-slit experiment does not record which slit was used. In this case, the observable defines a coarse motif \( M^{O} \) that contains both \( M^{\alpha} \) and \( M^{\beta} \).
The amplitude for the coarse motif is
\[ A^{O} = A^{\alpha} + A^{\beta}. \]
The measurement object is
\[ M^{O} = (A^{\alpha} + A^{\beta})^2. \]
This produces interference terms
\[ 2 A^{\alpha} A^{\beta} \]
whenever the directed comparison patterns of the two motifs are compatible under the coarse observable.
Thus:
- Distinguishable motifs do not interfere.
- Indistinguishable motifs interfere automatically.
- The Born rule arises from the same pairwise compatibility structure.
This reproduces the operational structure of quantum interference directly from the 1D flow substrate.
4.5.4 Motif Stability and Mass
The stability of a motif is determined by how many ticks it can propagate before violating comparison constraints. A motif that requires many flow points to maintain its directed comparison pattern is extended across a large region of the 1D manifold. A motif that requires only a few flow points is tightly localized.
Mass is inversely related to the spatial extent of the motif along the 1D flow. A light particle corresponds to a motif that extends across many flow points. A heavy particle corresponds to a motif that occupies only a few flow points.
The number of flow points \( N \) required to sustain a motif determines its mass through the flow-mass relation introduced earlier in the theory. This connects motif stability directly to particle mass.
Thus:
- Motifs define the relational structure of particles.
- Stability determines how far a motif extends.
- Extent determines mass.
- Mass determines how motifs propagate and interfere.
4.6 Bridge to Section 5
With particles, mass, charge, and spin fully expressed in dimensionless lattice units, Section 5 anchors these quantities to physical units. The substrate constants \(H\), \(K\), \(\delta\), \(L_c\), and \(\tau_0\) map onto energy, time, and length scales using the proton anchor \(\Psi\).
No comments:
Post a Comment