Holography Edge Sector Bridge Closed Free Bits

The three free bits

In the Recognition Science framework, a ledger is a discrete record of events, and a holographic boundary is modeled as a set of raw edge bits. The declaration `closed_free_bits` is a theorem in the framework's machine-checked library of formal theorems. It proves that when a parity constraint, the ledger-closure condition, is applied to four raw edge bits, exactly eight closed configurations remain. Since eight is two to the third power, the constraint removes precisely one degree of freedom, leaving three free bits, not four.

The proof is a finite exhaustive check, a `decide` tactic, meaning the computer verifies the count by checking every possible configuration. This settles a specific combinatorial fact: the raw pre-closure capacity of four bits is reduced to a post-closure realized information of three bits. The result is stated as `closedConfigs.card = 2 ^ 3`, and it is axiom-clean, relying only on the standard axioms of the underlying type theory.

This count matters because it adjudicates a fork in a physical model. One candidate formula for pixel area tracks the raw pre-closure capacity, giving a coefficient of four. The other tracks the realized post-closure information, giving a coefficient of three. The theorem proves the post-closure count is exactly three, but it does not decide which formula is physically correct. That is a separate question about which substrate the pixel area actually attaches to, a question the combinatorial facts sharpen but do not resolve.

In Recognition Science, the framework models the boundary as a ledger, and the theorem is a step in understanding what information is genuinely free. The result forces a re-evaluation: the sector label, a D₄-orbit label, is a lossy quotient of the edge bits, carrying only two bits of information, not an independent degree of freedom. This kills the additive `H + log 4` term as a candidate area law, because it would double-count information the edges already contain.

The theorem does not claim that one edge equals one independent recognition event. That identification remains an unformalized physical assertion. It also does not claim the isolated count of three is the correct count for an entangling surface. A separate panel argued that for a shared-vertex lattice, the count could be different, and the theorem's three survives only as the correct isolated, local count. The physical question of which lattice model is correct remains open.

/-- **Restated as "3 free bits."** Ledger closure on 4 raw edge-bits leaves exactly 3
independent bits, not 4. This is the fact the `4H` vs `3H` live bet hinges on: if pixel
area tracks *realized* (post-closure) information, the count is 3; if it tracks *raw*
(pre-closure) capacity, the count is 4. -/
theorem closed_free_bits : closedConfigs.card = 2 ^ 3 := closed_configs_card

/-- **The double-count kill (by `decide`).** The closed-edge substrate carries `log 8`
of information; the sector quotient carries only `log 4`, exactly half. Since sector
identity is entirely recoverable from (a strict compression of) the edge bits, adding
an independent `log 4` term on top of a per-edge entropy `H` double-counts information
the edges already contain. This is the precise combinatorial content behind killing
`H + log 4` as a candidate area law: `admissibleSectors` is a 2-to-1 lossy quotient of
`closedConfigs`, not a free-standing degree of freedom. -/
theorem sector_is_lossy_quotient_of_closed :
    admissibleSectors.card * 2 = closedConfigs.card := by decide

What this page does not claim

The theorem does not decide whether the physically correct pixel-area formula is 4H or 3H. The theorem does not prove that one edge equals one independent recognition event. The theorem's count of three is not claimed to be the correct count for an entangling surface.

Verify this page

Every tagged claim above names its theorem. To check one yourself rather than trust this page, elaborate the source module with Lean 4 and audit its axiom basis:

$ lake env lean IndisputableMonolith/Holography/EdgeSectorBridge.lean
expected axiom basis: [propext, Classical.choice, Quot.sound] (the Lean kernel's standard three; no RS-specific axioms)

A page whose claims cannot be reproduced this way does not ship. In production, every anchor links to the exact declaration in the public source release, and this block carries the build receipt for the page itself.

Derived articles

This page is generated by a question-recursion engine: the questions its answers raise become the next pages. The current agenda, with open targets marked red: