refactor(physics): deep mathematical hardening based on Round 3 adversarial review

papers/Holographic_Entanglement_Entropy_in_Markovian_Networks.md

@@ -1,29 +1,28 @@
-# Holographic Entanglement Entropy in Discrete Graph Topologies
+# Holographic Trapped Surfaces via Directed Graph Edge-Cuts
 
 **Target Venue:** *Journal of Cosmology and Astroparticle Physics (JCAP)*
 
 ## Abstract
-If the universe is a pre-geometric network of Markovian Agents (Conscious Realism), classical continuum physics such as General Relativity must be emergent approximations. Consequently, describing black holes using geometric Area ($A$) and the Planck length ($\ell_p$) is a dimensional category error. We reformulate the Bekenstein-Hawking entropy bound strictly for a dimensionless, discrete graph topology. By replacing geometric area with the minimum edge-cut ($C_{min}$) defining a sub-graph boundary, we demonstrate that a "singularity" occurs when the entanglement entropy of the internal nodes exceeds the channel capacity of the boundary edges. The event horizon is not a tear in spacetime, but a saturated graph-theoretic bottleneck.
+Mapping the Bekenstein-Hawking entropy bound to a discrete pre-geometric network requires replacing continuum metrics with rigorous graph theory. Previous attempts contained algebraic dimensional errors and failed to distinguish thermal graph bottlenecks from true gravitational event horizons. We rectify this by defining the holographic bound via the max-flow min-cut theorem: $S \le |C_{min}| \log(d)$, where $C_{min}$ is the minimum edge cut and $d$ is the local Hilbert dimension. Furthermore, we introduce directed causal edges. A gravitational singularity is rigorously defined as a sub-graph where the directed edge cuts form a strict trapped causal surface (all directed paths point inward), completely isolating the internal network's entanglement entropy from the exterior topology.
 
 ## 1. Introduction
-The Bekenstein bound limits the information in a region of space. In a pre-geometric graph theory of the universe, what is "space"? Space is simply the relational connectivity (edges) between agents (nodes).
+In a Markovian network, "space" is the relational connectivity between agents. We formulate black holes not as tears in a spatial manifold, but as trapped topological surfaces in a directed graph.
 
-## 2. Graph-Theoretic Holography
-Let the universe be a graph $G=(V,E)$. We define a macroscopic region as a sub-graph $V_{int} \subset V$. The boundary of this region is the set of edges $\partial V$ connecting $V_{int}$ to the external graph $V_{ext}$.
-In continuum physics, the bound is $S \le A/4G$. 
-In our discrete topology, the bound is determined by the maximum information flow across the boundary:
+## 2. Correcting the Holographic Algebraic Bound
+By the max-flow min-cut theorem of network information theory, the maximum entropy that can flow across a boundary $\partial V$ separating an internal sub-graph $V_{int}$ from the exterior $V_{ext}$ is proportional to the number of edges, not the logarithm of the edges. 
+The corrected discrete Bekenstein bound is:
 $$
-S(V_{int}) \le \log(|C_{min}|)
+S(V_{int}) \le |C_{min}| \log(d)
 $$
-where $C_{min}$ is the capacity of the minimum edge cut separating the interior from the exterior. 
+where $|C_{min}|$ is the number of edges in the minimal cut, exactly mirroring $A / 4G$.
 
-## 3. The Graph-Theoretic Event Horizon
-As nodes within $V_{int}$ become highly entangled, $S(V_{int})$ increases. When the entanglement entropy equals the boundary capacity, the sub-graph is completely saturated. 
-Any attempt to add more internal information without adding boundary edges violates the holographic bound. The exterior network perceives this sub-graph as a maximally entropic node—a black hole. The Hawking temperature corresponds to the randomized graph traversal paths leaking across the saturated cut.
+## 3. Directed Edges and Trapped Causal Surfaces
+A saturated edge cut alone only indicates a maximal thermal state, not a black hole. To form an event horizon, the graph must possess directed causal links.
+As the internal entanglement $S(V_{int})$ increases and the node density grows, the local gravitational coupling alters the graph's transition probabilities. When the transition probabilities across the cut $C_{min}$ become strictly unidirectional (all external paths point inward, with zero probability of an outward path), the sub-graph forms a **Trapped Causal Surface**. The interior agents continue to compute, but their state updates cannot causally influence the exterior network. 
 
 ## 4. Conclusion
-Gravitational singularities are not infinite densities of mass; they are purely topological bottlenecks in a discrete network. By translating the Bekenstein-Hawking entropy into minimum edge-cuts, we successfully map continuum black hole thermodynamics onto a pre-geometric Markovian agent lattice.
+Black holes in Conscious Realism are sub-graphs bounded by purely unidirectional directed edge-cuts. By correctly applying the max-flow min-cut theorem, we mathematically unify graph theory with holographic black hole thermodynamics.
 
 ## References
 1. Bekenstein, J. D. (1973). *Black holes and entropy*. Physical Review D.
-2. Ryu, S., & Takayanagi, T. (2006). *Holographic derivation of entanglement entropy from AdS/CFT*. Physical Review Letters.
+2. Penrose, R. (1965). *Gravitational collapse and space-time singularities*. Physical Review Letters.