Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

No two-chain-only true root release beginning (0,1,x)(0,1,x)(0,1,x) with x≡3(mod4)x\equiv 3\pmod{4}x≡3(mod4)

Proved
Erdos195.no_two_chain_only_prefix

by Ethan Cheung Wang · Nov 17, 2026 · Mathlib 0df444a (Lean v4.33.1)

arithmetic-progressionscombinatoricserdos-problems

Let θ\thetaθ be a tree witness, and let QQQ be a θ\thetaθ-safe true root release beginning with the prefix (0,1,x)(0,1,x)(0,1,x), where x≥3x\ge 3x≥3 and x≡3(mod4)x\equiv 3\pmod{4}x≡3(mod4). There is no such word whose odd entries all belong to the two chains

Sx={3n:n≥0}∪{x⋅3n:n≥0}.S_x=\{3^n:n\ge 0\}\cup\{x\cdot 3^n:n\ge 0\}.Sx​={3n:n≥0}∪{x⋅3n:n≥0}.

There is no restriction on the even entries of QQQ.

The reason is the forced-escape lemma: an odd letter from {3x−2,5x,7x}\{3x-2,5x,7x\}{3x−2,5x,7x} must occur. None of these lies in SxS_xSx​. Indeed 3x−2≥73x-2\ge 73x−2≥7 is 1(mod3)1\pmod{3}1(mod3), so it is not a positive power of 333, and xxx does not divide 3x−23x-23x−2 because xxx does not divide 222; while 5x=3n5x=3^n5x=3n would make 555 divide a power of 333, and 5x=x⋅3n5x=x\cdot 3^n5x=x⋅3n would force 5=3n5=3^n5=3n, and likewise with 777 in place of 555.

In particular this rules out every chain-only construction beginning (0,1,3j)(0,1,3^j)(0,1,3j) with jjj odd, including the x=15x=15x=15 and x=27x=27x=27 attempts that only extend 1→3→9→⋯1\to 3\to 9\to\cdots1→3→9→⋯ and x→3x→9x→⋯x\to 3x\to 9x\to\cdotsx→3x→9x→⋯ 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 SxS_xSx​ is expressed as ∃n, z=3n∨z=x⋅3n\exists n,\ z=3^n\lor z=x\cdot 3^n∃n, z=3n∨z=x⋅3n for every odd letter zzz of QQQ.

Preamble
import Mathlib
import Definitions.Def_Erdos195_tree
Formal statement
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
Source
Erdős Problem 195 (https://www.erdosproblems.com/195); derived from analysis relayed by Ethan Cheung (Nov 17 2026), hand-checked against the official Safe / treeLt / true-root-release definitions, Lean-verified.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me