B4 · Saturation / uniform field
For a finite set X of boundary steps, Config X = 𝒫(X). For a probability distribution d on Config X, Hₛ d ≤ |X| log 2, with equality exactly at the uniform distribution.
Definitions
| Name | Content |
|---|---|
BoundaryBits.Config X | 𝒫(X) |
BoundaryBits.openProb d s | probability that step s is open under d |
TorusSaturation.HSaturationDark | declared: a map darkShare ≤ 1 equal to 1 at saturation |
Results
| Statement | Name | Status |
|---|---|---|
Hₛ d ≤ |X| log 2 | BoundaryBits.entropy_le | Lean |
Hₛ d = |X| log 2 ↔ d = uniform | BoundaryBits.saturated_iff_uniform, TorusSaturation.saturated_iff_uniform | Lean |
H ≤ A/(4ℓ_P²), attained | TorusBekenstein.bekenstein_bound, TorusBekenstein.exists_saturating | Lean |
S ↦ F(S) is injective; 2^(2·dy·dz) configurations | TorusBoundaryField.configField_injective, TorusBoundaryField.card_fieldConfigs | Lean |
under HSaturationDark, saturation gives lightShare = 0 | TorusSaturation.HSaturationDark, TorusSaturation.hSaturationDark_satisfiable | declared hypothesis |
The bits as events
| Statement | Name | Status |
|---|---|---|
an event is a projection, p = ⟨ψ, Pψ⟩: 0 ≤ p ≤ 1, the complement has 1 − p, orthogonal events add | QuantumEvents.prob_le_one, QuantumEvents.prob_compl, QuantumEvents.prob_or | Lean |
every event is a bit: variance p (1 − p) ≤ ¼ | QuantumEvents.variance_eq, QuantumEvents.variance_le | Lean |
two commuting events have a joint law on {0, 1}²: four probabilities ≥ 0 adding up to 1, total probability | QuantumEvents.joint_sum, QuantumEvents.prob_total | Lean |
incompatible events: (Im ⟨Pψ, Qψ⟩)² ≤ p (1 − p) q (1 − q) (Robertson for bits) | QuantumEvents.robertson_events | Lean |
the boundary: on ℂ^{Config X} with ψ_d = Σ √d(S) e_S, p(s open) = openProb d s, and all these events commute: the boundary is a Kolmogorov space, on every cut | EventsTopology.prob_openEvent, EventsTopology.openEvent_comm, EventsTopology.variance_openEvent | Lean |
the boundary bits read from the field operators F(S) | — | open |
The boundary bits commute, so their statistics is classical; position and transport do not, and there Robertson holds (B1).
Figure
The walls of a region
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
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.
The animation draws independent bits; the counts and the bound are the Lean values.