Holography Edge Sector Bridge

The sector verdict

In the Recognition Science account of a holographic boundary, a pixel's state is described by four raw edge bits. A ledger (a discrete record of events) imposes a parity constraint on those bits: the XOR of the four must be zero. The EdgeSectorBridge module in the framework's machine-checked library of formal theorems settles two combinatorial facts about this setup, and the verdict kills a whole family of proposed area laws.

First, the parity constraint leaves exactly three free bits, not four. Of the 16 possible raw configurations, exactly 8 satisfy the closure condition. This is the fact that separates two competing entropy formulas: one counts raw pre-closure capacity (4H), the other counts realized post-closure information (3H). The module proves the 3-bit count by exhaustive finite check, not by assumption.

Second, the sector label is a deterministic function of the edge bits. A sector is defined as the canonical representative of a symmetry orbit of a face configuration, and the module proves that this map is total, surjective onto the four admissible sectors, and exactly two-to-one from the eight closed configurations. The sector carries log 4 bits of information; the closed edges carry log 8. Adding an independent log 4 term for the sector on top of a per-edge entropy H therefore double-counts information the edges already contain.

The certificate bundles these two facts: the sector is a lossy quotient of the edges, never a free-standing degree of freedom. This is what settles the question of whether "one entropy quantum per area quantum per sector" is a real physical principle or a conflation. It is the latter. The live candidates for the correct pixel-area formula move to the edge substrate itself, either as pre-closure capacity (4H) or post-closure realized information (3H). The module does not decide which of those two is physically correct; that depends on whether the area attaches to raw or closure-reduced information, and on which lattice model describes a horizon.

The consequence is that a broad class of proposed area laws is now closed for good. Any formula that treats the sector as an independent additive contribution is dead, confirmed by direct construction rather than informal argument. The remaining question is sharper: not whether sectors carry information, but which edge substrate the physical area actually attaches to.

/-- **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

/-- **THEOREM (surjectivity, by `decide`). Sectors carry no information beyond the
edge bits.** Every one of the 4 admissible sectors is hit by `sectorOf` from some
ledger-closed edge configuration. Combined with `sectorOf_mem_admissibleSectors`, this
proves `admissibleSectors` is exactly the image of `closedConfigs` under a
deterministic quotient map — a sector is a *projection* of the edges, never an
independent quantity added on top of them. -/
theorem sectorOf_surjective_on_closed :
    admissibleSectors ⊆ closedConfigs.image sectorOf := by decide

/-- **THEOREM (well-definedness, by `decide`).** `sectorOf` sends every ledger-closed
edge configuration into `admissibleSectors`: the canonical orbit representative of a
closed configuration is itself closed and is a sector representative. Closure is
`D₄`-invariant (permuting which vertex holds which bit does not change the XOR of the
4 bits), verified here by exhaustive finite check rather than assumed. -/
theorem sectorOf_mem_admissibleSectors :
    ∀ c : FaceCfg, closed c = true → sectorOf c ∈ admissibleSectors := by decide

/-- **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 module does not decide whether the physically correct pixel-area formula is 4H or 3H. The module does not prove that one edge equals one independent recognition event. The module does not resolve which lattice model, isolated or shared-vertex, governs a real horizon.

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: