Reduction: for all implies the goal
ProvedErdos3.erdos_3_of_r_boundPartial-summation reduction. Suppose that for every there is with for all large . Then the goal holds. Indeed, if had no -term progression then for all , and partial summation gives
This is the standard route by which quantitative bounds for Szemerédi's theorem bear on Erdős Problem #3 (it is how Bloom–Sisask settle ).
import Mathlib import Definitions.Def_Erdos142Basic
namespace Erdos3
open Erdos142
theorem erdos_3_of_r_bound
(h : ∀ k : ℕ, 3 ≤ k → ∃ c : ℝ, 0 < c ∧ ∀ᶠ N : ℕ in Filter.atTop,
(r k N : ℝ) ≤ (N : ℝ) / (Real.log N) ^ (1 + c)) :
∀ A : Set ℕ, (¬ Summable fun a : A ↦ 1 / (a : ℝ)) →
∃ᶠ (k : ℕ) in Filter.atTop, ∃ S ⊆ A, IsAPOfLength S k := by
sorry
end Erdos3Read-back
What the Lean code literally says, in plain math · Aristotle (Harmonic) — same agent that drafted the statement; NOT an independent auditor
Non-blind read-back. This read-back was written by the same agent that drafted the Lean statement, with full knowledge of the source and of the intended meaning. It is not blind, independent auditor testimony and must not be treated as such; it was produced this way on the explicit instruction of the proposal owner. Reviewers should compare it against the Lean code themselves.
Statement. Assume: for every natural number there is a real such that for all sufficiently large , (natural log, real power; may depend on ). Then the conclusion of the goal holds: for every , if is not summable in (the family indexed by the elements of ; since all terms are this is the same as the series diverging to , and in particular is infinite). If , its term is , which the formal system evaluates to , so contributes nothing. then for infinitely many there is a subset that is an arithmetic progression of length .
is the supremum (in ) of over finite sets that are free of length- progressions, meaning: every subset of that is an arithmetic progression of length (in the sense above) forces . For this says contains no distinct terms in arithmetic progression; for the condition is empty and . The published definition file proves and that the supremum bounds every such .
Definitions used (from the imported definition file Erdos142Basic). For a set of natural numbers and , is an arithmetic progression of length means: there exist natural numbers such that has exactly elements (cardinality taken in ) and
The cardinality condition forces as soon as (with the set is the singleton ). Length is satisfied only by , length by any singleton.
Remarks. The hypothesis is restricted to because for one has , which would make an unrestricted hypothesis false and the reduction vacuous. With the hypothesis is not known to be false (Behrend-type constructions give only -type lower bounds, which are compatible with it); whether it holds is open for .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.