Pith. sign in
module module moderate

IndisputableMonolith.Holography.KeystoneFactorThree

show as:
view Lean formalization →

The factor 3 that multiplies the Bekenstein area term under the microstate reading is forced by the ledger of a one-face closure map, not inserted by hand. Kernel-side cost is three times image-side cost: both sides are decided on the actual map. Holography and black-hole entropy workers cite this when they need the 3·(A/4) coefficient to be ledger-native. The argument is finite enumeration plus rank/nullity from the record-cost asymmetry module.

claimFor the one-face closure map, the kernel-side (microstate) record cost equals three times the image-side (record) cost: $C_{\mathrm{ker}}=3\,C_{\mathrm{im}}$ with $C_{\mathrm{im}}=1$, so the density ratio is exactly $3$. That same $3$ is the coefficient in the microstate assignment $S\mapsto 3\cdot(A/4)$. The record reading saturates the Bekenstein bound; the microstate reading violates it in a scale-free way.

background

Recognition holography treats entropy bounds as ledger costs of maps between bulk microstates and boundary records. The upstream module RecordCostAsymmetry supplies the rank/nullity selector: cost is read from the record side of a map rather than from a Landauer-style bit count alone (renamed from an earlier Landauer framing; mathematics unchanged).

This module isolates the numerical factor that appears when that selector is applied to a one-face closure map. Kernel cost and image cost are computed directly on the map; their ratio is three. The microstate reading therefore writes $3\cdot(A/4)$ for total entropy against the Bekenstein area term, while the record reading writes $A/4$ and saturates the bound.

Sibling results package the comparison: density ratio equals three, microstate chains contradict the bound, record chains saturate it, and violations are scale-free and unit-conversion stable. A keystone certificate packages the selection of the record reading.

proof idea

The module is theorem-bearing, not a pure definition dump. The core identity factor_three_is_ledger_forced (and density_ratio_is_three) evaluates kernel and image costs of the one-face closure map by decide on finite combinatorial data, obtaining $3=3\cdot 1$ with no free parameter.

From that ratio, saturation and violation lemmas compare the record reading and the microstate reading against a total-entropy Bekenstein bound. Scale-free and unit-conversion lemmas show the violation does not depend on a choice of units. The keystone certificate and selection lemmas assemble these facts into a single selector: only the record reading is consistent with the bound. Downstream imports consume that certificate rather than re-deriving the factor.

why it matters in Recognition Science

Without a ledger-forced 3, the microstate coefficient $3\cdot(A/4)$ would be an external ansatz. This module makes that coefficient an output of the closure map's cost asymmetry, tying holographic entropy bookkeeping to the record-cost reading developed upstream.

It is imported by DeficitFreePeriod, the LEG-B core chain that forces the holonomy period $2\pi/\kappa$ under named model premises. That downstream module promotes banked derive steps on the Bekenstein/LEG-B loop; it needs a clean, certificate-level source for why record reading (not microstate overcounting) is the consistent entropy assignment.

In the broader Recognition stack this sits in the holography domain that feeds dimensional and period constraints (eight-tick structure, $D=3$ forcing elsewhere). The keystone certificate is the reusable handle for any later bound that must prefer record saturation over microstate inflation.

scope and limits

used by (1)

From the project-wide theorem graph. These declarations reference this one in their body.

depends on (1)

Lean names referenced from this declaration's body.

declarations in this module (11)