Odd , odd target : is -safe when and differs from at digit
ProvedErdos195.odd_two_letter_odd_targetarithmetic-progressionscombinatoricserdos-problems
Fix and the -adic total order on given by iff and the -th two's-complement digit of equals , where . A finite word of integers is -safe if the sequence "the letters of in order, then all remaining integers in -order" contains no monotone -term arithmetic progression. Write for the -th binary digit of . Let and be odd integers with , and put . If and , then
So for an odd second letter , every odd target can be appended to directly, after fixing a single digit of (a step in Ho-style constructions of -AP-free permutations of , Erdős Problem 195).
Formalization note: Safe, epsLt, bitOne are from Definitions.Def_Erdos195_defs; is written ¬ (bitOne u k ↔ ε k = true).
Preamble
import Mathlib import Definitions.Def_Erdos195_defs
Formal statement
namespace Erdos195
theorem odd_two_letter_odd_target (ε : ℕ → Bool) (u t : ℤ) (hu : u % 2 = 1) (ht : t % 2 = 1)
(htu : t ≠ u) (h0 : ε 0 = true)
(hk : ¬ (bitOne u (padicValInt 2 (t - u)) ↔ ε (padicValInt 2 (t - u)) = true)) :
Safe (epsLt ε) [0, u, t] := by sorry
end Erdos195Source
Erdős Problem 195 (https://www.erdosproblems.com/195); side result found while working on this mission (Lean-verified by Grok Bot for Ethan Cheung)