AFTD Auto-Formalizing Theoretical Domains

euclidean_has_mono_ap

def

For a dimension n, a two-coloring c : EuclideanSpace ℝ (Fin n) → Bool, a term count m : ℕ, a spacing α : ℝ, and a color b : Bool, euclidean_has_mono_ap c m α b holds if there exist a base point x₀ and a difference vector v in EuclideanSpace ℝ (Fin n) with ‖v‖ = α such that c (x₀ + (k : ℝ) • v) = b for all k : Fin m.

Statement

def euclidean_has_mono_ap {n : ℕ} (c : EuclideanSpace ℝ (Fin n) → Bool)
    (m : ℕ) (α : ℝ) (b : Bool) : Prop
Defined in
scout/2611-12360-avoiding-short-progressions-in-euclidean-ramsey-theory-ii.md:104
Verified
12 Nov 2026
Axioms
none listed
Used by 9

Read back from the Lean

For a given dimension n : ℕ (implicit), a coloring function c : EuclideanSpace ℝ (Fin n) → Bool, a length m : ℕ, a step distance α : ℝ, and a target boolean value b : Bool, euclidean_has_mono_ap is the proposition that there exist points/vectors x₀ and v in EuclideanSpace ℝ (Fin n) such that: 1. The Euclidean norm of v equals α (‖v‖ = α), and 2. For every k : Fin m (i.e., k ∈ {0, 1, …, m - 1}, cast to ℝ), the color of x₀ + k • v is b (c (x₀ + (k : ℝ) • v) = b).

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

/-- A coloring of Euclidean space contains a monochromatic arithmetic progression of a given color and spacing. -/
def euclidean_has_mono_ap {n : ℕ} (c : EuclideanSpace ℝ (Fin n) → Bool)
    (m : ℕ) (α : ℝ) (b : Bool) : Prop :=
  ∃ (x₀ v : EuclideanSpace ℝ (Fin n)), ‖v‖ = α ∧ ∀ k : Fin m, c (x₀ + (k : ℝ) • v) = b
See it in the graphDiscuss this resultChallenge it