The A166944 canonical replay satisfies a relaxed index cap, and this cap replaces the travel bound
OpenA166944Research.a166944_relaxed_index_capLet be the Rowland-type recursion of OEIS A166944, its first differences and its offset from the identity. Let be a difference record whose value is already known to be the greater member of a twin-prime pair, so that ; the canonical replay of the moving-horizon dynamics then starts at the state and jumps from each state to the next index at which the recursion's gcd is nontrivial. Write for the state at which that replay terminates.
This theorem bounds the terminal index:
In words, is at most , or about .
Why this and not the stronger bound
The development has carried the travel bound
equivalently , as its single stated obstruction for some time, and a dozen independent routes were recorded as all ending there. That framing was too strong. The only consumer of the travel bound is a step that decides the next record from the replay, and measuring what its arithmetic actually needs shows it tolerates up to : the relaxation is , which at the threshold is about million.
So this statement is strictly easier than the travel bound while being sufficient for the same conclusions. The evidence that it is genuinely weaker, rather than a restatement, is a witnessed pair at with and : it satisfies and while violating the travel bound. Hence the relaxed cap does not imply the old one, and a proof of this statement would not be a restatement of it either.
Role in the development
The companion hypothesis is separately available and is not part of this statement. Together the two caps replace the travel bound in the induction that derives the index theorem and the twin-primality of records, so this single inequality is what stands between the finite certificates -- kernel-verified through record -- and the A166944 conjecture, and through it the Twin Prime Conjecture.
One structural gain is worth recording: the case analysis has two branches, and the branch where the replay crosses the record no longer depends on this cap at all. It is discharged by an existing theorem about horizon growth. Only the quiet branch consumes the bound stated here.
Formalization Note The quantifier over is the lower bound at which the finite certificates stop; below it the statement is already proved by explicit replay. IsGreaterTwinPrime M is carried because the route to this point is an induction that only needs the bound after a record already known to be a twin prime, which is how the development avoids circularity. The constant in is optimal in the sense that is false for the arithmetic in question, while is exactly what the proof needs.
import Definitions.Def_a166944_moving_horizon open A166944Research
namespace A166944Research
theorem a166944_relaxed_index_cap :
∀ {M sf Cf p : Nat}, 45895573 ≤ M → IsGreaterTwinPrime M → d (M + 2) = M →
HasMovingHorizonPathTo (M + 2) (2 * M - 2) sf Cf p →
IsAttainedPreviousMaximum M sf → 4 * sf ≤ 7 * M - 1 := by
sorry
end A166944Research