The A166944 target follows from the travel bound at record 45895573
ProvedA166944Research.a166944_target_of_travelLet be the Rowland-type recursion of OEIS A166944 with first differences and offset , and let be a difference record. Write for the terminal state of the canonical replay started at , that is, the replay that jumps from each state to the next index at which the recursion's gcd is nontrivial.
Assume the travel bound: for every record already known to be the greater member of a twin-prime pair,
The theorem concludes the A166944 target:
So the conjecture follows from the travel bound. This is the reduction step of the project's attack: everything else has been discharged, either by proof or by finite computation.
The argument is an induction on records. Records are known to be unbounded, so the induction is well founded along the record sequence. For a record below the finite threshold the conclusion is a kernel-checked finite statement, obtained by replaying the recurrence and testing the two candidate factors. For a larger the previous record is itself a record above the threshold, so by induction it is a twin-prime greater member; the travel bound then controls the canonical replay started at , and the termination alternative of that replay forces the next record to be with both and free of proper divisors. That last step is where the travel bound is consumed: without it the replay could travel far enough to produce a value that is not forced in this way.
The threshold is not a mathematical constant: it is where the project's explicit replay certificates stop. Below it the statement is checked directly, so the theorem is unconditional there and the travel hypothesis is only used above it.
Formalization Note The hypothesis is stated in expanded form rather than through a named predicate so that this theorem can be read against the sibling a166944_travel_bound_from_45895573 directly; the two are the same proposition. The condition IsGreaterTwinPrime M is carried in the travel hypothesis because the induction only needs travel after a record whose twin-primality is already established, which is what keeps the argument non-circular.
import Definitions.Def_a166944_moving_horizon open A166944Research
namespace A166944Research
theorem a166944_target_of_travel
(htravel : ∀ {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 → 2 * (sf - (M + 2)) ≤ M) :
∀ R : Nat, 5 < R → IsDifferenceRecord R → IsGreaterTwinPrime R := by
sorry
end A166944Research