Encyclopedia Holography Holography Landauer Bridge Walls Zero Bits Erasure On Idle
ARTICLE 3 claims 2 theorems 1 open
Holography Landauer Bridge Walls Zero Bits Erasure On Idle
A machine-checked theorem confirms that a system that does nothing erases zero bits, and that claiming otherwise is false.
The idle path
In the Recognition Science framework, a ledger (a discrete record of posted events) tracks every change in a system's state. The theorem zero_bits_erasure_on_idle states a simple fact about this ledger: if the system stays in its starting cell and takes no steps, the net number of erased bits is exactly zero. This is not a claim about physics; it is a statement about how the framework's own accounting predicate behaves on an empty path.
The companion theorem one_bit_erasure_fails_on_idle shows the same predicate rejects a one-bit erasure on that idle path. Together, the two theorems demonstrate that the accounting rule can tell a quiet path apart from an active one. The framework's library proves this discrimination formally, with no unverified assumptions.
What the declaration does not claim is more important than what it proves. It does not supply a reset protocol, a physical mechanism that would force a logical bit to be erased. The predicate LogicalErasurePostsDebit is defined as endpoint posted-weight accounting, and no Lean object names a protocol that would make that equality hold for a real erasure. The theorem is a hygiene check on the framework's own definitions, not a bridge to Landauer's principle in thermodynamics.
This matters because the framework is building toward a Landauer bridge: a link between its ledger accounting and physical heat dissipation. The idle-path theorem secures one corner of that bridge, showing the accounting is consistent. The bridge itself, the physical discharge that would connect logical erasure to measurable heat, remains open. That gap is deliberate, and the theorem's value is in marking it clearly.
THEOREM zero_bits_erasure_on_idle · IndisputableMonolith/Holography/LandauerBridgeWalls.lean
/-- Quiet path: staying at the zero cell erases zero posted bits. -/
theorem zero_bits_erasure_on_idle :
LogicalErasurePostsDebit 0 cell0 [] := by
simp [LogicalErasurePostsDebit, netErasedBits]
THEOREM one_bit_erasure_fails_on_idle · IndisputableMonolith/Holography/LandauerBridgeWalls.lean
/-- Claiming a one-bit logical erasure on the idle path is false. This shows
the premise discriminates paths, but still does not supply a reset protocol. -/
theorem one_bit_erasure_fails_on_idle :
¬ LogicalErasurePostsDebit 1 cell0 [] := by
simp [LogicalErasurePostsDebit, netErasedBits]
What this page does not claim
A physical proof that idle systems dissipate zero heat. A logical-bit reset protocol that forces erasure. A derivation of Landauer's principle from the ledger accounting.
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/LandauerBridgeWalls.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:
- What physical process would count as a reset protocol that forces the erasure predicate to hold?
- How does the framework's posted-weight accounting relate to thermodynamic entropy?
- Can the Landauer bridge be completed with an independent calorimetric observable?
MACHINE LAYER · GROUNDED CLAIM TABLE · CLICK TO EXPAND
THEOREM zero_bits_erasure_on_idle · IndisputableMonolith/Holography/LandauerBridgeWalls.lean
/-- Quiet path: staying at the zero cell erases zero posted bits. -/ theorem zero_bits_erasure_on_idle : LogicalErasurePostsDebit 0 cell0 [] := by simp [LogicalErasurePostsDebit, netErasedBits]If the system stays in its starting cell and takes no steps, the net number of erased bits is exactly zero. zero_bits_erasure_on_idle · IndisputableMonolith/Holography/LandauerBridgeWalls.leanTHEOREM one_bit_erasure_fails_on_idle · IndisputableMonolith/Holography/LandauerBridgeWalls.lean
/-- Claiming a one-bit logical erasure on the idle path is false. This shows the premise discriminates paths, but still does not supply a reset protocol. -/ theorem one_bit_erasure_fails_on_idle : ¬ LogicalErasurePostsDebit 1 cell0 [] := by simp [LogicalErasurePostsDebit, netErasedBits]The same predicate rejects a one-bit erasure on that idle path. one_bit_erasure_fails_on_idle · IndisputableMonolith/Holography/LandauerBridgeWalls.lean- OPENIt does not supply a reset protocol, a physical mechanism that would force a logical bit to be erased.