Bit threads and holographic entanglement

Bit threads and holographic entanglement

Michael Freedman Station Q, Microsoft Research, Santa Barbara, California 93106, USA and Department of Mathematics, University of California, Santa Barbara, California 93106 USAMartin Fisher School of Physics, Brandeis University, Waltham, Massachusetts 02453, USA    and Matthew Headrick Station Q, Microsoft Research, Santa Barbara, California 93106, USA and Department of Mathematics, University of California, Santa Barbara, California 93106 USAMartin Fisher School of Physics, Brandeis University, Waltham, Massachusetts 02453, USA

The Ryu-Takayanagi (RT) formula relates the entanglement entropy of a region in a holographic theory to the area of a corresponding bulk minimal surface. Using the max flow-min cut principle, a theorem from network theory, we rewrite the RT formula in a way that does not make reference to the minimal surface. Instead, we invoke the notion of a “flow”, defined as a divergenceless norm-bounded vector field, or equivalently a set of Planck-thickness “bit threads”. The entanglement entropy of a boundary region is given by the maximum flux out of it of any flow, or equivalently the maximum number of bit threads that can emanate from it. The threads thus represent entanglement between points on the boundary, and naturally implement the holographic principle. As we explain, this new picture clarifies several conceptual puzzles surrounding the RT formula. We give flow-based proofs of strong subadditivity and related properties; unlike the ones based on minimal surfaces, these proofs correspond in a transparent manner to the properties’ information-theoretic meanings. We also briefly discuss certain technical advantages that the flows offer over minimal surfaces. In a mathematical appendix, we review the max flow-min cut theorem on networks and on Riemannian manifolds, and prove in the network case that the set of max flows varies Lipshitz continuously in the network parameters.


BRX-TH-6302, NSF-KITP-16-051

1 Introduction

Figure 1: According to the Ryu-Takayanagi formula, (1), the entanglement entropy of a given boundary spatial region is given by the area of a corresponding bulk minimal surface .

The Ryu-Takayanagi entanglement entropy formula Ryu:2006bv; Ryu:2006ef is by now a firmly established entry in the holographic dictionary. This formula, which applies when the bulk is static and governed by classical Einstein gravity,111We will restrict our attention in the bulk of this paper to the regime of applicability of the RT formula. In the last section, we will briefly discuss its covariant generalization Hubeny:2007xt as well as stringy and quantum corrections. gives the EE of an arbitrary spatial region in terms of the area of , the minimal bulk surface homologous to (fig. 1):


In addition to being calculationally useful, this beautiful formula is widely believed to contain some deep—but still hidden—conceptual message about the nature of quantum gravity and the emergence of spacetime.

In trying to decode the conceptual implications of the RT formula, it is natural to wonder how one should think about the minimal surface , to which the formula seems to assign a special status. A naive interpretation is that the bits encoding the microstate of somehow “live on” the minimal surface , at a density of one bit per four Planck areas.222Actually, bits. As our aims are mostly conceptual, for simplicity of presentation we will consistently misuse “bit” to mean “ bits” (sometimes called a “nat”). A similar interpretation can be given to the Bekenstein-Hawking black-hole entropy formula (which to a certain extent is a special case of the RT formula). However, whereas the location of the black-hole horizon is fixed by the causal structure of the spacetime, the minimal surface depends on the arbitrary choice of boundary region , and this freedom reveals several problems with the above interpretation.

Figure 2: The minimal surface for the union of two separated regions undergoes a transition as a function of their separation between connecting them at small separation (left) and equalling the union of their respective minimal surfaces at large separation (right).

First, the minimal surface can jump under continuous deformations of Hirata:2006jx; Nishioka:2006gr; Klebanov:2007ws; Headrick:2010zt, suggesting that the bits strangely jump from one place to another.333One might wonder whether such a jump, which is due to competing minimal surfaces, reflects a jump in the type of microstate represented in the reduced density matrix , in other words a first-order phase transition between competing macrostates. However, this seems unlikely since, according to the RT formula, the entropy is given by the least-area surface, whereas in a conventional phase transition, it is the macrostate with the largest entropy that dominates (in the microcanonical ensemble). See Headrick:2013zda for further discussion of this issue. Consider for example the classic case of two separated regions , . The minimal surface for their union typically connects them at sufficiently small separation; as the separation is increased, however, it jumps to being the union of their respective minimal surfaces (fig. 2).

Figure 3: Schematic illustration of the mutual information and conditional entropy in a classical system: Two correlated systems and can be encoded into and bits respectively, such that bits of each are perfectly correlated, bits of are uncorrelated with those of , and bits of are uncorrelated with those of .
Figure 4: The shaded boxes indicate pairs of bits that are maximally entangled between and . Each such EPR pair contributes 1 to and , 0 to , 2 to , and to . In this case, is negative.

Related to this, it seems mysterious why the conditional entropy,


which measures the expected entropy of conditioned on knowing the state of , and the mutual information


which measures the amount of correlation between and , should be given by a difference of areas of surfaces that may pass through different parts of the spacetime (as in the left side of fig. 2). To put this question into context, let us briefly and heuristically recall why these particular linear combinations of entropies have special information-theoretic meanings, starting with the classical case. The state of can be encoded in a compressed form, such that it is represented by bits, the state of by bits, and the state of by bits. Then is clearly the number of bits that are shared by and , while is the number that appear only in and the number that appear only in (fig. 3). In the quantum case, a bit444Strictly speaking, a qubit. For simplicity, in this paper we will apply the term “bit” uniformly to the classical and quantum cases. of may be maximally entangled with a bit of ; such an EPR (or Bell) pair is pure in the joint system and so doesn’t contribute to , hence contributes to , to , and to (fig. 4). Again, in the RT calculation of these quantities, it is far from clear what the difference between the areas of minimal surfaces passing through different parts of the spacetime has to do with any redundancy or cancellation between the bits in and in .

A similar confusion arises for properties of entanglement entropies such as subadditivity and strong subadditivity. These fundamental properties have clear information-theoretic meanings, namely the positivity and monotonicity under inclusion of correlations, respectively. It can be proven that the RT formula obeys these properties Headrick:2007km; Headrick:2013zda. However, the proofs, which involve cutting and gluing minimal surfaces, bear little apparent relation to the information-theoretic meanings of the properties. In the absence of such a connection, it seems almost fortuitous that the formula satisfies these properties.

Arguably, the fallacy in ascribing too much significance to the minimal surface is in thinking of its area—and therefore —as a local property. In fact, since is defined by its minimality, its area is really a global property of the entire bulk spacetime. To emphasize this, one can write the RT formula without explicitly appearing:


where means homologous.

If we don’t think of the bits of as “living on” , how then should we interpret the RT formula? In this note we will provide a new interpretation which clarifies the above conceptual issues. This interpretation offers a transparent relation between the EE calculated from the formula, as well as the quantities and properties derived from it, and their information-theoretic meanings. It is hoped that this interpretation will be suggestive of a new way to think about the emergence of spacetime in quantum gravity.

Let us briefly summarize the new interpretation here. We will begin by rewriting the formula in a way that does not involve the minimal surface, or indeed any surfaces at all. Instead, we will invoke the notion of a flow, defined as a divergenceless vector field in the bulk with pointwise bounded norm; note that this is a global object, not localized anywhere in the bulk. Its flow lines can be thought of as a set of “threads” with a cross-sectional area of 4 Planck areas. In this picture, each thread leaving the region carries one independent bit of information about the microstate of ; is thus the maximum possible number of threads emanating from . The equivalence of this formulation to equation (1) arises from the fact that the minimal surface acts as a bottleneck limiting the number of threads emanating from ; this is formalized by the so-called max-flow min-cut (MFMC) principle, a theorem originally from network theory but which we use here in its Riemannian geometry version Federer74; MR700642; MR1088184.555The network version of MFMC was recently applied to compute EEs in a tensor-network toy model of holography Pastawski:2015qua. The threads thus naturally implement the holographic principle 'tHooft:1993gx; Susskind:1994vu; the entropy is computed by an area rather than a volume simply because one is counting one-dimensional rather than pointlike objects. Both entangled and classically correlated pairs of bits are naturally described in terms of these threads, along with important information-theoretic quantities like conditional entropy, mutual information, and conditional mutual information. Subadditivity and strong subadditivity follow immediately from this picture, and moreover the proofs of these properties correspond in a transparent way to their information-theoretic meanings. Unlike the minimal surfaces, the threads do not jump under continuous deformations of the region .666Since, in the thread picture, the minimal surface is eliminated as a fundamental object, an interesting question is how to think about the entanglement wedge, the bulk region that interpolates between and Headrick:2014cta. In particular, recent discussions of “subregion duality” and “entanglement wedge reconstruction” have suggested that the entanglement wedge may carry the information in the reduced density matrix (see e.g. Czech:2012bh; Headrick:2014cta; Jafferis:2015del). We leave consideration of this issue to future work. The new formulation also has certain technical advantages that we will describe.

We will explain the MFMC principle and describe the new formulation of the RT formula in the next section. In section 3, we will describe the bit threads and explain how they give rise to a natural interpretation of the formula. We conclude in section 4 with a discussion of open questions. Appendix A contains a mathematical review of aspects of MFMC, focusing on its Riemannian geometry version; it also gives proofs in the network setting and conjectures in the Riemannian setting of two properties of flows (continuity and nesting) that we will need.

2 Flows

In this section, we will state the max-flow min-cut (MFMC) theorem in its Riemannian-geometry version, and then use it to give a reformulation of the Ryu-Takayanagi formula that is mathematically equivalent to (1) but does not make reference to the minimal surface. MFMC is a standard tool in network theory, where it originated. On the other hand, the literature in the Riemannian setting is rather obscure. Therefore, in appendix A we provide a short review, and discuss some relevant extensions.

2.1 Max flow-min cut principle

Given an oriented Riemannian manifold with boundary and a positive constant , we define a “flow” to be a vector field satisfying the following two properties:


(We do not impose any boundary condition on .) We define a “surface” to be an oriented codimension-one submanifold, and denote the flux of through a surface by :


where is the determinant of the induced metric on and is the unit normal vector. Let be a region777Technically, by “region” we mean codimension-zero submanifold. of the boundary. The divergenceless condition implies that the flux through equals that through any homologous888If is not closed, then by “homologous” we mean relative to . surface:


Meanwhile, the norm bound implies , so this flux is bounded by the area of :


Maximizing on one side over all flows and minimizing on the other over all surfaces homologous to , we therefore have999At this stage, to be mathematically correct, we should really put sup and inf instead of max and min. However, one can show under certain conditions that the supremum and infimum are achieved; see appendix A.

Figure 5: Illustration of the Riemannian max-flow min-cut theorem: Given a boundary region , the minimal-area representative of its homology class is the bottleneck; its area gives an upper bound on the flux for any flow. The theorem asserts that there exists a flow whose flux equals the area of (times the constant ). In the figure, is shown by its flow lines. On , this flow necessarily equals times the unit normal .

So far this is all fairly obvious. The max-cut min-flow (MFMC) theorem Federer74; MR700642; MR1088184 makes the non-trivial statement that the inequality (9) is in fact saturated:


In other words, the inequalities (8) for all the different members of the homology class are the only obstructions to increasing the flux; the strongest of these is obviously the area-minimizing representative —this is the bottleneck. Any flow that achieves the maximum flux clearly must have , hence , everywhere on .101010The Riemannian MFMC theorem can be phrased in the language of calibrations. Via the Hodge star, , the definition of a flow is equivalent to that of a -calibration (setting to conform to the usual definition), and the statement “ on the surface ” is equivalent to the statement “ calibrates ”. It is a standard result that if a surface is calibrated then it has minimal area in its homology class. The MFMC theorem asserts the converse: any surface that is minimal in its homology class is calibrated. While calibrated implies minimal in any codimension, the converse is special to codimension 1, as can be shown by simple counterexamples. See the appendix for further discussion. Elsewhere, however, the constraints are weaker and there is considerable freedom in choosing the flow. Thus, whereas the area-minimizer is generically unique, the flux-maximizer generically enjoys an enormous (infinite-dimensional) degeneracy.111111Mathematically, for generic metrics, the max flow is underdetermined. This explains why the topic lies outside mainstream differential geometry; there is no well-posed PDE to solve! We will let denote any flux-maximizing flow. The theorem is illustrated in figure 5.

Figure 6: The nesting property asserts that the set of flows maximizing the flux on overlaps the set of flows maximizing the flux on . Flows in the overlap are referred to as .

Two extensions of the theorem will be useful to us in what follows. In subsections LABEL:continuity and LABEL:nesting respectively of the appendix, we will prove each property in the network setting and suggest how the proof may be carried over to the Riemannian setting.121212We are not aware of proofs of these statements in the literature. However, the literature on the network version of MFMC is very extensive, and it seems likely that one or both of these properties have previously been noted in some form. Firstly, the maximizing flow varies continuously under continuous deformations of ; more precisely, given the degeneracy of the maximizer, it can be chosen to vary continuously. Secondly, suppose we have two regions , of the boundary, which without loss of generality we assume to be disjoint. We cannot in general find a flow that maximizes the flux through both regions simultaneously. The reason is that the bottleneck for their union may have an area smaller than the sum of the areas of and . Then


implying that either the flux through or through fails to achieve its maximum. On the other hand, there do always exist flows that simultaneously maximize the flux through and through . We will call this the “nesting” property, and will denote such a flow by . Thus any flow called could also be called or (but not in general ). (See figure 6.) It is also useful to think of in two other, equivalent ways: as a flow that maximizes the flux through among those that maximize the flux through ; and as a flow that minimizes the flux through among those that maximize the flux through . There is an obvious generalization to more regions; for example simultaneously maximizes the fluxes through , , and .

2.2 Reformulation of Ryu-Takayanagi

Figure 7: According to eq. (12), the entanglement entropy of the region is given by the maximum flux through of any flow. A maximizing flow is illustrated by its flow lines in blue. This flux will equal the area of the RT minimal surface (divided by ).

We now return to the holographic context. The Riemannian manifold is a constant-time slice of a static bulk spacetime, is a region of its conformal boundary,131313In additional to the conformal boundary where the dual field theory lives, the slice may have a boundary which is a horizon. Recall that there is no boundary condition on , so it may have non-zero flux through horizons. The bulk may also end on singularities such as orbifold and orientifold fixed planes, end-of-the-world branes, and walls where internal dimensions cap off. However, as explained in Headrick:2013zda, these do not count of “boundaries” for the purposes of computing holographic entanglement entropy, and therefore must have vanishing flux through them. and we set . By (10), we can now rewrite the Ryu-Takayanagi formula (4) in the following simple way (see fig. 7):


It is worth noting that both the global minimization and the homology condition in the usual formulation are automatically incorporated in (12). Returning to the question in the introduction, “How should we think about the minimal surface?”, the answer is just that it serves as the bottleneck for the flow. If the region is varied, the bottleneck can jump even while the flow changes continuously.

If the region has a non-empty entangling surface , then the entanglement entropy (EE) will have an ultraviolet divergence. (There may also be an infrared divergence, if there is a finite entropy density and the region is infinite in extent. Similar remarks to those below apply to that case.) In the minimal-surface picture, this is due to the divergent surface area near the boundary; in the flow picture, it is due to the divergent flow near the entangling surface. It is then necessary to regulate the divergence by moving the boundary to a finite value of the radial coordinate. There is, however, an interesting difference between the surface and flow pictures in this regard. In the surface picture, it is necessary to introduce a regulator even to define the minimal surface. In particular, while one can define a locally minimal surface even if its area is infinite (namely a surface whose local area increases under local variations), one cannot determine which of several such surfaces should be considered the global minimum. On the other hand, we can give a definition of a maximal flow that applies even if the flux is infinite. First, given a flow we define an “augmentation” as a vector field such that is also a flow and has positive flux through . A maximal flow is then one that does not admit an augmentation. The utility of this definition will become clear when we discuss the mutual information in subsection 2.3 below.

The conceptual implications of (12) are the main focus of this paper. However, as an aside we note that this formula may actually be useful for the numerical evaluation of holographic EEs. Finding a max flow requires maximizing a linear functional on a vector space (the space of divergenceless vector fields) subject to a convex constraint; in other words, it is a convex optimization problem. This is in contrast to the problem of finding the min cut, which requires finding the global minimum of a functional that is defined on a non-linear space and typically has local minima.141414Actually, min cut can also be turned into a convex problem, as follows. (This is an example of “convex relaxation”.) One considers a real function on the manifold, subject to the constraint , , and minimizes the functional . On the minimum, on the “entanglement wedge” (the bulk region that interpolates between and ) and 0 on its complement; hence is a delta function supported on , and . Min cut, in this form, is related to max flow by the so-called “strong duality” of convex optimization problems. A fuller explanation of this will be given in covariantflows. For that reason, for certain classes of computational problems such as image processing, flow maximization is often used as a method for finding minimal surfaces. The basic strategy is the so-called Ford-Fulkerson algorithm: Start with an arbitrary flow and augment it until it can’t be augmented anymore. We leave the investigation of possible numerical applications of (12) to future work.

Given multiple subsystems of a quantum system, there are several linear combinations of EEs that have information-theoretic significance, and can easily be evaluated using the RT formula. The most important of these are the conditional entropy, mutual information, and conditional mutual information. The crucial subadditivity and strong subadditivity (SSA) inequalities are most simply expressed in terms of these quantities. In the rest of this section, we will see that these quantities and properties are naturally expressed in terms of flows.

2.3 Two regions

We begin with the conditional entropy , which has a simple and useful expression in terms of flows. Using the nesting property explained in subsection (2.1), we choose a flow that simultaneously maximizes the flux through and through . Then


Thus it is the minimum possible flux through , the amount left over after as much as flux possible has been put on , given that the flux has been maximized. (Note that this amount may be negative; we will discuss examples in the next section.)

The mutual information is the difference between the maximum and minimum flux on ,


i.e. the amount of flux that can be shifted from over to (again, always maximizing on ). If it is zero, then the flow that maximizes the flux on and also maximizes on ; this implies that the bottleneck simply consists of the union of the and bottlenecks.

The fact that is the difference between the maximum and minimum fluxes through (subject to maximizing on ) immediately implies that it is non-negative; this is subadditivity of EE. It can also be proved without appealing to the nesting property.151515We thank V. Hubeny for helpful discussions on this and related points. Simply pick any flow that maximizes on ; by (12), its flux through cannot exceed , and similarly for , so we have


If the regions do not share a boundary, then the ultraviolet divergences in their EEs are additive in , so the mutual information is ultraviolet-finite. To calculate or even define this quantity using the minimal-surface formulation of the RT formula requires first introducing and then removing a regulator. However, as discussed in the previous subsection, in the flow picture we can define maximal flows even when they have an infinite flux. Using this, we can define the mutual information directly in the unregulated theory. As above, we let be a maximal flow through and (i.e. one for which there exists neither an augmentation such that nor one such that ), and similarly for . We then define


This will agree with the definition from introducing and removing a regulator. Thus, even if the total fluxes are infinite, the amount of flux that can be shifted between and is a well-defined quantity.

Figure 8: The flow defined by equation (17) vanishes outside the entanglement wedge (shaded region), which is a tube connecting and . Its flux, which is half the mutual information, is bounded above by the area of the neck of this tube (shown in red).

Equation (17) leads to an interesting connection between the mutual information and the entanglement wedge , the bulk region that interpolates between and . First, note that the vector field


is itself a flow. Since and both equal the unit normal on , vanishes there. Furthermore, outside of , and can be chosen equal (since they are subject to the same constraints), making vanish. Thus we can assume that is non-zero only inside , which is a tube connecting and . Since is a flow, its flux—which is half the mutual information—is bounded above by the area of the “neck” of this tube, the least-area surface in separating and (technically, the least-area surface in homologous to relative to ).161616This statement can also be proven using minimal surfaces rather than flows by appropriately cutting up . This situation is illustrated in fig. 8. As an example, for two intervals , on the boundary of AdS, is connected as long as . The area of the neck is , which is larger than half the mutual information, . (In the regime where is disconnected, both the neck and the mutual information vanish, so the bound is trivial.)

The constraints , that define a flow are invariant under . Therefore, in addition to the definitional upper bound , we have the lower bound . In other words, the bottleneck constrains the flux in either direction. We can use this to give a proof of the Araki-Lieb inequality , similar to the proof (15) for subadditivity. Let be any flow maximizing the flux out of . Then


2.4 Three regions

The most important quantity involving three subsystems is the conditional mutual information , so-called because (classically) it is the mutual information between and , conditioned on :


This can be written in various ways in terms of conditional entropies or mutual informations. For example, we can write it as


Invoking the nesting property again, we can assume without loss of generality that the first flow also maximizes on and the second also maximizes on ; then we have


The first term is the maximum possible flux through and the second term the minimum, always subject to the constraint of first maximizing on and . Thus the conditional mutual information is the amount of flux that can be shifted between and subject to those constraints.

Since the maximum cannot be less than the minimum, we have , which is SSA. This proof that RT obeys SSA is in some ways simpler than the one based on cutting and pasting minimal surfaces, for which various special cases must be taken into account Headrick:2007km; Headrick:2013zda. More importantly, as we will discuss in the next section, the present proof relates in a transparent manner to the information-theoretic meaning of SSA.

Figure 9: The flow defined by equation (23) vanishes outside the region (shaded region), which is a tube connection and . Its flux, which is half the conditional mutual information, is bounded above by the smallest area separating and in this tube.

As with the mutual information, the conditional mutual information can be finite even when its component EEs are divergent; by rewriting (21) as


the flow again provides a regulator-free definition. Furthermore, the flow


can be chosen to vanish outside of the region , which is a tube connecting and .171717We thank N. Bao for pointing this out. Its flux, which is half the conditional mutual information, is bounded above by the area of the neck of this tube (the least-area surface separating and ); see figure 9. Note that


(for appropriate choices of and ), which is the analogue at the level of flows of the relation for fluxes.

The last linear combination of entropies we will consider is the tripartite information:


Like the conditional mutual information, this can be rewritten in various ways in terms of mutual informations or conditional entropies—for example —and therefore in terms of flows. We leave this as an exercise for the reader. Our main interest here is in the fact that, in holographic theories, the tripartite information is always non-positive,


a property called181818The name “monogamy of mutual information” is perhaps slightly obscure, as the connection between this inequality and monogamy of entanglement is rather indirect. A clearer name might be “superadditivity of mutual information”. “monogamy of mutual information” (MMI) Hayden:2011ag; Headrick:2013zda. The proof is similar to the original one for SSA, involving cutting and pasting minimal surfaces (again, various special cases have to be considered).191919An infinite set of inequalities involving more than three regions has recently been discovered, generalizing MMI Bao:2015bfa. We have not been able to find a proof of this property in the flow language (i.e., that does not invoke MFMC to pass back to the minimal surface and then apply the known proof there). We will discuss this further below.

Figure 10: Given a bulk geometry and three boundary regions , the set of flows that maximize the flux through can be plotted on a plane with the fluxes through and respectively as coordinates. The result is in general a hexagon or lower polygon where each side is either vertical, horizontal, or at a angle. The figure shows an illustrative example. Points in the interior of the hexagon represent flows that maximize only the flux through ; points lying on an edge represent flows that maximize also one other flux (e.g. , , , shown on the diagram); and the vertices represent flows that maximize two other fluxes (e.g. , shown). As shown in the figure, most quantities of interest that can be derived from the EEs of these regions—conditional entropies, mutual informations, and conditional mutual informations—are represented as positions or distances on this diagram. The tripartite information is the difference in length between the bottom and of the top of the hexagon. In the example shown, this is negative as required by the MMI inequality. However, this is not the case for all hexagons (a simple counterexample is given in the main text).

A useful way to visualize the various EEs and their linear combinations is shown in figure 10. We consider the set of all possible flows that maximize the flux on , and plot them on a plane using as coordinates their fluxes on and respectively. Note that, given the total flux through (which is ), all other fluxes (through , , etc.) are determined by those two. The possible fluxes will fill out a hexagon (or lower polygon) with edges that are horizontal, vertical, or at a angle running northwest-southeast.202020Like the toric diagram of a del Pezzo surface. As shown in the figure, many quantities of interest are represented by the positions of vertices and lengths of edges on this hexagon. Subadditivity and SSA are clear from the fact that these lengths cannot be negative.

One can ask conversely whether a given hexagon can be realized as a set of fluxes for some actual geometry. Positivity of the entropies and the Araki-Lieb inequality impose some constraints on the positions of the edges. These, however, are not enough to enforce the MMI inequality (26). A simple counterexample is a triangle with vertices at , , ; setting , this triangle represents the following entropies:


These entropies are realized by the state


(which can be purified to the 4-party GHZ state ). However, since , (26) is violated, and so the corresponding fluxes cannot be realized by any geometry. Since nesting and other basic properties of fluxes are implicitly satisfied in the hexagon construction, this counterexample shows that those properties are not sufficient to prove MMI. It follows that flows obey some other non-trivial property beyond nesting, which would be very interesting to discover.

3 Interpretation

Our purpose in this section is to attach an interpretation—essentially, a set of pictures—to the right-hand side of equation (12), which will connect it to the information-theoretic meaning of its left-hand side, the entanglement entropy, as well as derived quantities and concepts like mutual information, subadditivity, etc. The interpretation, in terms of so-called bit threads, is explained in subsection 3.1 and expanded upon in subsection 3.2. These are followed in subsection 3.3 by a further, more speculative interpretation, which relates bit threads to Weyl’s law from harmonic analysis.

3.1 Bit threads

As with an electric, magnetic, or fluid velocity field, it is convenient to visualize the flow by its field lines. These are defined as a set of integral curves of chosen so that their transverse density equals . We will call these flow lines “bit threads”, for a reason that will become clear soon.212121“Qubit threads” would perhaps be more accurate, but seems awkward. Please keep in mind that the threads are oriented.

The bit threads inherit two important properties from the definition of a flow. First, the bound means that they cannot be packed together more tightly than one per 4 Planck areas. Thus they have a microscopic but nonetheless finite thickness. In general, their density on macroscopic (i.e. AdS) scales will be of order (in the usual gauge/gravity terminology). Therefore, unless we are interested in effects (which we will mostly ignore in this paper), we should not worry too much about the discrepancy between the continuous flow and the discrete threads. Second, the condition means that the threads cannot begin, end, split, or join in the bulk; each thread can begin and end only on a boundary, which could be the conformal boundary where the field theory lives, or possibly a horizon (e.g. if we are considering a single-sided black hole spacetime).222222However, the threads cannot end on singularities in the bulk; see the discussion in footnote 13.

We would now like to suggest that a thread that emanates from a region on the boundary (and does not return to it) should be thought of as a channel that can carry one independent bit232323We remind the reader that, as explained in footnote 2, by “bit” we mean “ bits”. of information about the microstate of . The maximum number of independent bits is the entropy . This gives an interpretation to (12). The rest of this section will be devoted to developing this interpretation further, and using it to resolve the conceptual puzzles surrounding the RT formula that were described in the introduction.

We begin with a few general comments. First, as emphasized in the previous section, the maximum allowed number of threads leaving is a global property of the bulk spacetime. The minimal surface is the place where they happen to be most tightly packed together—where the bits are literally compressed, to their maximum allowed of 1 per 4 Planck areas. Under continuous deformations of , even when the location of this bottleneck jumps, the thread configuration change in a continuous manner. This resolves one of the conceptual puzzles.

Also as emphasized in the previous section, even given the constraint of maximizing the number of threads leaving , there remains considerable freedom in choosing the configuration, and in particular where to attach the threads in . Given the large volume near the boundary, there is also considerable freedom to add extra threads that begin and end on without changing the net number leaving . (Note, however, that these extra threads cannot cross the minimal surface, as there is no room for them there.) The freedom to move threads around and to add extra ones is a kind of gauge freedom, which, as we will explain in the next subsection, has an important physical significance.

Third, it is well known that a region with a non-empty entangling surface will have a divergent entropy . In the usual formulation of RT, this is due to the infinite area of the minimal surface near the boundary. In this picture, it is due to the fact that an infinite number of threads can be squeezed into the bulk near the entangling surface.

Finally, as a simple example, consider a one-sided black hole, representing a mixed state of the field theory. The entropy of the entire boundary is simply the black hole’s entropy, which (by either the Bekenstein-Hawking or the RT formula, since the horizon is the minimal surface) is the area of the horizon. In the bit-thread picture, the only threads that count are those that leave the boundary and don’t return; since they can’t end in the bulk, such threads must end on the horizon, which is itself the bottleneck. If we consider the two-sided version of the same black hole, but still evaluate the entropy of one boundary, then the threads continue to the other side and end on the other boundary, with the bottleneck still being the horizon.

3.2 Correlations and entanglement

We now consider two disjoint regions , . We start with the case where the joint system is pure. Then the amount of entanglement is equivalent to () EPR pairs. Since the total flux on must vanish, any thread leaving must either return to it or end on . The maximum that may go from to is the maximum flux on , which is . (In general one may consider thread configurations with threads going both ways. The flux measures the net number: the number going from to minus the number going the other way. However, when the maximum flux is achieved, no threads may go the other way, as the threads going from to already occupy the entire bottleneck .) We can simply reverse the direction of all of these threads in order to obtain a configuration maximizing the number leaving . Thus an entangled pair of bits is represented by a thread connecting and , which switches direction depending on which entropy is being measured.

Figure 11: Allowed thread configurations for the toy example discussed in the text, with , . One thread is stuck on , representing a bit that (in the compressed encoding of ) is unique to , one is stuck on , representing a bit that is unique to , and one can be moved between them, representing a pair of classically correlated bits. The box diagram on the left represents this state in the scheme of figure 3.
Figure 12: Allowed thread configurations for a toy example with , . In the configuration (left), although two threads can leave , only one can leave , so the second must go to . In (right), the first thread moves over to , while the second switches direction. The moving thread represents a classically correlated pair of bits, while the connecting one represents an entangled pair. The box diagram on the left represents this state in the scheme of figure 4.

Classical correlations between and require to be nonzero. In such a case some threads—up to total—can leave or and end elsewhere (neither on nor ). (Again, when that number is saturated, the bottleneck will be fully occupied, so no threads can come the other way, beginning elsewhere and ending on or .) Consider first a toy example, in which and . We then have , so one bit of (in its compressed form) is unique to , one is unique to , and one is redundant. How is this reflected in the thread configurations? With three threads total leaving , either two can come from and one from or vice versa (fig. 11). Thus one thread is stuck to , representing the bit unique to ; one is stuck to , representing the bit unique to ; and one is free to move between and , representing the redundant bit. In general, as long as both conditional entropies and are non-negative, in the thread configurations with the maximum threads leaving , of them will be stuck to , will be stuck to , and will be free to move between them. On the other hand, if a conditional entropy is negative, for example , then in some threads leaving must end on (since ); this reflects the fact that a negative conditional entropy implies the presence of entanglement. See fig. 12 for an example.

Let us recap what we have learned so far: We consider the set of thread configurations that maximize the total number leaving . An entangled pair of bits is represented by a thread that connects to and can switch direction. A classically correlated pair is represented by a thread that leaves and can begin on either or . And a bit that is unique to () is represented by a thread that leaves and is stuck to ().

In the previous subsection, we promised to explain the significance of two “gauge” freedoms that occur when evaluating using threads: the freedom to choose where to attach threads to the boundary, and the freedom to add extra threads that begin and end on . If we divide arbitrarily into two subregions, and apply the lessons of the previous paragraph, we learn that the freedom to move the threads around reflects the existence of classical correlations between different spatial locations in the field theory, while the freedom to add extra threads reflects the existence of entanglement between different locations.

Figure 13: Two possible ways of arranging bits given the entropies , , as discussed in the second toy example of the text. Top row: one bit is unique to each of and and two pairs of bits are classically correlated; in the corresponding set of thread configurations, one thread is stuck to each of and while two are free to move between them. Bottow row: two bits are unique to each and one pair of bits is entangled; in the corresponding set of thread configurations, two threads are stuck to each of and and one connects them and switches direction. In the box diagrams on the left, as in figs. 3 and 4, unshaded stacked boxes represent correlated bits and shaded ones entangled bits.

Now, as emphasized in the introduction, the thread picture is just a rewriting of the RT formula, which tells us the entropy of any given region. These entropies alone, however, cannot always distinguish between entanglement and classical correlation. For example, while a negative conditional entropy implies the presence of entanglement, a positive one does not imply its absence. Let us see, in another toy example, how the threads can accommodate either possibility. We take and , so and . There are two bit configurations that would both account for these entropies: one bit unique to each of and plus two correlated pairs; or two bits unique to each and one entangled pair. Indeed, the threads allow both options: either one thread attached to each of and and two that are free to move between them; or two threads attached to each and one connecting them (fig. 13).

Finally, we consider three regions. The strong subadditivity property says that has at least as much total correlation (including classical correlation and entanglement) with as with , i.e. that the amount of correlation is monotonic under inclusion. In the thread picture, this is represented by the intuitive fact, proven in subsection 2.4, that at least as many threads can be moved or connected between and as between and .

Figure 14: Bit-thread representation of the GHZ state on three bits (29). Given the entropies of the different subsets of , there are six allowed thread configurations. (A seventh, with no threads, is also allowed, of course.)

We would like to make one final point concerning the bit-thread interpretation. Naively, given that each thread represents an entangled pair of bits, it would seem that this picture privileges bipartite entanglement, and perhaps even suggests that more complicated forms of entanglement do not occur holographically. To see that this is not the case, consider a final toy example, the GHZ state on three bits:


This state does not violate any of the known constraints on holographic EEs, and indeed it is has been argued that entanglement of this type occurs in multiboundary black holes Balasubramanian:2014hda. The EEs for this state can be reproduced by a collection of six bit-thread configurations as shown in fig. 14. Thus, the threads certainly do accommodate multipartite entanglement. This example illustrates two important points: First, a given state is not represented by a single thread configuration, but rather a collection of configurations. Second, a thread connecting two regions only represents an entangled pair when the configuration maximizes the total number leaving the union of the regions. Thus, for example, in the top left and bottom left panels of fig. 14, a thread connects and . However, it is not true that in the GHZ state and are entangled (tracing over leaves and merely classically correlated); indeed, those configurations do not maximize the number of threads leaving . Rather, that thread represents the entanglement between and (as well as between and ).

On the other hand, the monogamy of mutual information inequality Hayden:2011ag; Headrick:2013zda and its generalizations Bao:2015bfa show that not all patterns of multipartite entanglement are allowed holographically. Unfortunately, the meaning of these constraints remains obscure, and the proofs based on minimal surfaces are not very helpful. It seems reasonable to hope that, if proofs based on flows or threads can be found, they might clarify this meaning.

3.3 Connection to Weyl’s law

Having persuaded the reader that an incompressible flow from to is a viable alternative to the usual minimum area formulation of the Ryu-Takayanagi idea, we would like to step back view our own suggestion a bit critically. The suggestion is certainly harmless as max-flow min-cut defines an equivalence between two dual pictures (more on this duality in appendix A). But the dual language appears to admit natural quantum mechanical corrections, so perhaps it can be formulated to make a deeper connection with quantum information. Can we see the bit-thread picture admitting the flexibility to treat the generalization to higher-derivative gravities (e.g. Gauss-Bonnet) where minimum area is replaced by the minimum of another local functional . In this section we will discuss tantalizing hints that the answer to these questions is “Yes”.

We have already suggested a discrete interpretation for the incompressible flow as an enormous but finite collection of lines representing qubit entanglement—in the simplest manifestation each line can be thought of a singlet in where the first (second) factor resides in (). Raising an index, such a line can equally be read as the “identity” isomorphism between these two qubits. For some (deep) reason the lines must keep of order a Planck distance apart. This picture is a nice starting point for entangling and , but can readily be enhanced. Instead of mere disjoint arcs we could consider a quantum circuit—again with a Planck-scale density restriction—joining to . In this circumstance there is again a maximal possible entanglement, , between input and output of the circuit. The advantage of replacing singlet strands with a general quantum circuit is that more general entanglement structures can thus be realized and these may be required to model the physics in the holographic dual. Recent work Cui:2015pla; Hastings shows that entanglement depends on number-theoretic properties of the Hilbert space dimensions in such a network. This feature may be useful in model building.

Alternatively, let us look at our bit threads with the eyes of a harmonic analyst. What could they mean? Space is not really packed full of Planck-spaced strings, they must be surrogates for something more fundamental: vibrational modes. How can we set this up? Let be the Hilbert space of divergenceless flows through the bulk from to normalized at infinity (or equivalently closed -forms evaluating on tangent planes to () and zero on all perpendicular planes.) The Riemann-Laplace operator is elliptic with these (Dirichlet) boundary conditions and we may use its eigen-fields as a basis for . It seems a reasonable ansatz to imagine separating variables (as in a Sturm-Liouville problem) finding these eigen-fields counted by the corresponding eigenfunctions of the Riemann-Laplace operator on functions defined on a least-area hypersurface . We will assume this. There is a beautiful discovery of Herman Weyl’s Weyl that the number of harmonic eigenfunctions up to a certain wavelength is very nearly the volume of measured in units of that wavelength, and further the next order (monotone) correction is given by the average scalar curvature of . From MR2346276 we extract the following asymptotic information by integrating their pointwise estimates over . To match their notation set .

Let be the volume of the unit ball in , and define as the number of eigenvalues of the Laplacian on whose square root is less than . Then


where the error term has the form:


where if is odd and if is even, and is the oscillatory piece of the expansion. For generic metrics there is a lower bound, , but for certain metrics, e.g. the round sphere, is much larger; there, (but finite).

Weyl’s Law, as it is called, allows us to regularize the Hilbert space to finite dimensions by applying a Planck-scale cutoff to the basis. Thus becomes the Hilbert space of vibrational modes of (divergenceless vector) fields running from to . The dimension of is essentially the area of in Planck units. To interpret this dimension via the RT formula it is natural to pass to the fermionic Fock space of . has dimension , which is convenient because then entropy of a random vector in a Hilbert space may be normalized to . (Technically it requires infinite information to specify a vector exactly but the above formula works perfectly to distinguish basis vector within a fixed basis and has the correct formal properties with respect to disjoint union of physical systems/tensor product of Hilbert spaces.) Now so RT is telling us that the EE between and is approximately the entropy of a fermionic system generated by the vibrational modes (up to Planck cutoff) of the divergenceless vector fields propagating from to . A many-body state here expresses the entanglement in the holographic dual. This, finally, is an apples-to-apples, entropy-to-entropy, comparison.

There is a final hint to follow up on. In the simplest gravity theories where the Einstein-Hilbert action is extended to higher-order terms in the curvature tensor, namely Gauss-Bonnet gravity, it is believed Hung:2011xb; deBoer:2011wk that the area on the gravity side of the RT formula area should be replaced with (and minimization should be done with respect to this functional). Weyl’s law, available for use in this harmonic viewpoint, suggests an explanation. If what must be counted are not units of area but harmonic functions, then the appearance of this new functional looks natural. In the functional above, the scalar curvature is measured not at the Planck scale but at an intermediate string scale a dozen orders of magnitude larger, so to really claim that Weyl’s law can explain RT for Gauss-Bonnet gravity, the appearance of the string scale needs to make sense. The bulk geometry, even if defined up to the Planck scale, is the base manifold of a string field theory, so it is reflected in that theory only insofar as it can be probed by strings. Curvatures between the Planck scale and the string scale may largely decouple from the bulk theory. Perhaps this is the start of an explanation.

4 Open questions

We close with a series of open questions concerning the bit-thread picture of holographic entanglement. We’ve already touched on a few of these in the previous sections.

4.1 Constraints on holographic states

It remains to find flow-based proofs of the monogamy of mutual information (MMI) inequality (26) Hayden:2011ag; Headrick:2013zda and its generalizations to more than three regions Bao:2015bfa. We showed in subsection 2.4 that MMI cannot be proved using just the nesting property and other basic properties of flows. Therefore, this inequality reflects some other property of flows, currently unknown to us. This is not just a technical problem. The meaning of MMI and its generalizations—what do they tell us about the special entanglement structure of holographic states?—remains obscure. Since the flows (or bit threads) provide a visual representation of this entanglement structure, it seems likely that a flow-based proof of the inequalities would help us to understand the meaning of MMI.

This is closely related to a second question, touched upon in subsection 3.2: What types of quantum states admit a bit-thread representation? In other words, how (if at all) are holographic states constrained by the fact that they admit such a representation?

4.2 Generalizations of Ryu-Takayanagi

The Ryu-Takayanagi formula, and therefore its max flow formulation and the accompanying bit-thread picture developed in this paper, apply within a certain regime: the bulk should be governed by classical Einstein gravity, it should be in a static state, and the region should lie on a constant-time slice of the boundary. Thus the RT formula can be generalized in at least three directions, by relaxing the static, Einstein, and classical conditions respectively.

The covariant generalization of RT, the Hubeny-Rangamani-Takayanagi (HRT) formula Hubeny:2007xt, replaces the minimal surface with an extremal (spacelike codimension-2) surface. The flow version of HRT will be elucidated in forthcoming work covariantflows.

Higher-derivative corrections to Einstein gravity include, for example, corrections in string-theory realizations of holography. In the special case of Lovelock gravity, it is believed that the RT formula is corrected by replacing the area functional by a functional that is essentially the lower-order Lovelock functional on the surface Hung:2011xb; deBoer:2011wk. For example, a Gauss-Bonnet correction to the gravitational action adds an Einstein-Hilbert term to the area functional; the total is then minimized to give the entanglement entropy. In subsection 3.3, using the Weyl law for the distribution of Laplacian eigenvalues on a manifold, we gave a possible generalization of max flow-min cut (MFMC) that would naturally incorporate such corrections. For more general higher-derivative corrections, the appropriate generalization of the RT formula is not known (see however the attempt Dong:2013qoa). Going even farther afield, one can consider EEs in duals of higher-spins fields, where the RT formula appears to be replaced by some sort of bulk Wilson line deBoer:2013vca; Ammon:2013hba; Castro:2014mza, and ask what the analogue of the max flow would be in that case.

Figure 15: Conjectured bit-thread representation of quantum corrections to entanglement entropy. In addition to the order- threads that are required to be continuous, there are of order threads that can jump from one part of the bulk space to another, representing entanglement of bulk quantum fields. The ones that jump across the minimal surface contribute to the max flow on and therefore to . Such a jump is shown as the dotted part of one of the threads in the figure.

Quantum corrections are controlled by (in the usual large- parlance). Thus the leading perturbative correction is of order (versus for the leading term). At this level, one has to be more careful than we have been in distinguishing between the continuous flows and the discrete threads. Presumably one also has to take into account the fact that the bulk metric is undergoing quantum fluctuations. Perhaps more interesting, however, is the fact that entanglement of the bulk quantum fields contributes to the boundary EE Faulkner:2013ana. Specifically, at order the contribution is given by the EE of the fields in the bulk spatial region defined by the homology constraint, (the so-called “entanglement wedge” Headrick:2014cta). (At this order, the bulk fields should be treated as free.) How can we reproduce this contribution using bit threads? A natural guess is that the effect of bulk entanglement is to allow the threads to jump from one part of the bulk to another. (These threads can be thought of as traversing Planck-sized wormholes connecting distant parts of the bulk, perhaps in the spirit of Maldacena and Susskind’s “ER = EPR” proposal Maldacena:2013xja.) Some threads would thus be able to “tunnel” across the bottleneck , increasing the maximum number that can leave and thereby increasing (see fig. 15). As usual, there would not be a single thread configuration, but rather a collection of them, accounting for the fact that the entanglement structure of the bulk quantum fields does not just consist of a set of pairwise entangled localized bits. It would be interesting to make this rather speculative idea more concrete and quantitative.

4.3 Emergent geometry

Finally, let us return to the question posed in the first paragraph of this paper: What role does holographic entanglement play in the emergence of spacetime? The reconstruction of the spacetime metric from the EEs of boundary regions (and a related quantity called “entwinement”) has been investigated recently by Czech and collaborators Balasubramanian:2014sra; Czech:2014ppa; Czech:2015qta. The bit threads suggest a novel way to approach this question, which goes beyond the data contained in the boundary EEs. Suppose that the bulk space is initially given as a topological manifold, without a metric. The entanglement structure of the field theory would be expressed as a collection of thread configurations on this manifold. Saying that the threads have a cross-sectional area of 4 Planck areas then endows the manifold with a geometry. Specifically, the metric can be defined as the smallest that permits all the given thread configurations. In other words, space is propped open by the threads.

We can make the above picture mathematically precise. First, in the absence of a metric, a thread configuration is represented not by a divergenceless vector field but rather by a closed -form . Given a metric, the form can be converted into a vector field using the Hodge star: . Therefore, in terms of , the constraint on the density of threads translates to


Whereas before the metric was taken as fixed and this inequality was viewed as a constraint on , we now take the components of as fixed and view it as a constraint on the metric. Given a collection of forms , we let at each point be the smallest-determinant positive symmetric matrix satisfying (32) for all . (This is itself a convex optimization problem.) This is what we meant above by the phrase, “the smallest metric that permits all the given thread configurations”.

Of course, this construction leaves many questions unanswered. First and foremost is the question of where this primordial collection of thread configurations comes from, and how it is related to the entanglement structure of the dual field theory. At a minimum it should reproduce the EE of all boundary spatial regions. This requires to include at least one max flow for each region. However, in principle could include many more configurations than that. Including enough thread configurations would allow the entire bulk metric to be determined via the above construction, including inside so-called “entanglement shadow” regions, where RT minimal surfaces do not pass Engelhardt:2013tra; Balasubramanian:2014sra; Freivogel:2014lja. A fundamental technical question is what property must satisfy for the resulting metric to be smooth (or even continuous). Knowing this would help us decide which forms to place in .

More ambitiously, one would want not just the geometry but also the topology of the bulk to be emergent, i.e. for the manifold itself to be determined by a set of threads living in some more abstract space. We leave the exploration of these questions to future work.


We would like to thank N. Bao, R. Bryant, B. Czech, S. Hartnoll, A. Lawrence, H. Liu, R. Myers, J. Preskill, X. Qi, M. Rangamani, E. Tonni, and B. Yoshida, and especially P. Doyle, P. Hayden, V. Hubeny, F. Morgan, and J. Sullivan, for very useful discussions.

This work was initiated at the Aspen Center for Physics, which is supported by National Science Foundation grant PHY-1066293, and developed at the Simons Symposium on Quantum Entanglement and at the Kavli Institute for Theoretical Physics, which is supported in part by the National Science Foundation under Grant No. NSF PHY11-25915. The work of M.H. was supported in part by the National Science Foundation under Career Award No. PHY-1053842.

Appendix A Max-flow min-cut on manifolds

We put the max flow/min cut principle into a larger context. For us the primary context, a divergenceless flow and least area hypersurfaces dual to it, can be extended in two different directions (and historically each direction had separate origins FF; EFS; HL; Federer69). One direction, “calibrations,” considers pairs (closed -form, -submanifold) which are, in a sense, minimal with respect to each other WikiCG. The second direction is to pass from smooth flows to discrete networks and treats discrete analogs of flux and cross-sectional area. Both extensions are of interest in gravity. For example, is a very natural case when considering surfaces in a -dimensional space-time bounding a cut dividing the constant time holographic dual into two pieces and . (The math literature does not seem to have considered calibrated geometry in mixed signature, so the standard results, reviewed here, are for Euclidean signature and will require some re-consideration in the Lorentzian case.) Discretization is also a natural direction if one wishes to interpret the flow as quantum mechanical entanglement between and , in which case the flow might be replaced with a quantum circuit Cui:2015pla.

a.1 Relation to calibrations

On a Riemannian -manifold we may use the metric to convert a -form to a ()-vector (field) . In the special case that , the condition that is closed, , is equivalent to . While our primary interest has been a divergenceless vector field and its flux through hypersurfaces, i.e., the case , we will make some general statements now for -forms and their integrations over -submanifolds, or integral currents, and return later to the special case . An integral -current is essentially an oriented rectifiable set of dimension with integral weights, thought of as a functional on -forms via integration. If this functional annihilates exact forms the underlying rectifiable set is thought of as a closed “singular -submanifold”. Regularity theory discusses how bad the singularities must be to realize the infimum of -area within the integral homology class torsion, where is the ambient manifold. Integral currents have the merit that their underlying rectifiable sets have good compactness properties, guaranteeing the existence of minimizers.

A -calibration is a closed real-valued -form so that at every point , where is a unit norm geometric -vector. The word geometric means an element of the Grassmannian rather than an element of formal -planes, , the exterior power of the tangent bundle. The norm on planes, geometric or otherwise, is induced by taking as an orthonormal basis, , and an orthonormal basis of . Thus norm is an -norm. Since it is pointwise and is defined only through its evaluation on geometric -vectors, it could be denoted but we sometimes use . As an example in Euclidean -space , is a calibration even though . The point is that , although of unit norm, is not a geometric -vector (i.e., plane).

One says an oriented -submanifold is calibrated by if for all , for the oriented unit -area -vector tangent to at .

If calibrates , and has finite -area, then absolutely minimizes area (let us drop the - in -area) for any (weighted) submanifold (real-)homologous to . (Proof: ). There is a converse to this but it is surprisingly weak. One must absorb some interesting counterexamples to appreciate why.

First, to understand the role of real coefficients, consider an example in the product of circle and a -sphere . Embedded a loop which represents twice the generator of . Now multiply the product metric on by a conformal factor where the function becomes extremely large near . For such a metric,


where is any loop representing the generator of . Now let be a shortest closed geodesic realizing the generator; . For generic metrics, will be simple (non self-intersecting) so we assume this. cannot be calibrated by any -form , otherwise

contradicting (A.1).

There is a more interesting expression of this phenomenon (due to Young, White, and Morgan Young; White; Morgan). For any integer , there are smooth simple closed curves in so that the minimal area of a bounding surface for the multiply weighted is less than times the minimal area of a bounding surface for .

These examples show that one should only attempt to calibrate submanifolds which minimize area within their real homology class. Fortunately when , regularity theorems Federer74; MR809969 say that real coefficient -area minimizers (which exist for any as integral currents) are in fact linear combinations of smooth submanifolds for , , and with integral weights become minimizers for integral classes. For , the Simons phenomenon appears BDG; MR0216387, and for certain metrics codimension one minimizers will be singular. Furthermore242424This was pointed out to us in Chodosh. when it is proved in MR1243523, using the local analysis of BDG and MR809969, that for generic metrics codimension one minimizers will be smooth manifolds. For , it is conjectured in MR1243523, but remains open, that for generic metrics, codimension one minimizers are smooth submanifolds. It is known MR809969 that the singularities of such minimizers may be assumed to have Hausdorff dimension .

We now address the question of whether a smooth, real, area minimizer can be calibrated. The most basic context is to work within a closed manifold , but in many applications (e.g., gravity), one is interested in noncompact and . In this case, “least area” means that cannot be modified in a compact region to a homologous with lower area. (Note: In discussing infinite area surfaces this seems to be the best we can do, whereas in the dual context of flows, as we saw in section 2.2, absence of an augmenting path provides a sharper notion.) Our discussion applies to both cases although our notation generally presumes the former.

a.2 Regularity

Regularity questions are central, and a good general introduction is MR2455580. We make no attempt here at rigor but merely outline some important ideas. The broadest generalization of submanifold is current. We need the following notations:

  • is a complete Riemannian manifold.

  • are -forms on , initially smooth but this property may be lost as limits are taken.

  • is the dual space called currents.

  • denotes integral -currents. These are the functionals obtained by integrating over an oriented rectifiable with integral weights. A rectifiable set by definition is the disjoint union of a countable number of oriented Lipshitz charts from together with a “negligible” piece of -Hausdorff measure 0. This is a nice type of current on which one can integrate forms, but generally less regular than a submanifold. (For example, general currents also include analogs of , derivatives of delta functions, along a submanifold; these are not integral currents. Oriented submanifolds with low dimensional singularities can still be integral currents.)

Motivated by Stokes’ theorem, an integral current is called closed if it annihilates exact forms . In this case defines a homology class torsion. Closed integral currents (actually their underlying rectifiable set ) have a well-defined -area and a minimizer is known to exist in the class .

For there are smooth submanifolds absolutely minimizing area (even among closed integral currents) in their real homology class, for which no calibrating form can be a smooth or even continuous section of the -form bundle

Comments 0
Request Comment
You are adding the first comment!
How to quickly get a good reply:
  • Give credit where it’s due by listing out the positive aspects of a paper before getting into which changes should be made.
  • Be specific in your critique, and provide supporting evidence with appropriate references to substantiate general statements.
  • Your comment should inspire ideas to flow and help the author improves the paper.

The better we are at sharing our knowledge with each other, the faster we move forward.
The feedback must be of minimum 40 characters and the title a minimum of 5 characters
Add comment
Loading ...
This is a comment super asjknd jkasnjk adsnkj
The feedback must be of minumum 40 characters
The feedback must be of minumum 40 characters

You are asking your first question!
How to quickly get a good answer:
  • Keep your question short and to the point
  • Check for grammar or spelling errors.
  • Phrase it like a question
Test description