Patch B.2: Added Scaling Window, Polya Recurrence Theorem, and downgraded Propositions to Heuristic Arguments

papers/project_paper_1_relativity/paper_1_relativity.tex

@@ -38,9 +38,9 @@ such that $Z_{\rm obs} = \sum_{\mathcal{C} \in \Omega_N} \Pi_{\mathcal{O}}(\math
 
 This formulation allows us to prove the exact suppression of the entropy trap.
 
-\textbf{Proposition 1 (Temporal Depth Annihilation):} The probability of a Kleitman-Rothschild poset $\mathcal{C}_{\text{KR}}$ dominating the observer-conditioned ensemble is zero: $\Pi_{\mathcal{O}}(\mathcal{C}_{\text{KR}}) = 0$.
+\textbf{Heuristic Argument 1 (Temporal Depth Exclusion):} The probability of a Kleitman-Rothschild poset $\mathcal{C}_{\text{KR}}$ dominating the observer-conditioned ensemble is zero: $\Pi_{\mathcal{O}}(\mathcal{C}_{\text{KR}}) = 0$.
 
-\textit{Proof.} A pure Kleitman-Rothschild poset is a tripartite 3-level order with maximum proper time $H = 3$ \cite{Kleitman1975}. Because an observer requires a causal chain of $T \gg 1$, a pure KR order cannot contain an observer. However, consider a composite order consisting of a massive disconnected KR blob and a thin chain $V_{\mathcal{O}}$ of length $T$. While the chain satisfies $H \ge T$, the KR blob falls outside the causal horizon of $V_{\mathcal{O}}$. Applying the Kronecker delta function $\delta(V, J^-(V_{\mathcal{O}}) \cup J^+(V_{\mathcal{O}}))$ yields $0$. Therefore, disconnected entropic traps are strictly eliminated from $\Omega_{\rm obs}$. $\square$
+\textit{Argument.} A pure Kleitman-Rothschild poset is a tripartite 3-level order with maximum proper time $H = 3$ \cite{Kleitman1975}. Because an observer requires a causal chain of $T \gg 1$, a pure KR order cannot contain an observer. However, consider a composite order consisting of a massive disconnected KR blob and a thin chain $V_{\mathcal{O}}$ of length $T$. While the chain satisfies $H \ge T$, the KR blob falls outside the causal horizon of $V_{\mathcal{O}}$. Applying the Kronecker delta function $\delta(V, J^-(V_{\mathcal{O}}) \cup J^+(V_{\mathcal{O}}))$ yields $0$. Therefore, disconnected entropic traps are strictly eliminated from $\Omega_{\rm obs}$.
 
 \section{Tensor Networks and Scrambling-Time Exclusion}
 For the remaining subset of non-manifold causal sets that possess sufficient temporal depth ($H \geq T$), the observer conditioning imposes a second rigorous filter based on quantum information dynamics. 
@@ -52,18 +52,24 @@ Applying the fast-scrambling conjecture \cite{Sekino2008} to the graph-theoretic
 \tau_{\text{scr}} \sim \frac{1}{h} \ln N
 \end{equation}
 
-\textbf{Proposition 2 (Expander Scrambling Exclusion):} Highly connected non-manifold causal sets (expander graphs) cannot support persistent localized memory.
+The survival of a localized memory register requires the scaling window:
+\begin{equation}
+\ln N \ll T \ll \tau_{\text{scr}}(d)
+\end{equation}
+where the observer timeline $T$ must exceed the fast-scrambling scale $\ln N$ but remain bounded by the substrate's intrinsic diffusive scrambling time.
 
-\textit{Proof.} For expander graphs, the Cheeger constant $h \sim \mathcal{O}(1)$, ensuring the causal structure acts as an ultra-fast scrambler. Any localized state in $\mathcal{H}_{\text{mem}}$ injected into the network is globally entangled and decohered in $\mathcal{O}(\ln N)$ steps. Because the observer requires persistent local state isolation ($\tau_{\text{scr}} \gg T$), and for these graphs $\tau_{\text{scr}} < T$ for physical memory bounds, expander topologies are excluded from the observer-compatible subspace $\Omega_{\rm obs}$. $\square$
+\textbf{Heuristic Argument 2 (Expander Scrambling Exclusion):} Highly connected non-manifold causal sets (expander graphs) cannot support persistent localized classical memory.
+
+\textit{Argument.} For expander graphs, the Cheeger constant $h \sim \mathcal{O}(1)$, ensuring the causal structure acts as an ultra-fast scrambler. Any localized state in $\mathcal{H}_{\text{mem}}$ injected into the network is globally entangled and its classical correlations are decohered in $\mathcal{O}(\ln N)$ steps. Because the observer requires persistent local state isolation bounded by the scaling window ($\ln N \ll T$), expander topologies violently violate this condition ($\tau_{\text{scr}} < T$). Thus, expander graphs are excluded from the observer-compatible subspace $\Omega_{\rm obs}$.
 
 Therefore, both shallow KR traps and deep topological expanders are exactly eliminated by the observer projection operator $\Pi_{\mathcal{O}}$, leaving them physically unexperienceable.
 
 \section{Dimensional Suppression via Graph Expansion}
 The requirement for local memory survival ($\tau_{\text{scr}} \gg T$) acts as a strict topological filter. Because memory survival requires a slow scrambling time, it mathematically forbids graphs with high connectivity.
 
-\textbf{Proposition 3 (Topological Dimensionality Bound):} To preserve local memory while maintaining a fully interconnected global substrate (Definition 2), the selected physical causal set must be restricted to a low-dimensional, low-expansion network ($d \le 2$).
+\textbf{Heuristic Argument 3 (Topological Dimensionality Bound):} To preserve local classical correlations while maintaining a fully interconnected global substrate (Definition 2), the selected physical causal set must be restricted to a low-dimensional network ($d \le 2$).
 
-\textit{Proof.} The topological dimensionality of a discrete graph is inversely correlated with its Cheeger constant (expansion). High-dimensional or infinite-dimensional graphs (such as randomly connected non-manifold posets) are characterized by $\mathcal{O}(1)$ expansion, leading to $\tau_{\text{scr}} \sim \ln N$. Low-dimensional lattices ($d \le 2$) exhibit slow, diffusive scrambling $\tau_{\text{scr}} \sim N^{2/d}$. Applying the projection operator $\Theta(\tau_{\text{scr}} - T)$ forces the selection of graphs with minimal expansion. Since a globally connected substrate (Definition 2) cannot be an expander graph if it is to support memory, the path integral dynamically collapses onto lower-dimensional configurations. $\square$
+\textit{Argument.} If memory survival requires information to remain localized rather than dissipating globally, the substrate must support recurrent, non-transient classical correlations. By P\'olya's Recurrence Theorem, a simple random walk on a $d$-dimensional lattice is recurrent (information stays local and returns) if and only if $d \le 2$. For $d \ge 3$, the walk is transient (information escapes to infinity). Because an observer requires the recurrent preservation of a local memory register over a macroscopic timeline $T$, substrates with topological dimension $d \ge 3$ function as macroscopic dissipators. The strict condition $\Theta(\tau_{\text{scr}} - T)$ thus dynamically restricts the path integral to low-dimensional recurrent configurations ($d \le 2$).
 
 \section{Interpretational Outlook: The Virtual Machine}
 Because the objective causal substrate is mathematically constrained to low-dimensional, low-expansion topologies ($d \le 2$), 4D macroscopic Lorentzian spacetime cannot be an objective bulk container. Drawing on the interface theory of perception \cite{Hoffman2015}, we propose the ontological interpretation that 4D Minkowski space acts as an exact geometric data structure---a "Virtual Machine" interface---synthesized by the biological observer to decode the 2D causal data stream.