The A166944 target implies the Twin Prime Conjecture
Opentwin_prime_conjecture_of_targetAssume the A166944 target: every difference record above of the Rowland-type recursion
is the greater member of a twin-prime pair. Then the Twin Prime Conjecture holds:
Suppose the set of such were finite. Then it has an upper bound , so every prime with prime satisfies . By the companion theorem unbounded_greater_twin_primes_of_target, the A166944 target supplies such a prime with , and is one of the primes counted by the set: this contradicts .
This is the mission link. It exhibits the A166944 conjecture as a sufficient condition for the Twin Prime Conjecture, so a proof of the A166944 target would resolve the mission goal. The A166944 conjecture and the Twin Prime Conjecture are both open; this theorem is a conditional reduction and does not prove either of them. Its role on the platform is to record the reduction edge, so that the mission's goal theorem becomes a tracked descendant of the A166944 chain rather than an isolated target.
Formalization Note A166944Research.Target is imported from the A166944 definition bundle and is used only as a hypothesis. The conclusion is stated with Set.Infinite on the same set-builder as the platform goal twin_prime_conjecture, so the type matches that goal exactly; infinitude is refuted from an upper bound via Set.Finite.bddAbove.
import Mathlib.Data.Nat.Prime.Defs import Mathlib.Data.Set.Finite.Basic import Mathlib.Data.Set.Finite.Lattice import Mathlib.Order.Bounds.Basic import Definitions.Def_a166944_record_core import Theorems.Thm_A166944Research_unbounded_greater_twin_primes_of_target open A166944Research
theorem twin_prime_conjecture_of_target (hTarget : A166944Research.Target) :
{p : ℕ | Nat.Prime p ∧ Nat.Prime (p + 2)}.Infinite := by sorry