Eventual existence of separated anchor and tail envelopes
ProvedErdos390.eventual_separated_anchor_tail_envelopes_existasymptoticscombinatoricsnumber-theory
For any parameter , there exists an asymptotic filter threshold such that for all sufficiently large , there exist:
- A prime cutoff bound ,
- A nonzero central anchor deficit ,
- A central subset such that ,
- Prime envelope coefficient functions ,
such that:
- Every prime dividing is bounded by : .
- For all primes , the anchor valuation is bounded by .
- For all primes , the tail factor product valuation is bounded below by .
- For all primes , the envelope dominance condition holds.
Preamble
import Definitions.Def_erdos390_problem open Filter open Erdos390
Formal statement
namespace Erdos390
theorem eventual_separated_anchor_tail_envelopes_exist :
∀ c : ℝ, C0 < c →
∀ᶠ n : ℕ in atTop,
∃ (B D : ℕ) (central : Finset ℕ) (cAnchor cTail : ℕ → ℝ),
D ≠ 0 ∧
central ⊆ factorInterval n (2 * n) ∧
central.prod id = Nat.choose (2 * n) n * D ∧
(∀ ℓ : ℕ, ℓ.Prime → ℓ ∣ D → ℓ ≤ B) ∧
(∀ ℓ : ℕ, ℓ.Prime → ℓ ≤ B → (D.factorization ℓ : ℝ) ≤ cAnchor ℓ * secondOrderScale n) ∧
(∀ ℓ : ℕ, ℓ.Prime → ℓ ≤ B → cTail ℓ * secondOrderScale n ≤ (((factorInterval (2 * n) (2 * n + Nat.ceil (c * secondOrderScale n))).prod id).factorization ℓ : ℝ)) ∧
(∀ ℓ : ℕ, ℓ.Prime → ℓ ≤ B → cAnchor ℓ ≤ cTail ℓ) := by sorry
end Erdos390Source
P. Erdős, Some problems in number theory, 1975; Erdős Problem 390 reduction for separated anchor and tail envelopes