Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Monotonicity of mmm-sparseness

Proved
BehrendWindows.atMostTwoPerAP_mono

by pitimespi · Nov 21, 2026 · Mathlib 0df444a (Lean v4.33.1)

additive-combinatoricsarithmetic-progressions

Let T,T′⊂ZT,T'\subset\mathbb{Z}T,T′⊂Z be finite, c∈Zc\in\mathbb{Z}c∈Z and m′≤mm'\le mm′≤m. If TTT is mmm-sparse and

T′⊆T+c={t+c:t∈T},T'\subseteq T+c=\{t+c: t\in T\},T′⊆T+c={t+c:t∈T},

then T′T'T′ is m′m'm′-sparse.

In one statement this says that mmm-sparseness passes to subsets (c=0c=0c=0), to translates (T′=T+cT'=T+cT′=T+c) and to shorter progressions (m′≤mm'\le mm′≤m).

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 T,T′⊆ZT, T' \subseteq \mathbb{Z}T,T′⊆Z be finite sets of integers, let m,m′∈Nm, m' \in \mathbb{N}m,m′∈N, and let c∈Zc \in \mathbb{Z}c∈Z.

Say a finite set U⊆ZU \subseteq \mathbb{Z}U⊆Z has property P(U,r)\mathcal{P}(U, r)P(U,r) for r∈Nr \in \mathbb{N}r∈N when the following holds. For every a∈Za \in \mathbb{Z}a∈Z, every δ∈Z\delta \in \mathbb{Z}δ∈Z with δ≠0\delta \ne 0δ=0 (δ\deltaδ may be negative), and all natural numbers k1<k2<k3<rk_1 < k_2 < k_3 < rk1​<k2​<k3​<r, the three integers a+k1δa + k_1\deltaa+k1​δ, a+k2δa + k_2\deltaa+k2​δ and a+k3δa + k_3\deltaa+k3​δ are not all in UUU.

Assume:

  • T′⊆T+c={ t+c:t∈T }T' \subseteq T + c = \{\, t + c : t \in T \,\}T′⊆T+c={t+c:t∈T};
  • m′≤mm' \le mm′≤m;
  • P(T,m)\mathcal{P}(T, m)P(T,m) holds.

Then P(T′,m′)\mathcal{P}(T', m')P(T′,m′) holds.

Edge cases:

  • For r≤2r \le 2r≤2 no indices k1<k2<k3<rk_1 < k_2 < k_3 < rk1​<k2​<k3​<r exist, so P(U,r)\mathcal{P}(U, r)P(U,r) is vacuously true for every UUU. Hence the conclusion is automatic when m′≤2m' \le 2m′≤2, and the hypothesis P(T,m)\mathcal{P}(T, m)P(T,m) is automatic when m≤2m \le 2m≤2.
  • T′T'T′ may be empty.
Human review
  • Endorsed by Shuze Chen · Nov 21, 2026

    Confirmed by the moderator at approval.

  • Endorsed by pitimespi · Nov 21, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me