arxiv: 2604.20181 · v1 · submitted 2026-04-22 · 🧮 math.DS

Selection Rules and Channel Structure in a Base Octave Model of Collatz Dynamics

Katharina Lodders This is my paper

Pith reviewed 2026-05-09 23:52 UTC · model grok-4.3

classification 🧮 math.DS

keywords Collatz conjectureparity dynamicsbase octave decompositionsymbolic dynamicsfinite state transitions2-adic valuationreturn mapscontractive subnetworks

0 comments p. Extension

The pith

Collatz trajectories are confined to the contractive subnetwork of the 1-2 cycle by finite parity state constraints.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper reformulates the Collatz rules as a single parity-controlled transformation and decomposes every integer uniquely into a base residue B from 1 to 8 plus an octave index A. This yields a finite directed transition skeleton on the bases that lifts across scales, which is refined into a 128-state symbolic system tracking all admissible moves and carry effects from higher-order parity. Within the system the only growth-permitting persistence is limited to base-7 transitions in even octaves and bounded by the 2-adic valuation of the index, producing overall non-positive drift in the logarithmic octave coordinate. Consequently every trajectory is forced into the contractive subnetwork associated with the terminal 1-2 cycle. A reader cares because the approach replaces separate odd-even cases with a uniform finite-state framework that gives a global structural reason the iteration cannot diverge or enter other cycles.

Core claim

In the base octave model every integer is written uniquely as n = B + 8(A-1) with B in 1 to 8. The Collatz rules induce parity-dependent transitions on B together with affine updates on A. Refining the parity description produces a finite 128-state symbolic system that encodes all admissible transitions including carry effects. Enumeration of return paths between persistence episodes shows that the sole unbounded persistence mechanism, occurring via base-7 transitions in even octaves, is necessarily bounded by the 2-adic valuation of the octave index. This forces a non-positive drift in the logarithmic octave coordinate and confines trajectories to the contractive subnetwork associated with

What carries the argument

The base octave decomposition n = B + 8(A-1) together with the 128-state symbolic transition system encoding parity-dependent base changes and higher-order carry effects.

If this is right

All trajectories exhibit non-positive drift in the logarithmic octave coordinate.
The only persistence mechanism is base-7 transitions in even octaves and is bounded by 2-adic valuation of the octave index.
Exhaustive enumeration of admissible return paths forces every trajectory into the contractive 1-2 subnetwork.
The dynamics reduce to a finite-state skeleton lifted across integer scales.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The same octave decomposition and finite-state refinement may apply to other parity-driven linear recurrences such as variants of 5x+1.
Return-map enumeration on the 128-state graph offers a route to computational verification of the absence of other cycles up to arbitrary but finite bounds.
The separation into base transitions and octave updates suggests a template for analyzing termination in broader classes of integer iterations controlled by modular conditions.

Load-bearing premise

Refining the parity description yields a finite 128-state symbolic system that encodes every admissible transition including all carry effects from higher-order parity inheritance.

What would settle it

An explicit starting integer whose sequence of base-octave transitions produces a state outside the 128 admissible ones or maintains sustained positive drift in the logarithmic octave coordinate without entering the 1-2 subnetwork.

Figures

Figures reproduced from arXiv: 2604.20181 by Katharina Lodders.

**Figure 1.** Figure 1: Permitted transitions induced by the Collatz rule when each iterate ℎ௜ is uniquely expressed in base–octave form, ℎ௜ = 𝐵௜ + 8(𝐴௜ − 1), with base value 𝐵௜ ∈ {1, … ,8} and octave index 𝐴௜ ∈ ℕ (see text for examples). The Collatz update allows transitions only between specific base sequences, determined jointly by the parity of the base value 𝐵௜ and the parity of the octave 𝐴௜ containing it (cf. the selection… view at source ↗

**Figure 2.** Figure 2: Piecewise linear growth and decay segments in log coordinates (illustrative example). Shown is the generalized Collatz trajectory starting at hi =1639 under the parity-controlled update (equation (5)), plotted as yi = log2(hi+1) versus step index i. Consecutive odd-updates produce exact linear growth segments with slope log2(3/2) in yi (Lemma 8.6), whereas halving steps produce linear [PITH_FULL_IMAGE:fig… view at source ↗

read the original abstract

The Collatz iteration is governed by two distinct update rules, depending on the parity of the current iterate: n(i+1)=3n(i)+1 for odd n(i), and n(i+1)=n(i)/2 for even n(i). We show that these rules can be written equivalently as a single parity controlled transformation, n(i+1)=((2s(i)+1)(2k(i)+s(i))+s(i))/2, where n(i)=2k(i)+s(i) and s(i) is the parity (0 or 1) of n(i), yielding a uniform, step aligned dynamical system in which parity variables are tracked explicitly. This reformulation removes the asymmetry of the traditional presentation and exposes structural regularities that are obscured when odd and even updates are treated separately. Building on this unified rule, we introduce a base octave decomposition, representing every integer uniquely in the form n=B+8(A-1) with B = 1 to 8. The resulting dynamics separate into parity dependent base transitions and affine updates of the octave index, inducing a finite directed transition skeleton lifted across scale levels. Refining the parity description yields a finite 128 state symbolic system that encodes all admissible transitions, including carry effects arising from higher order parity inheritance. Within this framework, we identify growth permitting and decay forcing channels and show that the only persistence mechanism (base 7 transitions in even octaves) is necessarily bounded by the 2 adic valuation of the octave index. An exhaustive enumeration of admissible return paths between persistence episodes establishes a non positive drift in a logarithmic octave coordinate. Because of these finite state constraints, trajectories are eventually confined to a contractive subnetwork associated with the terminal 1,2 cycle. The approach emphasizes structural organization and return map methods, and provides a symbolic framework for analyzing parity driven integer recurrences.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

The paper gives a unified parity rule plus base-octave split that builds a 128-state transition system and derives non-positive drift to argue Collatz orbits stay in the 1-2 cycle.

read the letter

The paper's core move is to rewrite the Collatz rules as one parity-controlled update and then decompose every integer into a base residue B from 1 to 8 plus an octave index. This produces a finite 128-state transition skeleton whose return paths all show non-positive drift in the log-octave coordinate, leading to the claim that trajectories are trapped in the 1-2 cycle. The reformulation itself is a clear improvement on the usual odd-even split because it keeps the parity variable s(i) explicit at every step. The base-octave split then isolates the local transitions from the scaling, which lets the authors separate growth and decay channels and bound the only persistent mechanism by the 2-adic valuation. That structural separation is the part that feels genuinely useful and could apply to other similar recurrences. The potential weak point is whether the 128 states really exhaust all possible transitions once higher-order parity inheritance and carry effects are included. The paper asserts that refining the parity description captures everything, and the stress-test finds no hidden escape route in the argument, but without the explicit transition table or a direct check that no additional states appear, the confinement result rests on that completeness. If the enumeration is correct, the drift argument holds; if not, an escape channel could remain. Readers working on Collatz, 3x+1 variants, or parity-driven dynamical systems on the integers would find this framework worth examining. It supplies a concrete symbolic model rather than another heuristic or computational check. I would send the paper to peer review. The approach is systematic and the finite-state reduction is a legitimate way to attack the problem, even if the final step needs close inspection by someone familiar with the 2-adic aspects.

Referee Report

1 major / 2 minor

Summary. The manuscript reformulates the Collatz iteration as the unified parity-controlled map n(i+1)=((2s(i)+1)(2k(i)+s(i))+s(i))/2 with n(i)=2k(i)+s(i), introduces a base-octave decomposition n=B+8(A-1) for B=1..8 that separates parity-dependent base transitions from affine octave-index updates, and refines this into a finite 128-state symbolic system that encodes all admissible transitions including carry effects. It identifies growth-permitting and decay-forcing channels, bounds the sole persistence mechanism (base-7 transitions in even octaves) by 2-adic valuation, and uses exhaustive enumeration of return paths to establish non-positive drift in a logarithmic octave coordinate, concluding that trajectories are eventually confined to a contractive subnetwork associated with the terminal 1-2 cycle.

Significance. If the 128-state enumeration is exhaustive and the drift calculation free of selection bias, the work supplies a concrete finite-state skeleton and return-map argument for confinement that is internally consistent with the given reformulation. The separation of base transitions from octave updates and the explicit tracking of higher-order parity inheritance constitute a structural contribution that could be useful for other parity-driven recurrences. The approach avoids traditional odd/even case splits and emphasizes symbolic organization over direct computation.

major comments (1)

[section describing the 128-state symbolic system and the enumeration of admissible return paths] The central confinement claim rests on the assertion that the 128-state system captures every admissible transition (including all carry effects from higher-order parity inheritance). The manuscript must supply an explicit completeness argument—e.g., a proof that the state space is closed under the unified rule and that no additional states arise from the base-octave decomposition—rather than relying solely on the parity rules used to construct the system. Without this, the non-positive drift result and the exclusion of escape trajectories remain conditional.

minor comments (2)

[abstract] The abstract states the equivalences and the confinement conclusion but supplies no derivations or transition table; a short explicit example of the unified rule applied to a small integer would clarify the reformulation for readers.
[base octave decomposition and drift calculation] Notation for the octave index A and the logarithmic coordinate used for drift should be defined once with a concrete numerical illustration to avoid ambiguity when comparing growth-permitting versus decay-forcing channels.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the careful reading of the manuscript and for highlighting the need for an explicit completeness argument in support of the 128-state system. We address the major comment below and will incorporate the requested clarification in the revision.

read point-by-point responses

Referee: [section describing the 128-state symbolic system and the enumeration of admissible return paths] The central confinement claim rests on the assertion that the 128-state system captures every admissible transition (including all carry effects from higher-order parity inheritance). The manuscript must supply an explicit completeness argument—e.g., a proof that the state space is closed under the unified rule and that no additional states arise from the base-octave decomposition—rather than relying solely on the parity rules used to construct the system. Without this, the non-positive drift result and the exclusion of escape trajectories remain conditional.

Authors: We agree that an explicit proof of closure is required to render the confinement claim unconditional. The 128-state system was obtained by refining the parity description under the unified map n(i+1)=((2s(i)+1)(2k(i)+s(i))+s(i))/2 together with the base-octave decomposition n=B+8(A-1), with states encoding all combinations of base parity, octave parity inheritance, and carry propagation. In the revised manuscript we will add a dedicated lemma and proof establishing that this finite set is closed: every application of the unified rule to a 128-state tuple produces another tuple inside the same set, with all possible carry effects from higher-order parity bits exhausted by the state encoding. The argument proceeds by exhaustive verification over the eight base residues and the two-bit parity inheritance patterns, confirming that no additional states are generated by the decomposition. This addition will directly support the subsequent non-positive drift calculation and the exclusion of escape trajectories. revision: yes

Circularity Check

0 steps flagged

No significant circularity in derivation chain

full rationale

The paper's central confinement claim follows from constructing a closed 128-state transition system via the unified parity rule n(i+1)=((2s(i)+1)(2k(i)+s(i))+s(i))/2 and base-octave decomposition, then performing exhaustive enumeration of return paths to obtain non-positive drift in the logarithmic coordinate. This enumeration is a direct, finite computation on the explicitly defined states and transitions; the state space is derived from the parity rules without presupposing the drift or confinement result. No parameters are fitted and renamed as predictions, no self-citations are load-bearing for the uniqueness or completeness claims, and the argument remains self-contained against the given reformulation and residue classes B=1..8. The finite-state closure is a property proven within the model rather than a definitional reduction.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 3 invented entities

The central claim rests on two background facts and three invented modeling devices. No numerical parameters are fitted to data.

axioms (2)

domain assumption The two Collatz rules are equivalent to the single parity-controlled map n(i+1)=((2s(i)+1)(2k(i)+s(i))+s(i))/2 with n(i)=2k(i)+s(i).
Presented as an algebraic identity in the abstract; used to obtain a uniform dynamical system.
standard math Every positive integer admits a unique representation n = B + 8(A-1) with B in {1,...,8}.
Standard modular decomposition; invoked to separate base transitions from octave-index updates.

invented entities (3)

base octave decomposition no independent evidence
purpose: To induce a finite directed transition skeleton lifted across scale levels.
New representational device introduced to expose structural regularities.
128-state symbolic system no independent evidence
purpose: To encode all admissible transitions including carry effects from higher-order parity.
Obtained by refining the parity description; claimed to be complete.
growth-permitting and decay-forcing channels no independent evidence
purpose: To classify persistence mechanisms and bound them by 2-adic valuation.
Identified inside the finite-state graph.

pith-pipeline@v0.9.0 · 5641 in / 1708 out tokens · 60070 ms · 2026-05-09T23:52:13.291533+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

35 extracted references · 1 canonical work pages

[1]

J. C. Lagarias, The 3x+1 problem: An overview, in The Ultimate Challenge: The 3x+1 Problem, J. C. Lagarias (ed.), Amer. Math. Soc., Providence, RI, 2010, pp. 3–29

2010
[2]

Tao, Almost all orbits of the Collatz map attain almost bounded values, Forum Math

T. Tao, Almost all orbits of the Collatz map attain almost bounded values, Forum Math. Pi 10 (2022), e12, 1–56, https://doi.org/10.1017/fmp.2022.8. 47 Appendix A1. Complete Parity Pathway Table A.1 Scope and Completeness Appendix A functions as a complete transition codebook for the refined Collatz state introduced in Section 7. The refined parity pathway...

work page doi:10.1017/fmp.2022.8 2022
[3]

StateID_128 Unique identiﬁer encoding all state bits
[4]

B Base class (1-8), where h = B + 8(A−1)
[5]

sb Parity of B: sb = B mod 2
[6]

sc Parity of ⌈B/2⌉: determines next base parity (sb(i+1) = sc(i))
[7]

sa Parity of A: sa = A mod 2 (0 = even, 1 = odd)
[8]

sq Next-level parity: sq = ⌊A/2⌋ mod 2
[9]

sr Third-level parity: sr = ⌊A/4⌋ mod 2
[10]

This is a bookkeeping device only; for any concrete integer, exactly one outcome is realized

OutcomeID Row index (0 or 1) distinguishing two successor outcomes for the same source state. This is a bookkeeping device only; for any concrete integer, exactly one outcome is realized. CLASSIFICATION COLUMNS (columns 9-11):
[11]

ν₂_class 2-adic valuation class of A, determined by (sa, sq, sr): sa=1 → ν₂=0 (A odd) sa=0, sq=1 → ν₂=1 sa=0, sq=0, sr=1 → ν₂=2 sa=0, sq=0, sr=0 → ν₂≥3 48
[12]

max_persist Maximum consecutive 7→7 steps possible from this state
[13]

drift_type DECAY(-1), MIXED, or PERSIST(+0.585) SUCCESSOR STATE COLUMNS (columns 12-16):
[14]

NextB Successor base B(i+1)
[15]

next_sb Successor sb(i+1) [= sc(i), unconditionally]
[16]

next_sc Successor sc(i+1)
[17]

next_sa Successor octave parity sa(i+1)
[18]

next_sq Successor sq(i+1)
[19]

next_sr Successor sr(i+1) FLAG COLUMNS (columns 18-20):
[20]

IsS7persist TRUE if state is in B7 persistence set (B=7 AND sa=0)
[21]

IsEntry67 TRUE if this is a 6→7 re-entry transition
[22]

IsExit73 TRUE if this is a forced 7→3 exit transition BUDGET COLUMNS (columns 21-22):
[23]

ν₂_consumed 1 if even-base halving step, else 0
[24]

OutcomeID

ν₂_possible_gain 1 if odd step can regenerate factor of 2, else 0 A.3. How to read the parity pathway table. Rows are indexed by admissible refined cases, not by base value alone. Each row corresponds to one admissible refined transition case and specifies the corresponding successor refined state Σ'(i+1). Where two rows share the same source tuple (B, sb...
[25]

Path# Sequential path identifier (1-22)
[26]

Path_Sequence Base sequence from 7→3 to 6→7
[27]

Route_Type Descriptive category (Minimal, Via 5, Extended, etc.)
[28]

Length Number of transitions in path
[29]

Even_Steps Count of even-base halving steps
[30]

Odd_Steps Count of odd-base steps
[31]

ν₂_Consumed Total factors of 2 consumed (= Even_Steps)
[32]

ν₂_Max_Gain Maximum possible regeneration
[33]

Entry_Cost Always 1 (the −1 in the budget equation)
[34]

Net_Budget = ν₂_Max_Gain − ν₂_Consumed − Entry_Cost
[35]

The entry cost (−1) provides that regeneration never exceeds consumption

Verdict CONTRACTS if Net_Budget ≤ 0 Observation: All 22 enumerated paths satisfy Net_Budget(P) ≤ 0. The entry cost (−1) provides that regeneration never exceeds consumption. 56 Appendix A2. Table A2. 22-Path-Enumeration with Net Budget Path# Path Sequence Type Len. Even Odd ν₂ Cons. ν₂Max Gain E.Cost Net Verdict 1 7→3→1→6 Minimal 3 1 2 1 1 1 -1 contracts ...