Chapter 11: Differential Geometry (Discrete)

11.2 Causal Geometry Construction

Section 11.2 Overview

The causal geometry within the Quantum Braid Dynamics framework emerges through the equipping of the discrete causal graph $G_t = (V_t, E_t)$ with two fundamental structures: the Undirected Shortest-Path Metric $\bar{d}_t$ and the Lazy Causal Probability Measure $\mu_u$. These structures enable the computation of the Causal Ollivier-Ricci curvature $K(u,v)$ along each directed edge.

The construction proceeds in three logical steps:

1. Measure Assignment: Every vertex $u$ is assigned a probability measure $\mu_u$ that encodes its local causal environment (past, present, and future).
2. Metric Integration: The graph is equipped with a metric space structure $(V, \bar{d})$ that allows for the rigorous calculation of transport costs.
3. Curvature Evaluation: The curvature $K$ is derived as the deviation of optimal transport cost from the metric distance, quantifying the graph's geometric "overlap."

This section formally defines these components and proves that the resulting geometry is well-posed, establishing the mathematical arena in which the Monotonicity Theorem Monotonicity Theorem (§11.3) operates.

---

11.2.1 Definition: Lazy Causal Measure

Allocation of Probability Mass according to the Balanced Weighting of Past, Present, and Future Neighborhoods

Let $G = (V, E)$ denote a finite, simple, directed graph. For any vertex $u \in V$, we define the Lazy Causal Measure $\mu_u$ as a probability distribution over $V$ that distributes mass among the vertex itself, its immediate past, and its immediate future.

Let the causal neighborhoods be defined as:

• Future Neighborhood: $N^+(u) = \{ v \in V \mid (u,v) \in E \}$, with cardinality $n_u^+ = |N^+(u)|$.
• Past Neighborhood: $N^-(u) = \{ v \in V \mid (v,u) \in E \}$, with cardinality $n_u^- = |N^-(u)|$.

We introduce fixed parameters $\alpha, \beta \in (0,1)$ such that $\alpha + 2\beta = 1$. Specifically, we adopt the Causal Triality values $\alpha = 1/3$ and $\beta = 1/3$. The measure $\mu_u$ is defined pointwise for any $x \in V$:

$$\mu_u(x) = \begin{cases} \alpha & \text{if } x = u, \\ \frac{\beta}{n_u^+} & \text{if } x \in N^+(u), \\ \frac{\beta}{n_u^-} & \text{if } x \in N^-(u), \\ 0 & \text{otherwise.} \end{cases}$$

Boundary Conditions (Laziness Adjustment): If a neighborhood is empty, its allocated mass $\beta$ is reassigned to the vertex $u$ to preserve normalization:

• If $N^+(u) = \emptyset$, $\mu_u(u) \leftarrow \alpha + \beta$.
• If $N^-(u) = \emptyset$, $\mu_u(u) \leftarrow \alpha + \beta$.
• If both are empty, $\mu_u(u) = 1$.

11.2.1.1 Commentary: "Tilt" of Time

Justification of the Measure Parameters via Causal Symmetry

Standard Ollivier-Ricci curvature is typically defined on undirected graphs using a measure distributed uniformly over immediate neighbors. In a directed causal graph, however, such a definition fails to capture the arrow of time. A measure that only looks "forward" (at children) or "backward" (at parents) would result in infinite transport distances when calculating curvature between causally connected nodes, as the supports of $\mu_u$ and $\mu_v$ might become disjoint.

The Lazy Causal Measure solves this by enforcing a "Causal Triality": the geometry at $u$ is the superposition of where it came from ($N^-$), where it is ($u$), and where it is going ($N^+$).

• $\alpha = 1/3$ (The Present): Ensures that the measures of adjacent nodes always overlap at least partially (via the lazy component), guaranteeing finite transport cost.
• $\beta = 1/3$ (Past/Future): Weights the incoming and outgoing information equally. This symmetry is crucial; it ensures that the geometry reflects the flow of information, not just the static topology.

The resulting measure acts as a "probe" that is "tilted" along the time orientation of the edges. When we compute the transport from $\mu_u$ to $\mu_v$, we are measuring how easily the entire causal history and future potential of $u$ can be mapped onto that of $v$.

11.2.1.2 Diagram: Measure Distribution

Depiction of Mass Distribution across Temporal Neighborhoods

TIME FLOW (t)
            |
            v

      [ PAST NEIGHBORHOOD N^-(u) ]
      ----------------------------
         (Mass = β / |N^-|)
            |         |
            v         v
           (x)       (y)
             \       /
              \     /  (Incoming Edges)
               \   /
                \ /
         [ PRESENT STATE ]
         -----------------
          (Mass = α )
               (u)
               / \
              /   \
             /     \ (Outgoing Edges)
            /       \
           v         v
         (z)         (w)
      ----------------------------
      [ FUTURE NEIGHBORHOOD N^+(u) ]
         (Mass = β / |N^+|)

---------------------------------------------------------
 Total Probability: Σ μ_u = α (Present) + β (Past) + β (Future) = 1
---------------------------------------------------------

The diagram illustrates the neighborhood mass distribution for the lazy causal measure $\mu_u$. The measure concentrates mass $\alpha$ at the central vertex $u$, representing the present temporal mode. This measure then distributes the remaining mass equally among the past neighbors (for example, $x, y \in N^-(u)$, each receiving $\beta / |N^-(u)|$) and the future neighbors (for example, $z, w \in N^+(u)$, each receiving $\beta / |N^+(u)|$). This allocation balances the causal influences from the past, the local present state, and the future, thereby ensuring that the measure respects the directed architecture of the graph while maintaining probabilistic normalization.

---

11.2.2 Definition: Causal Ollivier-Ricci Curvature

Quantification of Local Geometric Deviation via Optimal Transport Costs

Let $G = (V, E)$ be equipped with the undirected shortest-path metric $\bar{d}$ and the family of lazy causal measures $\{\mu_u\}_{u \in V}$. For any directed edge $(u,v) \in E$, the Causal Ollivier-Ricci Curvature $K(u,v)$ is defined as:

$$K(u,v) = 1 - \frac{W_1(\mu_u, \mu_v)}{\bar{d}(u,v)}.$$

Since adjacent vertices always satisfy $\bar{d}(u,v) = 1$ in the standard metric, this simplifies to:

$$K(u,v) = 1 - W_1(\mu_u, \mu_v).$$

Here, $W_1(\mu_u, \mu_v)$ denotes the $L_1$-Wasserstein distance between the measures, defined by the Kantorovich duality:

$$W_1(\mu_u, \mu_v) = \inf_{\pi \in \Pi(\mu_u, \mu_v)} \sum_{x,y \in V} \bar{d}(x,y) \cdot \pi(x,y),$$

where $\Pi(\mu_u, \mu_v)$ is the set of all transport couplings $\pi: V \times V \to [0,1]$ satisfying the marginal constraints $\sum_y \pi(x,y) = \mu_u(x)$ and $\sum_x \pi(x,y) = \mu_v(y)$.

11.2.2.1 Commentary: Geometry from Transport Cost

Interpretation of Curvature as Transport Efficiency

The causal ollivier-ricci curvature definition §11.2.2 of $K(u,v)$ provides a direct operational interpretation of curvature:

• $W_1 = 1$ (Flatness): If the transport cost exactly equals the metric distance, the "average" neighbor of $u$ is exactly distance 1 from the "average" neighbor of $v$. The geometry is Euclidean-like (locally flat).
• $W_1 < 1$ (Positive Curvature): If the transport cost is less than the distance, it means the neighborhoods of $u$ and $v$ are "closer" than the nodes themselves. This occurs when there are shared neighbors (triangles/3-cycles) that act as bridges, allowing mass to move "for free" or effectively shorter distances. This indicates spherical-like geometry (convergence of geodesics).
• $W_1 > 1$ (Negative Curvature): If the transport cost is greater than the distance, the neighborhoods are dispersing. This occurs in tree-like structures or grids where neighbors fan out, indicating hyperbolic-like geometry.

The emergence of positive curvature (gravity) is driven by the nucleation of 3-cycles, which creates these shared neighbors and lowers $W_1$ below 1.

11.2.2.2 Diagram: Transport Cost

Illustration of Transport Costs for Positive and Negative Curvature Configurations

(a) POSITIVE CURVATURE (High Connectivity)
    Condition: Shared neighbors create short paths.
    
        μ_u support           μ_v support
       (mass here)           (mass here)
            |                     |
            v                     v
            u ------------------> v
             \                   /
              \                 /
               \               /
                v             v
                 w (SHARED)
                 ^
                 |
      [Mass Transport Shortcut]
      Mass from u's neighbor (w) needs to move 
      to v's neighbor (w). Distance = 0.
      Result: Low W_1 cost => High K.


(b) NEGATIVE/FLAT CURVATURE (Tree-like/Linear)
    Condition: Disjoint neighborhoods create long paths.

    Past of u        Present       Future of v
       (x)              u              (y)
        |               |               ^
        | (mass)        |               | (mass)
        v               v               |
        x ------------> u ------------> v ------------> y
                        ^               |
                        |               |
                  (Edge u->v)           v
                                       (z)

    [Expensive Transport]
    To map μ_u to μ_v:
    Mass at x (past of u) must travel to y (future of v).
    Path: x -> u -> v -> y (Distance = 3).
    Result: High W_1 cost => Low/Negative K.

The diagram provides a visual interpretation of the causal Ollivier-Ricci curvature through transport costs. Panel (a) depicts a configuration yielding positive curvature: the presence of a shared neighbor $w$ establishes a channel for zero-cost transport between $\mu_u$ and $\mu_v$, resulting in a small value for $W_1$ and thus a positive value for $K > 0$. Panel (b) depicts a configuration yielding negative or flat curvature: the disjoint supports of $\mu_u$ (concentrated on $x, u, v$) and $\mu_v$ (concentrated on $u, v, y$) necessitate the relocation of mass over longer distances, such as from $x$ to $y$, producing a large value for $W_1$ and a non-positive value for $K \le 0$.

---

11.2.3 Theorem: Causal Geometry Construction

Establishment of Well-Posedness for the Discrete Geometric Space

Let $\mathcal{G}$ be the class of finite, simple, directed graphs. The construction mapping any $G \in \mathcal{G}$ to the causal geometry $(G, \bar{d}, \{\mu_u\}, K)$ is well-posed. Specifically, the following properties hold for all $G$:

1. Measure Validity: For all $u \in V$, the object $\mu_u$ defined in lazy causal measure definition §11.2.1 is a valid probability measure, satisfying non-negativity and the normalization condition $\sum_{x \in V} \mu_u(x) = 1$.
2. Metric Finiteness: For any weakly connected component of $G$, the undirected shortest-path metric satisfies $\bar{d}(x,y) < \infty$ for all pairs $x,y$, ensuring the Wasserstein distance is finite.
3. Curvature Boundedness: The curvature is strictly bounded. In the general case, $K(u,v) \in [1 - \text{diam}(G), 1]$. Under the specific parameters $\alpha=\beta=1/3$, tight local bounds apply, ensuring $K$ remains finite and computable.

The Causal Geometry Construction Theorem guarantees that the discrete Einstein-Hilbert action $\mathcal{S}[G] = \sum_{(u,v) \in E} K(u,v)$ is a well-defined functional for any physically realizable state of the causal graph.

11.2.3.1 Commentary: Argument Outline

Structure of the Causal Geometry Construction Argument via Normalization, Entropy Maximization, and Metric Necessity

The proof proceeds via Direct Construction, establishing the normalization and well-posedness of the probability measures under discrete transport constraints.

1. Measure Validity §11.2.4: The argument verifies probability normalization under the laziness adjustment, preventing mass leakage in vacuum regions.
2. The Entropy Maximization §11.2.5: The argument derives the equilibrium parameters from a maximum entropy principle, securing geometric stability.
3. The Metric Necessity §11.2.6: The argument demonstrates that undirected distances are required to avoid cost divergences, justifying the metric relaxation.

---

11.2.4 Lemma: Measure Validity

Verification of Probability Normalization through the Exhaustive Enumeration of Neighborhood Configurations

For any finite directed graph $G=(V,E)$ and any vertex $u \in V$, the function $\mu_u: V \to [0,1]$ defined in the preceding section lazy causal measure definition §11.2.1 constitutes a valid probability measure. Specifically, it satisfies the non-negativity condition $\mu_u(x) \ge 0$ for all $x$, and the normalization condition $\sum_{x \in V} \mu_u(x) = 1$, regardless of the topological configuration of the neighborhoods of $u$.

11.2.4.1 Proof: Measure Validity

Demonstration of Mass Conservation by the Summation of Disjoint Support Components

I. Decomposition of Support The support of the measure $\mu_u$ is restricted to the disjoint union of the singleton $\{u\}$, the future neighborhood $N^+(u)$, and the past neighborhood $N^-(u)$.

$$\text{supp}(\mu_u) \subseteq \{u\} \cup N^+(u) \cup N^-(u)$$

We utilize the fixed parameter constraint $\alpha + 2\beta = 1$, where $\alpha, \beta > 0$. The proof proceeds by exhaustively summing the mass over these components for the four possible topological states of $u$.

II. Case 1: Fully Connected Topology Assume $N^+(u) \neq \emptyset$ and $N^-(u) \neq \emptyset$. The indicator functions $\mathbb{I}[\emptyset]$ evaluate to 0.

1. Mass at $u$: $\mu_u(u) = \alpha$.
2. Mass at $N^+$: The total mass $\beta$ distributes uniformly over $n_u^+$ vertices. $\sum_{x \in N^+} \frac{\beta}{n_u^+} = n_u^+ \cdot \frac{\beta}{n_u^+} = \beta$.
3. Mass at $N^-$: Similarly, $\sum_{x \in N^-} \frac{\beta}{n_u^-} = \beta$. Total: $\alpha + \beta + \beta = \alpha + 2\beta = 1$.

III. Case 2: Future-Vacuum Topology Assume $N^+(u) = \emptyset$ while $N^-(u) \neq \emptyset$. The future indicator $\mathbb{I}[N^+ = \emptyset]$ evaluates to 1.

1. Mass at $u$: $\mu_u(u) = \alpha + \beta \cdot 1 = \alpha + \beta$. (Laziness Adjustment).
2. Mass at $N^+$: The sum is 0 (empty set).
3. Mass at $N^-$: The sum is $\beta$. Total: $(\alpha + \beta) + 0 + \beta = \alpha + 2\beta = 1$.

IV. Case 3: Past-Vacuum Topology Assume $N^+(u) \neq \emptyset$ while $N^-(u) = \emptyset$. The past indicator $\mathbb{I}[N^- = \emptyset]$ evaluates to 1.

1. Mass at $u$: $\mu_u(u) = \alpha + \beta \cdot 1 = \alpha + \beta$.
2. Mass at $N^+$: The sum is $\beta$.
3. Mass at $N^-$: The sum is 0. Total: $(\alpha + \beta) + \beta + 0 = \alpha + 2\beta = 1$.

V. Case 4: Isolated Singularity Assume $N^+(u) = \emptyset$ and $N^-(u) = \emptyset$. Both indicators evaluate to 1.

1. Mass at $u$: $\mu_u(u) = \alpha + \beta + \beta = 1$.
2. Mass at Neighborhoods: 0. Total: $1$.

VI. Conclusion In all valid topological configurations, the summation yields exactly 1. Non-negativity holds trivially as $\alpha, \beta > 0$. Thus, $\mu_u$ is a valid probability measure.

Q.E.D.

11.2.4.2 Calculation: Measure Verification

Validation of Measure Normalization via Directed Chain Simulation

Verification of the probability measure validity established in the Measure Validity Lemma Measure Validity §11.2.4 is based on the following protocols:

1. Lattice Generation: The algorithm constructs a representative directed chain graph representing the sparse causal regime.
2. Neighborhood Evaluation: The protocol applies the lazy causal measure formula to the vertices under the four exhaustive topological configurations.
3. Normalization Verification: The metric confirms that the sum of the measure equals exactly 1.0 in every instance, ensuring mass conservation.

import numpy as np
import networkx as nx

def lazy_mu(u, G, alpha=1/3, beta=1/3):
    """
    Compute lazy causal measure μ_u for vertex u.
    Handles empty neighborhoods via mass reassignment (Laziness).
    """
    N_plus = list(G.successors(u))
    N_minus = list(G.predecessors(u))
    n_plus = len(N_plus)
    n_minus = len(N_minus)
    
    # Initial allocation to Present
    mu = {u: alpha}
    
    # Future Allocation
    if n_plus == 0:
        mu[u] += beta  # Reabsorb
    else:
        for w in N_plus:
            mu[w] = beta / n_plus
            
    # Past Allocation
    if n_minus == 0:
        mu[u] += beta  # Reabsorb
    else:
        for w in N_minus:
            mu[w] = beta / n_minus
            
    return mu, sum(mu.values())

def print_case(name, mu, total):
    # Format for clean console output
    formatted_mu = {k: round(v, 4) for k, v in mu.items()}
    print(f"Case: {name}")
    print(f"  Map: {formatted_mu}")
    print(f"  Sum: {total:.4f}\n")

# --- Simulation Setup ---

# 1. Standard Chain: 0 -> 1 -> 2
G_chain = nx.DiGraph()
G_chain.add_edges_from([(0,1), (1,2)])

# Case 1: Balanced (u=1, has both past and future)
mu1, sum1 = lazy_mu(1, G_chain)
print_case("Balanced Topology (u=1)", mu1, sum1)

# Case 2: Empty Past (u=0, has future but no past)
mu0, sum0 = lazy_mu(0, G_chain)
print_case("Empty Past (u=0)", mu0, sum0)

# 2. Reverse Chain: 0 <- 1 <- 2 (to simulate empty future at u=2)
G_rev = nx.DiGraph()
G_rev.add_edges_from([(1,0), (2,1)])

# Case 3: Empty Future (u=2, has past but no future)
mu2, sum2 = lazy_mu(2, G_rev)
print_case("Empty Future (u=2)", mu2, sum2)

# 3. Isolated Node
G_iso = nx.DiGraph()
G_iso.add_node(99)

# Case 4: Isolated Singularity
mu_iso, sum_iso = lazy_mu(99, G_iso)
print_case("Isolated Singularity (u=99)", mu_iso, sum_iso)

Simulation Output

Case: Balanced Topology (u=1)
  Map: {1: 0.3333, 2: 0.3333, 0: 0.3333}
  Sum: 1.0000

Case: Empty Past (u=0)
  Map: {0: 0.6667, 1: 0.3333}
  Sum: 1.0000

Case: Empty Future (u=2)
  Map: {2: 0.6667, 1: 0.3333}
  Sum: 1.0000

Case: Isolated Singularity (u=99)
  Map: {99: 1.0}
  Sum: 1.0000

The results confirm exact conservation. The balanced case distributes mass evenly (1/3) across the triad (past, present, future). The semi-vacuous cases (empty past or future) correctly reallocate the missing $\beta$ portion to the self-mass, raising it to $2/3$. The isolated case concentrates the entire probability mass ($\alpha + 2\beta = 1.0$) onto the vertex itself. This confirms that the measure remains well-posed even in the highly sparse, disconnected regimes often encountered during the initial phases of the universe simulation.

11.2.4.3 Commentary: Conservation of Probability

Necessity of Laziness for Numerical Stability

Measure Validity, while elementary, secures the mathematical foundation of the transport problem. In standard Optimal Transport theory, the Wasserstein distance is only well-defined between distributions of equal total mass. If our definition allowed mass to "leak" out when a node lacked neighbors (e.g., simply assigning 0 mass to an empty future without compensation), the total mass would drop to $2/3$ or $1/3$. This would render the standard Wasserstein calculation impossible without resorting to complex unbalanced transport formulations.

The "Laziness Adjustment"—reabsorbing the allocation $\beta$ into the vertex $u$ whenever a neighborhood is empty—acts as a strict conservation law. It ensures that even in the most causally disconnected regions of the graph (a vacuum), the geometry remains well-defined. Physically, this implies that an isolated particle still possesses a valid geometric "shape"—it is simply a point mass with no extension into the past or future. This robustness is critical for the simulation engine, ensuring that topological edge cases do not cause the geometric metric to collapse or diverge.

---

11.2.5 Lemma: Entropy Maximization

Optimization of Informational Entropy via the Selection of the Tripartite Laziness Parameter

For a vertex $u$ possessing balanced causal degrees $d_+ = |N^+(u)| = d_- = |N^-(u)| = d \geq 1$, the Shannon entropy $H(\mu_u) = -\sum_{x \in V} \mu_u(x) \log \mu_u(x)$ attains its unique global maximum precisely when the laziness parameter assumes the value $\alpha = 1/3$. This condition corresponds to the maximization of the uncertainty regarding the temporal locus of the state, enforcing an equipartition of probability mass among the Past, Present, and Future causal sectors.

11.2.5.1 Proof: Entropy Maximization

Derivation of the Optimal Self-Weighting from the Analytical Maximization of the Macroscopic Temporal Entropy

I. Definition of Temporal Macro-States The vacuum acts to maximize the uncertainty of the temporal locus of the state, independent of the spatial dispersion within those loci. We define three distinct causal sectors (macro-states) for a vertex $u$: the Present $S_0 = \{u\}$, the Future $S_+ = N^+(u)$, and the Past $S_- = N^-(u)$. The total probability measure allocated to these macroscopic sectors is defined as:

$$\mu(S_0) = \alpha, \quad \mu(S_+) = \beta, \quad \mu(S_-) = \beta.$$

II. The Coarse-Grained Entropy Functional The macroscopic temporal entropy $H_{temporal}$ evaluates the Shannon entropy over these three temporal macro-states, factoring out the local spatial degree $d$. This yields the target functional:

$$H_{temporal}(\alpha, \beta) = -\mu(S_0) \log \mu(S_0) - \mu(S_+) \log \mu(S_+) - \mu(S_-) \log \mu(S_-)$$ $$H_{temporal}(\alpha, \beta) = -\alpha \log \alpha - 2\beta \log \beta.$$

III. Constraint Application and Variable Reduction The probability normalization condition $\sum \mu(S_i) = 1$ imposes the linear constraint $\alpha + 2\beta = 1$. This constraint resolves the variable $\beta$ in terms of the laziness parameter $\alpha$:

$$\beta(\alpha) = \frac{1 - \alpha}{2}.$$

Substitution of this relation into the entropy equation reduces $H_{temporal}$ to a univariate function $h(\alpha)$ on the domain $\alpha \in (0,1)$:

$$h(\alpha) = -\alpha \log \alpha - 2 \left( \frac{1 - \alpha}{2} \right) \log \left( \frac{1 - \alpha}{2} \right).$$

IV. Logarithmic Expansion and Isolation The logarithmic term involving the ratio expands via the identity $\log(a/b) = \log a - \log b$:

$$h(\alpha) = -\alpha \log \alpha - (1 - \alpha) [ \log(1 - \alpha) - \log 2 ].$$

Distributing the $(1-\alpha)$ isolates the $\alpha$-dependent logarithmic terms from the constant shift:

$$h(\alpha) = -\alpha \log \alpha - (1 - \alpha)\log(1 - \alpha) + (1 - \alpha)\log 2.$$

V. Derivation of the First Order Condition The location of the extremum requires the computation of the first derivative $\frac{dh}{d\alpha}$. Applying the product rule $\frac{d}{dx}(f(x)g(x)) = f'(x)g(x) + f(x)g'(x)$ to each term yields: 1.  Self Term: $\frac{d}{d\alpha}(-\alpha \log \alpha) = -(\log \alpha + \alpha \cdot \frac{1}{\alpha}) = -\log \alpha - 1$. 2.  Complement Term: $\frac{d}{d\alpha}(-(1-\alpha)\log(1-\alpha))$. Letting $u = 1-\alpha$, then $du/d\alpha = -1$.

    $\frac{d}{d\alpha} = (-1) \cdot \left[-\log u - (1-\alpha)\frac{1}{u}(-1)\right] = \log(1-\alpha) + 1.$

3.  Linear Term: $\frac{d}{d\alpha}((1-\alpha)\log 2) = -\log 2$.

Combining these components yields:

$$h'(\alpha) = -\log \alpha - 1 + \log(1-\alpha) + 1 - \log 2 = \log(1-\alpha) - \log \alpha - \log 2.$$

This simplifies to the final derivative form:

$$h'(\alpha) = \log \left( \frac{1 - \alpha}{2\alpha} \right).$$

VI. Solution for the Stationary Point The stationarity condition $h'(\alpha) = 0$ implies that the argument of the logarithm must equal unity:

$$\frac{1 - \alpha}{2\alpha} = 1.$$

Solving this algebraic equation for $\alpha$ yields the unique critical point:

$$1 - \alpha = 2\alpha \implies 1 = 3\alpha \implies \alpha = \frac{1}{3}.$$

Consequently, the associated directional mass becomes $\beta = (1 - 1/3)/2 = 1/3$.

VII. Verification of Concavity via Second Derivative The characterization of the critical point as a maximum requires the evaluation of the second derivative $h''(\alpha)$. Differentiating $h'(\alpha) = \log(1-\alpha) - \log(2\alpha)$:

$$h''(\alpha) = \frac{d}{d\alpha}[\log(1-\alpha)] - \frac{d}{d\alpha}[\log \alpha + \log 2] = \frac{-1}{1 - \alpha} - \frac{1}{\alpha}.$$

For any $\alpha$ in the domain $(0,1)$, both terms $-\frac{1}{1-\alpha}$ and $-\frac{1}{\alpha}$ assume strictly negative values. Thus, $h''(\alpha) < 0$ universally across the domain. This strict concavity guarantees that the stationary point $\alpha = 1/3$ represents a unique global maximum.

VIII. Global Optimality Conclusion Maximizing the uncertainty of the temporal locus necessitates the exact equipartition of probability mass among the Past, Present, and Future causal sectors. This establishes the parameters $\alpha = \beta = 1/3$ as the necessary condition for thermodynamic equilibrium in the unbiased geometry.

Q.E.D.

11.2.5.2 Calculation: Entropy Maximization

Maximization of Allocation Entropy via Bounded Numerical Optimization

Verification of the entropic equilibrium parameters established in the Entropy Maximization Proof Entropy Maximization Proof (§11.2.5.1) is based on the following protocols:

1. Entropy Computation: The algorithm performs a bounded numerical optimization of the allocation entropy $h(\alpha)$ to locate the global maximum.
2. Derivative Evaluation: The protocol executes a derivative check at the critical laziness value $\alpha = 1/3$ to verify that the theoretical derivative is zero within machine precision tolerance.
3. Sensitivity Analysis: The metric tracks the shift of optimal laziness under structural sparsity to evaluate entropic pressure.

import numpy as np
import matplotlib.pyplot as plt
from scipy.optimize import minimize_scalar

def h_balanced(alpha):
    """
    Computes allocation entropy h(α) for balanced degrees (d=1).
    Returns -inf at boundaries to enforce strict (0,1) domain.
    """
    if alpha <= 1e-9 or alpha >= (1 - 1e-9):
        return -np.inf
    beta = (1.0 - alpha) / 2.0
    return -alpha * np.log(alpha) - 2 * beta * np.log(beta)

def h_prime_analytical(alpha):
    """
    Computes the exact first derivative h'(α) = log(β/α).
    """
    beta = (1.0 - alpha) / 2.0
    return np.log(beta / alpha)

def h_double_prime_analytical(alpha):
    """
    Computes the exact second derivative h''(α).
    """
    return -1.0 / (1.0 - alpha) - 1.0 / alpha

def h_unbalanced(alpha, d_plus=1.0, d_minus=1.0):
    """
    Computes total entropy for unbalanced neighborhood sizes.
    """
    if alpha <= 1e-9 or alpha >= (1 - 1e-9):
        return -np.inf
    beta = (1.0 - alpha) / 2.0
    term_self = -alpha * np.log(alpha)
    term_future = -beta * np.log(beta / d_plus)
    term_past = -beta * np.log(beta / d_minus)
    return term_self + term_future + term_past

# 1. Optimization for Balanced Case
res = minimize_scalar(lambda a: -h_balanced(a), 
                      bounds=(0.01, 0.99), 
                      method='bounded', 
                      options={'xatol': 1e-12})
max_alpha = res.x
max_entropy = -res.fun

# 2. Derivative Checks at Theoretical Critical Point
alpha_theory = 1.0/3.0
val_h_prime = h_prime_analytical(alpha_theory)
val_h_double_prime = h_double_prime_analytical(alpha_theory)

# Check against Machine Epsilon to prove 0.0
machine_epsilon = np.finfo(float).eps
is_zero_within_precision = abs(val_h_prime) <= machine_epsilon

# 3. Sensitivity Check
res_sparse = minimize_scalar(lambda a: -h_unbalanced(a, d_plus=1.0, d_minus=0.087), 
                             bounds=(0.01, 0.99), 
                             method='bounded',
                             options={'xatol': 1e-12})
max_alpha_sparse = res_sparse.x

# --- Console Output ---
print(f"--- Balanced Case (d=1) ---")
print(f"Numerical Max α:    {max_alpha:.8f}")
print(f"Max Entropy h(α):   {max_entropy:.8f} (Theoretical log(3) ≈ 1.0986)")
print(f"h'(1/3) Residual:   {val_h_prime:.4e}")
print(f"  > Valid Zero?     {is_zero_within_precision} (Residual <= Machine Epsilon {machine_epsilon:.2e})")
print(f"h''(1/3):           {val_h_double_prime:.4f} (Expected: -4.5)")
print(f"\n--- Unbalanced Sensitivity ---")
print(f"Sparse Max α (d-=0.087): {max_alpha_sparse:.4f}")

Simulation Output

--- Balanced Case (d=1) ---
Numerical Max α:    0.33333333
Max Entropy h(α):   1.09861229 (Theoretical log(3) ≈ 1.0986)
h'(1/3) Residual:   2.2204e-16
  > Valid Zero?     True (Residual <= Machine Epsilon 2.22e-16)
h''(1/3):           -4.5000 (Expected: -4.5)

--- Unbalanced Sensitivity ---
Sparse Max α (d-=0.087): 0.6290

The verification validates the proof with strict numerical rigor. The optimization identifies the entropy maximum at $\alpha = 0.33333333$, aligning with the theoretical fraction $1/3$ to eight decimal places.

Crucially, the first derivative check returns a residual of $2.2204 \times 10^{-16}$. This is the fingerprint of a perfect zero in 64-bit computing. This value is Machine Epsilon ($\epsilon_{mach}$): the smallest possible difference between $1.0$ and the next representable number in binary floating-point arithmetic. Because computers cannot store the infinite repeating decimal $0.333...$ perfectly, this tiny residual is the mathematical equivalent of "zero within the absolute physical limits of the hardware." The boolean check in the code confirms this, proving the derivative vanishes exactly as predicted.

The sensitivity analysis further reveals that in the sparse regime ($d_- \approx 0.087$), the entropic pressure shifts the optimal laziness to $\alpha \approx 0.63$. This occurs because a nearly-empty past neighborhood offers less "space" to store information (lower configurational entropy), forcing the system to store more information in the present (increasing $\alpha$) to compensate. However, the vacuum re-absorption mechanism defined in Measure Validity §11.2.4effectively renormalizes these degrees back toward unity in the measure's definition, preserving the $\alpha=1/3$ equilibrium as the robust structural baseline.

11.2.5.3 Commentary: Universal Constant Alpha

Necessity of Entropic Equilibrium for Geometric Stability

The derivation of the parameter $\alpha = 1/3$ elevates this value from an arbitrary heuristic to a fundamental constant of the discrete geometry. In the absence of this entropic maximization, the definitions of curvature would suffer from temporal bias.

1. Bias toward Stagnation ($\alpha > 1/3$): If the measure over-weights the vertex itself, the transport cost becomes dominated by the static mass (the "lazy" component). This artificially lowers the Wasserstein distance $W_1$, effectively suppressing the detection of geometric curvature. The geometry becomes "stiff" and unresponsive to topological changes, behaving like a medium with infinite viscosity.

2. Bias toward Volatility ($\alpha < 1/3$): If the measure over-weights the neighborhoods, the transport cost becomes hypersensitive to local degree fluctuations (jitter). The geometry becomes unstable, with curvature values oscillating wildly due to minor topological noise rather than structural features.

By fixing $\alpha$ at the unique entropic maximum, the framework ensures that the resulting curvature $K$ serves as a pure measurement of the causal topology, uncorrupted by the specific biases of the measuring instrument. The value $1/3$ represents the thermodynamic equilibrium where the system retains maximum uncertainty regarding the "location" of the state (Past vs. Present vs. Future), thereby maximizing the informational content of any observed geometric deviation.

11.2.5.4 Diagram: Entropic Triality

Representation of Entropic Balance among the Tripartite Temporal Modes

MAXIMUM ENTROPY STATE (α = 1/3)
      -------------------------------
      The "Lazy" parameter α acts as the fulcrum
      balancing the temporal modes.

             [ PRESENT ]
             (Self-Loop)
              Mass = α
                 |
                 | (Fulcrum)
        _________v_________
       /                   \
      /                     \
 [ PAST ]                 [ FUTURE ]
(Incoming)               (Outgoing)
 Mass = β                 Mass = β

      If α > 1/3:  System is "stagnant" (Too much self-weight).
      If α < 1/3:  System is "volatile" (Too little self-weight).
      
      At α = 1/3:  Past = Present = Future.
                   Information spreads optimally.

:::

---

11.2.6 Lemma: Metric Necessity

Requirement of the Undirected Metric arising from the Prevention of Ill-Posed Transport Costs in Acyclic Graphs

The utilization of the undirected shortest-path metric $\bar{d}$ constitutes a necessary condition for the well-posedness of the causal Ollivier-Ricci curvature functional. The analysis demonstrates that any metric structure strictly respecting the directed topology of an acyclic causal graph generates divergent or undefined Wasserstein transport costs for a non-negligible set of vertex pairs, thereby rendering the curvature $K$ uncomputable. The geometric framework therefore decouples the connectivity metric from the causal directionality, delegating the latter entirely to the asymmetry of the probability measures.

11.2.6.1 Proof: Metric Necessity

Demonstration of Divergence in Directed Transport due to the Analysis of Acausal Backward Paths

I. Formulation of the Directed Transport Problem Consider a directed graph $G = (V, E)$ satisfying the acyclicity condition implicit in the causal structure acyclic effective causality §2.7.1. Let $d_{\text{dir}}(x,y)$ denote the directed geodesic distance, defined as the infimum of the lengths of all directed paths from $x$ to $y$. If no directed path exists from $x$ to $y$, the distance diverges: $d_{\text{dir}}(x,y) = \infty$. The associated Wasserstein-1 transport cost between two measures $\mu_u$ and $\mu_v$ defines itself as:

$$W_1^{\text{dir}}(\mu_u, \mu_v) = \inf_{\pi \in \Pi(\mu_u, \mu_v)} \sum_{x,y \in V} d_{\text{dir}}(x,y) \pi(x,y).$$

II. Identification of the Singular Configuration Consider two adjacent vertices $u, v$ connected by a directed edge $(u, v)$. The evaluation of the curvature $K(u,v)$ requires the computation of $W_1(\mu_u, \mu_v)$. The lazy causal measure $\mu_v$ allocates a strictly positive probability mass $\beta > 0$ to its past neighborhood $N^-(v)$. The lazy causal measure $\mu_u$ allocates a strictly positive probability mass $\beta > 0$ to its future neighborhood $N^+(u)$. Let $y \in N^+(u)$ be a future neighbor of $u$, and let $x \in N^-(v)$ be a past neighbor of $v$. A valid coupling $\pi$ must transport mass from the support of $\mu_u$ to the support of $\mu_v$. If the topology is tree-like (as in the sparse equilibrium limit bounded vertex degree lemma §5.5.3), the supports may be disjoint.

III. Analysis of Acausal Transport Requirements In the event that the optimal coupling $\pi$ assigns non-zero mass to a transition from a future-located vertex $y \in N^+(u)$ to a past-located vertex $x \in N^-(v)$, the cost function evaluates the directed distance $d_{\text{dir}}(y, x)$. Given the edge orientation $u \to v$, the vertex $y$ resides in the causal future of $u$, while $x$ resides in the causal past of $v$. A directed path from $y$ to $x$ would imply a trajectory $y \rightsquigarrow u \to v \rightsquigarrow x$. However, by definition, $x \to v$ (past neighbor implies edge into $v$), and $u \to y$ (future neighbor implies edge out of $u$). A path $y \to x$ requires moving against the causal flow. In a Directed Acyclic Graph (DAG), no such return path exists. Consequently, $d_{\text{dir}}(y, x) = \infty$.

IV. Divergence of the Transport Integral If the marginal distributions $\mu_u$ and $\mu_v$ necessitate any mass transfer between causally separated regions that lack a forward directed path, the transport integral diverges. Specifically, if the total mass in $N^+(u)$ exceeds the capacity of $N^+(v)$ to absorb it via forward paths, the surplus mass must flow to $u$, $v$, or $N^-(v)$. Transport from $N^+(u)$ to $N^-(v)$ incurs infinite cost. Transport from $N^+(u)$ to $u$ (backwards across the edge) incurs infinite cost. Thus, for a broad class of local configurations, $W_1^{\text{dir}}(\mu_u, \mu_v) = \infty$. This yields a curvature value $K = 1 - \infty = -\infty$, which constitutes a singularity rather than a geometric measurement.

V. Violation of Metric Space Axioms The directed distance $d_{\text{dir}}$ further fails the symmetry axiom of a metric space, $d(x,y) = d(y,x)$. While extended definitions of Optimal Transport (e.g., asymmetric transport) exist, they require finite costs. The presence of infinite costs in the "reverse" direction of time violates the condition for a bounded Lipschitz constant, preventing the convergence of the dual Kantorovich potentials. The geometry becomes ill-posed.

VI. Conclusion The undirected metric $\bar{d}$ resolves these singularities by assigning finite positive values to acausal links (e.g., $\bar{d}(y,x) < \infty$), effectively interpreting "distance" as "separation in the causal graph" rather than "causal reachability." The distinction between past and future is not lost but is instead encoded in the probability masses of $\mu_u$ and $\mu_v$ (the "tilt" of the measure) rather than the manifold metric itself. This separation ensures that $K(u,v)$ remains finite, bounded, and computable for all edges.

Q.E.D.

11.2.6.2 Calculation: Metric Verification

Evaluation of Transport Costs via Linear Programming

Verification of the undirected metric requirement established in the Metric Necessity Lemma Metric Necessity Proof (§11.2.6.1) is based on the following protocols:

1. Metric Construction: The algorithm constructs shortest-path distance matrices for a representative chain graph under both directed and undirected metrics.
2. Wasserstein Resolution: The protocol solves the optimal transport problem using a linear programming solver to evaluate forward and reverse transport costs.
3. Divergence Verification: The metric tracks the divergence of reverse transport under the directed metric to confirm the necessity of metric relaxation.

import numpy as np
from scipy.optimize import linprog

def w1_linprog(mu_source, mu_target, dist_dict, nodes):
    """
    Computes W_1 via Linear Programming (Min Cost Flow).
    - dist_dict: Must represent SHORTEST PATH distances (metric).
    - Returns np.inf if the transport problem is infeasible.
    """
    n = len(nodes)
    c = []
    inf_indices = []
    idx = 0
    
    # 1. Construct Cost Vector
    # If distance is infinite, we assign a finite proxy but restrict flow to 0 later.
    for i, x in enumerate(nodes):
        for j, y in enumerate(nodes):
            d = dist_dict.get((x, y), np.inf)
            if np.isinf(d):
                inf_indices.append(idx)
                c.append(1e6) 
            else:
                c.append(d)
            idx += 1
    c = np.array(c)
    
    # 2. Equality Constraints (Marginals)
    A_eq = np.zeros((2*n, n**2))
    b_eq = np.zeros(2*n)
    
    # Check mass conservation
    s_sum = sum(mu_source.values())
    t_sum = sum(mu_target.values())
    if not np.isclose(s_sum, t_sum):
        # Normalization to prevent numerical infeasibility
        mu_source = {k: v/s_sum for k,v in mu_source.items()}
        mu_target = {k: v/t_sum for k,v in mu_target.items()}

    # Source constraints
    for i in range(n):
        for j in range(n):
            A_eq[i, i*n + j] = 1
        b_eq[i] = mu_source.get(nodes[i], 0)
        
    # Target constraints
    for k in range(n):
        for i in range(n):
            A_eq[n + k, i*n + k] = 1
        b_eq[n + k] = mu_target.get(nodes[k], 0)
        
    # 3. Bounds: Forbid flow on infinite edges
    bounds = []
    for k in range(n**2):
        if k in inf_indices:
            bounds.append((0, 0)) # Constrain invalid paths to zero flow
        else:
            bounds.append((0, None))
    
    # 4. Solve
    res = linprog(c, A_eq=A_eq, b_eq=b_eq, bounds=bounds, method='highs')
    
    if not res.success:
        return np.inf
        
    return res.fun

# --- Setup ---
nodes = [0, 1, 2]
# Use exact fractions to ensure Sum(A) == Sum(B)
mu_A = {0: 2.0/3.0, 1: 1.0/3.0, 2: 0.0}       # Past-heavy (Source)
mu_B = {0: 1.0/3.0, 1: 1.0/3.0, 2: 1.0/3.0}   # Balanced (Target)

# --- Metrics (Geodesic Distances) ---
# Undirected: All connected. d(0,2) = 2.
d_undir = {
    (0,0):0, (0,1):1, (0,2):2, 
    (1,0):1, (1,1):0, (1,2):1, 
    (2,0):2, (2,1):1, (2,2):0
}

# Directed: Forward finite, Reverse infinite.
d_dir = {
    (0,0):0, (0,1):1, (0,2):2,       # 0->2 is valid path
    (1,0):np.inf, (1,1):0, (1,2):1,  # 1->0 impossible
    (2,0):np.inf, (2,1):np.inf, (2,2):0
}

# --- Computations ---
val_undir = w1_linprog(mu_A, mu_B, d_undir, nodes)
val_dir_fwd = w1_linprog(mu_A, mu_B, d_dir, nodes)   # A -> B
val_dir_rev = w1_linprog(mu_B, mu_A, d_dir, nodes)   # B -> A

# --- Output ---
print(f"Undirected W1 (A -> B):   {val_undir:.4f}")
print(f"Directed Fwd W1 (A -> B): {val_dir_fwd:.4f}")
print(f"Directed Rev W1 (B -> A): {val_dir_rev}")

Simulation Output

Undirected W1 (A -> B):   0.6667
Directed Fwd W1 (A -> B): 0.6667
Directed Rev W1 (B -> A): inf

The verification demonstrates the operational divergence of directed metrics in causal graphs, yielding the following outcomes:

1. Undirected Case: The transport cost converges to a finite value of approximately $0.6667$. The optimal coupling plan $\pi$ shifts the excess mass from node 0 (in $\mu_A$) to node 2 (in $\mu_B$) across a metric distance of 2. The weighted cost is $(1/3) \times 2 \approx 0.67$.
2. Directed Forward Case: Since the mass moves "downstream" ($0 \to 2$) aligned with the direction of the edges, the directed metric coincides with the undirected metric ($d_{\text{dir}}(0,2) = 2$). The cost remains $0.6667$.
3. Directed Reverse Case: The transport fails ($W_1 = \infty$). The target measure $\mu_A$ requires mass at node 0, but the source $\mu_B$ possesses mass at node 2. Moving mass from $2 \to 0$ requires traversing edges against the causal arrow. Since $d_{\text{dir}}(2,0) = \infty$, no finite coupling exists.

This confirms that directed metrics render the Wasserstein distance ill-posed for any pair of measures requiring reverse-time transport, a frequent occurrence in fluctuating graph topologies.

11.2.6.3 Commentary: Avoiding Singularities

Necessity of Metric Robustness for Geometric Continuity

The Metric Necessity Lemma secures the computational stability of the geometric framework. If the curvature $K$ relied on a directed metric, the functional would exhibit pathological singularities. Any localized fluctuation in the measure requiring even infinitesimal "backward" transport—such as a node possessing slightly more future mass than its past neighbor—would cause the curvature value to diverge instantly to $-\infty$. This brittleness would prohibit smooth dynamical evolution, as the gradient of the action would be undefined almost everywhere.

The construction utilized in Quantum Braid Dynamics (Undirected Metric + Lazy Causal Measure) resolves this by decoupling the connectivity of the space from the direction of time:

1. Metric Role (Continuity): The undirected metric $\bar{d}$ ensures that a finite path exists between all connected points, guaranteeing that the transport cost $W_1$ varies continuously with respect to the measure parameters.
2. Measure Role (Causality): The lazy causal measure $\mu$ reintroduces the arrow of time. By biasing the probability mass according to the directed topology, it ensures that transport "with the flow" incurs lower effective costs than transport "against the flow," thereby encoding causality into the curvature values without violating the metric space axioms.

---

11.2.7 Lemma: Compensation by Causal Measures

Encoding of Causal Directionality within the Asymmetric Bias of Neighborhood Probability Measures

The specific configuration of the probability mass distributions $\mu_u$ and $\mu_v$, governed by the local causal topology, effectively recovers the directional structure of the graph $G$, despite the utilization of the symmetric undirected metric $\bar{d}$ in the transport functional. The asymmetry inherent in the "Lazy Causal Measure" definition lazy causal measure definition §11.2.1 modulates the Wasserstein distance $W_1(\mu_u, \mu_v)$ such that the resulting curvature $K(u,v)$ accurately reflects the causal delay and information propagation along the directed edge $(u,v)$.

11.2.7.1 Proof: Compensation

Verification of Directional Curvature Sensitivity by the Computation of Transport Costs on Asymmetric Measures

I. Topological Instantiation The proof analyzes a minimal directed chain configuration $G = (V, E)$ with $V = \{A, B, C\}$ and edges $E = \{(A,B), (B,C)\}$. The proof fixes the laziness parameters at the entropic optimum $\alpha = 1/3$ and $\beta = 1/3$ Entropy Maximization §11.2.5. The undirected shortest-path metric $\bar{d}$ assigns the following values to the vertex pairs:

$$\bar{d}(A,B) = 1, \quad \bar{d}(B,C) = 1, \quad \bar{d}(A,C) = 2.$$

II. Derivation of the Origin Measure ($\mu_A$) The vertex $A$ resides at the origin of the chain.

1. Future Neighborhood: $N^+(A) = \{B\}$, cardinality $1$.
2. Past Neighborhood: $N^-(A) = \emptyset$, cardinality $0$. The indicator function $\mathbb{I}[N^-(A) = \emptyset]$ evaluates to 1, triggering the conservation rule defined in lazy causal measure definition §11.2.1. The mass $\beta$ allocated to the past reassigns to the vertex $A$.

$$\mu_A(x) = \begin{cases} \alpha + \beta = 2/3 & \text{if } x = A \\ \beta/1 = 1/3 & \text{if } x = B \\ 0 & \text{if } x = C \end{cases}$$

This distribution exhibits a heavy "past-static" bias, concentrating $2/3$ of the mass at the source.

III. Derivation of the Intermediate Measure ($\mu_B$) The vertex $B$ resides in the interior of the chain.

1. Future Neighborhood: $N^+(B) = \{C\}$, cardinality $1$.
2. Past Neighborhood: $N^-(B) = \{A\}$, cardinality $1$. Both neighborhoods are non-empty; the indicator functions evaluate to 0. The measure distributes purely according to the standard tripartition:

$$\mu_B(x) = \begin{cases} \beta/1 = 1/3 & \text{if } x = A \\ \alpha = 1/3 & \text{if } x = B \\ \beta/1 = 1/3 & \text{if } x = C \end{cases}$$

This distribution exhibits perfect temporal balance.

IV. Construction of the Optimal Transport Coupling The computation of $W_1(\mu_A, \mu_B)$ requires solving for the optimal coupling $\pi$ that moves mass from $\mu_A$ to $\mu_B$ with minimal cost $\sum \bar{d}(x,y)\pi(x,y)$. Comparing the marginals:

• At A: Source has $2/3$, Target has $1/3$. Excess supply $+1/3$.
• At B: Source has $1/3$, Target has $1/3$. Balanced.
• At C: Source has $0$, Target has $1/3$. Excess demand $-1/3$.

The optimal transport plan $\pi^*$ identifies the stationary components and the moving components:

1. Stationary Mass at A: Transport $1/3$ from $\mu_A(A)$ to $\mu_B(A)$. Cost: $\bar{d}(A,A) \times 1/3 = 0$.
2. Stationary Mass at B: Transport $1/3$ from $\mu_A(B)$ to $\mu_B(B)$. Cost: $\bar{d}(B,B) \times 1/3 = 0$.
3. Moving Mass: The remaining $1/3$ at $\mu_A(A)$ must transport to the vacancy at $\mu_B(C)$. Cost: $\bar{d}(A,C) \times 1/3 = 2 \times 1/3 = 2/3$.

V. Evaluation of Curvature The total Wasserstein distance sums the contributions:

$$W_1(\mu_A, \mu_B) = 0 + 0 + 2/3 = 2/3.$$

The Causal Ollivier-Ricci curvature for the edge $(A,B)$ computes as:

$$K(A,B) = 1 - W_1(\mu_A, \mu_B) = 1 - 2/3 = 1/3.$$

VI. Conclusion The non-zero cost $W_1 = 2/3$ arises entirely from the necessity of transporting mass from the "stuck" past of $A$ (due to the empty history) to the future of $B$. Even though the metric $\bar{d}$ is undirected, the probability measures encode the arrow of time: $\mu_A$ lags behind $\mu_B$. The geometry correctly identifies this lag as a positive distance, yielding a finite, positive curvature $K=1/3$ that signifies stable causal propagation.

Q.E.D.

11.2.7.2 Calculation: Compensation Verification

Verification of Causal Encoding via Asymmetric Optimal Transport

Verification of the asymmetric transport compensation established in the Causal Boundary Proof Causal Boundary Proof (§11.2.7.1) is based on the following protocols:

1. Measure Initialization: The algorithm dynamically calculates the lazy causal measures for a directed chain graph, explicitly enforcing boundary conditions.
2. Wasserstein Solution: The protocol solves the linear programming optimal transport problem to compute the exact Wasserstein distance between adjacent measures.
3. Mass Balance Analysis: The metric evaluates the excess mass vector to confirm the directional transport requirements identified in the proof.

import numpy as np
from scipy.optimize import linprog
import networkx as nx

def lazy_mu_dynamic(u, G, alpha=1.0/3.0, beta=1.0/3.0):
    """
    Computes μ_u dynamically based on graph topology.
    Implements the Re-absorption Logic (Measure Validity §11.2.4).
    """
    N_plus = list(G.successors(u))
    N_minus = list(G.predecessors(u))
    n_plus = len(N_plus)
    n_minus = len(N_minus)
    
    # Initialize dictionary
    mu = {n: 0.0 for n in G.nodes()}
    
    # Self-mass (Present)
    mu[u] += alpha
    
    # Future mass
    if n_plus == 0:
        mu[u] += beta
    else:
        for v in N_plus:
            mu[v] += beta / n_plus
            
    # Past mass
    if n_minus == 0:
        mu[u] += beta
    else:
        for v in N_minus:
            mu[v] += beta / n_minus
            
    return mu

def w1_solve(mu1, mu2, dist_matrix, nodes):
    """
    Solves Optimal Transport problem given two measure dicts and distance matrix.
    Returns the transport cost.
    """
    n = len(nodes)
    c = dist_matrix.flatten()
    
    # Equality constraints (Marginals)
    A_eq = np.zeros((2*n, n*n))
    b_eq = np.zeros(2*n)
    
    # Source constraints
    for i in range(n):
        for j in range(n):
            A_eq[i, i*n + j] = 1
        b_eq[i] = mu1[nodes[i]]
        
    # Target constraints
    for j in range(n):
        for i in range(n):
            A_eq[n+j, i*n + j] = 1
        b_eq[n+j] = mu2[nodes[j]]
        
    bounds = [(0, None) for _ in range(n*n)]
    
    res = linprog(c, A_eq=A_eq, b_eq=b_eq, bounds=bounds, method='highs')
    return res.fun

def format_dict(d):
    return {k: float(f"{v:.4f}") for k, v in d.items()}

# --- Setup ---
G = nx.DiGraph()
G.add_edges_from([(0,1), (1,2)]) # 0=A, 1=B, 2=C
nodes = [0, 1, 2]

# Compute Measures
mu_A = lazy_mu_dynamic(0, G)
mu_B = lazy_mu_dynamic(1, G)

# Compute Distance Matrix (Undirected Shortest Path)
# d(A,B)=1, d(B,C)=1, d(A,C)=2
dist_matrix = np.array([
    [0, 1, 2],
    [1, 0, 1],
    [2, 1, 0]
], dtype=float)

# Solve
w1_val = w1_solve(mu_A, mu_B, dist_matrix, nodes)
K_val = 1 - w1_val

# Verify Excess Mass (Proof Step IV)
# Excess = mu_A - mu_B. Positive means "Source has extra", Negative means "Target needs mass".
excess = {n: mu_A[n] - mu_B[n] for n in nodes}

# --- Output ---
print(f"Measure A (Origin): {format_dict(mu_A)}")
print(f"Measure B (Center): {format_dict(mu_B)}")
print(f"Excess Mass (A-B):  {format_dict(excess)}")
print(f"Transport Cost W1:  {w1_val:.4f}")
print(f"Curvature K(A,B):   {K_val:.4f}")

# Verification Logic
transport_verified = np.isclose(w1_val, 2.0/3.0)
print(f"Verification Pass:  {transport_verified}")

Simulation Output

Measure A (Origin): {0: 0.6667, 1: 0.3333, 2: 0.0}
Measure B (Center): {0: 0.3333, 1: 0.3333, 2: 0.3333}
Excess Mass (A-B):  {0: 0.3333, 1: 0.0, 2: -0.3333}
Transport Cost W1:  0.6667
Curvature K(A,B):   0.3333
Verification Pass:  True

The simulation provides exact confirmation of the analytical proof.

1. Measures: Measure A shows the predicted heavy self-bias ($0.6667$) due to the empty past. Measure B is perfectly balanced.

2. Excess Mass: The explicit calculation of Excess Mass confirms Proof Step IV: there is a surplus of $+0.3333$ at Node 0 (A) and a deficit of $-0.3333$ at Node 2 (C). Node 1 (B) is balanced ($0.0$).

3. Cost: The solver confirms that moving this specific surplus to this specific deficit over a distance of 2 yields a total cost of $0.6667$.This validates that the asymmetry of the measures successfully enforces a directional transport cost, compensating for the undirected metric.

11.2.7.3 Commentary: Arrow of Time in Static Geometry

Emergence of Directed Physics from Undirected Metrics

Compensation by Causal Measures resolves a central tension in discrete quantum gravity: how to reconcile the reversibility of metric distance (where $d(x,y)=d(y,x)$) with the irreversibility of causal time. The "Compensation Mechanism" demonstrates that the arrow of time is not lost when we adopt an undirected metric; rather, it is lifted into the space of measures.

By defining the measure $\mu_u$ based on the directed neighborhoods $N^-$ and $N^+$, we effectively "tilt" the probability distribution along the time axis. When we compute the distance between two such tilted distributions, the transport cost becomes sensitive to their relative orientation. Transporting "with the grain" of causality (as in the proof) yields a coherent, finite curvature. If we were to attempt transport "against the grain" (e.g., from a future-biased measure to a past-biased one), the cost would increase significantly (though remain finite), signaling a causal mismatch. Thus, the geometry of Quantum Braid Dynamics is oriented not by the manifold itself, but by the distribution of information upon it.

11.2.7.4 Diagram: Compensation Mechanism

Illustration of the Directional Compensation Mechanism between Metric Symmetry and Measure Asymmetry

THE METRIC (The Ruler)
----------------------
Undirected Distance: d(A,B) = d(B,A) = 1
A <==================> B
   (Cost is Symmetric)


THE MEASURES (The "Tilt")
-------------------------
Directed Graph: A ---> B

      μ_A (at A)              μ_B (at B)
     [Mass Pile]             [Mass Pile]
    +-----------+           +-----------+
    | 66% at A  |           | 33% at A  |
    | 33% at B  |           | 33% at B  |
    |  0% at C  |           | 33% at C  |
    +-----------+           +-----------+
          |                       ^
          |                       |
          +-----------------------+
           Mass must flow A -> C
           (Forced Forward)

RESULT
------
Even though the road is flat (symmetric distance),
the traffic is forced one way by the population (measures).
This encodes the Arrow of Time.

---

11.2.8 Proof: Causal Geometry Construction

Synthesis of Metric and Measure Validations establishing the Well-Posedness for the Curvature Definition

The proof of the Causal Geometry Construction Theorem Causal Geometry Construction §11.2.3 proceeds by aggregating the independent validation lemmas established in this section. This synthesis confirms that the tuple $(G, \bar{d}, \{\mu_u\}, K)$ constitutes a mathematically rigorous metric measure space capable of supporting a finite, time-oriented curvature calculus.

1. Measure Existence and Normalization: Measure Validity §11.2.4 guarantees that for every vertex $u \in V$, the object $\mu_u$ constitutes a valid probability measure ($\sum \mu_u(x) = 1$). The explicit handling of vacuum states via the laziness adjustment ensures that no topological configuration results in measure collapse or mass leakage, securing the input stability for the transport functional.

2. Metric Finiteness and Stability: Metric Necessity §11.2.6 establishes that the undirected shortest-path metric $\bar{d}$ is strictly necessary to prevent divergence. By proving that directed metrics yield infinite transport costs for reverse-time analysis, the compensation by causal measures lemma §11.2.7 justifies the use of $\bar{d}$ to ensure that $W_1(\mu_u, \mu_v) < \infty$ for all connected pairs, rendering the curvature $K(u,v)$ computable and continuous everywhere.

3. Causal Fidelity and Orientation: Compensation by Causal Measures §11.2.7 demonstrates that the undirected metric does not erase the arrow of time. The proof verifies that the temporal biases encoded in the measures $\mu_u, \mu_v$ (specifically the $\alpha=1/3$ equilibrium derived in Entropy Maximization §11.2.5) sufficiently modulate the transport cost to distinguish forward propagation from reverse propagation. This confirms that $K(u,v)$ encodes the directed causal structure of the underlying graph $G$.

4. Curvature Boundedness: Since $\bar{d}(x,y) \le \text{diam}(G)$ and $\mu_u, \mu_v$ are probability measures, the Wasserstein distance is bounded by $0 \le W_1 \le \text{diam}(G)$. Consequently, the curvature $K = 1 - W_1$ is strictly bounded within $[1 - \text{diam}(G), 1]$. In the sparse equilibrium regime where diameters of relevant neighborhoods are small, this bound tightens effectively to $[-1, 1]$.

Conclusion: The construction is well-posed. The resulting scalar curvature $K(u,v)$ serves as a finite, causally sensitive geometric invariant suitable for summation into the Einstein-Hilbert action.

Q.E.D.

---

11.2.Z Implications and Synthesis

Implications: The Geometric thermodynamics of Information

The successful construction of the Causal Geometry establishes a rigorous isomorphism between information processing and gravitational curvature. In this framework, "curved space" is not a pre-existing manifold that dictates how matter moves; rather, it is a statistical summary of how efficiently information flows through the causal network.

1. Geometry as Transport Efficiency: The definition of curvature as $K = 1 - W_1$ implies that positive curvature corresponds to "super-efficient" transport ($W_1 < 1$). Physically, this means that in regions of high gravity (high 3-cycle density), causal information propagates faster and more redundantly than in flat space. The "force" of gravity is thus reinterpreted as an entropic pressure: the system evolves to maximize causal efficiency (minimize transport cost), which manifests geometrically as the clustering of matter.

2. The Inertia of the Present: The derivation of the laziness parameter $\alpha = 1/3$ Entropy Maximization §11.2.5 provides a microscopic origin for the concept of mass/inertia in the geometry. By mandating that a significant portion of the probability mass remains at the vertex (the "Present"), the measure resists instantaneous transport. This "resistance to flow" creates the non-zero transport costs that define the metric scale. Without this laziness, the geometry would be ephemeral; with it, the geometry possesses "weight" and stability.

3. Resolution of the Discrete-Continuum Tension: The "Compensation Mechanism" Compensation by Causal Measures §11.2.7 solves the fundamental problem of defining directed time on an undirected metric space. By encoding the arrow of time into the measure rather than the metric, Quantum Braid Dynamics avoids the singularities that plague other discrete gravity approaches (such as Causal Sets or Lorentzian Regge Calculus) where "spacelike" distances are often imaginary or undefined. Here, all distances are real and finite, yet the physics remains strictly causal.

This geometric engine now stands ready to be coupled to the variational principle. Having defined what curvature is, the subsequent sections will determine how it evolves, deriving the Einstein Field Equations from the thermodynamic imperative to minimize the action of this constructed geometry.