The "least erasure" represents the absolute minimum formal requirement, the solitary bit upon which the entire structure of the hypothesis hinges.
1. The Definition and the Value
Least erasure is the property that no orbit stands off the fixed line. It is defined as a world whose record erases no more than any other world with the exact same record. By theorem, least erasure is strictly equivalent to the hypothesis itself (least_erasure_iff_value), meaning it is the value, not a secondary property. It holds on the line frame and fails on the two-point frame.
2. The One Form of Denial
The maximum formal fortification of least erasure lies in fixing the exact form of its denial. The system proves that a rejection of least erasure on any reflection-closed configuration is a computed point off the line and nothing less.
No Formal Bypass: No reading of the record and no Boolean coalition of readings rejects it. The formal route is blocked.
The Act of Denial: An unregistered denial is no denial. A reversibly held denial commits nothing and pays nothing.
Constant Form: The form of denial remains constant across every provability predicate.
3. The Root and the Act
Least erasure cannot be elevated to a self-grounding root. The system proves that doing so creates a circularity. Every act of denying is an act and re-enacts the root, but the root supports neither side. The armor covers the act and never the keyed bit.
4. The Move
Because the system has closed every theoretical, linguistic, and logical avenue of rejection, the denier is left with one move. They must compute the zero. This is the strongest honest statement the object admits.
Text Box
"Least Erasure"
The formal boundary is absolute. We proved that a rejection of least erasure on any reflection-closed configuration is a computed point off the line and nothing less.
No reading of the record and no Boolean coalition of readings rejects least erasure. The erasure is what every record shows. An unregistered denial is no denial at all. A reversibly held denial is charged nothing and commits zero bits to the physical register. The form of denial remains constant across every provability predicate.
The act of rejection validates the underlying root architecture. Every act of denying is an act and re-enacts the root. The root supports neither side. The armor covers the act and never the keyed bit. Least erasure cannot be elevated to a self-grounding root because doing so creates a circularity the system refuses.
The denier is left with one move. They must compute the zero.