Level 10 Math Upgrade v7: Final formatting and punctuation pass

papers/project_paper_1_relativity/armada_3_jmp/paper_1c_math_JMP.tex

@@ -35,7 +35,7 @@ We investigate the behavior of random walks and discrete diffusion processes on
 
 The study of random walks on graphs provides profound insights into the topological and spectral properties of the underlying space~\cite{Lovasz1993,Woess2000}. Pólya's Recurrence Theorem famously establishes that a simple random walk on an undirected regular integer lattice $\mathbb{Z}^d$ is recurrent for $d \le 2$ and transient for $d \ge 3$~\cite{Polya1921}. This phase transition in diffusion processes serves as a critical mathematical boundary distinguishing low-dimensional manifolds, which can trap and preserve local information, from higher-dimensional spaces, where information irrevocably dissipates.
 
-In discrete models of mathematical physics, particularly causal set theory and related approaches to quantum gravity~\cite{Bombelli1987,Sorkin2003,Surya2019,Rideout2009}, one frequently encounters locally finite Directed Acyclic Graphs (DAGs) acting as fundamental evolving networks. On a DAG, a random walk is constrained by causality; it must follow directed edges and, containing no cycles, can never return to its precise vertex of origin. Consequently, the traditional formulation of recurrence---returning to a starting point---must be generalized.
+In discrete models of mathematical physics, particularly causal set theory and related approaches to quantum gravity~\cite{Bombelli1987,Sorkin2005,Surya2019,Rideout2009}, one frequently encounters locally finite Directed Acyclic Graphs (DAGs) acting as fundamental evolving networks. On a DAG, a random walk is constrained by causality; it must follow directed edges and, containing no cycles, can never return to its precise vertex of origin. Consequently, the traditional formulation of recurrence---returning to a starting point---must be generalized.
 
 In this paper, we establish a generalized recurrence threshold for DAGs. We define recurrence as the persistent temporal intersection of a diffusion state with a localized structural trajectory (a distinguished maximal chain). The propagation of the walk is governed by the discrete Laplacian acting on the graded graph. By computing the trace of the Green's function along the chain, we prove that the necessary condition for recurrent classical correlations bounds the topological dimension of the graph.
 
@@ -60,7 +60,7 @@ The poset possesses an emergent \emph{topological dimension} $d$ if the cardinal
 This definition naturally mirrors the volumetric boundary growth of a $d$-dimensional continuous space, where the cross-sectional area at radial time $t$ scales as $t^{d-1}$.
 
 \begin{definition}[Spatial Homogeneity Condition]
-A graded poset satisfies the \emph{spatial homogeneity condition} if, for any origin vertex $v_0$, the forward causal future $J^+(v_0) \cap L_t$ asymptotically covers the entire layer $L_t$ as $t \to \infty$, such that a random walk rapidly mixes and the transition probabilities uniformly distribute across the layer volume.
+A graded poset satisfies the \emph{spatial homogeneity condition} if, for any origin vertex $v_0$, the forward causal future $J^+(v_0) \cap L_t$ asymptotically covers the entire layer $L_t$ as $t \to \infty$, such that a random walk rapidly mixes and the transition probabilities uniformly distribute across the layer volume. This rapid mixing implies that the spectral gap of the horizontal slice propagation doesn't introduce localizing traps along the chain.
 \end{definition}
 \begin{remark}
 This condition restricts our core theorem to a specific class of highly symmetric, regular graded posets (discrete analogues of isotropic expanding spacetimes). Generic DAGs do not naturally satisfy this condition due to lightcone localization.
@@ -75,7 +75,7 @@ A \emph{distinguished maximal chain} $\gamma$ is a sequence of vertices $\gamma
 To study diffusion and wave propagation on $\mathcal{P}$, we define the incidence kinematics. Let $\mathcal{H}_V$ and $\mathcal{H}_E$ be the Hilbert spaces of square-integrable functions on the vertices and edges, respectively.
 The forward difference operator $\nabla^+: \mathcal{H}_V \to \mathcal{H}_E$ and the backward difference operator $\nabla^-: \mathcal{H}_E \to \mathcal{H}_V$ are defined as:
 \begin{align}
-(\nabla^+ f)(u,v) &= f(v) - f(u) \\
+(\nabla^+ f)(u,v) &= f(v) - f(u), \\
 (\nabla^- g)(v) &= \sum_{u: (u,v)\in E} g(u,v) - \sum_{w: (v,w)\in E} g(v,w).
 \end{align}
 
@@ -114,7 +114,7 @@ A random walk $(X_t)_{t=0}^\infty$ is \emph{chain-recurrent} if it intersects th
 \end{definition}
 
 \begin{theorem}[Dimensional Bound on Recurrence]
-Let $\mathcal{P}$ be a graded poset of integer topological dimension $d \ge 1$ satisfying the spatial homogeneity condition. A random walk on $\mathcal{P}$ is chain-recurrent if and only if $d \le 2$. For $d \ge 3$, the walk is transient.
+Let $\mathcal{P}$ be a graded poset of integer topological dimension $d \in \mathbb{Z}^{+}$ satisfying the spatial homogeneity condition. A random walk on $\mathcal{P}$ is chain-recurrent if and only if $d \le 2$. For $d \ge 3$, the walk is transient.
 \end{theorem}
 
 \begin{proof}
@@ -125,7 +125,7 @@ c_1 \sum_{t=1}^\infty \frac{1}{t^{d-1}} \le \mathbb{E}[I] = \sum_{t=1}^\infty G_
 \end{equation}
 This sum converges or diverges as a standard $p$-series with $p = d - 1$:
 \begin{enumerate}
-    \item If $d \ge 3$ (where $d$ is restricted to integers), then $p \ge 2 > 1$. The expected number of intersections is finite, $\sum G_R \le c_2 \sum \frac{1}{t^{d-1}} < \infty$. By the first Borel-Cantelli lemma, the probability that infinitely many events $E_t$ occur is strictly zero. The walk is strictly transient.
+    \item If $d \ge 3$ (where $d \in \mathbb{Z}^{+}$), then $p \ge 2 > 1$. The expected number of intersections is finite, $\sum G_R \le c_2 \sum \frac{1}{t^{d-1}} < \infty$. By the first Borel-Cantelli lemma, the probability that infinitely many events $E_t$ occur is strictly zero. The walk is strictly transient.
     \item If $d \le 2$, then $p \le 1$. The expected number of visits diverges, $\sum G_R = \infty$. According to standard Markov chain potential theory~\cite{Woess2000}, a state (or distinguished chain) is recurrent if and only if the sum of the transition probabilities (the Green's function trace) diverges. Therefore, the walk is chain-recurrent with probability one.
 \end{enumerate}
 Therefore, stable chain-recurrence is strictly bounded to $d \le 2$.
@@ -184,7 +184,7 @@ L.~Bombelli, J.~Lee, D.~Meyer, and R.~Sorkin,
 \newblock \emph{Space-time as a causal set},
 \newblock Phys. Rev. Lett. \textbf{59}, 521--524 (1987).
 
-\bibitem{Sorkin2003}
+\bibitem{Sorkin2005}
 R.~D. Sorkin,
 \newblock \emph{Causal sets: Discrete gravity},
 \newblock Lectures on Quantum Gravity, 305--327 (Springer, 2005).