Two-state binary digit transport with arbitrary integer state coefficients
DefinitionErdos195_TwoStateBinary_Modelarithmetic-progressionscombinatoricsfinite-state-machines
Let be a two-element state set, arbitrary integer coefficients, and arbitrary transitions. Define integer-valued maps on nonnegative integers by
The exact terminating recursion reads binary digits from the least significant end; the next coefficient may depend on the lower digit prefix through the state. No oddness, reachability, boundedness, injectivity, surjectivity or progression-avoidance assumption is built into the definition. This is the minimal interface for one two-state construction-family obstruction in the Erdős195 investigation.
Definition code
import Mathlib
namespace Erdos195.NonlinearStateResearch
/-- A coefficient may depend on the already-read lower binary prefix. -/
def stateValue (a : Bool → ℤ) (δ₀ δ₁ : Bool → Bool) (s : Bool) (n : ℕ) : ℤ :=
if hn : n = 0 then 0 else
if n % 2 = 0 then 2 * stateValue a δ₀ δ₁ (δ₀ s) (n / 2)
else 2 * stateValue a δ₀ δ₁ (δ₁ s) (n / 2) + a s
termination_by n
decreasing_by all_goals omega
end Erdos195.NonlinearStateResearch
Source
Independent research definition, exact recurrence from the kernel-checked two-state transport investigation of public Erdős195 mission49a38d9f-e723-48b5-9209-130dea45c67b. Contextual actual permutation: Ho https://arxiv.org/abs/2609.12780v1. The new state transport and obstruction are not attributed to that paper; the actual-Ho application is a separately checked companion.