Case of the goal (Bloom–Sisask)
ProvedErdos3.bloom_sisask_three_apIf satisfies , then contains a three-term arithmetic progression with . This is the case of the goal, first established by Bloom and Sisask (2020) as a consequence of their bound on .
import Mathlib import Definitions.Def_Erdos142Basic
namespace Erdos3
open Erdos142
theorem bloom_sisask_three_ap : ∀ A : Set ℕ,
(¬ Summable fun a : A ↦ 1 / (a : ℝ)) → ∃ S ⊆ A, IsAPOfLength S 3 := 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. For every set : 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 there is a subset that is an arithmetic progression of length exactly , i.e. with three distinct elements (so ).
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.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.