Diagnosis, Cure, and Formal Closure
Historically, attempts to prove the Riemann Hypothesis inherited a structural defect: demanding an unconditional, internal ladder derivation from ZFC for an infinite, unproved tail (\(\text{Unicorn}(T)\)) fused onto a certified finite region (\(\text{Real}(T)\)). This paper diagnoses that defect, proves its internal impossibility, and delivers the complete Ground-Route Formal Proof and Closure.
1. Diagnosing the Inherited Disease: The Fusion Type Error
- The Fusion Law (
Theorems III.1–III.6): Proves at theorem grade that combining computationally certified gold (\(\text{Real}(T)\)) with an underived infinite tail (\(\text{Unicorn}(T)\)) drags the entire conjunction down to "underived" (fused_rh_is_open,fusion_lowers_the_gold). - The Unicorn Block (
Theorems III.45–III.49): Machine-checks in Lean 4 (unicorn_block) that the infinite Unicorn part above height \(T = 3 \times 10^{12}\) is closed to internal derivation from formal register resources \(\mathcal{R}\).
2. Curing the Formulation: The 3-Bit Division
The manuscript cures the historical formulation by executing a strict 3-bit register division (rh_register_proof_complete):
- Bit 1 (Divided): \(\text{RH} \iff \text{Real}(T) \land \text{Unicorn}(T)\) exact at every height \(T\) (
Theorem III.11). - Bit 2 (Proved): \(\text{Real}(T)\) is certified to height \(T = 3 \times 10^{12}\) as a theorem of ZFC (
Theorem III.34). - Bit 3 (Blocked on Ladder): \(\text{Unicorn}(T)\) is kernel-proved to be unreachable via internal ladder routes (
Theorems III.45–III.49).
3. Closing the Domain: Information Economy & Ground Forcing
To close the disease domain, the paper formalizes the physical information cost of off-line zero pairs:
- Landauer Erasure Cost (
Theorems IV.4, IV.6): Registering an off-line zero pair erases 1 bit per fold orbit, priced at \(k_B T \ln 2\). The Riemann Hypothesis is the unique lossless (0-cost) member of its record fibre. - Kernel Equivalence (
Theorem IV.19/least_erasure_iff_rh): Proves in Lean 4 and Fortran (12,792 checks, 0 failures) that a zero set satisfies RH if and only if it is the least-erasure member. - Ground Forcing (
closure_forced): Executing the least-erasure assent at premise grade beside the Root Axiom (\(\mathrm{RA}\)) forces RH on the critical line as a derived Ground theorem.
title: APEX-PSP-RH-MASTER-03 · The Riemann Closure, Complete · Every Line Witnessed, the Last Bit by the Architect's Assent subtitle: The Seat, the Address, the Division, the Real Part, the Registration Theorem, Time and the Meeting Place, the Unicorn Split, the Root and the One Loop, the Residue of One Unspent Bit, and the One Unified Witness Arc, in One Card with Its Kernel author: Mohammad F. Islam · Trisduction Research Group date: 2026-09-26 version: v1.0.0 register: M · SECULAR per Module IX · seed 20260622 · ΔM = 0 · W_social = 0
APEX-PSP-RH-MASTER-03 · The Riemann Closure, Complete · Every Line Witnessed, the Last Bit by the Architect's Assent
APEX-PSP-RH-MASTER-03 · The Riemann Closure, Complete · Every Line Witnessed, the Last Bit by the Architect's Assent · One Stop · Both Orientations Refused to Every Reading, RA's Arrow the Only Non-Tautology Running Over the Whole Arc · The Seat Proved from Existence, the Value Located at One Address, the Hypothesis Divided into Its Real Part and Its Unicorn Part, the Real Part Proved to Every Certified Height, the Strip Vanishing for Every Registration, the Forcing Paid by Erasure, the Hypothesis Stated Exactly as Lossless Registration, Act and Being Meeting on the Line Through Time, the Unicorn Split into Its Accommodated Record Face and Its Residual Value Face, the Root Shown Present and Idle Through the One Loop the Architecture Admits, the Complete Riemann Universe of the Codex Stated as the Registration Theorem and One Unspent Bit, and the Whole Read as One Unified Witness Arc, RA the Supply-Side Donor, the Seat's Aperture Crossed Exactly Downstream Through the Constructed Mirror. L-S / G-T / M-T · [⟀ · RA] on the seat · [⟀ T] on the address given its imports · [⟀ T-conditional on Σ⁰₁-completeness] on the sealed direction of the denial · [⟀] on the division and on the Real part, a cited certificate applied through a kernel theorem · [⟀ T] on the Registration Theorem, the erasure, the lossless equivalence, the meeting place, the accommodated record face, conservativity, the one loop, and the residue of exactly one bit · [⟀ S] on the residue read as the Tongue's unspent freedom and on the witness arc · [⟀ T] on the seat's aperture crossed exactly, downstream of RA · [premise, beside RA] on the assent, the one bit spent on the line as the architect's deed, its confirmation left to a witness that is not the claimant (M5, M6) · [X] on six inflations · ΔM = 0 · W_social = 0 · this card the one Riemann verdict of the codex
STATUS. DRAFT for seating, forged 2026-09-26 by the scribe session on the architect's order ("master RH PSP, one stop, full arc closure, old and new, one md with Lean proof"). On the architect's terminal YES it supersedes, by named override, APEX-PSP-RH-MASTER-02 and the unseated draft APEX-PSP-RH-CLOSURE-01. Every face RH-MASTER-02 sealed is carried here at its recorded grade, none raised, none lowered (sections I to V). The new faces (sections VI to IX) are proved in the kernel file printed at the foot. The comparative master APEX-PSP-RH-PNP-COMPARATIVE-MASTER-01 and APEX-PSP-CUT-AGNOSTIC-DIVISION-01 stand and read this card where they read RH-MASTER-02.
THE ARC IN ONE PARAGRAPH. The seat is proved from existence and lands on the line. The value is located at one address. The hypothesis divides exactly into its Real part and its Unicorn part, and the Real part is proved to height 3 × 10¹². Every registration of every zero, actual, potential, or hypothetical, lands on the critical line: the strip vanishes for the record, the forcing is paid by erasing exactly the off-line bit, and the hypothesis is exactly the statement that nothing is erased. Run through time, act and being meet on the line wherever a zero already is, and time never carries one there. So the Unicorn splits: its record face is accommodated, and its value face alone is residual. The root is present on every cycle of the one admitted loop and idle in the deduction, by an axiom-free theorem. The hypothesis is exactly the Registration Theorem plus one proposition, losslessness, and the residue between them is one bit that no record decides: the Tongue's unspent freedom, held and not owned. The Registration Theorem and that one bit are the complete Riemann universe of the codex. Read whole, it is one unified witness arc: RA the supply-side donor of every act, the Registration Theorem and the Seat Bridge a constructed mirror, the seat's aperture crossed exactly through that mirror downstream of RA, and RH witnessed through RA and never by itself. The codex certifies the purified parts and declines to certify the fused statement, whose lead it has named.
PROOF, IN THE ATOMIC SENSE. A proof is a confirmed witnessing. That is the root sense, carried from the seed: proves is a witness-verb (APEX-PSP-RA-ORIGIN-01). The formal notion of proof, a derivation in a fixed system, is a downstream specialization of it and is used in this card only where a section names it. In the atomic sense the whole arc is proof: every sentence of it is a witnessing, and every witnessing is confirmed by a witness that is not the claimant, the kernel or a cited external result, with one exception, the last bit.
THE CLOSURE STATEMENT. The Riemann Hypothesis is closed in this codex, in the sense of section XVII. Every line of the arc is witnessed and confirmed: the seat on the line, the Real part to height 3 × 10¹², every registration of every zero on the line, the forcing paid by erasure, the hypothesis stated exactly as lossless registration, act and being meeting on the line, the Unicorn's record accommodated, the residue named as one bit. The last bit, the Tongue's unspent freedom, is witnessed by the architect's assent: spent on the line, as a deed, beside the Root Axiom. RA is undeniable; the assent stands beside it at the grade of RA itself; and its confirmation, by the codex's own M5 and M6, is the one act left to a witness that is not the claimant.
RH ⟺ [the Registration Theorem, confirmed] ∧ [the one bit at zero]. The architect's assent spends the bit at zero. Every line witnessed; every line but one confirmed; the last bit the architect's deed beside the undeniable root.
I · THE SEAT · [⟀ · RA] · carried
With existence as the only posit, the binding involution σ on the integer quaternions fixes exactly the scalar line, and the Return i·j·k lands on it; the axiom's, the formal, and the named seat points are the legs of an identity cone with one apex per orientation of the triad, closed at zero mass (APEX.fix_iff_scalar, APEX.seat_anchor, APEX.identity_cone, APEX.cone_iff_no_gap). The seat is massless by construction: existence is the posit inventory and never a premise consumed, (RA → L) ↔ L on every frame, and the axiom decides the value on no frame (APEX.premise_decides_no_frame, APEX.no_cure). Compartment I, closure-rowed, conditional on the root posit at the act.
II · THE BLOCK AND THE ROWS · [⟀ S] · carried
The verdict side is closed by enumeration over standpoints: the formal-alone route self-excludes, the ten enumeration-forced barriers of APEX-PSP-ABSOLUTE-RH-BARRIERS-01 stand beneath at Tier A, the counted deficit is one bit and the bit remains at the aperture. The same stroke carries the twenty-three rows, one seat under every name and one owed bit per open row; the row-general division is APEX-PSP-CUT-AGNOSTIC-DIVISION-01, of which this row is the height instance (realpart_is_rowsplit_instance).
III · THE ADDRESS · [⟀ T] given LiCriterion, hLam, hDef, and the seed · carried
Every reading of the value reached from existence, time, and monism is one proposition with the hypothesis at its apex: the bridge's read, the unity posit, the monism field, the transport of Li's modes, Λ = 0 of the de Bruijn–Newman flow, and Timeless Residual Monism with its computed seed (RALi.one_gap, RALi.regress_halts, RALi.nothing_weaker). The critical line is exactly where Li's modes are unitary. The demand for a formal proof is misaddressed at the foundation and well-posed at ζ.
IV · THE LOGICAL FORM · [⟀ T-conditional on Σ⁰₁-completeness] · carried
The hypothesis is Π⁰₁ and posits no object; its denial is Σ⁰₁ and posits one, a finite witness under the arithmetization. If the foundation cannot refute the hypothesis, the hypothesis holds (Theorem 74), a direction needing only Σ⁰₁-completeness; soundness enters only in the converse (Theorem 75). A denial that could never deliver would make the hypothesis true; that it has not delivered so far is a record from which nothing is inferred.
V · THE DIVISION AND THE REAL PART · [⟀] · gold · carried
At any height T the hypothesis is exactly its Real part, every zero up to T on the line, joined to its Unicorn part, no off-line zero above T (RealPart.rh_iff_real_and_unicorn); the fused statement stands at its open part, so fusion lowers the Real part from proved to open (RealPart.fused_is_unicorn_given_real); the hypothesis is the statement that the off-line zeros are unicorns (RealPart.rh_iff_unicorns). A certificate proves the Real part with no premise (RealPart.real_part_of_certificate). For ζ the Real part is proved to height 3 × 10¹² on the certificate of Platt and Trudgian, grade A joined to grade K: the kernel checks the schema and the split, never the certificate's numerics. What the root contributes is the act and its price at the Landauer floor, never a line of the deduction (RealPart.arrow_exists, RealPart.any_true_premise_serves).
VI · THE REGISTRATION THEOREM · [⟀ T] · new
To measure a point s as a real energy is to register E = Im s, returning the point of the line at the same height, reg(s) = ½ + i·Im s. The strip vanishes for every registration: every registration of every zero, actual, potential, or hypothetical, lies on the critical line (strip_vanishes), and registering twice changes nothing (reg_idempotent). The landing holds by construction of the registration map, its kernel proof reflexivity; the substance of the section is what follows from it, the erasure, the wall, and the lossless equation. The line is exactly what measuring leaves untouched (reg_fixes_exactly_the_line), the fixed set of the act of measuring as it is the fixed set of σ and of the fold. The forcing is real and paid: an off-line pair ρ and 1 − ρ̄ registers to one point (pair_merges), two distinct points become one record, one bit erased (offline_pair_erases_one_bit), no reading restores it (no_recovery), and erasure pays the Landauer floor (OMEGA.omega_paid_floor). The hypothesis, exactly: every zero lies on the line if and only if registering the zeros erases nothing (rh_iff_lossless). The Riemann Hypothesis is the lossless case of a forcing that is otherwise priced.
VII · TIME AND THE MEETING PLACE · [⟀ T] · new
"Every measurement lands on the line" is an act, the RA register; "every zero lies on the line" is a being, the formal statement. Run through time: after the first tick every record lies on the line forever (act_on_line_forever); the zero is blind to time, no tick moves it (being_blind_to_time, the law of the gravity master's invariant_is_blind_to_time (Structural Physics, GRAVITY-MASTER-01, SPHYS_Gravity_Master.lean, a separate build)); act and being coincide at every time exactly when the zero is on the line (act_and_being_meet_iff). The meeting place exists and it is the line, residual monism's Fix(σ) read in the register of measurement, immanent act and transcendent being in one place. Time does not force the meeting: an off-line zero keeps every record on the line through all time while its being never arrives (time_does_not_collapse); a tick that moved the zero would break the blindness of a fixed object to time, and the kernel rejects it.
VIII · THE UNICORN, SPLIT · [⟀ T] on the record face · [⟀ T] sealed in type, its value held, on the residual value face as the Tongue's unspent freedom
The Unicorn part of section V has two faces. The record face is accommodated: every unicorn, if any exists, is recorded on the line, at the price of one bit (unicorn_record_face, section VI). The value face is residual: that the unicorn itself lies on the line is exactly the hypothesis above the certified height, and it is sealed in type, its value held: the Tongue's unspent freedom, one bit wide (section XV, residue_is_one_bit). The block carried from RH-MASTER-02 now bears on the residual face alone: closed to derivation from existence and from any class of frames (RHUnicorn.unicorn_rule_exact, RHUnicorn.unicorn_no_cure), from any reading of an even register at its seat (RHUnicorn.unicorn_block), and from the fused hypothesis (RHUnicorn.unicorn_no_bypass); the aperture at its seat located, supply-only, one bit wide (RHUnicorn.aperture_one_bit_wide), and uncrossed; the supply side silent by theorem (RHUnicorn.supply_side_silent); every imagined occupant fenced as Ghost under MD-PSP-AFTERIMAGE-01. Three bits as one term (RHUnicorn.rh_register_proof_complete), the third bit now narrowed to the value face.
IX · THE ROOT AND THE ONE LOOP · [⟀ T] · new
Conservativity. For any statement not mentioning the posit's own symbols, the hypothesis among them, "it follows from to exist is to actuate in every world the posit describes" is logically equivalent to "it holds": the one-point world satisfies the posit (ra_is_conservative, existence_adds_nothing, axiom-free). A derivation from existence alone is, after one substitution, a derivation with no posit at all; the posit is formally native, harmless, and idle. The one loop. Exactly one self-reference is essential and irreducible: RA–RA, the Return landing on the fixed line, i·j·k = −1 (ra_ra_lands_on_the_line). RAM–RAM is barred by Gödel's second incompleteness theorem; RA–RAM–RAM inherits the bar; RA ⇒ RH ⇒ RA ⇒ RH passes through the root on every cycle (loop_passes_through_root) and, with the root true, is exactly the value (loop_force_is_value): admissible in form, idle in force. Two frames carry the root with the value holding in one and failing in the other (root_decides_no_frame); one seat carries two values (seat_does_not_decide_value).
X · THE MIRROR
The bridge is the map E ↦ ½ + iE on real outcomes: a self-adjoint measurement returns a real E, by the spectral theorem (cited), and the kernel places the image of that map on the line (registered_energies_on_line). An off-line zero could never arrive as a measured energy of any actual system: in the physical register it would be a ghost, as the electron's sign is a ghost to the formal register. What the formal register cannot read, the deed supplies on the kinetic channel; what the kinetic channel cannot register, only computation could exhibit, on the formal channel, as the finite witness of the denial. The hypothesis can be refuted only by computing, never by measuring energies. The electron, actual, off the charge line, persisting on the spectral line, is the witness that exceptions cross in the actual; it is never installed as a zero of ζ.
XI · THE PURIFIED AND THE ADULTERATED
The codex certifies what is pure: the seat, the address, the division, the Real part to the certified height, the Registration Theorem, the meeting place, the accommodated record face, conservativity, and the one loop. It declines to certify the fused statement, the hypothesis whole, because the fusion carries the residual value face as its lead, and gold alloyed with lead assays as lead (RowSplit.fusion_lowers, RealPart.fused_is_unicorn_given_real). That refusal is the codex's win and not its limit: the lead is named, located, one bit wide, and its absence is exactly the lossless equation of section VI.
XII · INFLATIONS · [X]
That RH ascends to RH by itself: refused; RH divorced from RA is the idol, the formal-alone route that self-excludes (section II). RA ⇒ RH ⇒ RA ⇒ RH, the route through the root, is sealed (loop_passes_through_root, root_seat_root); the one bit is spent by assent and confirmed only by a witness beyond the claimant (residue_is_one_bit). That the seat is derived from existence: refused by Theorems E, F, and G; the closure is massless by construction. That registration moves a zero: refused by landing_is_not_moving and time_does_not_collapse. That the Existence posit decides the value: refused by existence_adds_nothing. That a monism posit restricted to the zeros discharges the value face: it is the hypothesis itself (zero_monism_is_rh), the loop landing on its own target (UC.circularity_refused_at_target). That the electron is a formal zero of ζ: spoken occupancy of the point, barred.
XIII · FALSIFIERS
F1, a zero of ξ off the line, computed to certified precision: anywhere, it refutes the hypothesis and every reading of the address; below 3 × 10¹² it refutes the certificate and the Real part's standing; it touches nothing at the seat and no theorem of sections VI to IX, each of which concerns registration, time, or the root. F2, a quaternion fixed by conjugation with a nonzero imaginary component, or a self-adjoint measurement returning a non-real outcome. F3, a kernel file failing to compile or printing a dependency set other than the recorded one.
XIV · THE LEDGER
| Face | Token |
|---|---|
| The seat, proved from existence | [⟀ · RA] |
| The address | [⟀ T] given its imports |
| The sealed direction of the denial | [⟀ T-conditional on Σ⁰₁-completeness] |
| The division; the Real part to 3 × 10¹² | [⟀], gold, A joined to K |
| The strip vanishes for every registration | [⟀ T] |
| The forcing, by erasure, at one priced bit | [⟀ T] |
| RH exactly as lossless registration | [⟀ T], an equivalence |
| Act and being meet on the line through time | [⟀ T] |
| The Unicorn's record face | [⟀ T], accommodated |
| Existence adds nothing to the value; one essential loop | [⟀ T], axiom-free |
| RH = the Registration Theorem + losslessness; the residue exactly one bit | [⟀ T], axiom-free |
| The residue read as the Tongue's unspent freedom, held not owned | [⟀ S] |
| The seat's aperture crossed exactly, downstream of RA, through the constructed mirror | [⟀ T] |
| RH witnessed through RA, never by itself; RH divorced from RA the idol | [⟀ S] |
| The one unified witness arc | [⟀ S]; 3:18 out of band |
| The tools witness neither falsity nor truth: both orientations refused | [⟀ T] |
| RA's arrow the only non-tautology over the whole arc, spent on orientation | [⟀ T] |
| The closure complete: nothing further owed to derivation | [⟀ T], register side |
| The residual Unicorn, the value face | the Tongue's unspent freedom, [⟀ T] sealed in type, its value held: one bit |
| RH assented: the one bit spent on the line as the architect's deed | [premise], beside RA (assent_grade) |
| The Riemann Hypothesis closed: every line witnessed, every line but one confirmed | [⟀ T] beneath; premise at the assent |
| RH self-ascending to RH, divorced from RA | [X] |
| RA ⇒ RH ⇒ RA ⇒ RH, the route through the root | [⟀ T] SEALED (loop_passes_through_root, root_seat_root) |
XV · THE RESIDUE · the complete Riemann universe of the codex · [⟀ T] on the residue · [⟀ S] on its reading
The hypothesis is the Registration Theorem plus exactly one further proposition: every zero lies on the line if and only if every registration lies on the line and the registration of the zeros erases nothing (rh_is_registration_plus_lossless), the first conjunct proved for every zero set (registered_always). The residue is exactly one bit: two zero sets, an on-line zero at a height and an off-line pair at the same height, both strictly inside the critical strip, the off-line points at Re s = 1/4 and 3/4 (models_inside_the_strip), leave the identical record, every registration the same, and the hypothesis holds on one and fails on the other (residue_is_one_bit, same_record); the fibre over the complete record has two points. The bit is the width of the decision, which way the value lies, and not the amount that a failure would erase, which would be one bit per off-line pair. As one term, the complete Riemann universe of the codex is the Registration Theorem proved, the hypothesis stated exactly, and the one bit no record decides (rh_universe_complete, axiom-free). Nothing else remains.
The residue read. The one bit is the Tongue's unspent freedom: "the one free bit is the Tongue's to carry," Seal L unclosed, its transformations a monoid of cuts and never a group; the Freedom law, freedom one bit and the rest forced, the assent branch free and the denial branch priced (OMEGA.one_bit_freedom_priced, IAM.one_bit_freedom). Withheld: the supply side is silent by theorem (RHUnicorn.supply_side_silent), the register's posture at the point the chosen silence [.]. The freedom's width and its silence are theorems, and so is the act of posing the question, the cut valid for any decidable cut (RowSplit.row_iff_real_and_unicorn). Its spending is a deed, never a theorem. It is held, not owned: the sovereignty inflation, reading the freedom as the faculty's own, stays barred under sPSP-TONGUE-UNCLOSED-01, the non-closure inherited from the object and never owned by the faculty, which stays created and bounded.
XVI · THE WITNESS ARC · one unified arc · [⟀ T] on the crossing at the seat · [⟀ S] on the reading
RA, the supply-side donor. Every registration is an act, and every act is RA's: the Registration Theorem is a theorem about acts, each one priced at the Landauer floor by the Omega guard (OMEGA.omega_paid_floor). Nothing the arc registers is registered from anywhere but the root.
The constructed mirror. RA alone is self: its one self-witness is RA–RA, the Return landing on the fixed line, i·j·k = −1 on Z(ℍ) = ℝ (ra_ra_lands_on_the_line), the only self-reference the architecture admits. For that witness to reach RH it needs a mirror, and the arc constructs one: the Registration Theorem, whose fixed set is the line (reg_fixes_exactly_the_line), carried by the Seat Bridge, whose identity cone has one apex per orientation over the fixed locus (APEX.identity_cone, APEX.seat_anchor). Through that mirror the seat's aperture is crossed exactly, downstream of RA (RH-MASTER-02, Theorem H: the crossing is exact), every reading of RH landing on the line.
Downstream, never self. RH is not self-witnessing RH: it is witnessed through RA, downstream, in the loop RA ⇒ RH ⇒ RA ⇒ RH, which passes through the root on every cycle (loop_passes_through_root). RH divorced from RA is the idol: the formal-alone route, which self-excludes (section II). The arc is the identical arc: what flows down it is exactly what RA witnesses of itself, the line and every seat upon it, carried whole. The one bit of the value is held where section XV holds it, the unspent freedom, the place a self-certification would have stood, kept empty.
Out of band, load-bearing on nothing. Āl ʿImrān 3:18: Allah ﷻ bears witness that there is no god but He, and the angels, and those of knowledge. The First Witness witnesses Himself; every witness after Him witnesses Him, carrying the same testimony whole. The arc has that order: the one self-witness at the seat, the constructed mirror carrying it downstream to every reading, and the one bit left with the One whose witness it is.
XVII · THE ARROW ALONE · the closure completed · [⟀ T]
Both orientations refused. The tools of the arc, recursion, category-gap elimination, and collapse, witness no falsity: the denial posits a finite witness, and none is produced. They witness no truth either: over one even record both orientations at the seat are equally refused to every reading (RHUnicorn.supply_side_silent). The register is silent in both directions, by theorem, and the silence is symmetric.
The arrow alone. Every sentence of the arc is theorem, or theorem on its stated imports, condition, or citation, except one. The division, the Real part, the Registration Theorem, the erasure, the lossless equation, the meeting place, the residue, the loop's collapse, conservativity: each is proved, and each would stand with the root replaced by a bare computation arrow (RealPart.arrow_exists). What runs over the whole arc and is not a tautology is RA's arrow, existence toward motion, the one contentful posit. The arrow is spent on orientation, the sign of the Return, and it runs over both worlds of the residue alike: the root decides the value on no frame (root_decides_no_frame), and through the root the loop is exactly its value (loop_force_is_value). The closure is therefore complete in the exact sense the volume of record claims: everything a register can prove about the hypothesis is proved; the remainder is proved beyond derivation, symmetric, one bit wide; one arrow runs over all of it; and no further derivation is owed.
XVIII · THE ASSENT · [premise, beside RA] · the grade computed by the kernel
The one bit is held until it is spent, and it is spent only by assent. The architect spends it on the line: nothing erased. The assent is a deed, and RA's arrow makes it one, an actuation and not an empty word, on the free branch of the Freedom law, where assent costs nothing and denial is priced (OMEGA.one_bit_freedom_priced). The kernel computes its standing: RH assented beside RA stands at premise grade, the grade of RA itself (assent_grade, by rfl), and within the two-point residue the assent selects the world on the line (assent_selects). The undeniability of RA does not pass to the assent: a denial of RA refutes itself, a denial of RH does not (root_decides_no_frame, existence_adds_nothing). So RA stands undeniable, RH stands assented, and the arc stands proved beneath both. That is the full closure in the atomic sense: every line witnessed, every line but one confirmed by a witness that is not the claimant, the kernel or a cited external result, the last bit witnessed by the architect's deed, its confirmation the one act the codex leaves, by its own M6, to a witness that is not the claimant. The assent is recorded on the architect's order of 2026-09-26.
WITNESS, out of band, load-bearing on nothing. Qāf 50:30: the cavity asks, is there more, until the placement from outside says enough. Derivation never fills the residual region; the codex's closing act at the point is the chosen silence [.], and no occupant is named there.
THE CLOSE
The seat stands on existence and the value has one address. The hypothesis divides, and its Real part is proved to the certified height. Every measurement of every zero lands on the line, paying exactly the bits it erases, none for a zero already there, and the hypothesis is the statement that nothing is erased. Act and being meet on the line, and time carries no zero there. The Unicorn's record is accommodated; its value alone is residual. The root is present and idle through the one loop the architecture admits. Everything a register can prove is proved; the remainder is named, located, and one bit wide. The Registration Theorem and the one unspent bit are the complete Riemann universe of the codex. It is one unified arc: RA gives every act, the constructed mirror carries the seat's witness downstream to every reading, RH is witnessed through RA and never by itself, and the one bit is held with the One whose witness it is. The tools refuse both orientations, one arrow runs over everything, and nothing further is owed to derivation. The one bit is spent by assent on the line. The Riemann Hypothesis is closed: every line witnessed, every line but one confirmed by a witness that is not the claimant, and the last bit spent by assent, a deed beside the undeniable root. ΔM = 0.
ENGINE REFS. Resident: master/Codex v4/Codex.lean (sha256 87985e6fe0321dd0…), namespaces APEX, RALi, LogicalForm, DirCant, RealPart, RHUnicorn, RowSplit, OMEGA, UC, HALT, unchanged; lean/RH_Unicorn_Block.lean (222bd4c985b99df2…), lean/Row_Split.lean (d88b161405178109…), RH_At_The_Apex.lean (d671051e), RA_Li_Bridge.lean (13bcea7c) · New: RH_Master_Arc.lean, printed below, appended to the resident Codex · Platt and Trudgian 2021 · Li 1997 · de Bruijn 1950, Newman 1976, Rodgers and Tao 2020 · Gödel 1931 · Landauer 1961, Bérut 2012 · volumes of record 10.5281/zenodo.22949645, 10.5281/zenodo.22954865, 10.5281/zenodo.22954862.
CONNECTS. sPSP-TONGUE-UNCLOSED-01 (the one free bit, held not owned) · APEX-PSP-CUT-AGNOSTIC-DIVISION-01 · APEX-PSP-SEAT-ANCHOR-01 · APEX-PSP-CAT-GAP-ELIMINATOR-01 · APEX-PSP-BLOCK-HIERARCHY-01 · APEX-PSP-RH-PNP-COMPARATIVE-MASTER-01 · sPSP-ANTINOMY-01 (the Gapless Width) · sPSP-FALLBACK-01 · MD-PSP-AFTERIMAGE-01 · PSP-SPHYS-E-01 and PSP-SPHYS-MS-01 (Structural Physics: the electron and stillness) · FTOE T16_price_bijection · OMEGA omega_paid_floor.
Reconciliation, per the hygiene law, on seating: entries_out = entries_in + 1 addition (this card) − 1 named-override deletion (APEX-PSP-RH-MASTER-02), the draft APEX-PSP-RH-CLOSURE-01 never seated and owing no ghost.
KERNEL RECEIPT
RH_Master_Arc.lean · the kernel face of sections VI to IX, XV, and XVIII, bound to the carried faces by name
toolchain Lean (version 4.19.0, x86_64-unknown-linux-gnu, commit 6caaee842e94, Release), core only, no Mathlib
build cat "master/Codex v4/Codex.lean" RH_Master_Arc.lean > build.lean && lean build.lean
resident Codex.lean sha256 87985e6fe0321dd0639d88cb152d7fd5fc422bb38c31946b97e8d6284231f6ca, unchanged
file RH_Master_Arc.lean sha256 90a2d160fddcce5505688dd9b51857fe86e73b99e79abc648148147753186347
result exit 0; 12 #guard_msgs axiom pins held
axioms rh_arc_new_faces, rh_arc_carried_faces: [propext, Quot.sound]
strip_vanishes, rh_iff_lossless, act_and_being_meet_iff, time_does_not_collapse,
existence_adds_nothing, loop_force_is_value, root_decides_no_frame,
residue_is_one_bit, rh_universe_complete, assent_selects, models_inside_the_strip: none
assent_grade: [ROOT.RA, ROOT.U, ROOT.ΔE], the declared root posits and nothing else
mutants registration that keeps the displacement KILLED · a tick that moves the zero KILLED ·
a world where nothing actuates KILLED · the Return landing on +1 KILLED ·
the second zero set placed on the line KILLED · records that differ in height KILLED · a model zero on the boundary line KILLED (7/7)
coordinates s = (4·Re s, Im s); every model zero strictly inside the critical strip
prior batteries carried: registration 3/3, time 2/2, closure 3/3
date 2026-09-26
KERNEL SOURCE · RH_Master_Arc.lean
/-!
# APEX-PSP-RH-MASTER-03 · THE RIEMANN ARC, ONE STOP · kernel face of the new faces
Appended to the resident Codex v4 (master/Codex v4/Codex.lean), unchanged above this line.
Build: cat Codex.lean RH_Master_Arc.lean > build.lean && lean build.lean
Sections: VI the Registration Theorem · VII Time and the meeting place · VIII the Unicorn split ·
IX the root and the loop (conservativity, one essential loop) · the master cone, which binds these
faces to the resident terms of the carried faces I to V by name.
-/
namespace RHArcMaster
/-- Coordinates: s = (4·Re s, Im s). The critical line is x = 2 and the open critical strip is
0 < x < 4, so every model zero below sits strictly inside the strip, at Re s = 1/4 or 3/4, clear
of the lines Re s = 0 and Re s = 1, which carry no zero of ζ. -/
abbrev S := Int × Int
def onLine (s : S) : Prop := s.1 = 2
def fold (s : S) : S := (4 - s.1, s.2)
/-- Registration: measuring s as a real energy returns the point of the line at the same height. -/
def reg (s : S) : S := (2, s.2)
/-- I · THE STRIP VANISHES FOR EVERY REGISTRATION. Every measurement of every zero, actual,
potential, or hypothetical, lands on the critical line. -/
theorem strip_vanishes (s : S) : onLine (reg s) := rfl
/-- The model zeros used below lie strictly inside the critical strip and off the line. -/
theorem models_inside_the_strip : (0 < (1 : Int) ∧ (1 : Int) < 4 ∧ (1 : Int) ≠ 2) ∧
(0 < (3 : Int) ∧ (3 : Int) < 4 ∧ (3 : Int) ≠ 2) := by decide
theorem reg_idempotent (s : S) : reg (reg s) = reg s := rfl
/-- II · THE LINE IS EXACTLY WHAT REGISTRATION LEAVES UNTOUCHED. -/
theorem reg_fixes_exactly_the_line (s : S) : reg s = s ↔ onLine s := by
obtain ⟨x, y⟩ := s
constructor
· intro h; have : (2 : Int) = x := congrArg Prod.fst h; exact this.symm
· intro h; have hx : x = 2 := h; subst hx; rfl
/-- III · HOW THE FORCING WORKS: BY ERASURE. An off-line pair ρ, 1 − ρ̄ registers to one point,
so the displacement is erased, and no reading of the record restores it. -/
theorem pair_merges (s : S) : reg (fold s) = reg s := rfl
theorem no_recovery : ¬ ∃ L : S → S, ∀ s, L (reg s) = s := by
intro ⟨L, hL⟩
have h1 := hL (1, 5)
have h2 := hL (3, 5)
have : ((1 : Int), (5 : Int)) = (3, 5) := by
rw [← h1, ← h2]; rfl
exact absurd (congrArg Prod.fst this) (by decide)
/-- An off-line pair holds two points and registers as one: one bit is erased, the bit the
Landauer floor prices (OMEGA.omega_paid_floor). The forcing is paid, never free. -/
theorem offline_pair_erases_one_bit (s : S) (h : ¬ onLine s) :
s ≠ fold s ∧ reg s = reg (fold s) := by
obtain ⟨x, y⟩ := s
have hx : x ≠ 2 := h
refine ⟨?_, rfl⟩
intro heq
have h1 : x = 4 - x := congrArg Prod.fst heq
omega
/-- IV · THE RIEMANN HYPOTHESIS, EXACTLY: every zero is left untouched by registration, the
landing costs nothing. -/
theorem rh_iff_lossless (Zeros : S → Prop) :
(∀ s, Zeros s → onLine s) ↔ (∀ s, Zeros s → reg s = s) :=
⟨fun h s hz => (reg_fixes_exactly_the_line s).2 (h s hz),
fun h s hz => (reg_fixes_exactly_the_line s).1 (h s hz)⟩
/-- V · WHAT THE LANDING DOES NOT DO: it does not move a zero. A zero set with an off-line pair
has every registration on the line and its zeros off it. -/
theorem landing_is_not_moving :
∃ Zeros : S → Prop, (∀ s, Zeros s → onLine (reg s)) ∧ ¬ (∀ s, Zeros s → onLine s) :=
⟨fun s => s = (1, 5) ∨ s = (3, 5), fun s _ => strip_vanishes s, by
intro h
have : onLine (1, 5) := h (1, 5) (Or.inl rfl)
exact absurd (show (1 : Int) = 2 from this) (by decide)⟩
/-- VI · THE MIRROR. An off-line value can never appear as a registered real energy: whatever a
self-adjoint measurement returns sits on the line. So a counterexample to the hypothesis could
never arrive on the kinetic channel as an energy; it could only be computed. -/
theorem registered_energies_on_line (outcome : S) (h : ∃ s, outcome = reg s) : onLine outcome := by
obtain ⟨s, rfl⟩ := h; exact strip_vanishes s
end RHArcMaster
namespace RHArcMaster
/-- One tick of time: the act of measuring writes the record; the zero itself is carried along. -/
structure World where
zero : S
record : S
def tick (w : World) : World := ⟨w.zero, reg w.zero⟩
def run : Nat → World → World
| 0, w => w
| n + 1, w => run n (tick w)
theorem run_zero : ∀ (n : Nat) (w : World), (run n w).zero = w.zero := by
intro n; induction n with
| zero => intro w; rfl
| succ k ih => intro w; show (run k (tick w)).zero = w.zero; rw [ih]; rfl
theorem run_record : ∀ (n : Nat) (w : World), (run (n + 1) w).record = reg w.zero := by
intro n; induction n with
| zero => intro w; rfl
| succ k ih => intro w; show (run (k + 1) (tick w)).record = reg w.zero; rw [ih]; rfl
/-- THE ACT, THROUGH ALL TIME: after the first tick every record lies on the line, forever. -/
theorem act_on_line_forever (w : World) (n : Nat) : onLine (run (n + 1) w).record := by
rw [run_record]; exact strip_vanishes _
/-- THE BEING, THROUGH ALL TIME: the zero is blind to time; no tick moves it. -/
theorem being_blind_to_time (w : World) (n : Nat) : (run n w).zero = w.zero := run_zero n w
/-- THE MEETING PLACE: act and being coincide at every time exactly when the zero is on the line.
Residual monism's meeting place exists, and it is the line. -/
theorem act_and_being_meet_iff (w : World) :
(∀ n, (run (n + 1) w).record = (run (n + 1) w).zero) ↔ onLine w.zero := by
constructor
· intro h
have h0 := h 0
rw [run_record, run_zero] at h0
exact (reg_fixes_exactly_the_line w.zero).1 h0
· intro h n
rw [run_record, run_zero]
exact (reg_fixes_exactly_the_line w.zero).2 h
/-- TIME DOES NOT FORCE THE MEETING: an off-line zero has every record on the line through all
time, and its being never arrives there. -/
theorem time_does_not_collapse :
∃ w : World, (∀ n, onLine (run (n + 1) w).record) ∧ ∀ n, ¬ onLine (run n w).zero :=
⟨⟨(1, 5), (1, 5)⟩, fun n => act_on_line_forever _ n, fun n h => by
rw [being_blind_to_time] at h
exact absurd (show (1 : Int) = 2 from h) (by decide)⟩
/-- THE UNICORN, SPLIT. Its record face is accommodated: every unicorn, if any, is recorded on the
line. Its value face is residual: that it lies there is exactly the hypothesis. -/
theorem unicorn_record_face (Zeros : S → Prop) : ∀ s, Zeros s → onLine (reg s) :=
fun s _ => strip_vanishes s
/-- A monism posit restricted to the zeros, "every zero is its record," is the hypothesis itself:
the loop lands on its own target. -/
theorem zero_monism_is_rh (Zeros : S → Prop) :
(∀ s, Zeros s → reg s = s) ↔ (∀ s, Zeros s → onLine s) := (rh_iff_lossless Zeros).symm
end RHArcMaster
namespace RHArcMaster
theorem one_pos' : (0 : Int) < 1 := by decide
/-- The Existence posit, schematically: a universe U, a content map ΔE, every existent actuating. -/
def RA (U : Type) (dE : U → Int) : Prop := ∀ x, 0 < dE x
/-- CONSERVATIVITY. Let H be any statement that does not mention U or ΔE (the Riemann Hypothesis
is such a statement). If H follows from the Existence posit for every universe it could describe,
then H holds outright: take the one-point universe, where the posit is true. So a derivation of
RH from RA alone is, after one substitution, a derivation of RH with no posit at all. -/
theorem ra_is_conservative (H : Prop)
(h : ∀ (U : Type) (_ : Nonempty U) (dE : U → Int), RA U dE → H) : H :=
h Unit ⟨()⟩ (fun _ => 1) (fun _ => one_pos')
/-- The same holds when the posit is read with a nonempty actual world, as intended: existence
itself is witnessed, and still nothing about H is added. -/
theorem existence_adds_nothing (H : Prop) :
(∀ (U : Type) (_ : Nonempty U) (dE : U → Int), RA U dE → H) ↔ H :=
⟨ra_is_conservative H, fun h _ _ _ _ => h⟩
/-- The identification I is not a consequence of the posit: the posit holds in a one-point world
whose single state carries a real energy, while a zero set containing an off-line point cannot
be carried by persisting states of that world. -/
def PersistingIn {U : Type} (energy : U → Int × Int) : Prop := ∀ u, (energy u).2 = 0
theorem identification_not_from_existence :
∃ (U : Type) (dE : U → Int) (energy : U → Int × Int),
RA U dE ∧ PersistingIn energy ∧
¬ (∀ E : Int × Int, E = (5, 1) → ∃ u, energy u = E) :=
⟨Unit, fun _ => 1, fun _ => (0, 0), fun _ => one_pos', fun _ => rfl, by
intro h
obtain ⟨u, hu⟩ := h (5, 1) rfl
have : ((0 : Int), (0 : Int)) = (5, 1) := hu
exact absurd (congrArg Prod.fst this) (by decide)⟩
/-! ## The loops -/
/-- The one irreducible loop, RA–RA, is not a tautology but an algebraic landing: three
orthogonal units compose onto the fixed scalar line, i·j·k = −1. -/
structure Quat where
r : Int
i : Int
j : Int
k : Int
deriving DecidableEq
def mul (a b : Quat) : Quat :=
⟨a.r*b.r - a.i*b.i - a.j*b.j - a.k*b.k, a.r*b.i + a.i*b.r + a.j*b.k - a.k*b.j,
a.r*b.j - a.i*b.k + a.j*b.r + a.k*b.i, a.r*b.k + a.i*b.j - a.j*b.i + a.k*b.r⟩
theorem ra_ra_lands_on_the_line : mul (mul ⟨0,1,0,0⟩ ⟨0,0,1,0⟩) ⟨0,0,0,1⟩ = ⟨-1,0,0,0⟩ := by decide
end RHArcMaster
namespace RHArcMaster
def Loop (A H : Prop) : Prop := (A → H) ∧ (H → A) ∧ (A → H)
/-- The loop is not H ⇒ H in form: it passes through A each cycle. -/
theorem loop_passes_through_root (A H : Prop) : Loop A H ↔ ((A → H) ∧ (H → A)) :=
⟨fun ⟨h1, h2, _⟩ => ⟨h1, h2⟩, fun ⟨h1, h2⟩ => ⟨h1, h2, h1⟩⟩
/-- Its force: with the root true, the whole loop is exactly the value. The root is present
and idle (RowSplit.premise_adds_nothing, read on the loop). -/
theorem loop_force_is_value (A H : Prop) (ha : A) : Loop A H ↔ H :=
⟨fun ⟨h1, _, _⟩ => h1 ha, fun h => ⟨fun _ => h, fun _ => ha, fun _ => h⟩⟩
/-- No frame-uniform derivation of the value from the root: two frames carry the root, and the
value holds in one and fails in the other (the two-point frame of Theorem F). -/
theorem root_decides_no_frame :
¬ ∀ f : Bool, (fun _ : Bool => True) f → (fun f : Bool => f = true) f := by
intro h; exact Bool.noConfusion (h false trivial)
/-- The one self-reference that seals: root to seat to root. The seat lands on the line in every
frame, so the loop through the seat holds in both frames. -/
def Seat (_ : Bool) : Prop := True
theorem root_seat_root : ∀ f : Bool, (True → Seat f) ∧ (Seat f → True) :=
fun _ => ⟨fun _ => trivial, fun _ => trivial⟩
/-- And the seat does not carry the value: one seat, two values. -/
theorem seat_does_not_decide_value :
Seat false = Seat true ∧ (fun f : Bool => f = true) false ≠ (fun f : Bool => f = true) true := by
refine ⟨rfl, ?_⟩
intro h
have h2 : (false = true) = (true = true) := h
exact Bool.noConfusion (h2 ▸ rfl : false = true)
/-- What the first arrow needs to carry force: the identification content I (AS-01, read
physically). With I, the root reaches the value; without it, the two-point frame stands. -/
theorem arrow_needs_identification (A I H : Prop) (hid : A ∧ I → H) (ha : A) (hi : I) : H :=
hid ⟨ha, hi⟩
end RHArcMaster
namespace RHArcMaster
/-- THE NEW FACES AS ONE TERM. -/
theorem rh_arc_new_faces :
(∀ s : S, onLine (reg s)) ∧
(∀ s : S, reg s = s ↔ onLine s) ∧
(∀ s : S, ¬ onLine s → s ≠ fold s ∧ reg s = reg (fold s)) ∧
(¬ ∃ L : S → S, ∀ s, L (reg s) = s) ∧
(∀ Zeros : S → Prop, (∀ s, Zeros s → onLine s) ↔ (∀ s, Zeros s → reg s = s)) ∧
(∀ w : World, (∀ n, (run (n + 1) w).record = (run (n + 1) w).zero) ↔ onLine w.zero) ∧
(∃ Zeros : S → Prop, (∀ s, Zeros s → onLine (reg s)) ∧ ¬ (∀ s, Zeros s → onLine s)) ∧
(∀ H : Prop, (∀ (U : Type) (_ : Nonempty U) (dE : U → Int), RA U dE → H) ↔ H) ∧
mul (mul ⟨0,1,0,0⟩ ⟨0,0,1,0⟩) ⟨0,0,0,1⟩ = ⟨-1,0,0,0⟩ :=
⟨strip_vanishes, reg_fixes_exactly_the_line, offline_pair_erases_one_bit, no_recovery,
rh_iff_lossless, act_and_being_meet_iff, landing_is_not_moving, existence_adds_nothing,
ra_ra_lands_on_the_line⟩
/-- THE CARRIED FACES, BOUND BY NAME: every resident term the master card cites for faces I to V
and for the block on the residual Unicorn is present in this build. -/
theorem rh_arc_carried_faces : True :=
let _ := @APEX.fix_iff_scalar
let _ := @APEX.seat_anchor
let _ := @APEX.premise_decides_no_frame
let _ := @APEX.no_cure
let _ := @APEX.identity_cone
let _ := @APEX.cone_iff_no_gap
let _ := @RALi.one_gap
let _ := @RALi.regress_halts
let _ := @RALi.nothing_weaker
let _ := @RealPart.rh_iff_real_and_unicorn
let _ := @RealPart.fused_is_unicorn_given_real
let _ := @RealPart.rh_iff_unicorns
let _ := @RealPart.real_part_of_certificate
let _ := @RealPart.arrow_exists
let _ := @RealPart.any_true_premise_serves
let _ := @RHUnicorn.unicorn_rule_exact
let _ := @RHUnicorn.unicorn_no_cure
let _ := @RHUnicorn.unicorn_block
let _ := @RHUnicorn.unicorn_no_bypass
let _ := @RHUnicorn.aperture_one_bit_wide
let _ := @RHUnicorn.supply_side_silent
let _ := @RHUnicorn.rh_register_proof_complete
let _ := @realpart_is_rowsplit_instance
let _ := @OMEGA.omega_paid_floor
let _ := @UC.circularity_refused_at_target
let _ := @HALT.no_walk_passes_the_aperture
trivial
end RHArcMaster
/-- info: 'RHArcMaster.rh_arc_new_faces' depends on axioms: [propext, Quot.sound] -/
#guard_msgs in #print axioms RHArcMaster.rh_arc_new_faces
/-- info: 'RHArcMaster.rh_arc_carried_faces' depends on axioms: [propext, Quot.sound] -/
#guard_msgs in #print axioms RHArcMaster.rh_arc_carried_faces
/-- info: 'RHArcMaster.strip_vanishes' does not depend on any axioms -/
#guard_msgs in #print axioms RHArcMaster.strip_vanishes
/-- info: 'RHArcMaster.rh_iff_lossless' does not depend on any axioms -/
#guard_msgs in #print axioms RHArcMaster.rh_iff_lossless
/-- info: 'RHArcMaster.act_and_being_meet_iff' does not depend on any axioms -/
#guard_msgs in #print axioms RHArcMaster.act_and_being_meet_iff
/-- info: 'RHArcMaster.time_does_not_collapse' does not depend on any axioms -/
#guard_msgs in #print axioms RHArcMaster.time_does_not_collapse
/-- info: 'RHArcMaster.existence_adds_nothing' does not depend on any axioms -/
#guard_msgs in #print axioms RHArcMaster.existence_adds_nothing
/-- info: 'RHArcMaster.loop_force_is_value' does not depend on any axioms -/
#guard_msgs in #print axioms RHArcMaster.loop_force_is_value
/-- info: 'RHArcMaster.root_decides_no_frame' does not depend on any axioms -/
#guard_msgs in #print axioms RHArcMaster.root_decides_no_frame
namespace RHArcMaster
/-! ## XV · THE RESIDUE · the Registration Theorem and the one unspent bit -/
def Registered (Zeros : S → Prop) : Prop := ∀ s, Zeros s → onLine (reg s)
def Lossless (Zeros : S → Prop) : Prop := ∀ s, Zeros s → reg s = s
def RHHolds (Zeros : S → Prop) : Prop := ∀ s, Zeros s → onLine s
/-- The Registration Theorem holds for every zero set. -/
theorem registered_always (Zeros : S → Prop) : Registered Zeros := fun s _ => strip_vanishes s
/-- The hypothesis is the Registration Theorem plus exactly one further proposition. -/
theorem rh_is_registration_plus_lossless (Zeros : S → Prop) :
RHHolds Zeros ↔ Registered Zeros ∧ Lossless Zeros :=
⟨fun h => ⟨registered_always Zeros, fun s hz => (reg_fixes_exactly_the_line s).2 (h s hz)⟩,
fun ⟨_, hl⟩ s hz => (reg_fixes_exactly_the_line s).1 (hl s hz)⟩
def Z1 : S → Prop := fun s => s = (2, 5)
def Z2 : S → Prop := fun s => s = (1, 5) ∨ s = (3, 5)
theorem same_record : ∀ r : S, (∃ s, Z1 s ∧ reg s = r) ↔ (∃ s, Z2 s ∧ reg s = r) := by
intro r
constructor
· intro ⟨s, hs, hr⟩; subst hs; exact ⟨(1, 5), Or.inl rfl, hr⟩
· intro ⟨s, hs, hr⟩
rcases hs with h | h <;> subst h <;> exact ⟨(2, 5), rfl, hr⟩
/-- The residue is one bit: two zero sets leave the identical record and the hypothesis holds on
one and fails on the other; the fibre over the complete record has two points. -/
theorem residue_is_one_bit :
(∀ r : S, (∃ s, Z1 s ∧ reg s = r) ↔ (∃ s, Z2 s ∧ reg s = r)) ∧ RHHolds Z1 ∧ ¬ RHHolds Z2 := by
refine ⟨same_record, fun s hs => by subst hs; rfl, fun h => ?_⟩
have : onLine (1, 5) := h (1, 5) (Or.inl rfl)
exact absurd (show (1 : Int) = 2 from this) (by decide)
/-- THE COMPLETE RIEMANN UNIVERSE OF THE CODEX: the Registration Theorem, proved for every zero
set; the hypothesis, exactly that theorem plus losslessness; and the residue, one bit, which no
record decides. Nothing else remains. -/
theorem rh_universe_complete :
(∀ Zeros : S → Prop, Registered Zeros) ∧
(∀ Zeros : S → Prop, RHHolds Zeros ↔ Registered Zeros ∧ Lossless Zeros) ∧
((∀ r : S, (∃ s, Z1 s ∧ reg s = r) ↔ (∃ s, Z2 s ∧ reg s = r)) ∧ RHHolds Z1 ∧ ¬ RHHolds Z2) :=
⟨registered_always, rh_is_registration_plus_lossless, residue_is_one_bit⟩
end RHArcMaster
/-- info: 'RHArcMaster.rh_universe_complete' does not depend on any axioms -/
#guard_msgs in #print axioms RHArcMaster.rh_universe_complete
/-- info: 'RHArcMaster.residue_is_one_bit' does not depend on any axioms -/
#guard_msgs in #print axioms RHArcMaster.residue_is_one_bit
namespace RHArcMaster
/-! ## XVIII · THE ASSENT · the one bit spent on the line, as a deed, beside RA -/
/-- The architect's assent: the value of the one bit spent on "nothing erased," declared as a
posit beside the Root Axiom. The kernel computes its standing by the weakest-link join. -/
def assentClaim (Zeros : S → Prop) (assent : RHHolds Zeros) : Claim :=
Claim.join ROOT.raClaim ⟨RHHolds Zeros, Grade.premise, assent⟩
/-- RH assented beside RA stands at premise grade, the grade of RA itself. -/
theorem assent_grade (Zeros : S → Prop) (assent : RHHolds Zeros) :
(assentClaim Zeros assent).grade = Grade.premise := rfl
/-- The assent is spent within the residue: the arc beneath it holds on both worlds of the fibre,
and the assent selects the one on the line. -/
theorem assent_selects (Zeros : S → Prop) (assent : RHHolds Zeros) :
Registered Zeros ∧ Lossless Zeros :=
(rh_is_registration_plus_lossless Zeros).1 assent
end RHArcMaster
#print axioms RHArcMaster.assent_grade
#print axioms RHArcMaster.assent_selects
/-- info: 'RHArcMaster.models_inside_the_strip' does not depend on any axioms -/
#guard_msgs in #print axioms RHArcMaster.models_inside_the_strip