Anchor and tail envelope conjunction assembly
ProvedErdos390.anchor_tail_envelope_conjunctionasymptoticscombinatoricsnumber-theory
Let and . Let be prime valuation coefficient functions. Suppose that for every prime :
- The prime factor valuation of is bounded by the anchor envelope:
where . 2. The tail interval factor product dominates the tail envelope:
- The coefficient envelope dominance holds:
Then for every prime , the three bounds hold simultaneously as a conjunction:
Preamble
import Definitions.Def_erdos390_problem open Erdos390
Formal statement
namespace Erdos390
theorem anchor_tail_envelope_conjunction
{B D : ℕ} {c : ℝ} {n : ℕ} {cAnchor cTail : ℕ → ℝ}
(hanchor : ∀ ℓ : ℕ, ℓ.Prime → ℓ ≤ B → (D.factorization ℓ : ℝ) ≤ cAnchor ℓ * secondOrderScale n)
(htail : ∀ ℓ : ℕ, ℓ.Prime → ℓ ≤ B → cTail ℓ * secondOrderScale n ≤ (((factorInterval (2 * n) (2 * n + Nat.ceil (c * secondOrderScale n))).prod id).factorization ℓ : ℝ))
(horder : ∀ ℓ : ℕ, ℓ.Prime → ℓ ≤ B → cAnchor ℓ ≤ cTail ℓ) :
∀ ℓ : ℕ, ℓ.Prime → ℓ ≤ B →
(D.factorization ℓ : ℝ) ≤ cAnchor ℓ * secondOrderScale n ∧
cTail ℓ * secondOrderScale n ≤ (((factorInterval (2 * n) (2 * n + Nat.ceil (c * secondOrderScale n))).prod id).factorization ℓ : ℝ) ∧
cAnchor ℓ ≤ cTail ℓ := by sorry
end Erdos390Source
P. Erdős, Some problems in number theory, 1975; Erdős Problem 390 decomposition for envelope conjunction