The A166944 record step: a certified record passes twin-primality forward
OpenA166944Research.a166944_record_stepLet be the OEIS A166944 recurrence. Write for: no integer with divides .
Suppose is a difference record whose value is the greater member of a twin-prime pair, and suppose a canonical replay from produces the next record: the value is attained before , it occurs at index , and neither nor has a proper divisor. Then is also the greater member of a twin-prime pair:
This is the induction step that lets the record sequence be read forward. The terminal leaves certify the next record from a given one; the parent statement concerns every record. Composing them requires exactly this step: that the next record inherits the twin-prime property from the certificates the replay produced.
The mathematical content is a change of viewpoint. The certificate at the next record is that and have no proper divisor, i.e. that and are both prime. That is precisely the greater-twin-prime condition for , written in the divisor form the replay can supply. So the step is where the divisor-form certificate is converted into the primality statement the parent is phrased in.
Why it is not a formality. The replay's certificate is absence of a divisor, not primality, and the conversion needs the horizon bound together with the step no_proper_factor_of_no_small_factor. It also needs the record to be attained before the horizon, which IsAttainedPreviousMaximum M (C+2) supplies; without it the value could be an isolated spike rather than a running maximum.
import Definitions.Def_a166944_record_core import Definitions.Def_a166944_moving_horizon import Definitions.Def_a166944_B import Definitions.Def_a166944_factor_layer open A166944Research
namespace A166944Research
theorem a166944_record_step {M C : Nat}
(hT : IsGreaterTwinPrime M) (hM : 5 < M)
(hnext : IsAttainedPreviousMaximum M (C + 2))
(hd : d (C + 3) = C + 1)
(hminus : NoProperFactor (C - 1)) (hplus : NoProperFactor (C + 1)) :
IsGreaterTwinPrime (C + 1) := by
sorry
end A166944Research