There is a newer version of the record available.

Published June 5, 2026 | Version v10

Structured Sectors of the Collatz Carry Equation: Christoffel Towers, 2-Adic Windows, and Shell Residents

Description

This six-note sequence studies structured zero-entropy and grouped-tower sectors of the accelerated odd-only Collatz carry equation through finite-block, Sturmian, continued-fraction, and (2)-adic methods. The first note shows that fixed nonsingular near-critical mechanical block families remain effectively reducible, while the infinite continued-fraction tower forms a genuine renormalizing boundary. The second note identifies a native (2)-adic Sturmian carry constant governing the residue dynamics of standard Christoffel blocks. The third note develops an exact nonsingularity ledger for pure standard blocks by separating the obstruction into a shrinking (2)-adic window and an independent odd-prime divisibility layer, with a positive size-collision corollary tied to externally verified convergence bounds. The fourth note extends the program to the first grouped tower-product family (X_5^aX_6^b), proving a prefix-agreement saturation theorem: for (a\ge2), the (2)-adic window stabilizes at depth (83), so one explicit centered residue certificate nonsingularizes the family throughout its certified bounded-size region. The fifth note formalizes the bit analyzer (\ell(D)=v_2(Q(D)+\Xi_\alpha)) as a reusable diagnostic, showing that it detects saturation depths, window recycling, and exact Christoffel/Stern--Brocot degeneracy identities across several structured families. The sixth note proves a general adjacent-pair saturation taxonomy for standard tower products (X_n^aX_{n+1}^b): upper-leading pairs saturate at depth (p_n-1), while lower-leading pairs saturate at depth (p_n+p_{n+1}-1) for (a\ge2), with the (a=1) branch governed by standard Christoffel factorization and semiconvergent landings. The sequence does not claim a proof of the Collatz conjecture; it isolates and certifies specific structured sectors and formulates the remaining obstruction as a precise arithmetic problem involving (2)-adic windows, odd-prime divisibility, residue genericity, and the behavior of non-mechanical or positive-entropy valuation words.

Files

AdicSturmianCarryConstant.pdf

Files (5.7 MB)

Name Size Download all
md5:8064824b9605a0ad26603ed742022842
299.6 kB Preview Download
md5:ab51c2d20833a9dd5b0237e22e3164db
289.4 kB Preview Download
md5:aad1685bbdfc73749a23074c3536c253
256.2 kB Preview Download
md5:5251024b7312070f738f66db2bb8ad48
184.9 kB Preview Download
md5:ac724d237a325ef7128769ff391c3bb7
223.8 kB Preview Download
md5:cf4a5c83d031057c31cfe70ac00d3737
248.0 kB Preview Download
md5:a56432c3ba64fdbbf776d68b4e4fed74
221.6 kB Preview Download
md5:a1fe356128dac56bb12e3b384d2e5730
231.3 kB Preview Download
md5:cb19685df12e8a7819275e8e6ab2e4ba
214.3 kB Preview Download
md5:3f9347659cc514335564ae9ab33d2f17
207.1 kB Preview Download
md5:f45a7409dbe1837116d00ed9be6831db
267.4 kB Preview Download
md5:99293c626a56d822fa0309f503470d9e
240.2 kB Preview Download
md5:b70bf77ab18ec37a8ea4096ef48cbe07
175.8 kB Preview Download
md5:3ceec4d6778505e2d8586bec7aca84a9
212.2 kB Preview Download
md5:7e6c3e2767bf387db59793457292e98c
216.3 kB Preview Download
md5:303b915a18762fff2010645ad1d90cc0
235.7 kB Preview Download
md5:b5bd74a2d22a9162a0ff948ffa7b38c1
250.4 kB Preview Download
md5:76d38b8d1b123e5868d1ae4fe81dcc7b
239.2 kB Preview Download
md5:21ae09d4f0755d7c3847b12471770c32
209.6 kB Preview Download
md5:132a0821d409745adeac1c0cc505b9af
238.8 kB Preview Download
md5:b44140ff52259fc5f5c2f6ebbb350922
185.2 kB Preview Download
md5:89dafe27ecb1e513ca2a6b284da7c61f
212.3 kB Preview Download
md5:bdd0cc3ba986cf099fcc855ec852adf9
224.9 kB Preview Download
md5:960139485a85871c32247c70204d8d9c
223.9 kB Preview Download
md5:35e5e1d01c20f177beeddb27a392d17b
232.7 kB Preview Download