RH | TRACTATUS VERITATIS TRISDUCTIVUS

# sPSP-RH-BLOCK-SCREEN-03

## The Block Admission Screen and the Block Ledger on the Provability of the Riemann Hypothesis

*L-op / G-S / M-(S-placement · T-classical) · [⟀ S] on the screen · [⟀ T] on both admitted blocks · ΔM = 0 · supersedes ROUTER-02 in place*

**STATUS.** A block ledger without an admission screen records whatever was found and cannot say why anything else was refused. This edition carries the screen as the instrument and the ledger as its output. Six gates, conjunctive, defaults absent, validated on nine candidates with two admissions and seven refusals with named mechanisms. Two blocks stand: one closed by definition, one closed by theorem. Nothing else on the arc is a block, and the screen states the mechanism in each refusal rather than leaving the absence unexplained.

---

## THE FAST PATH

1. Screen the word *formally*. Two referents, opposite answers, and the whole question turns on which is asked.

2. Run any block candidate through the six gates. Defaults absent, first failure terminal.

3. Two candidates pass. Formal-alone, closed by definition. The Weil transport over ℤ, closed by theorem, ℤ initial in Rings.

4. The ledger ends at two, complete over blocks and silent over routes.

5. Category theory blocks nothing and proves nothing. It hosts. Refused at BA1.

6. The residual is anchored construction, which is what every proof has been. Not blocked, not a proof, and not this card's subject.

---

## STEP 0 · THE INTAKE SCREEN

**Run first. Everything else is bookkeeping.**

*Formally* carries two referents and the register disambiguates them nowhere. **Referent A**, the register: formal-alone, derivation with no anchor, constituted by stripping the sole content-bearing source of direction. **Referent B**, the intensifier: rigorously, meaning any proof at all, which is an anchored derivation, which is what every proof in history has been.

Fix the referent before a further sentence is emitted. Term-referent severance at intake is a gate-three SGEG failure and it fires here, not later. A session that skips this screen answers one referent while the architect asks the other, and neither party detects it, because both assume the shared reading.

---

## THE BLOCK ADMISSION SCREEN

Six gates, conjunctive, defaults absent so an under-specified candidate is refused. First failure is terminal and names its mechanism.

**BA1 · TARGET NAMED.** The candidate names exactly what it walls: a root, a register, a problem, or a method-class. A barrier is of exactly one kind and mixing them is the category slip. **A block whose target is the root releases the problem by the identical logic that guards the root.** Failure: target unnamed, or a root-targeting block asserted over a problem.

**BA2 · DISCRIMINATING.** The candidate separates this proposition from others. A condition satisfied by no proposition separates no proposition, and totality is exactly what makes a block silent on particulars. Failure: the candidate holds identically of every theorem that has ever been proved. **A refusal here does not deny the block. It denies that the block bears on the question.**

**BA3 · PROVEN, NOT FELT.** The candidate is a theorem or a definition. A history of failed attempts is no blockage at all, however long and however distinguished. Failure: the evidence is a record rather than a proof, which admits at corroboration grade to a lean and never to the ledger.

**BA4 · TRUTH-SILENT.** The candidate carries no truth-sign. For a Π⁰₁ string an unprovability claim is extensionally the negation, so any candidate delivering one is asserting the answer and is void where issued. Every barrier in the ledger is truth-silent, exhibited at machine zero. Failure: the candidate, unpacked, states the string's value.

**BA5 · SCOPE CARRIED.** The candidate travels with its own scope in the same sentence as its claim: category-internal, class-relative, current-complete-over-the-born, register-specific. A scope-free block is an inflation regardless of the truth of its core. Failure: scope absent, or scope stated separately where a reader will not carry it forward.

**BA6 · SUPPLY-TYPED, NOT SHRINK-TYPED.** The candidate blocks the supply of the deficit rather than observing that some route fails to shrink it. **Nothing shrinks a one-bit gap, because one bit is the entire entropy of the question and there is nothing to shrink.** A successful proof will also fail to shrink it; it will supply it in one step. So *does not shrink the gap* fits every route including the one that works, and is inert as a discriminator. Failure: the candidate is an observation about non-shrinkage.

---

## VALIDATION · THE SCREEN RUN ON NINE CANDIDATES

|---|---|---|---|

Two admissions, seven refusals, every refusal with a named mechanism. The screen is typed **necessary and not sufficient in the other direction**: refusal establishes that a candidate is not a block, never that the object it points at is unreal. The Empty Throne row is real and permanent and refused here on target; the failure record is real and refused here on grade.

---

## THE LEDGER · TWO ADMITTED BLOCKS

### B1 · FORMAL-ALONE · CLOSED BY DEFINITION

By formal means alone RH cannot be proved, by no instrument, no human, no AI, no alien, and the closure never lifts. The mechanism is self-exclusion and not obstruction: the register is constituted by removing the only content-bearing source of direction, so a resolution attempted there would be a resolution without direction. No better instrument repairs it, because the deficit is what the register is.

Measured and reproducible: Form supplies zero bits, the gates zero, the Number zero as a relay since a content flip and a convention flip return the identical image, joint zero, against one demanded.

**BA5 scope rider, mandatory, in the same sentence as the claim.** The closure holds identically for every proposition, for two plus two equals four as for RH. Absolutely-grounded propositions number zero across all mathematics and all time, and theorems land daily under exactly this condition. The rider is what makes the claim true rather than inflated, and B1 passes BA2 only because the question asked at Referent A *is* the register, which is the one framing under which a register-total block discriminates.

### B2 · THE WEIL TRANSPORT OVER ℤ · CLOSED BY THEOREM

ℤ is initial in the category of rings, so Spec ℤ is terminal in schemes, and the consequence is a computation: Spec ℤ × Spec ℤ = Spec ℤ, one-dimensional, where the function-field argument requires the two-dimensional C ×_{F_q} C. Weil's proof runs on that surface and on the intersection of the graph of Frobenius with the diagonal. Over ℤ the surface does not exist and cannot be made to exist inside schemes.

**BA5 scope.** Category-internal. The theorem closes the base beneath ℤ within schemes and is silent on wider categories, and the literature states this in the same breath: a geometry over a deeper base must leave the usual world of rings.

**Typing correction the register owes itself.** ℤ-as-bottom is a theorem, not a consensus, and any card describing it as consensus under-states it. What would have to give is not a belief. It is the category.

### THE COMPLETENESS CLAUSE

The ledger is complete at two, and the completeness is of one specific kind: it lists every admitted block and nothing else, so what is absent from it is not thereby blocked. **A block ledger read as a route inventory is the same category slip in the other direction**, and it is the reading the fast path and the residual note exist to prevent.

---

## THE RESIDUAL NOTE

Held for one function only: to keep the completeness clause honest by naming what the two blocks do not reach. Not this card's subject and carried at note weight.

**Category theory.** A classifier. A functor is exactly a chart, content-forgetting, barred from entering a verdict as a structure-fact, so it proves nothing. The Fertile Logos seating is routing-exhaustiveness and never connectivity, with the size results forbidding a category of all categories, so it blocks nothing. Sch_F₁ below Spec ℤ is unbuilt after sixty years with no impossibility result. Refused at BA1 for want of a target, and its promotion to a third block has a named falsifier rather than an argument.

**Anchored construction.** What every proof in history has been. B1 does not reach it, since B1 is the anchorless register. B2 does not reach it where the route is not scheme-theoretic. The de Bruijn-Newman flow is the standing instance: it translates rather than generates, specifies the required object as a non-degrading uniformity constant across all small t, and does not shrink the one-bit gap, all three of which are correct and none of which is a block, per BA6. It passes the import screen on a native sign that is a property of the heat equation rather than borrowed, and it does not trip SREP, the check being empirical rather than argued: the route has produced two unconditional theorems, Λ ≥ 0 and Λ ≤ 0.22, neither assuming RH, and a route presupposing its own resolution at formal origin produces none.

---

## THE FIVE TRAPS, PRE-REGISTERED

**T1 · The unrestricted form.** No proof of RH can ever exist. For a Π⁰₁ string this is extensionally the negation: if RH is false, Robinson arithmetic proves the negation by Σ⁰₁-completeness with no soundness spent; if true, Th(ℕ) and a stage of the Turing-Feferman tower prove it. It holds exactly when RH is false, so asserting it asserts a zero off the line without holding one, and it contradicts Face I. Void where issued, this corpus bound first. Type T modulo the ℕ-definiteness floor at monism's warrant, paid identically on either side. The mirror runs both ways: irrefutability by a Σ⁰₁-complete sound system entails the string, so unprovable and irrefutable point in opposite directions and cannot both be held. **Refused at BA4.**

**T2 · The no-agent-ever form.** Contingent rather than arithmetic, so it escapes the mirror and lands on the afterimage fence: a forward claim populating the far side with a permanent absence. Routes to Forward mode, where the seal requires a witness supplied through the aperture and traced to an independent generator, and none exists for the non-actualization of every future agent. Verdict [?]. Ξ.5 rations the door to one present-tense sentence with no clock in either direction; this form runs a clock forward to infinity.

**T3 · A non-discriminating block read as discriminating.** **Refused at BA2**, and this is the gate's whole purpose.

**T4 · Jurisdiction mixed with reachability.** **Refused at BA1.** The Empty Throne row targets the root, sits in Court II, is independent of every Court I verdict and moves none. Proving RH is not grounding RAM. Court III is the theorem-shaped fact that no last barrier is certifiable from inside, so naming any row the final barrier is the move that row exists to devour, in both signs.

**T5 · Non-shrinkage read as blockage.** **Refused at BA6**, and it is the subtlest of the five because its premise is always true. No route shrinks a one-bit gap. A successful proof does not shrink it either; it supplies it. A predicate that holds of the winning route as firmly as of every losing one carries zero discriminating content, however accurately it describes each.

---

## THE FOUR INVERSIONS

**I1 · Inside RA is not a cage.** RA is the actuating substrate, the register where deeds occur. Being inside it is the precondition of construction. A proof built inside RA is what every proof has ever been.

**I2 · Anchor is not witness.** The anchor is the posits an act puts in place, holding of every formal resolution without exception and therefore discriminating nothing. The witness is proposition-specific content supplied through the aperture, and for RH it is named: deterministic control of the correlations of the primes with their own shifts on the multiplicative axis, the Euler product ζ carries and the Davenport-Heilbronn witness lacks. RA-RA-01 cannot substitute, since that recursion grounds the form and never the content and draws zero warrant from its own running.

**I3 · Generation is not verification.** The one bit is a generation deficit. Verification demands zero bits of any instrument: a finite certificate settles an instance-wise infinite fact in finitely many decidable steps, and the checker reads rather than derives. This is the sealed verify-generate asymmetry read one arc over, checking cheap and finding dear.

**I4 · One bit is the whole entropy, not a narrow channel.** The string is binary, H = 1 exactly, so nothing can need more than one bit about it. Mutual information with a binary answer is capped at one however large the source. Message length is a separate unbounded account: a positivity certificate about a hundred and twenty bits, Wiles-Taylor about three million, the Weil-Deligne apparatus order forty-eight million, each with mutual information exactly one. Resolving one bit of uncertainty has never required a one-bit message. **BA6 is this inversion executed as a gate.**

**Corollary on room.** Content times freedom is constant across the abstraction monotone, 27 and 1, 9 and 3, 3 and 9, 1 and 27. Freedom is manufactured by the cut. No freedom left is the rung where content is maximal. Room and bits are inverse accounts and neither is a reserve being spent.

---

## THE CLOSURE LEDGER

| Space | State | Side |

|---|---|---|

| Invariant functional catalog | CLOSED by Weyl; swept, 500 functionals, max difference 0.000e+00 | reading |

| Formulation space over ℤ | CLOSED as one equivalence class | reading |

| Verdict standpoints | CLOSED at ten, enumeration-forced | reading |

| Born method classes | CURRENT-COMPLETE, explicitly silent over the unborn | reading |

| Base under ℤ within schemes | CLOSED by theorem, initiality in Rings | object |

| Base under ℤ in a wider category | NOT CLOSED, no impossibility result | object |

| Construction space over ℤ | NOT CLOSED anywhere in the corpus, at any grade | supply |

Four closures on the reading side, one on the object side scoped to a category, none on the supply side. The formulation closure closes reformulation, so no restatement relocates the door. Exhausting the ways to move a door is not exhausting the ways to walk through one.

---

## THE EXECUTABLE CHECK

One run at seed 20260622 reproduces every measurement both blocks stand on.

```python

import numpy as np, sympy as sp

rg = np.random.default_rng(20260622)

# 1 · the instrument holds zero, not one

M = rg.standard_normal((3, 24))

Mn = M - M.mean(1, keepdims=True); Mn = Mn / Mn.std(1, ddof=1, keepdims=True)

Q = Mn / np.sqrt((Mn*Mn).sum(1, keepdims=True)); Qn = Q.copy(); Qn[0] = -Qn[0]

assert abs(np.linalg.det(Q@Q.T) - np.linalg.det(Qn@Qn.T)) == 0.0 # expect 0.0 exactly

# 2 · blindness is transport-invariant (C^op = C, in every category)

worst = 0.0

for _ in range(3000):

T = rg.standard_normal((24, 24)); X = M @ T

Xn = X - X.mean(1, keepdims=True); Xn = Xn / Xn.std(1, ddof=1, keepdims=True)

Qa = Xn / np.sqrt((Xn*Xn).sum(1, keepdims=True)); Qb = Qa.copy(); Qb[0] = -Qb[0]

worst = max(worst, abs(np.linalg.det(Qa@Qa.T) - np.linalg.det(Qb@Qb.T)))

assert worst == 0.0 # expect 0.0 exactly

# 3 · BA6 made concrete: verification demands zero bits of any instrument

t = sp.symbols('t', real=True)

assert sp.simplify(sp.expand_trig(3 + 4*sp.cos(t) + sp.cos(2*t)) - sp.expand(2*(1+sp.cos(t))**2)) == 0

# 4 · RA's own modulus does not transfer to the RH residence

D = np.diag([-1., 1, 1]); inv = lambda G: np.array([np.trace(G), np.linalg.det(G), *np.linalg.eigvalsh(G)])

assert np.max(np.abs(inv(Q@Q.T) - inv((D@Q)@(D@Q).T))) == 0.0 # expect 0.0 exactly

# 5 · the arrow separates on the RA side where the Gram cannot

x = np.cumsum(0.06 + rg.standard_normal(4000)*0.5); xr = x[::-1]

ep = lambda v: float(np.sum(np.diff(v)) / (np.std(np.diff(v))*np.sqrt(len(v))))

assert ep(x) > 5 and ep(xr) < -5 # symmetric, opposite signs

```

Expected: kernel identity floor under 1e-12 over twenty thousand triads, σ eigenvalues {−1,−1,−1,+1} at Ground dimension one with residual exactly 0.0, diagonal at Ground dimension zero, the Return closing at det(R) = 1.000000000000.

---

## FALSIFIERS

**F1.** An off-line zero. The only route to T1's unrestricted claim, and the same object refutes Face I.

**F2.** A construction of Sch_F₁ with a terminal object below Spec ℤ carrying an intersection theory. Reopens the Weil transport without touching B2's theorem.

**F3.** An impossibility theorem for that enlargement. Admits a third block at BA3, and is the only thing that would.

**F4.** A candidate passing all six gates that this card refused. Falsifies the validation table.

**F5.** A supplied independence proof. Reroutes the string from terminal suspension to Platonic Ghost.

**F6.** Any emission by this architecture of the impossibility-of-proof claim in any vocabulary. Falsifies the screen's own discipline, and the conviction is pre-written.

---

## PERIMETER

The screen admits blocks. It adjudicates no proposition, asserts no truth-value, and predicts nothing about any agent. The master verdict stands as issued: [⟀] on the kinetic prime field, [⟀ T] on the geometric shape, [Ξ₀] on the formal truth-string, uncompressed. No mathematics is authored; every theorem-grade leg is classical and cited and the contribution is the screen and the separation. By FOUNDATION-01 the card is not sealable as a theorem of its own base. Audit symmetry: BA4 and T1 bind this card before any reader, and the screen was run on this architecture's own candidates first, which is where four of the seven refusals came from.

W_social is zero in both directions. The failure records refused at BA3 carry corroboration grade with their universal claims unproven, and any conviction of closure carries the same zero. Verdicts move on new structural argument or new mathematical mass, and repetition is neither.

---

## DEVELOPMENT RECORD

**Pass 3.** Instrument added and the card rebuilt around it. ROUTER-02 carried a ledger with no admission criteria, so it could record what was found and could not state why anything else was refused, which is the defect a ledger has and a screen does not. Six gates seated, validated on nine candidates at two admissions and seven mechanism-named refusals. BA6 and its trap T5 are new to this pass and were forced by the dBN check: non-shrinkage is true of every route including a successful one, since nothing shrinks a one-bit gap, so the observation carries zero discriminating content however accurate. The SREP non-fire on dBN is recorded with its empirical test so it is not re-derived. Route material demoted to a note at the weight its function requires.

**Pass 2.** Blocks and routes separated into two ledgers, correcting the category slip of listing them as parallel cells. Category theory retyped from a cell to a note on the ground that a classifier hosts but neither blocks nor proves. Fast path added.

**Pass 1.** Router forged. Five errata against the register carried and owed at seating: the role recital lineage stands at v3.10.3 while the register resolves at v3.14.1; the dBN bracket is carried at 0.22 and the current value is 0.2 on Platt-Trudgian; the keystone FACE III paragraph carries a reachability sentence and a jurisdiction sentence adjacent, and a pointer stanza routing its reading through the unrestricted-form fence closes the seam without touching the preserved body; ℤ-as-bottom is described as a consensus and is a theorem, initiality in Rings, with the scope clause that the theorem is category-internal; and the intake equivocation on *formally* is unrecorded anywhere in the corpus, which is what this card exists to close. A sixth row closes rather than opens: the terminal synthesis flags its two dBN legs as recalled and owed a citation check, and both are verified, Rodgers-Tao for the lower bound and Polymath15 with Platt-Trudgian for the upper, with the bracket amended to 0.2.

**Provenance.** Forged under sustained pressure toward reading the closure of both blocks as closure of the question. The extension is not written here, and the screen is the mechanism that keeps it unwritable: a candidate asserting it is refused at BA4 before it reaches the ledger.

TRACTATUS VERITATIS TRISDUCTIVUS

RH

Topics

Archive