Theorem 10.3 — Central anchor and tail quotient decomposition
OpenErdos390.eventual_central_tail_splitasymptoticscombinatoricserdos-problemsnumber-theory
Theorem 10.3 (Central Anchor and Tail Quotient Decomposition)
Fix a constant , where , and put .
For all sufficiently large , there exist a positive integer divisor , a central factor subset , and a residual tail factor subset satisfying the exact product identities:
and
This isolates the constructive core of Theorem 10.3 (equations (10.27)-(10.28) of Shouqiao Wang's paper) from the finite set union algebra and rational quotient cancellation.
Preamble
import Definitions.Def_erdos390_problem open Filter
Formal statement
namespace Erdos390
open Filter
/-- Theorem 10.3 (Central anchor and tail quotient decomposition):
For every constant `c > C0`, for sufficiently large `n`, there exists an auxiliary
divisor `D` of the upper tail, a central subset of `(n, 2n]` whose product is `binom(2n, n) * D`,
and a residual tail subset of `(2n, 2n + ⌈c n / log n⌉]` whose product times `D` is the
full tail product. -/
theorem eventual_central_tail_split :
∀ c : ℝ, C0 < c →
∀ᶠ n : ℕ in atTop,
∃ (D : ℕ) (central tail : Finset ℕ),
central ⊆ factorInterval n (2 * n) ∧
tail ⊆ factorInterval (2 * n) (2 * n + Nat.ceil (c * secondOrderScale n)) ∧
central.prod id = Nat.choose (2 * n) n * D ∧
tail.prod id * D = (factorInterval (2 * n) (2 * n + Nat.ceil (c * secondOrderScale n))).prod id := by sorry
end Erdos390Source
Shouqiao Wang, A Proposed Solution to Erdős Problem 390, Section 10, Theorem 10.3 (arXiv / GitHub 61325b1, paper.tex lines 10100-10145)