The A166944 canonical replay keeps its terminal horizon below 3M+4
OpenA166944Research.a166944_horizon_cap_from_45895573Let 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 known to be the greater member of a twin-prime pair, so that ; the canonical replay 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 it terminates.
This theorem bounds the terminal horizon:
It is one half of a pair of caps that together replace the older, stronger travel bound in the induction deriving the index theorem and the twin-primality of records. The companion cap,
is strictly weaker than the travel bound -- travel gives , so the relaxation is , about million at the threshold . The pair does not imply the travel bound: at the pair satisfies both caps and violates travel, so the decomposition is a genuine weakening rather than a restatement.
Role
This is the cap that the replay's crossing branch consumes, and that branch is the reason the decomposition is worth having: it reaches its conclusion through an existing theorem about horizon growth and does not depend on the relaxed index cap at all. So the case analysis splits the obstruction, and only the quiet branch consumes the harder half.
Where it stands
The statement is not proved here. It is a uniform statement about the terminal state of a canonical replay, and the development's finite certificates -- kernel-verified through record -- cover only finitely many records. What has changed with this pair of caps is the strength of the target, not whether the target is reached.
Formalization Note The lower bound is where the development's explicit replay certificates stop; below it the statement is discharged by replay. IsGreaterTwinPrime M is carried because the route is an induction that only needs the caps after a record already known to be a twin prime, which is how the development avoids circularity.
import Definitions.Def_a166944_moving_horizon open A166944Research
namespace A166944Research
theorem a166944_horizon_cap_from_45895573 :
∀ {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 → Cf ≤ 3 * M + 4 := by
sorry
end A166944Research