Decide how four endpoints may be joined
Draw two intervals along the boundary, each of width , with positive gap . Label their endpoints from left to right. Depth is and the curvature radius is . We first take the continuum limit, with both much larger than radial cutoff .
One pairing joins the two ends of each interval separately. Each arc caps its own bulk region. Another joins the outermost endpoints and also joins the two endpoints bordering the gap. Remove the inner cap from the outer cap: the remaining bulk region again has the original boundary intervals along its edge.
The requirement that the intervals and curves together bound an appropriate bulk region is the homology condition. It identifies the candidates whose lengths must be compared. Arbitrary endpoint pairings can violate that requirement; crossing long arcs cannot be global minimizers here. We minimize total curve length. The shade records the spatial region bounded by those curves.
Source: Matthew Headrick
Find where the two total lengths agree
An interval of width contributes at small cutoff. The disconnected candidate uses width twice. The connected candidate uses the full outer span and the gap . These give the two total lengths below.
Both candidates have four endpoints near the boundary, with the same cutoff divergence. Subtract their lengths and that common contribution cancels. A small gap makes the inner connecting arc inexpensive. Increasing the gap eventually favors the separate caps.
Source: Matthew Headrick
Read mutual information from the length difference
Mutual information is . It measures correlations available when the two parts are considered together, including classical correlations and entanglement. At leading classical Einstein-gravity order, entropy is the minimal length divided by , and is the dimensionless central charge. Natural logarithms give entropy in nats.
When the separate caps win, the leading joint entropy equals the sum of the leading individual entropies. The mutual information at this order vanishes. When the connected pairing wins, their length difference gives a positive contribution. The minimum of two smooth functions is continuous at the crossing but can change slope there, producing the corner in the graph.
The leading term grows with . Its vanishing still allows correlations of order . An exactly zero full mutual information would imply a product joint density matrix. Quantum corrections and finite central charge also modify the sharp classical transition.
Source: Matthew Headrick
Work through a complete numerical example
Take , and reference cutoff . The continuum formulas give a disconnected total length of about and a connected total of about . The connected candidate is shorter by about .
Divide that difference by and then by , equivalently by , to obtain . Direct substitution of into the logarithmic expression gives the same value.
Keep the widths fixed and increase the gap to . The ratio becomes , so the connected candidate is longer. The separate pairing now wins and leading mutual information vanishes. Both intervals remain present; their joint minimal curve has changed.
A finite cutoff shifts the crossing
The preceding chapter fixes endpoints on a common surface and defines width by their horizontal separation there. Its exact length is . Compare with to keep identical endpoint data for both finite-cutoff candidates.
At and , a numerical crossing occurs at , close to the continuum value . At the larger cutoff , it moves to about . These shifts belong to the specified finite-cutoff geometry.
Interpreting this exact finite-cutoff minimum as an entropy of a particular regulated quantum field theory would require a separate theory and dictionary. We retain it as a geometric comparison and display continuum leading RT mutual information separately. Their agreement improves toward the boundary.
Source: Shinsei Ryu and Tadashi Takayanagi · Matthew Headrick
Turn a spatial region into a wedge
An equal-time picture contains only a spatial region. After shading the region between the selected curves and boundary intervals, we must extend the construction through time. Initial data on a spatial region determine events in its domain of dependence: every inextendible causal curve through such an event must meet that region. The boundary theory has its own domain of dependence.
Write the shaded bulk region as . Its bulk domain of dependence defines the classical entanglement wedge. A causal wedge asks a different operational question: which bulk events can both receive a signal from and send a signal back to the boundary domain ? One construction uses the extremal surface and homology; the other uses light cones.
For a single vacuum interval in empty AdS, symmetry makes the wedges equal. The boundary domain is a diamond with tips at in units with light speed one. Light cones from those tips intersect the equal-time slice on the radius- geodesic. More general regions or states allow the wedges to differ. For nearby disjoint intervals, the joint entanglement wedge can connect even though the causal wedges obtained from signal round trips remain separate.
Source: Xi Dong
Why a bulk region leads to a reconstruction question
If the reduced state of a boundary region retains the observable information of a bulk region, operators supported on that boundary region should reproduce the relevant bulk operations. This is reconstruction: specify the allowed states and operators, then compare their actions and measurement statistics. The geometric region identifies where to ask that information question.
Dong, Harlow and Wall formulate it as a quantum-information statement on a code subspace in . States must stay within a controlled semiclassical setting. The reconstruction argument uses relative-entropy and generalized-entropy assumptions, with established expansion orders distinguished from higher-order assumptions. The next chapter uses a finite quantum code to calculate how operations can remain available after a subsystem is erased.
Source: Xi Dong