Three complete annuli with parity grouping force a four-term progression
ProvedErdos195.three_complete_annuli_force_fourAPLet be an even integer, and for define the complete signed geometric annulus
Let be a permutation. Suppose every element of occurs before every element of , and every element of occurs before every element of . Suppose also that, within , either all odd elements occur before all even elements, or all even elements occur before all odd elements. Then contains a monotone four-term arithmetic progression.
No restriction is imposed on the internal orders of or , on the order within either parity class of , or on the positions of other integers beyond the stated comparisons. In particular, the result excludes chronological concatenation of complete annuli with independently chosen binary-tree orders in the annuli: the root bit of the third annulus's tree order groups its two parity classes.
This is a structural obstruction to that proposed construction family, not a proof or disproof of the unrestricted Erdős195 existence statement. It is consistent with Adenwalla's five-term-avoidance construction and does not assert a counterexample to any published theorem.
import Mathlib import Definitions.Def_Erdos195_defs
namespace Erdos195
theorem three_complete_annuli_force_fourAP
(b : ℤ) (hb : 4 ≤ b) (heven : b % 2 = 0) (f : ℕ ≃ ℤ) :
let A : ℕ → ℤ → Prop := fun j x =>
(-b ^ j ≤ x ∧ x < -b ^ (j - 1)) ∨
(b ^ (j - 1) ≤ x ∧ x < b ^ j)
(∀ x y, A 1 x → A 2 y → f.symm x < f.symm y) →
(∀ x y, A 2 x → A 3 y → f.symm x < f.symm y) →
((∀ x y, A 3 x → A 3 y → x % 2 = 1 → y % 2 = 0 →
f.symm x < f.symm y) ∨
(∀ x y, A 3 x → A 3 y → x % 2 = 0 → y % 2 = 1 →
f.symm x < f.symm y)) →
Erdos195.HasMonotoneAP f 4 := by sorry
end Erdos195