AFTD Auto-Formalizing Theoretical Domains

finset_contains_k_ap

def

A subset s of Fin n contains a k-term arithmetic progression if there exist a and d with 1 ≤ d such that a + i * d is in s for all 0 ≤ i < k.

Statement

def finset_contains_k_ap (n k : ℕ) (s : Finset (Fin n)) : Prop
Defined in
arXiv:2610.26243, Section 1
Verified
22 Oct 2026
Axioms
none listed
Used by 1
  • random_deletion_inequality_k_apLet 𝒜 and 𝒞 be families in Finset (Finset (Fin n)) such that 𝒜 is an up-set, 𝒞 is a down-set, and for every A ∈ 𝒜 and C ∈ 𝒞, the…

Read back from the Lean

For given natural numbers n and k, and a finite set s of elements of Fin n, the proposition asserts that there exist natural numbers a and d such that 1 ≤ d, and for every natural number i < k, there exists an element x ∈ s whose value (as a natural number) equals a + i * d.

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

Lean source view module on GitHub

/-- Predicate that a subset of Fin n contains a k-term arithmetic progression. -/
def finset_contains_k_ap (n k : ℕ) (s : Finset (Fin n)) : Prop := ∃ (a d : ℕ), 1 ≤ d ∧ ∀ i < k, ∃ x ∈ s, (x : ℕ) = a + i * d
See it in the graphDiscuss this resultChallenge it