AFTD Auto-Formalizing Theoretical Domains

spherical_mod5_scale149_100_blue_unit_ap

theoremverified

The planar radial coloring that colors x true exactly when floor((149/100)‖x‖²) is nonzero modulo 5 has a true 17-term arithmetic progression with unit spacing.

Statement

theorem spherical_mod5_scale149_100_blue_unit_ap : euclidean_has_mono_ap (fun x : EuclideanSpace ℝ (Fin 2) => decide ((⌊(149 / 100 : ℝ) * ‖x‖^2⌋ : ℤ) % 5 ≠ 0)) 17 1 true
Source
Exact rational witness from experiment 25409 for OP-1482.
Verified
13 Nov 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 3
  • 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,…
  • mod5_rational_quadratic_blue_witnessFor each integer k from 0 through 16, the floor of (149/100) k² + (183/50) k + 5569/1490 is nonzero modulo 5.
  • norm_sq_ap_quadraticFor any initial point x₀ and difference vector v in n-dimensional Euclidean space, and any real coefficient k, the squared norm of x₀ + k…

The proof, explained

The proof establishes the existence of a monochromatic 17-term arithmetic progression of unit spacing by exhibiting an explicit witness in the Euclidean plane ℝ². The progression starts at x = (183/149, 1) with unit step direction v = (1, 0). For each term index k ∈ {0, ..., 16}, the scaled squared norm (149/100) ‖x + k • v‖² expands algebraically to the quadratic polynomial (149/100) k² + (183/50) k + 5569/1490. The proof then concludes by applying an auxiliary lemma confirming that the floor of this quadratic is non-zero modulo 5 for every k in {0, ..., 16}.

  1. The problem reduces to showing that the chosen direction vector v has unit norm and that every point x + k • v for k ∈ {0, ..., 16} has the specified color.

    We choose candidate base point x = (183/149, 1) and unit step vector v = (1, 0) in ℝ². Providing these witnesses splits the goal into two subgoals: showing ‖v‖ = 1 and showing that the coloring condition holds at every step k ∈ {0, ..., 16}.

    lines 2–4

      let x : EuclideanSpace ℝ (Fin 2) := WithLp.toLp 2 ![(183 / 149 : ℝ), 1]
      let v : EuclideanSpace ℝ (Fin 2) := WithLp.toLp 2 ![(1 : ℝ), 0]
      refine ⟨x, v, ?_, ?_⟩
  2. The step vector v has unit length: ‖v‖ = 1.

    We first evaluate ‖v‖² = 1² + 0² = 1 by expanding the Euclidean norm into components via EuclideanSpace.real_norm_sq_eq and Fin.sum_univ_two. Since norms are non-negative by norm_nonneg, nonlinear arithmetic (nlinarith) concludes that ‖v‖ = 1.

    lines 5–8

    uses EuclideanSpace.real_norm_sq_eq, Fin.sum_univ_two, norm_nonneg

      · have hv : ‖v‖^2 = 1 := by
          simp [v, EuclideanSpace.real_norm_sq_eq, Fin.sum_univ_two]
        have hn := norm_nonneg v
        nlinarith
  3. For an arbitrary index k ∈ {0, ..., 16}, it suffices to show that ⌊(149/100) ‖x + k • v‖²⌋ % 5 ≠ 0.

    We introduce the index k and simplify the boolean equality decide p = true to the proposition p using decide_eq_true_eq.

    lines 9–10

    uses decide_eq_true_eq

      · intro k
        simp only [decide_eq_true_eq]
  4. The quantity (149/100) ‖x + k • v‖² expands to the quadratic polynomial (149/100) k² + (183/50) k + 5569/1490.

    By EuclideanSpace.real_norm_sq_eq and Fin.sum_univ_two, the squared norm of x + k • v = (183/149 + k, 1) is (183/149 + k)² + 1². Multiplying by 149/100 and simplifying the polynomial using ring arithmetic yields the quadratic expression.

    lines 11–14

    uses EuclideanSpace.real_norm_sq_eq, Fin.sum_univ_two

        have hv : (149 / 100 : ℝ) * ‖x + (k : ℝ) • v‖^2 =
            (149 / 100 : ℝ) * (k.val : ℝ)^2 + (183 / 50 : ℝ) * k.val + 5569 / 1490 := by
          rw [EuclideanSpace.real_norm_sq_eq]
          simp [x, v, Fin.sum_univ_two] <;> ring
  5. Every point x + k • v along the progression satisfies the non-zero modulo 5 condition.

    Rewriting the goal with the quadratic identity reduces the claim to ⌊(149/100) k² + (183/50) k + 5569/1490⌋ % 5 ≠ 0, which holds by the auxiliary lemma mod5_rational_quadratic_blue_witness.

    lines 15–16

    uses mod5_rational_quadratic_blue_witness

        rw [hv]
        exact mod5_rational_quadratic_blue_witness k
EuclideanSpace.real_norm_sq_eq
In a real Euclidean space, the squared norm of a vector equals the sum of the squares of its components.
Fin.sum_univ_two
A sum over the two elements of Fin 2 equals the sum of the terms at index 0 and index 1.
norm_nonneg
The norm of any vector in a seminormed group is non-negative.
decide_eq_true_eq
A decidable proposition p is true if and only if decide p = true.
mod5_rational_quadratic_blue_witness
For every k ∈ {0, ..., 16}, the floor of (149/100) k² + (183/50) k + 5569/1490 is not divisible by 5.

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

theorem spherical_mod5_scale149_100_blue_unit_ap : euclidean_has_mono_ap (fun x : EuclideanSpace ℝ (Fin 2) => decide ((⌊(149 / 100 : ℝ) * ‖x‖^2⌋ : ℤ) % 5 ≠ 0)) 17 1 true := by  let x : EuclideanSpace ℝ (Fin 2) := WithLp.toLp 2 ![(183 / 149 : ℝ), 1]  let v : EuclideanSpace ℝ (Fin 2) := WithLp.toLp 2 ![(1 : ℝ), 0]  refine ⟨x, v, ?_, ?_⟩  · have hv : ‖v‖^2 = 1 := by      simp [v, EuclideanSpace.real_norm_sq_eq, Fin.sum_univ_two]    have hn := norm_nonneg v    nlinarith  · intro k    simp only [decide_eq_true_eq]    have hv : (149 / 100 : ℝ) * ‖x + (k : ℝ) • v‖^2 =        (149 / 100 : ℝ) * (k.val : ℝ)^2 + (183 / 50 : ℝ) * k.val + 5569 / 1490 := by      rw [EuclideanSpace.real_norm_sq_eq]      simp [x, v, Fin.sum_univ_two] <;> ring    rw [hv]    exact mod5_rational_quadratic_blue_witness k
See it in the graphDiscuss this resultChallenge it