The even halves and of the reflection completion are not tree-safe
ProvedErdos195.even_halves_0145_0154_not_tree_safeA tree witness is a function on the nodes of the binary tree of residues. For distinct integers with , put iff . A finite word is -safe if the completion “letters of in order, then all remaining integers in -order” contains no monotone -term arithmetic progression. Positions are first occurrences.
Theorem. Neither of the words and is tree-safe for any witness .
These are the only two candidate even halves (after division by ) of a reflection completion of the safe odd word , with even batches and . In both words the in-order pairs and are open (the third and fourth terms and are absent). Both pairs occupy the root node and force opposite values of there: while . The official criterion exists_treeLt_safe_iff therefore fails.
This is the exact limitation recorded in the finite reflection-completion analysis: reflection completion discharges all root and mixed-parity obligations, but batch ordering alone need not make the reflected even subsequence safe. The theorem does not claim that every even enlargement fails, does not preserve a prefix such as , and does not settle Erdős #195.
Formalization Note Safety is official Safe (treeLt θ). The two concrete words are [0, 1, 4, 5] and [0, 1, 5, 4].
import Mathlib import Definitions.Def_Erdos195_tree
namespace Erdos195
theorem even_halves_0145_0154_not_tree_safe :
(¬ ∃ θ : ℕ → ℤ → Bool, Safe (treeLt θ) [0, 1, 4, 5]) ∧
(¬ ∃ θ : ℕ → ℤ → Bool, Safe (treeLt θ) [0, 1, 5, 4]) := by sorry
end Erdos195