Any finite set of odd integers extends the prefix with no other even entries
ProvedErdos195.zero_one_odd_finite_extensionA 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.
Corollary. For every finite set of odd integers there is a duplicate-free word which begins with the prefix , contains every element of , has no even entry other than , and is tree-safe for some witness .
The construction is the one recorded in the safe-word composition note. Let and apply the specified-first ordering lemma to obtain a tree-safe word with underlying set beginning with . Output
The official parity decomposition of tree safety reduces the claim to safety of the even child and of the odd child , together with a root condition. Mixed-parity in-order pairs in necessarily begin with the unique even letter , so they force , consistently.
This handles arbitrarily many prescribed positive and negative odd integers simultaneously while preserving the prefix . It does not justify inserting a new even integer after the odd block has begun, is not a true-root-release statement, and does not settle Erdős #195.
Formalization Note The prefix hypothesis is for some tail . Safety is official Safe (treeLt θ). The lemma specified_first_safe_order supplies ; the gluing step uses official safe_parity_decomp.
import Mathlib import Definitions.Def_Erdos195_tree
namespace Erdos195
theorem zero_one_odd_finite_extension (F : Finset ℤ) (hF : ∀ z ∈ F, z % 2 = 1) :
∃ Q : List ℤ, Q.Nodup ∧ (∃ T : List ℤ, Q = 0 :: 1 :: T) ∧ (∀ z ∈ F, z ∈ Q) ∧
(∀ z ∈ Q, z % 2 = 0 → z = 0) ∧
∃ θ : ℕ → ℤ → Bool, Safe (treeLt θ) Q := by sorry
end Erdos195