Five primes below the analytic threshold
OpenTaoFivePrimes.five_primes_below_analytic_thresholdEvery odd with is a sum of at most five primes.
This is the range the circle-method argument of the mission does not reach. TaoFivePrimes.three_primes_near requires and TaoFivePrimes.liu_wang_three_primes requires , so together with this statement the odd numbers are covered with no gap, and TaoFivePrimes.five_primes follows.
The intended proof: peel primes off the top, then finish with verified Goldbach. Two inputs already present in this mission do it. TaoFivePrimes.prime_in_short_interval says that for there is a prime with
and TaoFivePrimes.even_goldbach_verified says every even number in is a sum of two primes. Starting from and applying the first three times,
and , so the remainder after three peels lies in the verified Goldbach range and contributes two more primes: five in all.
The threshold is exactly this computation. , and the hypothesis sits just under it, with about one percent to spare. So the constant appearing in three_primes_near and representationCount_pos is not an arbitrary convenience: it is the largest round threshold from which three applications of the Ramaré--Saouter gap bound still land inside the Goldbach verification. A fourth peel is not available, because prime_in_short_interval needs and the third remainder is already below the point where a further peel would help.
Parity is what makes the count come out at five. is odd and the peeled primes are odd (each is close to a number far larger than ), so the remainders alternate even, odd, even: the third remainder is even, which is what the Goldbach input requires. Peeling only twice would leave an odd remainder and no way to finish in two primes.
Small cases. Below the range where peeling applies the statement is immediate rather than special: for odd , the number is even and at most , so is a sum of three primes; and are themselves prime. The genuinely open content is therefore the middle range, where the number of peels needed varies with the size of and the hypothesis of the short-interval input has to be checked at each step.
import Mathlib import Definitions.Def_BraidsLinksMCG_ArtinBraidGroup import Definitions.Def_BraidsLinksMCG_ArtinEndo
namespace TaoFivePrimes
theorem five_primes_below_analytic_threshold (n : ℕ) (hodd : Odd n) (hn : 1 < n)
(hsmall : n < 87 * 10 ^ 35) :
∃ s : Multiset ℕ, s.card ≤ 5 ∧ (∀ p ∈ s, Nat.Prime p) ∧ s.sum = n := by sorry
end TaoFivePrimes