Petty's Notebook
ArticlesPapersnfieldAbout
Get notified when new posts are published. No spam, just math.
Alexander S. Petty  |  ©2009-2026
← Back
Collision Capacity

The Weight of a Carry

August 18, 20268 min read
Companion paper: Finite Generation of Collision Capacity →
The branching cells evoke repeated boundary subdivision. Each split preserves mass, while the same local rule determines the geometry at every resolution.
The branching cells evoke repeated boundary subdivision. Each split preserves mass, while the same local rule determines the geometry at every resolution.

In 1861 Achille Brocot, a clockmaker in Paris, had a practical problem. He wanted gear trains that turn at awkward ratios, and he needed good fractions to approximate them. He found them with a single move. Between two fractions, put their mediant, the fraction you get by adding the tops and adding the bottoms. Between one half and two thirds goes three fifths. Keep doing it and every fraction in lowest terms turns up exactly once, in a tree. Moritz Stern had found the same tree three years earlier.

The remainder clocks in The Clocks Beneath Collision Energy, one for every period, carry weights. The two-position clock carries a quarter of the total, the three-position clock a sixth, four and five a twelfth each, six a thirtieth, and so on down, adding to exactly one. The shares look arbitrary. Nothing about a clock that turns forever suggests it should weigh a thirtieth, and conservation alone cannot explain them, since any shares adding to one would keep the clocks turning.

They come from Brocot’s tree. Every gap between neighboring fractions in the tree pays a share to exactly one clock, the clock whose period is the denominator of the fraction that will split that gap. The gap from zero to one pays the two-position clock its quarter. The two gaps on either side of one half pay the three-position clock a twelfth apiece. And the payments are made by the carry, the digit you move into the next column when a sum overflows, because a carry splits things exactly the way the tree does.

Three plus three on a clock of five

Start with three plus three. On a five-position clock, six becomes one and leaves a carry. Double every position and the carries are zero, zero, zero, one, one.

The five-by-five addition square contains ten gold carry cells. Five outlined diagonal cells contain two carries. Below, doubling the five positions gives zero, zero, zero, one, one. A two-twenty-fifths covariance bar divides into two equal child bars of one twenty-fifth. The five-by-five addition square contains ten gold carry cells. Five outlined diagonal cells contain two carries. Below, doubling the five positions gives zero, zero, zero, one, one. A two-twenty-fifths covariance bar divides into two equal child bars of one twenty-fifth.
The five-position addition square. Gold cells carry and blue cells do not. Ten of the twenty-five carry, and so do two of the five cells on the outlined diagonal, the same two fifths. Below, the original row paired with itself, 2/25, splits exactly into its two pairings with the doubled row, 1/25 and 1/25.

The full addition square has twenty-five cells. Ten carry. The five cells along its diagonal have two carries. Both experiments give the same two-fifths share, even though the diagonal ties the two inputs together.

That small agreement has a consequence. Measure how the centered rows vary together. Replacing a pair of rows by its two children, each paired with their sum row, divides the original measurement exactly. In this example, 2/252/252/25 becomes 1/25+1/251/25+1/251/25+1/25.

Here the parent compares the original row with itself. Each child compares that row with the doubled row, in opposite orders.

The rows change. The pairing is conserved.

Look at the labels on those rows. The pair (1, 1) splits into (1, 2) and (2, 1). Wherever the rows make sense, a pair (a, b) splits into (a, a + b) and (a + b, b), and nothing is lost in the split. That is Brocot’s move, made by a carry.

The carry and the conserved pairing

At modulus mmm, use the centered residue row

Ua(A)=[aA]mm−m−12m.U_a(A)=\frac{[aA]_m}{m}-\frac{m-1}{2m}.Ua​(A)=m[aA]m​​−2mm−1​.

Assume aaa, bbb and a+ba+ba+b are all units modulo mmm. Each row then has variance vm=(m2−1)/(12m2)v_m=(m^2-1)/(12m^2)vm​=(m2−1)/(12m2).

On the full addition square, the two inputs and their reduced sum are pairwise independent and uniform. Their centered signed sum is the centered carry. Its variance is therefore 3vm3v_m3vm​.

On the synchronized line (aA,bA)(aA,bA)(aA,bA), the carry is still zero or one and has the same mean. Its variance must also be 3vm3v_m3vm​. Expanding that variance gives

⟨Ua,Ub⟩ =⟨Ua,Ua+b⟩+⟨Ua+b,Ub⟩.\begin{gathered} \langle U_a,U_b\rangle\ =\\ \langle U_a,U_{a+b}\rangle +\langle U_{a+b},U_b\rangle. \end{gathered}⟨Ua​,Ub​⟩ =⟨Ua​,Ua+b​⟩+⟨Ua+b​,Ub​⟩.​

Independence belongs to the full square, not to the synchronized line. The line’s rows are dependent. Their covariance is what the identity preserves.

Twice as big, four times the cost

Capacity measures the average squared size of the collision response. Could another rule do the same job?

The paper makes the question precise. Give each centered value its own cost, using one continuous, even rule at every scale. Average those costs. Require the pairing formed from sums and differences to obey the carry split.

The rule is forced to be a constant times the square. Doubling a value must multiply its cost by four. A five-position test also forces tripling to multiply it by nine. Continuity leaves no room between those requirements.

This depends on measuring values individually. A rule that combines the whole row first can escape it. The theorem keeps that assumption in view.

The precise measurement test

For a continuous even density Φ\PhiΦ with Φ(0)=0\Phi(0)=0Φ(0)=0, define

EmΦ(f)=1m∑AΦ(f(A))E_m^\Phi(f)=\frac1m\sum_A\Phi(f(A))EmΦ​(f)=m1​A∑​Φ(f(A))

and

PmΦ(f,g)=EmΦ(f+g)−EmΦ(f−g)4.P_m^\Phi(f,g)=\frac{E_m^\Phi(f+g)-E_m^\Phi(f-g)}4.PmΦ​(f,g)=4EmΦ​(f+g)−EmΦ​(f−g)​.

Carry refinement is required for all real amplitudes and all unit triples at every odd modulus. The root triples at growing moduli give Φ(2t)=4Φ(t)\Phi(2t)=4\Phi(t)Φ(2t)=4Φ(t). The root triple at five gives Φ(3t)=9Φ(t)\Phi(3t)=9\Phi(t)Φ(3t)=9Φ(t). The quotient Φ(t)/t2\Phi(t)/t^2Φ(t)/t2, viewed on a logarithmic scale, has the two incommensurable periods log⁡2\log2log2 and log⁡3\log3log3. Continuity makes it constant. Nonnegative, nonzero cost gives a positive constant, and one variance calibration makes it one.

The nonlocal rule E(f)=∥f∥24E(f)=\|f\|_2^4E(f)=∥f∥24​ also passes the unit-row carry tests. Thus carry refinement alone does not select squared size among every conceivable measurement. Nor does one five-entry table prove the all-amplitude theorem.

The digits supply the rows

The measurement still needs something to measure.

In base five, the equal-digit cells are 00, 11, 22, 33 and 44. Count their boundary crossings and subtract the baseline. Reorder the twenty-five phases by the digit rule. The resulting values lie exactly on a sum of four rising, resetting waves.

Five gold equal-digit cells occupy positions zero, six, twelve, eighteen and twenty-four in the base-five grid. A phase-relabeling example leads to four sawtooth waves with one through four turns. At the bottom, all twenty-five exact table values lie on twice their sum, including the midpoint endpoint value at zero. Five gold equal-digit cells occupy positions zero, six, twelve, eighteen and twenty-four in the base-five grid. A phase-relabeling example leads to four sawtooth waves with one through four turns. At the bottom, all twenty-five exact table values lie on twice their sum, including the midpoint endpoint value at zero.
Top, the five equal-digit cells of base five, 00 through 44. Reorder the twenty-five phases by the digit rule and the carry table, in gold dots, lands exactly on the sum of four sawtooth waves making one, two, three and four turns. The lines are the waves themselves, not a curve fitted to the dots.

The waves make one, two, three and four turns. There are no skipped frequencies or adjustable coefficients. The digit condition supplies them.

This straightening works in every integer base and at every two-position lag. The row labels must stay attached. They tell us when each contribution first enters as the calculation grows.

The exact straightening, including the endpoints

Let BBB be the base, ℓ\ellℓ the lag, Q=BℓQ=B^\ellQ=Bℓ, m=BQm=BQm=BQ and N=Q−1N=Q-1N=Q−1. The equal-digit cells are

G={d(Q+1)+By},0≤d<B,0≤y<Q/B.\begin{gathered} G=\{d(Q+1)+By\},\\ 0\le d<B,\quad 0\le y<Q/B. \end{gathered}G={d(Q+1)+By},0≤d<B,0≤y<Q/B.​

Their centered table is

F(a)=∑n∈G(⌊(n+1)am⌋−⌊nam⌋)−aB.\begin{gathered} F(a)=\sum_{n\in G}\left( \left\lfloor\frac{(n+1)a}{m}\right\rfloor -\left\lfloor\frac{na}{m}\right\rfloor\right)\\ -\frac aB. \end{gathered}F(a)=n∈G∑​(⌊m(n+1)a​⌋−⌊mna​⌋)−Ba​.​

Write b(t)={t}−1/2\mathfrak b(t)=\{t\}-1/2b(t)={t}−1/2 off the integers and zero at an integer. The exact identity is

F([(1−Q)A]m)=2∑r=1Nb(rA/m).F([(1-Q)A]_m)=2\sum_{r=1}^{N}\mathfrak b(rA/m).F([(1−Q)A]m​)=2r=1∑N​b(rA/m).

At base five and lag one, the phase multiplier is −4 mod 25-4\bmod25−4mod25. All twenty-five phases, including zero, are retained in the figure. The plotted ramps are the prescribed affine functions, not an arbitrary interpolation between those samples. Their continuous capacity is

J(N)=∫01(2∑r=1Nb(rx))2dx.J(N)=\int_0^1\left(2\sum_{r=1}^N\mathfrak b(rx)\right)^2dx.J(N)=∫01​(2r=1∑N​b(rx))2dx.

The finite sampled energy and this integral are different quantities. Their comparison requires an additional sampling estimate.

There is also an endpoint correction between ordinary centered residue rows and sampled midpoint sawteeth. For unit frequencies,

Ur(A)=b(rA/m)+em(A),U_r(A)=\mathfrak b(rA/m)+e_m(A),Ur​(A)=b(rA/m)+em​(A),

where em(A)=1/(2m)−1A=0/2e_m(A)=1/(2m)-\mathbf1_{A=0}/2em​(A)=1/(2m)−1A=0​/2. Omitting it leaves a refinement defect (m−1)/(4m2)(m-1)/(4m^2)(m−1)/(4m2), equal to 1/251/251/25 at five. The paper retains the correction before passing to the affine pairing. Higher-lag nonunit rows are covered by straightening, not by this unit-row endpoint formula.

Every gap pays a clock

Now the tree itself. Mark one half and two thirds, neighbors in Brocot’s tree. The gap between them is one sixth. Insert their mediant, three fifths, and the gap splits into one tenth and one fifteenth. Nothing is lost.

The continuous pairing assigns half the gap to its boundary. So 1/121/121/12 divides into 1/20+1/301/20+1/301/20+1/30.

The interval from one half to two thirds divides at three fifths into gaps of one tenth and one fifteenth, drawn to scale. Half-lengths give boundary masses one twelfth, one twentieth and one thirtieth. Below, separate coprime-pair contributions assemble the clock weights at periods two through five. The interval from one half to two thirds divides at three fifths into gaps of one tenth and one fifteenth, drawn to scale. Half-lengths give boundary masses one twelfth, one twentieth and one thirtieth. Below, separate coprime-pair contributions assemble the clock weights at periods two through five.
The gap from one half to two thirds, one sixth, split at the mediant three fifths into one tenth and one fifteenth. Half of each gap is its boundary share, and the shares add exactly. Divide each share by its period, the sum of its two denominators, and you get the clock weights in the bars below.

To turn that boundary share into a clock weight, divide it by the denominator of the mediant, the sum of the two denominators at the ends of the gap. The gap from one half to two thirds splits at three fifths, so its share of 1/121/121/12 pays the five-position clock 1/601/601/60.

Every clock collects from every gap whose mediant has its period as denominator. Counting every gap in the tree supplies all the weights, and a telescoping sum down the tree proves they add to exactly one.

Boundary mass, period mass and the conserved unit

For coprime positive a,ba,ba,b, the affine covariance is 1/(12ab)1/(12ab)1/(12ab). The source normalization makes its boundary mass

C(a,b)=12ab.C(a,b)=\frac1{2ab}.C(a,b)=2ab1​.

It obeys C(a,b)=C(a,a+b)+C(a+b,b)C(a,b)=C(a,a+b)+C(a+b,b)C(a,b)=C(a,a+b)+C(a+b,b). This is the conserved half-length under classical Farey subdivision. The clock contribution is a different quantity,

K(a,b)=C(a,b)a+b=12ab(a+b).K(a,b)=\frac{C(a,b)}{a+b}=\frac1{2ab(a+b)}.K(a,b)=a+bC(a,b)​=2ab(a+b)1​.

Its period sum is

wk=∑a+b=k(a,b)=1K(a,b).w_k=\sum_{\substack{a+b=k\\(a,b)=1}}K(a,b).wk​=a+b=k(a,b)=1​∑​K(a,b).

The source first admits a reduced pair at cutoff k=a+bk=a+bk=a+b. Larger cutoffs contain ⌊N/k⌋\lfloor N/k\rfloor⌊N/k⌋ common-scale copies. Those labeled appearances force the address; conservation by itself does not.

The reciprocal kernel follows directly from the source ledger. It also has an independent uniqueness characterization. Among symmetric degree-minus-three kernels with a continuous normalized angular profile, conservation of the period-weighted boundary under this same subdivision forces the reciprocal form. Unit total mass fixes its constant. The unweighted clock contribution KKK is not what adds under an individual Farey split.

Run the calculation backward

A capacity compresses the whole wave into one number. That invites a question Mark Kac made famous in 1966, when he asked whether you can hear the shape of a drum, whether the tones a drum makes determine its outline. For drums the answer, found in 1992, is no. Here the capacities are the tones. Keep one at every resolution and the compression turns out to be reversible.

The first four capacities are 1/31/31/3, 111, 5/35/35/3 and 23/923/923/9. Each individual doubled wave contributes 1/31/31/3. Subtract those individual contributions, rescale, and compare successive totals. Each difference contains the weights of the clocks resetting at that integer.

At four, the two-position clock resets again. Its weight is already known from two. Subtract that contribution and the remaining increment reveals the weight at four.

The first six capacities form an increasing graph. After removing the known linear term and rescaling, each adjacent difference is a stacked bar of resetting clock contributions. At four, the blue contribution of clock two is subtracted from five sixths, leaving one third. Dividing by four recovers weight one twelfth. The first six capacities form an increasing graph. After removing the known linear term and rescaling, each adjacent difference is a stacked bar of resetting clock contributions. At four, the blue contribution of clock two is subtracted from five sixths, leaving one third. Dividing by four recovers weight one twelfth.
Top, the first six capacities. Below, what each new resolution adds, split by the clocks that reset there. At four, the two-position clock’s part is already known. Take one half from five sixths, divide the remaining third by four, and out comes the weight of the four-position clock, one twelfth.

Continue and every new resolution exposes one new weight. Within the paper’s smooth symmetric boundary class, the entire sequence then recovers the boundary profile itself. It does not recover an arbitrary realization of the original digit tables.

The inverse, with six exact entries

Expanding the square gives N/3N/3N/3 from the individual waves. The cross-pair terms have a common factor 2/32/32/3. Remove the former and divide by the latter. This gives S(N)=3(J(N)−N/3)/2S(N)=3(J(N)-N/3)/2S(N)=3(J(N)−N/3)/2, with S(0)=0S(0)=0S(0)=0. Its differences obey

ΔS(n)=∑k∣nkwk.\Delta S(n)=\sum_{k\mid n}kw_k.ΔS(n)=k∣n∑​kwk​.

This is a triangular recovery. Every proper divisor is smaller than nnn. Subtract its known contribution and divide by nnn.

Resolution Capacity Reset increment Recovered weight
1 1/31/31/3 000 000
2 111 1/21/21/2 1/41/41/4
3 5/35/35/3 1/21/21/2 1/61/61/6
4 23/923/923/9 5/65/65/6 1/121/121/12
5 19/619/619/6 5/125/125/12 1/121/121/12
6 43/1043/1043/10 6/56/56/5 1/301/301/30

In particular,

w4=5/6−1/24=112.w_4=\frac{5/6-1/2}{4}=\frac1{12}.w4​=45/6−1/2​=121​.

For the kernel inverse, write

KP(a,b)=P(a/(a+b))2ab(a+b).K_P(a,b)=\frac{P(a/(a+b))}{2ab(a+b)}.KP​(a,b)=2ab(a+b)P(a/(a+b))​.

The theorem assumes a symmetric C3C^3C3 profile, positive inside the interval, with unit total primitive mass. Divisor inversion restores full grid sums from primitive sums. After removing the endpoint singularity, grid averaging and Fourier inversion recover the profile. This step needs the complete infinite sequence and the stated regularity.

Symmetry is essential. An antisymmetric perturbation cancels inside every period sum. Fixed phase coordinates are essential too. Translating all waves leaves their squared integrals unchanged but moves their boundaries. The theorem recovers the regular symmetric primitive ledger, not unrestricted source data.

Six identical answers

Stop at six. Two different boundary rules can give exactly the same six capacities. No rounding, no measurement error.

A constant blue collision profile and a smooth gold alternative differ visibly across the boundary coordinate. Both profiles are positive. Their capacity differences are exactly zero through resolution six. The first nonzero difference appears at seven, followed by signed changes at later resolutions. The perturbation uses the prime frequencies seven and eleven. A constant blue collision profile and a smooth gold alternative differ visibly across the boundary coordinate. Both profiles are positive. Their capacity differences are exactly zero through resolution six. The first nonzero difference appears at seven, followed by signed changes at later resolutions. The perturbation uses the prime frequencies seven and eleven.
Blue is the collision rule and gold a smooth alternative, with the vertical scale magnified to show how slightly they differ. Below, the difference in capacity at each resolution. The first six are exactly zero. The first disagreement, at seven, is 7/15972.

The blue profile is the collision rule. The gold profile is a smooth positive alternative. Their first disagreement appears at seven. The construction can put that disagreement beyond any finite cutoff we choose.

The full record identifies the boundary. A finite record cannot.

Exact recovery is not cheap recovery either. The paper gives a signed readout of the weights that returns log⁡p\log plogp at every prime power and zero everywhere else. Nothing in its definition mentions a prime, and the primes come out of the carry weights anyway. It proves nothing new about primes, but it is a strange place to meet them. The readout’s sensitivity at the first changed address grows like n2log⁡nn^2\log nn2logn, so a small change in the whole state can become a large change in a late coefficient.

The hidden perturbation and the sensitive readout

The displayed control uses primes r=7r=7r=7, s=11s=11s=11 and ε=1/(8s3)\varepsilon=1/(8s^3)ε=1/(8s3). Set

h(u)=72cos⁡(2πu)+49cos⁡(14πu)−121cos⁡(22πu),\begin{aligned} h(u)={}&72\cos(2\pi u)\\ &+49\cos(14\pi u)\\ &-121\cos(22\pi u), \end{aligned}h(u)=​72cos(2πu)+49cos(14πu)−121cos(22πu),​

and P(u)=1+2εu(1−u)h(u)P(u)=1+2\varepsilon u(1-u)h(u)P(u)=1+2εu(1−u)h(u). The profile is symmetric, smooth and positive. Its primitive mass remains one. Grid averaging makes its unprimitive rows differ only at seven and eleven. Finite divisor inversion gives the exact changes of period mass and capacity. The first capacity difference is 7/159727/159727/15972 at seven.

For the signed readout, first form the angular row

Hv(n)=1n∑k∣nk3vk.H_v(n)=\frac1n\sum_{k\mid n}k^3v_k.Hv​(n)=n1​k∣n∑​k3vk​.

Normalize its adjacent differences by cv=4v2c_v=4v_2cv​=4v2​, so av(n)=(Hv(n+1)−Hv(n))/cva_v(n)=(H_v(n+1)-H_v(n))/c_vav​(n)=(Hv​(n+1)−Hv​(n))/cv​. Logarithmic marking and Dirichlet convolution inversion define

Pv(n)=n[(avlog⁡)∗av−1](n).\mathfrak P_v(n)=n[(a_v\log)*a_v^{-1}](n).Pv​(n)=n[(av​log)∗av−1​](n).

For the collision weights, aw(n)=1/na_w(n)=1/naw​(n)=1/n. The classical identity μ∗log⁡=Λ\mu*\log=\Lambdaμ∗log=Λ then gives Pw=Λ\mathfrak P_w=\LambdaPw​=Λ. The whole current recognizes the collision mass. This supplies no new prime-distribution estimate.

The control first changes the normalized increment at six, one step before the first changed capacity. Its current there is (147/5324)log⁡6(147/5324)\log6(147/5324)log6, while the collision current is zero. The sharp n2log⁡nn^2\log nn2logn sensitivity concerns a growing first changed address, with preceding increments and the scale held fixed. It does not say that a fixed coefficient is discontinuous or that signed sums cannot cancel.

The primitive pairs, from twelve to seven hundred sixty-eight
Four complete triangular arrays show all primitive pairs with period sum at most twelve, forty-eight, one hundred ninety-two and seven hundred sixty-eight. Colors encode their positive reciprocal kernel weights on one logarithmic scale. Missing squares have a common divisor. The largest panel retains 179,407 primitive pairs. Four complete triangular arrays show all primitive pairs with period sum at most twelve, forty-eight, one hundred ninety-two and seven hundred sixty-eight. Colors encode their positive reciprocal kernel weights on one logarithmic scale. Missing squares have a common divisor. The largest panel retains 179,407 primitive pairs.
Every coprime pair of labels, in squares from twelve to seven hundred sixty-eight wide. Each lit cell is a pair with no common factor, colored by its share on one scale across all four panels. The dark gaps are pairs with a common factor. Each diagonal line is one period, and the shares along it add to that clock’s weight.

Every occupied square is a coprime pair. Its diagonal address is the period a+ba+ba+b. Colors show the actual kernel contribution on one logarithmic scale across all four panels. The gaps are pairs with a common divisor. All cells are retained. These are the individual contributions whose period sums give the clock weights.

Four close studies of generation and recovery
The addition square and its three centered residue observables. Pairwise independence belongs to the full square; the synchronized-line calculation preserves covariance without independence.
The addition square and its three centered rows. The inputs and their sum are independent across the whole square but not along the diagonal, and the pairing survives anyway.
The gap from one half to two thirds and its mediant split at three fifths. Exact interval lengths give the primitive boundary masses.
The gap from one half to two thirds, split at three fifths. The exact lengths are the boundary shares.
Consecutive sawtooth rows feed the primitive-pair ledger. The period weights group those pairs into one conserved unit of mass.
The sawtooth waves feed the ledger of coprime pairs, and the clock weights gather those pairs into one conserved unit.
The explicit seven-and-eleven profile control and its first eighteen capacity differences. The first six capacities agree exactly despite different smooth boundary profiles.
The seven-and-eleven alternative and its first eighteen capacity differences. The first six agree exactly.

The full proofs are in Finite Generation of Collision Capacity.

Six answers can agree exactly and come from different boundaries. So can six million. The construction lets me move the first disagreement past the last number you have checked.

Companion paper: Finite Generation of Collision Capacity →
Share

Discussion

Sign in to join the discussion.

← All articlesRead the paper →
← Previous: The Bias Beneath the Secondary Term
Next: Repetend Rigidity at the Golden Scale →