Monotonicity of -sparseness
ProvedBehrendWindows.atMostTwoPerAP_monoadditive-combinatoricsarithmetic-progressions
Let be finite, and . If is -sparse and
then is -sparse.
In one statement this says that -sparseness passes to subsets (), to translates () and to shorter progressions ().
Preamble
import Mathlib import Definitions.Def_BehrendWindows_AtMostTwoPerAP
Formal statement
namespace BehrendWindows
theorem atMostTwoPerAP_mono {T T' : Finset ℤ} {m m' : ℕ} (c : ℤ)
(hT : T' ⊆ T.image (· + c)) (hm : m' ≤ m) (h : AtMostTwoPerAP T m) :
AtMostTwoPerAP T' m' := by sorry
end BehrendWindows
Source
No published source states the version uniform in m; statement from the mission proposal, milestone 5
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Let be finite sets of integers, let , and let .
Say a finite set has property for when the following holds. For every , every with ( may be negative), and all natural numbers , the three integers , and are not all in .
Assume:
- ;
- ;
- holds.
Then holds.
Edge cases:
- For no indices exist, so is vacuously true for every . Hence the conclusion is automatic when , and the hypothesis is automatic when .
- may be empty.
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.