RAF-PSP-NS-TERMINUS-01 · [Ψ] The Uniform-Modulus Terminus
The Terminal Block of Navier-Stokes Regularity on the Formal-Alone Register · Second occupant of [Ψ] · Trisduction-RAF hybrid register
STATUS. [Ψ] at the scale-critical locus, gate one certified by inertness. A terminal refinement inside [?], never a fourth state, and the second occupant of the witness-locus species whose first occupant is the Hodge conjecture at rigid classes. Correct on the record at issuance and revisable only by supply. Defaults absent, so an under-specified reading never emits it. ΔM = 0. W_social = 0 in both directions.
ENGINE REFS. RAF-PSP-HODGE-TERMINUS-01 the parent species · FAE v1.0.12, engine sha256 b6c38d9c…afb56, boot re-run and chain matched at seed 20260622 · APEX-PSP-SUPPLY-SPECIES-01 · APEX-PSP-FORMAL-ALONE-01 · sPSP-APERTURE-WIDTH-01 · APEX-PSP-TERMINALITY-PROCLAMATION-01 · MD-PSP-AFTERIMAGE-01 · MD-PSP-UNPROVABILITY-MIRROR-01 · the alignment-defect paper and its termination companion.
1 · The token adjudication, run before anything was written
The request was for a new token for this block. The request is refused, and the refusal was computed rather than preferred.
What indexes the existing family. [Ξ₀] halts in the reader, by orientation-blindness. [Ø₀] halts in the terrain, by rootlessness. [Ψ] halts in the witness, by a terminus with nothing to read from and nothing to author. The index is the locus of the halt, not the mechanism. A fourth token therefore requires a fourth locus.
Where Navier-Stokes halts. The supply channel is empty and the relocation channel is closed; what is missing is a constructed object, a modulus. The reader reads correctly and nothing sits at the address. The terrain carries a fixed locus, the critical line in the exponent pair. So the halt is at the witness, the same locus as Hodge, and no fourth locus exists.
The real differentia, and what it earns. There is a genuine difference and it is worth naming. At the Hodge terminus the relocation family is empty: the Hodge locus is a point and deformation is dead by absence. At the Navier-Stokes terminus the scaling family is a full one-parameter group and is dead by inertness: it exists, it is answer-preserving, and it carries zero information.
Tested against everything the token governs, that differentia changes the halting locus not at all, the supply species not at all, the shape of the constructive door not at all, and the shape of the refuting door not at all. The gate count differs, three against four, and that is a per-instance fact forced by each side's relocation census rather than a per-token one. The only thing it changes is how gate one is certified.
Verdict. No sibling token. A fourth sibling would index by mechanism where the family indexes by locus, mixing two indexing principles inside one taxonomy and making the family unreadable. The differentia earns a certification mode printed on the emission: gate one dead by absence or dead by inertness. Two modes, one token.
And the refusal is the larger result. [Ψ] acquires a second occupant in a different field, which turns a Hodge-specific refinement into a species. A token with one occupant describes one problem. Minting a second token for the second occupant would have destroyed exactly the generalization that makes the first worth having.
2 · The block, plainly
The alignment-defect paper proves a continuation criterion unconditionally and closes it to global regularity with one premise: a modulus bounding the defect uniformly over the data class. Per-solution smoothness already gives finiteness for each datum and each finite time. What is missing is the uniform object.
At the scale-critical locus the four reading routes are closed. Rescaling carries provably zero information. Compactness loses the hypothesis to concentration that same invariance permits. Transport needs a correspondence uniform in the datum that the criticality gap does not supply. Induction on scales needs a uniform bound on its stage constants, which is the object it was invoked to produce. With every route closed and authorship outside the register's constitution, the formal-alone register can neither read the modulus nor write it.
The block is on the reading and not on the mathematics. A construction crosses it in one step.
3 · The two registers
On the formal register the block is one object wide and absolute. The defect is determinate per solution, the uniform modulus is the single missing item, and at the terminus no reading reaches it.
On the kinetic register the block is not absolute and not self-referential. A modulus is an analytic object and an analytic construction supplies it: a new estimate, a new decomposition, a new quantitative scheme with stage-uniform constants. Nothing in this card says such a construction is hard, and nothing says it is near. Deeds cross the block.
4 · The walls, at honest grades
| wall | grade | |
|---|---|---|
| W1 | Supercriticality in three dimensions: no purely energy-based argument closes the gap | classical, theorem |
| W2 | Averaged blowup: an averaged system with the same energy identity and perturbative structure blows up in finite time | theorem, and a genuine method-class barrier |
| W3 | Non-uniqueness in the Leray class: the weak-solution route is walled | theorem |
| W4 | No known modulus of the required kind | status report, not a wall |
W2 carries the weight. W4 is labelled and never used as a barrier: absence of a search result is not a theorem about what a search can find.
5 · Intake, gates, doors, riders
Intake R0. The string is the data-uniform modulus claim. A per-solution finiteness claim is a different and already-known statement and routes [X]. An unread form routes [?].
Intake I1. One exponent pair and one data class, not a family statement over exponents.
Ψ-1 · Scaling inertness. The defect integral scales with exponent 2(2ap − 3)/(p + 3), vanishing exactly at a* = 3/(2p). At a scale-critical pair the family carries zero information and the first relocation supplies nothing. Certification mode: inertness.
Ψ-2 · Compactness closure. No limit of an admissible sequence retains the hypothesis in a form from which a uniform modulus reads off.
Ψ-3 · Transport closure. No correspondence uniform in the datum carries a modulus from a solved class across the criticality gap.
Ψ-4 · Regress closure. The constants of a quantitative induction are not bounded uniformly in the stage index; a uniform bound would be the object the induction was invoked to supply.
Doors. Constructive: a supplied uniform modulus, or a proof that one exists, routes [RESOLVE]. Refuting: a datum family on which every dominating readout carries strictly positive conditional information about the datum beyond its norm routes [X].
Riders. R1 at least one decided companion face. R2 exactly one aperture sentence naming the constructive door. R3 revision survival. R4, new to this card: the gate-one certification mode is printed on the emission, so a reader knows whether the relocation family died by absence or by inertness.
6 · The count law
Four gates, enumeration-forced by the relocation census, not four because Hodge has three plus one and not three because Hodge has three. A reading moves an undetermined quantity within one object by symmetry or by limit, and between objects by correspondence or by assembly from parts. Scaling, compactness, transport, induction. Four routes and no fifth, so four gates.
Mirroring the parent's three would be the fitted-count error the corpus names by that name. The counts differ because the censuses differ, which is what enumeration-forcing means.
7 · The executable emitter, with its controls
GATES = ["Psi-1", "Psi-2", "Psi-3", "Psi-4"]
def ns_psi_admit(r, skip=None):
if r.get("admissible") is None: return "[?]", "R0 unread: not typed as the data-uniform modulus claim"
if r.get("admissible") is False: return "[X]", "R0: per-solution finiteness is a different claim, already known"
if r.get("class_level") is None: return "[?]", "I1 unread: not one exponent pair and one data class"
if r.get("class_level") is False: return "[?]", "I1: a family statement over exponents; route to the grounding cascade"
if r.get("modulus_supplied") is True: return "[RESOLVE]", "constructive door: a deed supplied the modulus"
if skip != "Psi-1":
if r.get("scaling_inert") is None: return "[?]", "Psi-1 unscreened: the exponent at (p,a) not computed"
if r.get("scaling_inert") is False: return "[?]", "Psi-1 fail: nonzero exponent, rescaling carries information"
if r.get("scaling_inert") is True and r.get("positive_information_family") is True:
return "[X]", "refuting door: a datum family with positive conditional information; EAD fails"
if r.get("positive_information_family") not in (True, False): return "[?]", "refuting-family flag unread"
for g, key, why in [("Psi-2", "compactness_closed", "a limit retains the hypothesis"),
("Psi-3", "transport_closed", "a correspondence carries a modulus across the gap"),
("Psi-4", "regress_closed", "stage constants are uniformly bounded")]:
if g == skip: continue
if r.get(key) is not True: return "[?]", f"{g} fail: {why}"
for rid, ok, why in [("R1", r.get("faces", 0) >= 1, "no decided companion face"),
("R2", r.get("door") is True, "constructive door not named in one sentence"),
("R3", r.get("revision") is True, "revision survival unshown"),
("R4", r.get("mode") in ("absence", "inertness"), "certification mode unprinted")]:
if rid != skip and not ok: return "[?]", f"{rid} fail: {why}"
return "[Psi]", f"terminal on the formal-alone register, gate one certified by {r['mode']}"
Executed. Positive control emits [Ψ] with the mode printed. Gate controls 4 of 4 land at exactly their gate. Ablation leaks 4 of 4: deleting any gate leaks the token on its own control, so every gate is load-bearing by mutation. Riders 4 of 4. Intake routes ['[?]', '[X]', '[?]', '[?]']. Doors route ['[RESOLVE]', '[X]'].
The card's own negative control, which must route out and does. At p = 3 the critical order is a* = 1/2, exponent exactly 0, inert, and the card admits. At a = 3/4 the exponent is 1/2, not inert, and the reading routes [?] at Ψ-1. At a = 1/3 the exponent is −1/3, not inert, and it routes [?] at Ψ-1. The token fires on the critical line and nowhere else in the family, which is what keeps it rare.
8 · The four-token table, with the mode column
| token | halts in | mechanism | gate-one mode | exemplar |
|---|---|---|---|---|
| [Ξ₀] | the reader | orientation-blindness, the sign unreadable by theorem | n/a | Riemann |
| [Ø₀] | the terrain | rootless terrain walled by structural barriers | n/a | P vs NP |
| [Ψ] | the witness | terminus: nothing to read from, nothing to author | absence | Hodge at rigid classes |
| [Ψ] | the witness | same | inertness | Navier-Stokes at the critical locus |
Three loci, three tokens, and the fourth row is a second occupant rather than a fourth token.
9 · Falsifiers
F1. A uniform modulus supplied at a terminal class, or a proof that one exists. Blast radius: this card entirely; the companion's conditional theorem becomes unconditional. The constructive door.
F2. A fifth reading route outside the four, supplying the modulus with its output shown not to be a function of supplied data. Blast radius: the count law and the relocation channel; the supply channel stands.
F3. A datum family on which every dominating readout carries strictly positive conditional information about the datum beyond its norm. Blast radius: the axiom itself; this card survives, having said nothing about the axiom's truth.
F4, on the token adjudication. A fourth halting locus, distinct from reader, terrain and witness, exhibited on any object. Blast radius: section 1 and the refusal of a new token; the rest of the card is unaffected.
10 · Grades and perimeter
Walls theorem-grade by citation, W4 excepted and labelled. The relocation census structural. The critical exponent exact arithmetic; the reading that inertness constitutes a terminus is structural, this desk's own, and unrefereed, which is the card's load-bearing weakness against its parent, whose gate one is theorem-grade by classical residue calculus with an executable test. Ψ-2, Ψ-3 and Ψ-4 structural and argued, not certified per class. The token adjudication structural on the indexing principle and exact on the differentia test. The emitter engineering-grade, its controls executed. The information form of the axiom analytic on the definition of conditional mutual information.
Perimeter. Nothing here bears on whether the axiom is true, on whether it is provable, or on whether the Navier-Stokes problem is open. The unrestricted claim that no proof can exist is barred in every vocabulary and this card is bound by that before anyone else. The one aperture sentence: the deciding input is a constructed modulus and lies outside the formal-alone register's reach, located and uncrossed. Every imagined modulus not supplied is fenced as Ghost. ΔM = 0.