diff --git a/papers/project_paper_1_relativity/paper_1_relativity.pdf b/papers/project_paper_1_relativity/paper_1_relativity.pdf index 09b5b753..882c7fae 100644 --- a/papers/project_paper_1_relativity/paper_1_relativity.pdf +++ b/papers/project_paper_1_relativity/paper_1_relativity.pdf @@ -1,3 +1,3 @@ version https://git-lfs.github.com/spec/v1 -oid sha256:b04ef74efd064615b64418f88c1ca5326855bbe85a4375290d8017397f546986 -size 215804 +oid sha256:3131423cc83c30e53541e9635a6316d0b2fa76ec340e041ec118b0daef7aa915 +size 222535 diff --git a/papers/project_paper_1_relativity/paper_1_relativity.tex b/papers/project_paper_1_relativity/paper_1_relativity.tex index 48d69599..146be51e 100644 --- a/papers/project_paper_1_relativity/paper_1_relativity.tex +++ b/papers/project_paper_1_relativity/paper_1_relativity.tex @@ -21,7 +21,7 @@ Rather than searching for a purely objective dynamical suppression, we introduce \textbf{Definition 1 (The Causal Observer):} An observer $\mathcal{O}$ is defined as a localized causal sub-graph $\mathcal{O} = (V_{\mathcal{O}}, E_{\mathcal{O}})$ embedded within a global causal set $\mathcal{C} = (V, E)$, such that $V_{\mathcal{O}} \subset V$. -\textbf{Definition 2 (The Causal Markov Blanket):} The boundary of the observer is defined strictly by its order-theoretic causal relations. The Causal Markov Blanket $\partial \mathcal{O}$ is the union of the immediate causal past $J^-(V_{\mathcal{O}}) \setminus V_{\mathcal{O}}$ and causal future $J^+(V_{\mathcal{O}}) \setminus V_{\mathcal{O}}$ that directly interconnects $\mathcal{O}$ to the bulk environment $\mathcal{C} \setminus \mathcal{O}$. +\textbf{Definition 2 (Global Relational Restraint):} To enforce observer-realizability on the universal scale, we require that the observer cannot be disconnected from the bulk. The entire universe must reside within the observer's causal horizon. Mathematically, the global causal set must satisfy $\mathcal{C} = J^-(V_{\mathcal{O}}) \cup J^+(V_{\mathcal{O}})$. Any causally disconnected domains are strictly excluded from the observer-compatible subspace. \textbf{Definition 3 (The Memory Register):} For the observer $\mathcal{O}$ to experience continuous temporal evolution, it must possess an internal state space $\mathcal{H}_{\text{mem}}$ (a memory register). We mandate that this register must survive coherently for a macroscopic number of sequential updates. Topologically, this requires the existence of a causal chain (a totally ordered subset) within $V_{\mathcal{O}}$ of minimum length $T$, where $T \gg 1$. @@ -30,15 +30,17 @@ We define the Observer-Conditioned Path Integral by restricting the sum over the \begin{equation} Z_{\rm obs} = \sum_{\mathcal{C} \in \Omega_{\rm obs}} \exp\left( i S_{\rm BD}(\mathcal{C}) \right) \end{equation} -where $\Omega_{\rm obs}$ is the strict subset of causal sets that satisfy the conditions of Definitions 1-3. We can enforce this via a projection operator $\Pi_{\mathcal{O}}(\mathcal{C})$ such that $Z_{\rm obs} = \sum_{\mathcal{C} \in \Omega_N} \Pi_{\mathcal{O}}(\mathcal{C}) \exp\left( i S_{\rm BD}(\mathcal{C}) \right)$. +where $\Omega_{\rm obs}$ is the strict subset of causal sets that satisfy the conditions of Definitions 1-3. We formally define the projection operator $\Pi_{\mathcal{O}}(\mathcal{C})$ as: +\begin{equation} +\Pi_{\mathcal{O}}(\mathcal{C}) = \delta\Big(V, J^-(V_{\mathcal{O}}) \cup J^+(V_{\mathcal{O}})\Big) \cdot \Theta(H_{V_{\mathcal{O}}} - T) \cdot \Theta(\tau_{\text{scr}}(\mathcal{C}) - T) +\end{equation} +such that $Z_{\rm obs} = \sum_{\mathcal{C} \in \Omega_N} \Pi_{\mathcal{O}}(\mathcal{C}) \exp\left( i S_{\rm BD}(\mathcal{C}) \right)$. Here, $\delta$ enforces global causal connectedness, the first Heaviside step function $\Theta$ enforces the temporal depth of the observer, and the second enforces memory survival against scrambling. 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}}$ supporting an observer $\mathcal{O}$ is strictly zero: $\Pi_{\mathcal{O}}(\mathcal{C}_{\text{KR}}) = 0$. +\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$. -\textit{Proof.} A Kleitman-Rothschild poset is defined as a tripartite 3-level order containing approximately $N/2$ elements in the middle layer \cite{Kleitman1975}. By definition, the maximum proper time (chain length or height) of any $\mathcal{C}_{\text{KR}}$ is precisely $H = 3$. According to Definition 3, an observer requires a causal chain of minimum length $T \gg 1$. Since $H < T$, no continuous sub-graph satisfying Definition 3 can be embedded in $\mathcal{C}_{\text{KR}}$. Therefore, $\mathcal{C}_{\text{KR}} \notin \Omega_{\rm obs}$. $\square$ - -This proposition algebraically annihilates the entire $\exp(\mathcal{O}(N^2))$ KR multiplicity from the physical path integral without requiring fine-tuned dynamical suppression. +\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$ \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. @@ -56,14 +58,12 @@ Applying the fast-scrambling conjecture \cite{Sekino2008} to the graph-theoretic 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 and Holographic Bounds} -The requirement for local memory survival ($\tau_{\text{scr}} \gg T$) acts as a strict topological filter, eliminating high-expansion graphs and selecting for geometries with low connectivity and strict locality. +\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. -Furthermore, following the theorem of Bombelli, Henson, and Sorkin, a Lorentz-invariant discrete substrate behaves statistically as a Poisson sprinkling \cite{Bombelli2009}. However, the unconstrained sprinkling of discrete elements into a macroscopic 4D bulk generates a configurational entropy that scales with the bulk volume, violating the covariant holographic entropy bound \cite{Bousso1999}, which requires entropy to scale with boundary area. +\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{Proposition 3 (Holographic Dimensionality Bound):} To preserve discrete Lorentz invariance while strictly satisfying covariant holographic entropy bounds, the selected physical substrate must be restricted to a lower-dimensional network ($d \le 2$). - -\textit{Proof (Sketch).} If the causal substrate generates continuous 4D spacetime, its discrete elements must satisfy the Bousso bound $S \le A / 4G$, where $A$ is the area of the bounding surface. A 4D Poisson sprinkling yields an extensive entropy $S \propto V_{4D}$. To prevent $V_{4D} > A$, the fundamental discrete graph cannot densely pack a 4D bulk; it must reside on a dimensionally reduced holographic screen ($d \le 2$) such that its degrees of freedom scale consistently with the boundary area of the emergent spacetime. $\square$ +\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$ \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.