
Revised November 15, 2026.
An integral can pass over one exceptional point without changing its value. A finite average has to read it. At the common reset of the collision field, the difference at that one point carries an entire unit in the limit.
The Common Reset in the Cubic Law accounts for the unit and gives a quarter-power bound on the error left over. The half-power target asks for a closer agreement between the growing collision table and its continuous energy. What in the arithmetic permits that improvement?
Whole families of resets already reach the target, even when every contribution is charged at its absolute size. Keep their signs and the bound improves again. The question now has a boundary. Inside these families the stronger comparison works. The complementary reading remains open.
At prime five, four ramps run around the unit interval. The first completes one circuit, the second two, the third three and the fourth four. Each rises from minus one toward plus one, then starts over. At a reset its assigned value is zero.
Add the four readings, then square their sum. Integrating that square gives . Reading it at the 25 equally spaced points of the carry table and averaging gives . The same field has two energy readings, separated by
All four clocks reset at zero. Their sum approaches minus four from the right and plus four from the left around the circle. Its square approaches sixteen from either side. The sample at zero reads zero.
Sixteen is fixed by those traces. Restore that one squared reading and leave the other twenty-four alone. The grid average rises by . The difference becomes
One changed reading takes the discrepancy from to . The integral stays put. The corrected table reads slightly high.
At a general prime , there are clocks and samples. The common reset contributes
This approaches one. The squared reset height grows at the same scale as the number of samples, so refinement keeps the missed contribution alive.
At the other resets, some clocks start over while others keep reading. All their values combine before the square is taken. The boundary formula in Collision Calculus retains these interactions, their signs and the curvature between resets. To improve the comparison, we need to see which of these boundaries belong together.
At prime thirty-one, the field has thirty clocks. At one third, clocks three, six, nine and every other multiple of three reset together. At one fifth, the multiples of five reset. At two fifths, those same clocks reset again.
Reduce an address to lowest terms. Its denominator names the clocks that meet there. At one third, ten clocks reset and twenty keep reading. All thirty contribute to the field at that address.
Now multiply an address repeatedly by thirty and reduce it after each step. Powers of two, three and five disappear from its denominator. Twelve eventually reaches one. Fourteen leaves seven. Twenty-one also leaves seven.
Fourteen and twenty-one have the same surviving clock. Twenty-eight feeds through fourteen to seven. Separate denominators enter the same family through different branches.
The sampling grid moves the addresses too. Comparing its motion with the source’s motion gives return conditions on the surviving denominators. One selection at thirty-one includes every denominator from two through thirty except seventeen, twenty-three and twenty-nine.
Those surviving clocks divide an explicit integer built from the source size and grid size. That integer may grow with the prime, provided it stays below a fixed power. The estimate then includes every reduced address in every selected denominator family, with all the incoming branches above its surviving clock.
At thirty-one, twenty-six of the twenty-nine nonorigin denominator families are covered together. Only three remain outside. That small complement does not persist as the cutoff grows. Under the stated height condition the forest population is sparse, and the complement is large.
Read the selected forest at thirty-one. Keep the full thirty-clock field at every address, together with each reset’s multiplicity and sampling weight.
The positive contributions add to about . The negative contributions add to about . Charging every contribution at its absolute size gives about .
Keep the signs and only about remains.
The theorem controls these sums as the source and grid grow. After sampling normalization, the absolute forest sum has a half-power bound. Its signed sum has a first-power bound. Restoring the forest’s reading to complete clocks has the first-power bound too.
For comparison, a sixteenfold increase in divides by two, by four and by sixteen. The estimates include constants and arbitrarily small exponent losses. They bound the errors without requiring each successive value to be smaller.
The target holds throughout these selected families before cancellation is even used. Their signs leave a stronger allowance. The remaining half-power question lies in the complementary reset reading, still taken from the same complete field on the same grid.
For an odd prime , put and . The midpoint sawtooth is away from integers and at integers. The field and its sampling defect are
Let be the largest divisor of coprime to . For a positive integer , the selected forest is
For any set of reset denominators , its signed boundary reading is
If for fixed , the absolute boundary sum over the forest is , and its signed sum is . Multiplication by gives the normalized half-power and first-power bounds.
The figure uses the return window and
At , its omitted denominators are exactly .
Write for the same signed reading over the complementary denominators. The exact decomposition and proved estimates give
The full half-power target is therefore equivalent to . This bound remains open. The established global exponent remains .
A reset belongs to several clocks at once. Keeping a family of resets therefore raises a source question. Which coefficients produce the selected totals?
Give six clocks coefficient one. Their totals at reset denominators one through six are
The three at denominator two comes from clocks two, four and six. Keep only denominator families dividing six. The record becomes .
Work backward. The unique source with that record has coefficients
Clocks one and two must double. Deleting clocks four and five alone would leave the wrong totals.
Divisor inversion performs this reconstruction. The selected boundaries have a source of their own, and it still interacts with the rest of the field. Its mixed work remains in the calculation when the reading is restored to the original grid.
These interactions carry most of the leading energy. The Cubic Law assigns one third to the harmonic diagonal and two thirds to interactions between different clocks. Removing those terms removes two thirds of the leading budget. The continuous energy also has its own secondary terms. The sampling defect compares the two complete readings.
The complete cutoff interior admits a second grouping into packets of two or three clocks. Its unfinished packets form a fringe, and the entire fringe fits within the half-power allowance.
At thirty-one, the complete packet is and its fringe is . The forest’s complement is . These are different selections of the same arithmetic. The packet estimate controls its unfinished edges; the forest estimate controls its selected reset families.
The grouping uses the source word, the short ramp sum left after complete periods and reflection. The upper word advances by two here, the lower by one. An upper word opens a cell, and the lower words in that cell complete its packet.
The proofs are developed in The Sampling Defect and Reset Forests. They write out the remaining signed readings and give a sufficient bound on the cost of observing them.
At five, restoring one sample leaves . At a growing cutoff, the corresponding remainder gathers readings from more and more reset addresses. The forest bound controls complete families of those addresses. The packet bound pays for the unfinished edges of a different grouping.
Beyond those estimates, the remaining clocks still read the same field. Their return relations are fixed by the arithmetic. How much cancellation do those relations force?
Discussion
Sign in to join the discussion.