Actual parity prefixes and natural absolute gaps
DefinitionCollatzWork_PrefixCollisionStatementcollatz-work-import
Let be the shortcut Collatz map: for even and for odd . Write for its -fold iterate, with .
For natural k, n, and m, define equal parity prefixes by
The gap is (n−m)+(m−n) with natural truncated subtraction, equivalently the absolute difference. The two statement interfaces express equal residues modulo the kth power of two and the resulting separation of distinct starts.
Definition code
import Std import Init.Grind.Ordered.Module import Definitions.Def_CollatzWork_ConvergenceStatement import Definitions.Def_CollatzWork_InverseWordBoundaryStatement namespace CollatzWork /-! # Trusted finite-prefix collision statements The parity bits below are those of the repository's actual shortcut orbit. No convergence assumption or abstract symbolic itinerary is substituted. -/ /-- The first `k` parity bits of the two actual shortcut orbits agree. -/ def SameParityPrefix (k n m : Nat) : Prop := ∀ i : Nat, i < k → shortcutIter i n % 2 = shortcutIter i m % 2 /-- Natural absolute difference, written using truncated subtraction. -/ def prefixGap (n m : Nat) : Nat := (n - m) + (m - n) /-- Equal parity prefixes force equal residues modulo the prefix modulus. -/ def PrefixCollisionStatement : Prop := ∀ k n m : Nat, SameParityPrefix k n m → n % 2 ^ k = m % 2 ^ k /-- Distinct starts sharing a prefix must be at least its modulus apart. -/ def PrefixSeparationStatement : Prop := ∀ k n m : Nat, SameParityPrefix k n m → n ≠ m → 2 ^ k ≤ prefixGap n m end CollatzWork
Source