
Revised November 2, 2026.
A finite carry table and a continuous sawtooth field describe the same readings. Their mean-square energies nevertheless approach a difference of one as the table grows. The difference comes from a single entry at which every sawtooth resets and the table reads zero.
The earlier result established that this unit survives. The revised argument gives a much stronger bound on everything left over. After correcting the common reset, the finite average approaches the continuous energy at a quarter-power rate, up to an arbitrarily small loss in the exponent. That measures how accurately the original arithmetic table reads the continuous field behind it.
A digit collision means that the selected digit positions agree. In a two-digit base-three word, the possibilities are 00, 11 and 22, occupying positions zero, four and eight on a circle of nine places. Multiplication by two moves those marks to zero, eight and seven. A further step of two takes the last two marks across the join, including the mark that lands exactly on zero. The carry count is two.
A step of two crosses the join from two of the nine possible starting positions. For three selected marks, the proportional allowance is therefore two thirds. Subtracting that allowance leaves a centered reading of four thirds. Doing the same for every multiplier fills the carry table. Squaring its centered readings and adding gives the collision energy.
The table has an exact harmonic description. Start with a repeating ramp that rises linearly, drops at each integer and takes the value zero at the drop. Center the ramp around zero; this is the sawtooth function. I call each dilated copy a clock. In base , there are clocks, completing one, two, up to cycles per unit interval. Double their readings and add them before squaring.
Reading that field at the equally spaced grid points gives precisely the centered carry table in a different order. The identity includes the resets and holds in composite bases too. The rate theorem uses odd prime bases.
At base three, the nine squared readings have average . The continuous squared field has average . Their difference is . For larger prime bases, that difference can lie above or below one; the theorem controls its approach to one.
At base five, all four clocks reset at zero. Just to the right, each doubled clock approaches minus one. Just to the left around the periodic join, each approaches plus one. Their sum approaches minus four on one side and plus four on the other, so its square approaches sixteen from both sides.
At zero itself, the assigned readings are all zero. The table samples that point exactly.
An integral is unchanged if we alter the value at one point. The grid average gives that point a share of . Replacing its zero squared reading by sixteen therefore raises the average by .
In base , the same correction is
The height beside the reset grows with the square of the number of clocks, while the grid’s weight on one point shrinks as the inverse square of the base. Their product survives. This is why refining the grid does not remove the discrepancy. The field being sampled is growing at the same time.
Identifying the common reset leaves the main difficulty. The interior contains many other resets, and their number grows with the base. At each one, some clocks restart while others continue. Their combined contribution to the sampling error must be controlled with its sign.
At base five, replace the origin’s squared reading by sixteen and leave the other twenty-four samples alone. Draw each reading as a rectangle of width . Some rectangles overshoot the squared field; others fall short. Their signed differences add to
The cancellation visible in this small example has to be proved uniformly as the whole table grows. An exact sampling identity separates the common reset, the interior interaction and a smaller curvature term. It also applies to weighted mixtures and grids passing through additional resets, recording their contributions explicitly.
The interior interaction can be written in classical Dedekind sums. Their Fourier frequencies sometimes repeat patterns from smaller grids. Grouping copies of the same pattern cancels complete cycles before any estimate is applied. Two geometric-sum estimates control the large-frequency tails.
For the remaining frequencies, reciprocity and Fourier completion turn the arithmetic phases into a family of linear twists. These twists have equally spaced slopes. The argument counts those whose slope approaches an integer, where cancellation can be weak. The others receive a stronger bound. This distinction allows all inverse frequencies to be included without charging each one the largest possible cost.
Balancing the resulting estimates gives the quarter-power rate. The carry table supplies the exact finite observation and its endpoints; the Dedekind and exponential-sum tools control the error of that observation.
Write for the finite carry energy and for the continuous mean-square energy. Their difference after normalization is the sampling defect,
The revised theorem states that, for every , through odd primes,
The earlier version gave the much smaller exponent , with a logarithmic factor. The present proof improves the error estimate for the complete table. The bound is asymptotic, with a constant depending on ; it does not supply a numerical error certificate at a specified base.
Equivalently, correcting the common reset gives
The correction is prescribed by the carry construction. It is not fitted to the observed energies. The theorem controls every odd prime base, including the exceptional alignments that a finite panel of computations might miss.
The Cubic Law and The Secondary Term describe the leading structure of this energy. The sampling theorem keeps the continuous energy exact and measures how faithfully the finite table reads it. Further terms in the continuous energy and sharper sampling rates are distinct questions about the same construction.
The square-root conjecture asks for the stronger error . The present estimates reach their best balance at , so reaching requires further cancellation in the signed interior sum. That question remains open.
What is established is the boundary correction and a uniform rate for the error after it is removed. The exact bridge identifies what the table reads. The cancellation theorem determines how accurately its average recovers the continuous energy.
The complete argument is in The Unit Sampling Defect in Digit-Collision Energy, with earlier versions preserved under the paper’s DOI.
Discussion
Sign in to join the discussion.