Covariant Bit Threads in Holographic Entropy

• Covariant bit threads are a Lorentzian extension of the bit-thread paradigm, connecting extremal surfaces to holographic entanglement entropy.
• They utilize divergence-free causal flows and convex optimization to rigorously establish duality with the HRT formula.
• Algorithmic implementations via the covariant phase-space formalism facilitate applications in time-dependent, quantum-corrected, and higher-curvature spacetimes.

Covariant bit threads constitute the Lorentzian extension of the bit-thread paradigm for holographic entanglement entropy and generalized geometric entropies. They unify surface, flow, and thread distribution representations of the HRT (Hubeny-Rangamani-Takayanagi) formula and enable a rigorous translation of static, time-dependent, and quantum-corrected setups via convex optimization and covariant phase-space constructs. The core formalism emphasizes divergence-free causal flows (subject to global/nonlocal constraints) and their duality with extremal-area surfaces, with profound implications for holographic entropy inequalities, modular flow, and bulk reconstruction (Das et al., 26 Aug 2025, Headrick et al., 2022).

1. Covariant Bit Thread Axioms and Analogues of Max-Flow/Min-Cut

On a Lorentzian manifold $\mathcal{M}$ with boundary supporting a dual CFT, an achronal spatial boundary region $A$ admits a bulk extremal surface $\gamma_A$ homologous to $A$, obtained via the HRT prescription. The covariant bit-thread program seeks a bulk vector field $v^\mu(x)$ obeying: $\nabla_\mu v^\mu = 0$ throughout the bulk region homologous to $A$, and the causal/subluminal bound: $|v|\equiv \sqrt{-g_{\mu\nu} v^\mu v^\nu} \leq 1$ at all points. The Lorentzian max-flow/min-cut theorem asserts: $$\boxed{ \max_{v^\mu:\;\nabla_\mu v^\mu=0,\; |v|\leq 1} \int_A v^\mu n_\mu d\Sigma = \min_{\gamma_A} \frac{\mathrm{Area}(\gamma_A)}{4G_N} }$$ where the maximization spans all future-directed causal, divergenceless $v^\mu$, and $A$0 is the unit normal on $A$1. This covariant statement generalizes the Freedman-Headrick MFMC equivalence beyond time-reflection and static backgrounds, connecting directly to the geometric content of HRT (Das et al., 26 Aug 2025, Headrick et al., 2022).

2. Covariant Phase Space and Construction Algorithms

The covariant phase-space (CPS) formalism enables the explicit construction of candidate flows. Given a (conformal) Killing symmetry generator $A$2, CPS yields a codimension-2 current form: $A$3 where $A$4 is the Noether charge and $A$5 the symplectic potential. By finding a closed $A$6-form $A$7 with $A$8 and projecting to a bulk Cauchy slice, one defines: $A$9 satisfying $\gamma_A$0. In scenarios where $\gamma_A$1 is a bulk Killing horizon generated by $\gamma_A$2, $\gamma_A$3 and $\gamma_A$4 everywhere on the horizon, yielding a norm-saturating maximal flow.

For general situations, the norm condition or the boundary matching $\gamma_A$5 at $\gamma_A$6 need not be satisfied by the naive CPS current. One then leverages the freedom to add a divergenceless “gauge” field: $\gamma_A$7 where $\gamma_A$8 is a harmonic function solving: $\gamma_A$9 The full flow is $A$0, with $A$1 adjusted so $A$2 everywhere and $A$3 (Das et al., 26 Aug 2025).

3. Convex Programming Reformulations: V-Flows, U-Flows, and Duality

Covariant bit threads admit structurally dual convex program formulations. The max V-flow program seeks a bulk 1-form $A$4 (covector) satisfying: $A$5 subject to a nonlocal-in-time norm bound implemented via barrier functions $A$6, encoding causality and global constraints: $A$7 The objective—maximizing $A$8—reproduces $A$9.

The min U-flow program employs a future-directed causal 1-form $v^\mu(x)$0, with: $v^\mu(x)$1 and a nonlocal-in-space lower bound via $v^\mu(x)$2: $v^\mu(x)$3 Minimizing $v^\mu(x)$4 again yields the HRT area. Lagrange duality interchanges V- and U-flows; both programs identify the HRT surface and entanglement wedges dynamically (Headrick et al., 2022).

4. Measure-Theoretic Thread Distributions

Thread distributions generalize flows to measure-theoretic objects, encoding the density of bit threads as nonnegative measures $v^\mu(x)$5 on bulk curve sets $v^\mu(x)$6. For V-threads (connecting $v^\mu(x)$7 to $v^\mu(x)$8), the local density constraint is: $v^\mu(x)$9 The total measure, $\nabla_\mu v^\mu = 0$0, counts the number of threads, and maximization under these constraints recovers the minimal area cut homologous to $\nabla_\mu v^\mu = 0$1 (the RT formula in the Riemannian limit).

The dual U-thread program is defined analogously for inextendible causal curves. The two linear programs are dual: maximal V-thread distributions and minimal U-thread distributions attain optima at the HRT surface, ensuring the Lorentzian MFMC theorem extends to the space of thread measures (Headrick et al., 2022).

5. Entropy Laws, Quantum Corrections, and Energy Conditions

The covariant phase-space formalism re-expresses the first law of entanglement entropy in terms of bit threads and the associated current: $\nabla_\mu v^\mu = 0$2 In the bit-thread language, $\nabla_\mu v^\mu = 0$3 is divergence-free and $\nabla_\mu v^\mu = 0$4 holds.

When including quantum effects, the positivity of bulk relative entropy,

$\nabla_\mu v^\mu = 0$5

is reflected in

$\nabla_\mu v^\mu = 0$6

In the flow picture, $\nabla_\mu v^\mu = 0$7 with $\nabla_\mu v^\mu = 0$8, with the dominant energy condition (DEC) underlying the JLMS equality between bulk and boundary relative entropies (Das et al., 26 Aug 2025).

6. Explicit Examples and Applicational Domains

Dynamical and static explicit constructions demonstrate the generality of covariant bit threads:

• AdS$\nabla_\mu v^\mu = 0$9-Vaidya spacetime: For $A$0 with $A$1, the CPS approach yields $A$2 phasewise, with harmonic correction $A$3 ensuring $A$4 and correct flux on $A$5, equaling $A$6.
• De Sitter static patch: For

$A$7

the Killing generator $A$8 yields a valid $A$9 matching the cosmological horizon and reproducing $|v|\equiv \sqrt{-g_{\mu\nu} v^\mu v^\nu} \leq 1$0 (Das et al., 26 Aug 2025).

In model "stripe" spacetimes, the full convex program gives entropy values interpolating between geometric area values outside and inside the stripe, illustrating the refraction of flows caused by nonlocal norm bounds (Headrick et al., 2022).

7. Algorithmic Implementation and Practical Methodology

A practical pipeline for covariant bit-thread construction in Lorentzian backgrounds, as outlined in (Das et al., 26 Aug 2025), consists of:

1. Identify an exact or conformal Killing vector field $|v|\equiv \sqrt{-g_{\mu\nu} v^\mu v^\nu} \leq 1$1 adapted to the boundary region.
2. Compute the codimension-2 current $|v|\equiv \sqrt{-g_{\mu\nu} v^\mu v^\nu} \leq 1$2 or its extension $|v|\equiv \sqrt{-g_{\mu\nu} v^\mu v^\nu} \leq 1$3 using the Iyer–Wald (or appropriate) boundary-corrected CPS formalism.
3. Extract a closed $|v|\equiv \sqrt{-g_{\mu\nu} v^\mu v^\nu} \leq 1$4-form $|v|\equiv \sqrt{-g_{\mu\nu} v^\mu v^\nu} \leq 1$5 so that $|v|\equiv \sqrt{-g_{\mu\nu} v^\mu v^\nu} \leq 1$6.
4. Project to a chosen Cauchy slice and define $|v|\equiv \sqrt{-g_{\mu\nu} v^\mu v^\nu} \leq 1$7; verify divergence-free property.
5. Check norm and saturation conditions for $|v|\equiv \sqrt{-g_{\mu\nu} v^\mu v^\nu} \leq 1$8. When violated, solve the Laplace problem $|v|\equiv \sqrt{-g_{\mu\nu} v^\mu v^\nu} \leq 1$9 with specified Dirichlet/Neumann conditions, and set $$\boxed{ \max_{v^\mu:\;\nabla_\mu v^\mu=0,\; |v|\leq 1} \int_A v^\mu n_\mu d\Sigma = \min_{\gamma_A} \frac{\mathrm{Area}(\gamma_A)}{4G_N} }$$0.
6. Validate all final constraints and compute the flux, which equals $$\boxed{ \max_{v^\mu:\;\nabla_\mu v^\mu=0,\; |v|\leq 1} \int_A v^\mu n_\mu d\Sigma = \min_{\gamma_A} \frac{\mathrm{Area}(\gamma_A)}{4G_N} }$$1.

This method extends seamlessly to time-dependent, quantum-corrected, and higher curvature backgrounds, enabling unified entropy computations in diverse spacetimes.

---

Covariant bit threads provide the operational and geometric backbone for Lorentzian and time-dependent holographic entanglement formulations, capturing convex structure, dualities, and quantum/energy law generalizations in a unified, algorithmically tractable framework (Das et al., 26 Aug 2025, Headrick et al., 2022).