The reflection word is tree-safe and a true root release
ProvedErdos195.reflection_word_021643The six-letter word
is tree-safe for some tree witness , and is a true root release: every open in-order pair with odd difference has even second entry.
This word is the checked positive instance of the finite reflection-completion construction applied to the odd word , with second-batch order . Its even subsequence divided by is , which is itself tree-safe, and its odd subsequence is . The construction does not preserve an arbitrary prescribed prefix such as , and this instance does not by itself prove an extension lemma or settle Erdős #195.
Formalization Note Safety is official Safe (treeLt θ). The second conjunct is the official true-root-release predicate used in Erdos195.odd_entry_demand and Erdos195.nine_true_release, specialized to this concrete word.
import Mathlib import Definitions.Def_Erdos195_tree
namespace Erdos195
theorem reflection_word_021643 :
(∃ θ : ℕ → ℤ → Bool, Safe (treeLt θ) [0, 2, 1, 6, 4, 3]) ∧
(∀ a b : ℤ, a ∈ ([0, 2, 1, 6, 4, 3] : List ℤ) →
b ∈ ([0, 2, 1, 6, 4, 3] : List ℤ) →
[0, 2, 1, 6, 4, 3].idxOf a < [0, 2, 1, 6, 4, 3].idxOf b →
2 * b - a ∉ ([0, 2, 1, 6, 4, 3] : List ℤ) →
3 * b - 2 * a ∉ ([0, 2, 1, 6, 4, 3] : List ℤ) →
(b - a) % 2 = 1 → b % 2 = 0) := by sorry
end Erdos195