Encyclopedia Gravity Gravity Page Curve Dynamical Operator Level Page Process Structural Prop Holds

ARTICLE 3 claims 3 theorems

Gravity Page Curve Dynamical Operator Level Page Process Structural Prop Holds

A black hole's information loss paradox may have a ledger-based resolution, and a machine-checked proof now certifies the core structural step.

The structural guarantee

The ledger (a discrete record of events) approach to black hole evaporation starts with a simple question: can the gradual loss of information be described as a series of bookkeeping steps, each transferring a fixed amount of capacity from the hole to the radiation? The declaration operator_level_page_process_structural_prop_holds answers yes to the structural core of that question. It proves, in the framework's machine-checked library of formal theorems, that a valid operator-level process exists: a sequence of unitary steps that maps an initial state of the combined system to a final one, with the entropy of the radiation following the expected curve.

The proof is constructive. It builds a specific process, the canonicalOperatorPageEntropyReadout, for the simplest possible case: one bulk state and one radiation state. The existence of this process is what the theorem establishes. It does not merely assert that such a process could exist; it provides one. This is the difference between a kinematic description, where the curve is put in by hand, and a dynamical one, where the curve is a consequence of the process itself.

The broader context matters. The full Page curve, the triangular rise and fall of radiation entropy during evaporation, is derived in the framework from two principles: linear capacity transfer and Schmidt purification. The theorem here certifies that the operator-level machinery, the actual steps of the process, can be instantiated. It is a structural guarantee: the framework's dynamical recipe is not vacuous. There is at least one concrete process that realizes the required structure.

What the theorem does not claim is equally important. It does not claim that this specific process is the one that occurs in nature. It does not derive the capacity evolution from the recognition update itself; that remains open. And it does not prove that the operator process is unique. The theorem establishes existence, not uniqueness, and not physical selection.

The consequence is that the framework's dynamical story for the Page curve has a certified foundation. The next step, deriving the capacity transfer rate from the ledger update, can proceed with confidence that the operator-level structure is sound. The structural question is settled; the dynamical question is the target.

THEOREM operator_level_page_process_structural_prop_holds · IndisputableMonolith/Gravity/PageCurveDynamical.lean
operator_level_page_process_structural_prop_holds · IndisputableMonolith/Gravity/PageCurveDynamical.lean:453
theorem operator_level_page_process_structural_prop_holds :
    operator_level_page_process_structural_prop :=
  ⟨canonicalOperatorPageEntropyReadout 1 (by norm_num) 1 (by norm_num)⟩
THEOREM operator_level_page_process_structural_prop_holds · IndisputableMonolith/Gravity/PageCurveDynamical.lean
operator_level_page_process_structural_prop_holds · IndisputableMonolith/Gravity/PageCurveDynamical.lean:453
theorem operator_level_page_process_structural_prop_holds :
    operator_level_page_process_structural_prop :=
  ⟨canonicalOperatorPageEntropyReadout 1 (by norm_num) 1 (by norm_num)⟩
THEOREM pageCurveFromUnitarity · IndisputableMonolith/Gravity/PageCurveDynamical.lean
/-- The Page curve as the entropy bound forced by Schmidt purification:
`S_rad(t) = min(bulkCapacity, radiationCapacity)`. This is the unique
saturation of the entropy bound on a pure joint state, given linear
capacity transfer between bulk and radiation. -/
def pageCurveFromUnitarity (S_BH t : ℝ) : ℝ :=
  min (bulkCapacity S_BH t) (radiationCapacity S_BH t)

What this page does not claim

This theorem does not claim that the constructed process is the one that occurs in nature. It does not derive the capacity evolution from the recognition update itself. It does not prove that the operator process is unique.

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/Gravity/PageCurveDynamical.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:

MACHINE LAYER · GROUNDED CLAIM TABLE · CLICK TO EXPAND