Forced escape after the prefix with
ProvedErdos195.forced_escape_prefixLet be a tree witness, and let be a -safe finite word which is a true root release and begins with the prefix , where and . Then
and at least one of the following holds:
In particular, at least one of , , occurs in . These conditions are necessary, not sufficient.
As in the official lemma odd_entry_demand, a word is a true root release if every open in-order pair with odd difference has even second entry: no open pair forces the bit at the root node. An in-order pair is open when and .
The first clause follows from odd_entry_demand together with the prefix: if occurred it would have to occur after , so it cannot be the grounded partner required when is absent. The remaining obligation is a genuine escape from the two official tripling chains based at and at : the in-order pairs and occupy the same node and force opposite values of there, so they cannot both be open.
This does not rule out unrestricted extensions of , does not claim that escape obligations always discharge finitely or propagate forever, and does not settle Erdős #195.
Formalization Note The prefix hypothesis is for some tail . The true-root-release hypothesis is the same predicate as in Erdos195.odd_entry_demand. Safety is official Safe (treeLt θ).
import Mathlib import Definitions.Def_Erdos195_tree
namespace Erdos195
theorem forced_escape_prefix (θ : ℕ → ℤ → Bool) (Q : List ℤ) (x : ℤ)
(hx : (3 : ℤ) ≤ x) (hxmod : x % 4 = 3)
(hS : Safe (treeLt θ) Q)
(hpref : ∃ T : List ℤ, Q = 0 :: 1 :: x :: T)
(hrel : ∀ a b : ℤ, a ∈ Q → b ∈ Q → Q.idxOf a < Q.idxOf b → 2 * b - a ∉ Q →
3 * b - 2 * a ∉ Q → (b - a) % 2 = 1 → b % 2 = 0) :
(3 * x ∈ Q) ∧
(3 * x - 2 ∈ Q ∨ 7 * x ∈ Q ∨ (5 * x ∈ Q ∧ Q.idxOf (5 * x) < Q.idxOf (3 * x))) ∧
(3 * x - 2 ∈ Q ∨ 5 * x ∈ Q ∨ 7 * x ∈ Q) := by sorry
end Erdos195