Finite Spectral Shadows for the Collatz Valuation Cocycle

We study residue equidistribution for the accelerated Collatz/Syracuse mapS (x) = (3x+1) /2^v₂ (3x+1) through a pathwise twisted Birkhoff functional---thedeterministic defect cocycle Wₙ (x;, s) ---and the finiteresidue--height transfer operators ₒ, ₐ, ₋, that govern it. Our aimis not to prove the Collatz conjecture but to identify, rigorously, the correctfinite spectral object and the correct quotient on which its gap should besought. We prove two clean finite identities: a sliding-window congruenceexpressing xₙ 3ʳ as a finite window of the valuation word, and the factthat the quadratic character ₂ of (/3ʳ) ^ satisfies₂ (S (x) ) = (-1) ^v₂ (3x+1), i. e. \ ₂ is valuation parity indisguise and is an exact coboundary of the faithful residue--valuation skewproduct. Consequently the right form of the finite spectral hypothesis (``H23a'') is a gap for all non-coboundary characters of the faithful (synchronized) operator, not for all nontrivial characters. We then prove threetheorems about that operator: a classification of coboundaries (Cob=₂, for arbitrary positive branchweights), whence by Wielandt's theorem a strict spectral gap for everynon-coboundary character at every finite level and tilt; a conductorcollapse (the nonzero spectrum of a conductor-3ᶜ sector is computed at level3ᶜ), which reduces uniformity of the gap in Q to the boundedness of asingle sequence of computable constants c (s) ; and a rotationidentity showing the quadratic sector of the killed height-strip operator is arigid rotation of the principal one. The uniformity question is thenresolved: a threshold (m=c) Schur analysis of the adjoint kernelyields bounded Plancherel shells for the renewal constants (QL3C₁<5. 16), cascade row contraction at rate (3/2) ᶜ, a level-cost law with the exact constant 47<3^-1/2, and aroot-ball analysis closing the degenerate budget---together the finiteH23a theorem cc (0) (3/2) ^1/2+o (1) <1 at s=0. Onthe global side we prove the keystone arrow (every bad orbit castsa finite non-coboundary two-point shadow), reduce the remaining quenchedexclusion to a joint (2, 3) -adic max-plus rigidity, and prove twounconditional exclusion theorems: periodic traps via linear forms inlogarithms, and---by a new repetition rigidity argument in whichrepeated valuation blocks are exact cycles---all bounded-discrepancyvaluation words of subexponential complexity, in particular everySturmian word. A counterexample must therefore mimic randomness at everybanded scale. The elementary core (the 2-adic coding lemma andrepetition rigidity) is machine-verified in Lean~4. A companioncomputational report companion} documents the numerical suite.