Stop 3 of 9 · Where does a region keep its information?
Holography — a region keeps its information on its walls
The entropy of a region is counted on its boundary: every step across the wall is one bit, open or closed. On the open cube a cut has one wall, dy·dz steps. On the three-torus every axis closes on itself, so the same cut has two walls, the plane and the seam: 2·dy·dz steps and S = 2·dy·dz·log 2, whatever the depth.
The cut
| Open cube (d → ∞, never touched) | T³ (rings) | Closed reflecting cube (see note) | |
|---|---|---|---|
| boundary steps | – | – | not in Lean |
| entropy S | – | – | not in Lean |
| Λ·ℓ² | – | – | not in Lean |
| horizon area / a² | – | – | not in Lean |
| Immirzi γ | log 2 / (π√3) ≈ 0.1274, the same | not in Lean | |
| angle of the axis | 0 at d = 2, 3 (saturates); ceiling 28.30°, never reached | 26.57° at d = 3 (does not saturate); 49.5° at 4; tends to 45° from above | no data |
| light / dark at the limit | ≈ 0.775 / 0.225 (C_N^∞ = √(π²/3 − 2)) | ½ / ½ (C° → √2) | no data |
The third column is the reading "infinitely large, closed, reflecting walls, d∞ − 1": there is no theorem for it in the repositories, and the open chain already has its ends as walls. Its cells stay empty until the postulate is pointed to in Lean.
The light sphere, open axis against ring
Each axis of d positions is a point inside the unit sphere (its four-vector over v₀): on the surface the state is all light, inside some is dark.
Blue: the open axis. Orange: the ring. Random walk: both states take small random steps; the trails show the light decaying. Drag to rotate.
What is exact here
- Lean The cut of T³ has
2·dy·dzsteps andS = 2·dy·dz·log 2, independent of the depth and of the plane. - Lean With one bit of area per step,
S = A/(4ℓ_P²)exactly whena² = 4ℓ_P² log 2. - Lean The open cube has one wall,
dy·dzsteps, and the same bit of area. - Browser The angles and the random walk of the light sphere are computed on this page.
Theorem trail
| Statement | Name |
|---|---|
the boundary has 2·dy·dz steps | TorusArea.card_crossSteps |
S = 2·dy·dz·log 2, independent of depth | TorusArea.cutEntropy_eq, TorusArea.cutEntropy_eq_of_depth |
Bekenstein–Hawking iff a² = 4ℓ_P² log 2 | TorusArea.bekensteinHawking_iff |
| the open cube: one wall | OpenCubeBoundary.bekenstein_bound |