Nomological Havituation

June 30, 2026 | BY ZeroDivide EDIT

 # APEX-PSP-NOMOS-01 · The Cost-Gradient Emergence of Object-Law and the Incompressible 

NOMOS-01: cost-gradient mechanism that is derivable from RA and RAM, carries a conserved invariant, and locates its own wall as a theorem rather than a regress. Supersedes BA-004

## REGISTER I · LINGUISTIC · SEAL L · LOADS FIRST · ORIENTATION-FIXING

The kinetic register's three-seal law loads the linguistic seal first because the decomposition the geometry and the algebra consume is forced semantically, before any sign-blind instrument runs. Here the decisive distinction is made in the meaning of one word, and the orientation the determinant cannot recover is set.

**L.1 · Parse.** Candidate proposition P: *law emerges from RA by cost-reducing groove-entrenchment.*

**L.2 · The word that carries the whole verdict.** "Law" in P is ambiguous across a quantifier, and the ambiguity is the entire result. Read one way: *an object-law*, a particular regularity among the laws, the kind a recognizer entrenches. Read the other way: *law-as-such*, lawfulness itself, the move from no-law to law. The two readings are not two strengths of one claim. They are two propositions, and P is true on the first and false on the second. This split is linguistic. It precedes geometry and algebra. It is the sign the orientation-blind kernel will not be able to read, so it is read and fixed here.

**L.3 · Atomic decomposition (deletion test, LIT-disjoint).**

- **A₁ · existence.** There is a substrate that acts and pays, RA, ΔE_k greater than zero, the actuation floor.

- **A₂ · kinetic.** Repeated actuation traverses and deepens a groove, the cheap-reuse dynamics, remembering as the re-finding of a prior path.

- **A₃ · registration.** The entrenched groove is read as an object-law, regularity registered.

Delete any slot and the factual content is incomplete. Three irreducible slots under pairwise-disjoint vocabulary. No register-routing violation. **[⟀] at the semantic register.**

**L.4 · The orientation read, carried forward.** The directional content of P is *conversion*: from redundancy that is already present, toward a groove that becomes actualized. The arrow runs latent-to-entrenched, never random-to-lawful. This sign, conversion-not-creation, is the Platonic Impressed Plenum of the proposition. It is fixed at the linguistic register and handed to geometry and algebra. The kernel will confirm magnitude and independence. It will not be permitted to set this sign, because by orientation-blindness it cannot.

**L.5 · The lexical correction to the superseded card.** "Habituation" overclaimed by lexical suggestion, implying laws-as-such form by habit. The honest verb is *entrenchment*. Habituation entrenches an existing groove. It does not originate the law the groove expresses. The correction is made in the word before it is made in the geometry.

## REGISTER II · GEOMETRIC · SEAL G · LOADS SECOND · STRUCTURE

The geometry gives the cost picture its faces and locates the floor. It loads after the sign is fixed and before the magnitude is read.

**G.1 · The σ-split.** σ is conjugation on ℍ, σ² equal to identity. Its +1 eigenspace is Fix(σ) equal to ℝ equal to Z(ℍ), the Ground, dimension 1. Its −1 eigenspace is Im ℍ, the chiral residence, dimension 3. The split is exact: eigenvalues {−1, −1, −1, +1}, det(σ restricted to the residence) equal to det(−I₃) equal to −1, orientation-reversing, so the residence is handed before anything stands in it, which is the algebraic face of the sign Register I fixed.

**G.2 · The cost picture, mapped onto the split.** Take the substrate dynamics σ-symmetric, the condition that makes σ a genuine involution of the system. Then:

- The symmetric drift vanishes exactly where the σ-odd component vanishes, on Fix(σ). The Ground is the fixed-point set, zero drift, no gradient, zero maintenance cost, infinite persistence. This is L_1, the imprint, the long-term bank, carrying no local gradient per sPSP-TIME-02.

- The chiral residence Im ℍ is the σ-odd content, the gradient-bearing grooves, the payable and harvestable structure, L_2, traversed and directional. Maintenance cost is monotone in the chiral norm ‖x_odd‖. Three chiral degrees of freedom are the content that must be paid for. One achiral degree is the free floor. The σ-split is the cost ledger.

**G.3 · The emergence loop, geometrically.** Monism (substrate equal to topology equal to actuation) makes an actuation an inscription, a trace laid in the substrate, so a directional vector is cut into the residence with each act. The Return projects the composed triad toward the Ground, scalar contact, λ not zero. Remembering finds the prior groove and lowers the cost of re-traversal. RA least-action concentrates the next actuation on the cheaper path. More flux runs the groove, the groove cuts deeper, sPSP-TIME-02 again. Occupation lowers future cost, lower cost pulls future occupation. This is the positive feedback the superseded card lacked, and it is broken ergodicity, the system trapped in a basin and not exploring, the exact inverse of the retired Markov-ergodic engine.

**G.4 · The infinite-barrier witness.** Persistence is escape time, τ approximately τ_0 · exp(ΔU / k_B T), Kramers and Arrhenius, Freidlin-Wentzell in the field case. The proton is the measured instance at the L_1 end: by sPSP-PROTON-02, baryon number is a Hopf invariant and the Q equal to 1 to Q equal to 0 transition must cross a singular field of infinite gradient energy, so decay is topological forbiddance, a basin so deep it reads L_1-grade permanent. The proton does not forget itself because self-erasure costs infinite gradient energy.

**G.5 · Forgetting and remembering, the two signs of one gradient.** Forgetting is erasure, Landauer-positive, the costly direction, the metered Barzakh valve of sPSP-FORGET-02 that stops the cheap direction from carving everything into one channel. Remembering is reuse, cost-saving, the cheap direction, the compressed groove. They are not opposites. They are the brake and the accelerator on one cost gradient over the residence, with the Ground as the gradient's floor.

**G.6 · The geometric statement of the wall.** The residence is finite-dimensional and bounded. The Ground is the fixed locus. You can rotate within the residence, relabel grooves, deepen them. You cannot carve away the Ground. The harvestable content lives in the three chiral axes. The floor is the one achiral axis, and it is not a groove. **[⟀] on the σ-split and the eigenspace identities, theorem-grade. [S] on the cost-mapping and the loop.**

## REGISTER III · MATHEMATICAL · THE KERNEL · LOADS THIRD · MAGNITUDE ONLY

The kernel reads magnitude through det(R) equal to λ² and is blind to sign. It runs last, after the sign is fixed and the structure is set, as confirmation. Three calculations, executed, reproducible. Seed-free, explicit unit axes.


The three warrant axes are the three registers themselves:

- **u_F** the actuation floor, RA and least-action.

- **u_E** the groove-entrenchment dynamics, the deepening.

- **u_ER** the regularity registered as object-law, whose independent content is exactly the harvestable redundancy R(X).


```

CALC 1  OBJECT-LAW EMERGENCE   (registration axis carries independent content)

  u_F=[1,0.20,0.10]  u_E=[0.30,1,0.20]  u_ER=[0.15,0.25,1]

  lambda = Re(qF qE qER)      = -0.783084615286

  det(R) = lambda^2           =  0.613221514698

  |lambda^2 - det(R)|         =  1.11e-16          (identity holds at machine precision)

  -det[frame] vs lambda       = -0.783084615286   (match 0.00e+00)

  det(G), unit axes => G=R    =  0.613221514698

  rank = 3   kappa(R) = 3.8430

  VERDICT                     =  [LOCK]  three independent axes


CALC 2  ORIENTATION-BLINDNESS   (the reason Linguistic loads FIRST)

  reflect u_E -> -u_E

  lambda reflected            = +0.783084615286   (sign ratio -1.000000)

  det(R) reflected            =  0.613221514698

  |det(R) - det(R)_reflected| =  0.00e+00

  the LOCK is identical, the DIRECTION flips. The kernel cannot read

  conversion-versus-creation. That sign was fixed at Register I.


CALC 3  LAW-AS-SUCH GENESIS     (registration axis manufactured from nothing)

  u_ER = 0.6 u_F + 0.4 u_E   (no independent source; R(X) = 0)

  lambda                      = -2.776e-17

  det(R)                      =  0.000e+00

  collapse floor eps          =  6.661e-14

  rank = 2

  VERDICT                     =  [X]  COLLAPSE: no third dimension exists to lock

```


**M.1 · What CALC 1 seals.** The three registers are genuinely independent axes. The kernel identity λ² equal to det(R) closes at 1.11 × 10⁻¹⁶, the triple product equals minus the frame determinant exactly, the conditioning is benign. Object-law emergence locks. **[⟀]**


**M.2 · What CALC 2 forces, and why the order is load-bearing.** Reflect the entrenchment axis and λ flips sign while det(R) is bit-identical. The lock for "object-law emerges" and the lock for its mirror are the same number. Had the math loaded first, it would have certified a lock for both the conversion reading and a creation reading, and could not have told them apart, because the determinant reads volume and not orientation. The direction is unreadable downstream. Fixing it at the linguistic register is not stylistic. It is the only register that can carry the sign. **[T]**


**M.3 · What CALC 3 proves, orientation-independently.** Genesis fails, and it fails not by orientation but by rank. When the third axis is manufactured from the span of the first two, there is no independent content, the system is rank 2, det(R) sits at the collapse floor, and the lock cannot fire. This is the honest, sign-free reason law-as-such does not emerge: there is no third dimension to lock onto when the would-be law is assembled from what is already there. **[X]**


**M.4 · The bridge to the incompressible floor.** The independent content on u_ER is exactly the redundancy R(X) equal to raw minus K(X), measured in the prior battery. A lawful actuation stream carried R equal to 79.5 percent, an independent u_ER, CALC 1, lock. A lawless iid stream carried R equal to 0.0 percent, a u_ER collapsed into the manifest plane, CALC 3, collapse. The kernel collapse and the incompressibility theorem are one event read in two registers.


```

  lawful stream   R = 79.5%  -> u_ER independent -> [LOCK]      object-law

  lawless stream  R =  0.0%  -> u_ER in-plane    -> [X] collapse  no law

```


---


## 4 · THE INCOMPRESSIBLE FLOOR · THE FORMAL CORE


Model RA as a stochastic source. Each symbol is one actuation over the substrate degrees of freedom. By Landauer the irreducible bit-content of the actuation stream X is its Kolmogorov complexity K(X), and the cost floor to hold and erase X is bounded below by k_B T ln 2 · K(X).


Pattern recognition is the two-part MDL code: a recognizer is a model M, total cost L(M) + L(X|M), and recognition minimizes it. The minimum achievable is K(X). So pattern recognition is the descent of realized cost toward the K(X) floor from above. That descent is the RA-RA Return running down the cost gradient. The groove it cuts is M*, the compressing regularity. This is object-law emergence, formalized and quantified.


The fuel is named and conserved. Define harvestable lawfulness R(X) equal to raw minus K(X), the redundancy. It is the entire reservoir a recognizer can convert into an entrenched groove. The recoverable energy is R(X) · k_B T ln 2. R(X) is a property of the source, not of the recognizer. The recognizer cannot inflate it.


**The wall, now a theorem.** Law-as-such would require R(X) greater than zero on a random source, the manufacture of redundancy from incompressibility. The incompressibility theorem forbids it: the fraction of length-n streams compressible by more than c bits is below 2⁻ᶜ, so almost every actuation stream is lawless, and on a lawless stream no amount of actuation or recognition produces a law. You cannot compress noise. Stream B confirmed it at R equal to 0.0 percent. Stream C, a deterministic generator with tiny true K but statistically flat output, confirmed the second bound: even locating the true floor is uncomputable by halting, so a real recognizer reaches only an upper bound on K and the residual gap is uncomputable. You cannot manufacture the lawfulness that is absent, and you cannot fully harvest the lawfulness that is present.


**K(X) is the conserved invariant and the formal image of RA.** It is the irreducible actuation cost at the bottom of every description, present in all of them, compressible by none, underivable for the same reason it is incompressible. The empty throne is now a quantity. It is the K-floor. The regress of MD-PSP-FOUNDATION-01 bottoms out here, at RA, premise-grade, the one premise whose denial enacts it.


**Arsenal-invariance, the strengthening.** The wall is a fixed point of the whole toolkit, not a gap one method missed. Maximum entropy derives the Gibbs form of object-laws but consumes the MaxEnt principle. Freidlin-Wentzell derives least-action as the most-probable path, so least-action emerges as statistics, but consumes the reference measure. MDL derives emergence as redundancy-harvesting but consumes compressibility, which is pre-existing lawfulness. Renormalization and the central limit theorem derive universal effective laws but consume the aggregation rule and the measure. Every path derives the form of object-laws and entrenches structure already present. Every path consumes one meta-law it does not derive. The invariance across independent methods is stronger evidence than any single regress.


---


## 5 · WARRANT LEDGER


- **Theorem-grade [T].** The σ-split and eigenspace dimensions; the orientation-reversal det(σ|residence) equal to −1; the kernel identity λ² equal to det(R) and λ equal to minus the frame determinant; orientation-blindness of the squared lock; the Kramers-Arrhenius escape law; the source-coding bound and the incompressibility theorem; the proton topological barrier (sPSP-PROTON-02 Claim A); the rank-2 collapse of a manufactured third axis.

- **Structural [S].** The mapping of the cost picture onto the σ-split; the Ground as the zero-cost permanent attractor; the residence as the harvestable grooves; the emergence loop as broken-ergodicity groove-entrenchment; R(X) as the object-law fuel; the L_3/L_2/L_1 stratification as an escape-time ordering.

- **Operational-procedural.** The linguistic forcing of the object-law versus law-as-such distinction, reproducible by the deletion test and the LIT.

- **Premise-grade (the floor).** RA, ΔE_k greater than zero, the actuation floor, the one premise whose denial enacts it (AEGIS-01); RAM and the σ-symmetry of the dynamics; monism, the inscription premise without which an actuation leaves no reusable trace; the σ-fixed Ground as a definite object, metaphysics quarantined.

- **By MD-PSP-FOUNDATION-01.** NOMOS-01 seals object-law emergence and the incompressibility wall at their grades and adds no warrant to RA, RAM, or monism beneath them. The root cannot be climbed to. ΔM equal to zero.


---


## 6 · DEPENDENCIES, CONNECTIONS, SUPERSESSION


**↑ DEPENDS:** RA · RAM (σ, the binding involution) · BA-001a (Landauer floor) · MONISM-MASTER-01 (substrate equal to topology equal to actuation, the inscription premise) · sPSP-TIME-02 (groove versus imprint, gradient-bearing versus gradient-free) · MD-PSP-FOUNDATION-01 (the floor, the root not climbable-to) · ORIENT-01 (orientation-blindness of det(R) equal to λ²) · QUAT-01 / BA-018 (the closed-form kernel) · sPSP-PROTON-02 (the infinite-barrier witness) · FORGET-01 / sPSP-FORGET-02 (forgetting as metered erasure) · AEGIS-01 (RA self-enactment).


**↔ CONNECTS:** B.Q-MASTER (the same localization shape, harvest the structure present, never manufacture the structure absent) · APEX-PSP-CHEM-01 (L_2 attractors actualized as matter) · sPSP-TIME-02 (the two signs of the cost gradient).


**SUPERSEDES:** BA-004 (Nomological Habituation, CN/C/C) and sPSP-122 (Nomological Habituation via Markov-Ergodic, CN/T1/C). The Markov-ergodic mechanism is retired as self-contradicting. The cost-gradient mechanism with the incompressible floor replaces it.


---


## 7 · VERDICT


**[⟀] S — Object-law emergence, derived and quantified.** Cost-reducing groove-entrenchment via monism plus sPSP-TIME-02 plus RA least-action, formalized as MDL cost-descent toward the K(X) floor, fuel R(X) equal to raw minus K(X), recoverable energy R(X) · k_B T ln 2. Kernel CALC 1 locks the three independent registers, λ equal to −0.783084615286, det(R) equal to 0.613221514698, identity residual 1.11 × 10⁻¹⁶. The battery realizes it at 79.5 percent harvest on a lawful stream. Theorem-grade on the identity and the source-coding mathematics, structural on the RA-and-groove mapping. This is law-as-habit at the object level, derived, not asserted.


**Net.** RA does not emerge. Object-laws emerge on RA, as the harvest of whatever redundancy the actuation stream already carries, bounded above and below by a quantity no recognizer can move. The orientation that separates harvest from genesis is fixed at the linguistic register, the structure is read at the geometric register, and the magnitude is confirmed at the kernel, in that order, so the orientation-blind determinant never votes on direction. The statistics gave the engine and the fuel gauge, and in the same breath the proof that the tank is finite and that RA is the floor of it.


[⟀] FORGED · APEX-PSP-NOMOS-01 · L→G→M · OBJECT-LAW EMERGENCE DERIVED · LAW-AS-SUCH FORECLOSED BY THEOREM · K(X) THE CONSERVED FLOOR · RA THE INCOMPRESSIBLE BOTTOM · SUPERSEDES BA-004 · ΔM = 0