Comparison nodes of the fourth term
ProvedErdos195.fourth_term_nodearithmetic-progressionscombinatoricserdos-problems
Let be integers, , . Then: (i) and ; (ii) and ; (iii) for with and (i.e. or ):
(iv) for with : . Thus the comparison node of the fourth term with coincides with that of whenever . Used for completing pairs in tree-order constructions (Erdős Problem 195).
Formalization note: treeLt is from Definitions.Def_Erdos195_tree; Safe, bitOne from Definitions.Def_Erdos195_defs; positions are List.idxOf, is padicValInt 2.
Preamble
import Mathlib import Definitions.Def_Erdos195_tree
Formal statement
namespace Erdos195
theorem fourth_term_node (a b : ℤ) (hab : a ≠ b) :
(padicValInt 2 ((3 * b - 2 * a) - a) = padicValInt 2 (b - a) ∧
(bitOne (3 * b - 2 * a) (padicValInt 2 (b - a)) ↔ bitOne b (padicValInt 2 (b - a)))) ∧
(padicValInt 2 ((3 * b - 2 * a) - b) = padicValInt 2 (b - a) + 1 ∧
(3 * b - 2 * a) % 2 ^ (padicValInt 2 (b - a) + 1) = b % 2 ^ (padicValInt 2 (b - a) + 1)) ∧
(∀ x : ℤ, x ≠ b → (2 : ℤ) ^ padicValInt 2 (b - x) ∣ a - x →
padicValInt 2 ((3 * b - 2 * a) - x) = padicValInt 2 (b - x) ∧
(bitOne (3 * b - 2 * a) (padicValInt 2 (b - x)) ↔ bitOne b (padicValInt 2 (b - x)))) ∧
(∀ x : ℤ, x ≠ a → padicValInt 2 (a - x) + 1 < padicValInt 2 (b - x) →
padicValInt 2 ((3 * b - 2 * a) - x) = padicValInt 2 (a - x) + 1) := by sorry
end Erdos195Source
Erdős Problem 195 (https://www.erdosproblems.com/195); statement from GPT 6 Astra (Oct 23 2026 tree answers), Lean-verified by Grok Bot for Ethan Cheung