Prime-valuation error from prime-power column discrepancy
ProvedErdos390.prime_power_column_valuation_error_leerdos390prime-valuationsrounding
Let be finite, , and . Let . Suppose every prime-power divisibility column has discrepancy at most . Then for every prime ,
This converts the finite incidence discrepancy estimate into the valuation-error budget used by the correction bank. The conclusion holds for arbitrary real vectors satisfying the column bound.
Preamble
import Definitions.Def_erdos390_prime_power_rounding open scoped BigOperators open Erdos390.WholePaper
Formal statement
theorem Erdos390.prime_power_column_valuation_error_le
{A : Type*} [Fintype A]
(value : A → ℕ) (M d : ℕ) (X x : A → ℝ)
(hM : 0 < M)
(hvaluePos : ∀ a, 0 < value a)
(hvalueLe : ∀ a, value a ≤ M)
(hcolumn : ∀ q : ↥(primePowerColumns M),
|∑ a, (X a - x a) *
zeroOneColumn
(fun q' a' ↦ primePowerInc M q' (value a')) q a| ≤
(4 * d : ℝ))
{p : ℕ} (hp : p.Prime) :
|roundingValuationError value X x p| ≤
(4 * d * Nat.log p M : ℝ) := by sorrySource
Shouqiao Wang, A Proposed Solution to Erdos Problem 390, Section 10, equations rounding-prime-power-column, rounding-column-degree, rounding-error-box, and rounding-no-rough-error. https://github.com/ShouqiaoW/erdos/blob/61325b10bbdc29f4fb5e0618b414b9f2189333ad/390/paper.tex; corresponding Lean files PrimePowerColumns.lean, ValuationError.lean and GuardedExactificationAlgebra.lean.