Stop 4 of 9 · How many bits fit on the boundary, and what does full look like?

Bits on the boundary — and what full looks like

Every square on the walls of a region is one bit: the step across it is open or closed. No way of filling the region holds more than the walls allow, S = 2·dy·dz·log 2 on T³. It is reached in exactly one way: when every pattern of the walls is equally likely. Raise the chance of each bit and watch the count reach the bound at one half.

The walls of a region

The region is the slab on the left of the plane. On T³ every axis closes on itself, so the slab has two walls: the plane you choose, and the seam where the axis closes. Each wall has dy × dz squares. Orange: open (1). Empty: closed (0). Move the depth and the plane: the count of bits does not change. Drag to rotate.

open (1)closed (0)
bits on the walls (2·dy·dz)
–
possible patterns
–
capacity S = bits × log 2
–
positions inside (does not count)
–

With each square of area 4ℓ_P² log 2 (one bit of area, as on the open cube) the capacity is the Bekenstein–Hawking value A / 4ℓ_P² of the picture "bits on the boundary": area, not volume.

Fill it up

Now let every bit be 1 with the same chance. With a small chance the walls are almost all empty and hold little information; the information held grows as the chance goes to one half, and comes back down after. The bar reaches 100 % only at one half: every pattern equally likely. That is the only state that fills the region (Lean: the uniform distribution and no other).

information held (bits)
–
capacity (bits)
–
how full
–
state
–

The region turns dark only when it is full: that is Nava's postulate, declared in Lean as a bridge (HSaturationDark), not derived. Below the top the postulate says nothing, so the page does not shade the region in between.

What is exact here

Theorem trail
StatementName
H ≤ S; the uniform distribution reaches itTorusBekenstein.entropy_le_cutEntropy, TorusBekenstein.entropy_uniform, TorusBekenstein.exists_saturating
H = S iff uniformTorusSaturation.saturated_iff_uniform
the bits are field operatorsTorusBoundaryField.configField_injective, TorusBoundaryField.card_fieldConfigs
full ⇒ dark (declared)TorusSaturation.HSaturationDark, TorusSaturation.hSaturationDark_satisfiable
the wall bits are commuting eventsEventsTopology.prob_openEvent, EventsTopology.openEvent_comm
a bit varies at most ¼; commuting bits have a joint lawQuantumEvents.variance_le, QuantumEvents.joint_sum
non-commuting questions: Robertson for bitsQuantumEvents.robertson_events

← Stop 3The pathStop 5 →