Conditional on the A166944 target, arbitrarily large primes have prime
ProvedA166944Research.unbounded_greater_twin_primes_of_targetAssume the A166944 target: every difference record of the Rowland-type recursion
that exceeds is the greater member of a twin-prime pair. Then arbitrarily large such primes exist:
The argument combines the two halves of the conjecture. Difference records are unbounded (difference_records_unbounded), so above any threshold there is a record ; the target applied to that record makes both and prime, and gives the claim. The constant is bookkeeping for the strict inequality in the target.
This is the reduction edge from the A166944 conjecture to the Twin Prime Conjecture. The conjecture itself is open; what is proved here is only the implication, so the statement is a conditional result and does not assert that the twin-prime conjecture has been proved. It is the interface through which any future proof of the target would immediately yield infinitely many twin primes, and it is the theorem to attack if one wants to see the conjecture's reach without engaging its arithmetic core.
Formalization Note Target and IsGreaterTwinPrime are imported from the A166944 definition bundle: IsGreaterTwinPrime p is p.Prime ∧ (p - 2).Prime, and Target is ∀ R, 5 < R → IsDifferenceRecord R → IsGreaterTwinPrime R. The hypothesis hTarget is an assumption of the theorem, never a proved claim.
import Definitions.Def_a166944_record_core import Mathlib.Data.Nat.Prime.Defs open A166944Research
namespace A166944Research
theorem unbounded_greater_twin_primes_of_target (hTarget : Target) (M : ℕ) :
∃ R : ℕ, M < R ∧ IsGreaterTwinPrime R := by sorry
end A166944Research