Binary place values with a fixed sign at each digit
DefinitionErdos195_SignedBinary_Modelarithmetic-progressionsbinary-expansionscombinatorics
For a Boolean sign sequence , define and . The signed binary value of a natural number is the finite sum of its binary digits, weighted by . The exact recursive definition is ; for , it is twice plus the sign of the zeroth digit when is odd, and plus zero when is even. The definition makes no claim of injectivity, surjectivity, or progression avoidance. It is the minimal interface used by a generic obstruction to fixed signed-digit transports of progression-free natural-number permutations.
Definition code
import Mathlib
namespace Erdos195.SignedDigitResearch
def sign (b : Bool) : ℤ := if b then -1 else 1
def signedValue (ε : ℕ → Bool) (n : ℕ) : ℤ :=
if hn : n = 0 then 0 else
2 * signedValue (fun j => ε (j + 1)) (n / 2) +
if n % 2 = 0 then 0 else sign (ε 0)
termination_by n
decreasing_by omega
end Erdos195.SignedDigitResearch
Source
Research-derived exact signed-binary recurrence used in the Erdős195 transport-family investigation (public mission49a38d9f-e723-48b5-9209-130dea45c67b). Context: Ho, arXiv:2609.12780v1, explicit natural-number permutation; this signed-digit transport is an investigated extension strategy, not a claim of that paper. The full scoped obstruction is submitted separately.