AFTD Auto-Formalizing Theoretical Domains

not_euclidean_has_mono_ap_const_ne

theoremverified

For any dimension n, any positive integer m with 0 < m, and any spacing α : ℝ, the constant coloring c = (fun _ => true) on EuclideanSpace ℝ (Fin n) satisfies ¬ euclidean_has_mono_ap c m α false.

Statement

theorem not_euclidean_has_mono_ap_const_ne {n : ℕ} (m : ℕ) (α : ℝ) (hm : 0 < m) :
    ¬ euclidean_has_mono_ap (fun (_ : EuclideanSpace ℝ (Fin n)) => true) m α false
Source
folklore
Verified
12 Nov 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 1
  • euclidean_has_mono_apFor a dimension n, a two-coloring c : EuclideanSpace ℝ (Fin n) → Bool, a term count m : ℕ, a spacing α : ℝ, and a color b : Bool,…

Read back from the Lean

For any dimension n : ℕ (implicit), any length m : ℕ, and any distance α : ℝ, if m > 0, then the constant function on EuclideanSpace ℝ (Fin n) that maps every point to true does not contain a monochromatic arithmetic progression of length m and step length α with color false. That is, there do not exist points x₀, v in EuclideanSpace ℝ (Fin n) such that ‖v‖ = α and for all k ∈ Fin m, (fun _ => true) (x₀ + (k : ℝ) • v) = false.

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

The proof, explained

We argue by contradiction: if the constant coloring assigning `true` everywhere contained a monochromatic progression of color `false`, then every point in that progression would have color `false`. Because $m > 0$, the progression has at least one element, so its initial point ($k = 0$) must be colored `false`. But the constant coloring assigns `true` to every point, producing the contradiction $\\mathrm{true} = \\mathrm{false}$.

  1. Assume for contradiction that there exists a monochromatic arithmetic progression of color false.

    By definition of `euclidean_has_mono_ap`, such an arithmetic progression provides a base point $x_0$, a direction vector $v$ of norm $\alpha$, and an assumption $h$ that every term $x_0 + k v$ (for $k \\in \\{0, \\dots, m-1\\}$) has color `false` under the coloring.

    line 4

      rintro ⟨x₀, v, -, h⟩
  2. Evaluating the coloring at the first point of the progression yields an immediate contradiction.

    Because $m > 0$, the index $0$ is valid ($0 \\in \\mathrm{Fin}\\, m$). Specializing the monochromaticity hypothesis $h$ to $k = 0$ gives $(\\lambda x.\\, \\mathrm{true})(x_0 + 0 \\cdot v) = \\mathrm{false}$, which simplifies definitionally to $\\mathrm{true} = \\mathrm{false}$. Since $\\mathrm{true}$ and $\\mathrm{false}$ are distinct constructors of `Bool`, this equality is impossible, closing the goal.

    lines 5–6

      have h0 := h ⟨0, hm⟩
      cases h0

Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.

Lean source view module on GitHub

/-- A constant coloring with color true contains no monochromatic arithmetic progression of color false. -/theorem not_euclidean_has_mono_ap_const_ne {n : ℕ} (m : ℕ) (α : ℝ) (hm : 0 < m) :    ¬ euclidean_has_mono_ap (fun (_ : EuclideanSpace ℝ (Fin n)) => true) m α false := by  rintro ⟨x₀, v, -, h⟩  have h0 := h ⟨0, hm⟩  cases h0
See it in the graphDiscuss this resultChallenge it