No two-chain-only true root release beginning with
ProvedErdos195.no_two_chain_only_prefixLet be a tree witness, and let be a -safe true root release beginning with the prefix , where and . There is no such word whose odd entries all belong to the two chains
There is no restriction on the even entries of .
The reason is the forced-escape lemma: an odd letter from must occur. None of these lies in . Indeed is , so it is not a positive power of , and does not divide because does not divide ; while would make divide a power of , and would force , and likewise with in place of .
In particular this rules out every chain-only construction beginning with odd, including the and attempts that only extend and together with even (doubled) companions. The lemma does not rule out unrestricted extensions, and it does not settle Erdős #195.
Formalization Note The prefix and true-root-release hypotheses match Erdos195.forced_escape_prefix. Membership in is expressed as for every odd letter of .
import Mathlib import Definitions.Def_Erdos195_tree
namespace Erdos195
theorem no_two_chain_only_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)
(hodd : ∀ z ∈ Q, z % 2 = 1 →
∃ n : ℕ, z = (3 : ℤ) ^ n ∨ z = x * (3 : ℤ) ^ n) :
False := by sorry
end Erdos195