A dyadic order pattern obstructs every triangular binary-weight transport to a 4AP-free integer permutation
ProvedErdos195.TriangularWeightResearch.triangular_transport_has_fourAP_of_patternsarithmetic-progressionscombinatoricserdos-problems
Let be a permutation, and write . Assume that for every and every ,
For an arbitrary sequence of integers , define the binary-weight map by the exact terminating recursion
If satisfies for every , then contains a monotone four-term arithmetic progression. There are no sign, oddness, magnitude, periodicity, or growth assumptions on .
The actual explicit Ho permutation is a separately checked instance of the order hypothesis. For that permutation the result rules out every triangular binary-weight transport, extending the fixed signed-digit coefficient family. The generic order hypotheses differ from the earlier signed-digit obstruction. This is a construction-family obstruction; the original Erdős195 existence question remains open.
Preamble
import Mathlib import Definitions.Def_Erdos195_defs import Definitions.Def_Erdos195_TriangularBinary_Model
Formal statement
namespace Erdos195.TriangularWeightResearch
theorem triangular_transport_has_fourAP_of_patterns
(p : ℕ ≃ ℕ) (a : ℕ → ℤ) (f : ℕ ≃ ℤ)
(hval : ∀ i, f i = weightValue a (p i))
(horder : ∀ k n : ℕ, 2 ≤ n →
p.symm (2^k*3) < p.symm (2^k*2) ∧
p.symm (2^k*2) < p.symm (2^k*(2*n+1)) ∧
p.symm (2^k*(2*n+1)) < p.symm (2^k*(2*n))) :
HasMonotoneAP f 4 := by sorry
end Erdos195.TriangularWeightResearchSource
Independent triangular binary-weight obstruction developed in this research branch. The actual Ho permutation from arXiv:2609.12780v1 is a separately kernel-checked application: its first four entries, even-order self-similarity, and paired-odd precedence prove the all-scale pattern. Neither the new obstruction nor these new algorithm-specific helpers is attributed to the paper. Exact actual Ho closure provenance: accepted submission ba0ba110-74af-4501-8488-3247e332dec2, MIT-licensed upstream boonsuan/4ap.