The A166944 canonical travel bound from record 45895573 onward
OpenA166944Research.a166944_travel_bound_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 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 follows the recurrence by jumping from each state to the next index at which a gcd in the recursion is nontrivial. Write for the state at which that replay terminates.
The theorem bounds how far the replay travels before it terminates:
In words: the terminal index exceeds the starting index by at most half the record value. Equivalently, writing for a travel length , the bound is .
This is the last remaining ingredient for the A166944 conjecture. The index and twin-primality conclusions are already reduced to it: the project's REACH.md records that the finite replay certificates reach record , and that everything beyond them follows from this single inequality. Under the inequality is exactly the index cap , so proving either form is the same task.
The statement is stated as a bound on the replay rather than on the recurrence, because the replay is what the existing theory controls: the project proves a per-step increment of at least two (CountFromIndex), a per-step gap of at most twice the record (GapBound), and that the reservoir coordinate at the exit is determined by the accumulated excess (BIntegrate). What none of them supplies is a bound on the number of steps, and that is what this inequality encodes: the count satisfies , so a bound on the travel is a bound on the count.
The verified certificates show the bound holds with room to spare: at the observed travel is events against an allowance of , a factor of about . The margin grows with , which is why a finite check cannot settle the statement and a uniform argument is needed.
Formalization Note The quantifier over is the lower bound at which the finite certificates stop; below it the bound is already proved by explicit replay. IsGreaterTwinPrime M is carried because the route to this point is an induction that only needs travel after a record already known to be a twin prime; this is how the project avoids circularity. IsAttainedPreviousMaximum M sf says every difference up to the terminal index is at most , which is what makes the replay 'capped'.
import Definitions.Def_a166944_moving_horizon open A166944Research
namespace A166944Research
theorem a166944_travel_bound_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 → 2 * (sf - (M + 2)) ≤ M := by
sorry
end A166944Research