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

The Analytic Collision Transform

January 24, 202615 min read
Companion paper: The Analytic Collision Transform →
The blue petals change shape around a gold junction that never moves. The junction is the finite digit boundary, fixed while the analytic parameter travels through the critical strip, and each active channel carries the zeros of its own L-function.
The blue petals change shape around a gold junction that never moves. The junction is the finite digit boundary, fixed while the analytic parameter travels through the critical strip, and each active channel carries the zeros of its own L-function.

The collision coefficient at base five is an average of twenty signed fractions from long division. For the character that turns eighteen degrees at each power of two, it comes to about 0.441164−0.520524i0.441164-0.520524i0.441164−0.520524i. Its size carries L(1,χ)L(1,\chi)L(1,χ), as The Collision Spectrum and the L-Function Landscape showed, and I wanted to know whether the rest of the LLL-function could be reached from the same table. It can, with classical tools. Place the periodic zeta function on the diagonal of equal digit pairs and take the character transform, and the result is a fixed multiple of L(s,χ‾)L(s,\overline\chi)L(s,χ​) throughout the critical strip, with the collision coefficient sitting at s=0s=0s=0.

The fixed multiple is the same five-step sum over the diagonal of equal digit pairs, and it doesn’t change as sss moves. The rest of the factor is a gamma function and a sine, which never vanish for 0<Re⁡s<10<\operatorname{Re}s<10<Res<1. So whenever the digit sum is nonzero, the transform has exactly the zeros of L(s,χ‾)L(s,\overline\chi)L(s,χ​) there, with the same multiplicities, which follows at once from the factorization and says nothing new about where those zeros are. The new part is the factorization itself, with the finite digit sum carried through unchanged and the collision coefficient recovered at the left edge, phase and all, times iπi\piiπ.

An eighteen-degree turn

A character modulo 252525 gives each residue a complex weight, and multiplying residues multiplies their weights. Successive powers of 222 visit all twenty residues not divisible by five, so a character is set by how far it turns at each visit. Take the one that turns eighteen degrees, χ(2)=eπi/10\chi(2)=e^{\pi i/10}χ(2)=eπi/10, and give the multiples of five weight zero.

The base-five words with equal digits, 000000, 111111, 222222, 333333 and 444444, are the integers 000, 666, 121212, 181818 and 242424. Step each forward by one, wrapping 242424 around to 000, and record how much the character’s weight changes across each step. Adding the five changes gives

G={0,6,12,18,24},D(χ)=∑n∈G[χ(n+1)−χ(n)].\begin{aligned} G&=\{0,6,12,18,24\},\\ D(\chi)&=\sum_{n\in G}[\chi(n+1)-\chi(n)]. \end{aligned}GD(χ)​={0,6,12,18,24},=n∈G∑​[χ(n+1)−χ(n)].​

A twenty-five-place clock marks five steps in gold. The selected starting labels are zero, six, twelve, eighteen and twenty-four. Below, five teal arrows add head to tail in the complex plane. Their gold resultant is the diagonal character sum. A twenty-five-place clock marks five steps in gold. The selected starting labels are zero, six, twelve, eighteen and twenty-four. Below, five teal arrows add head to tail in the complex plane. Their gold resultant is the diagonal character sum.
The five equal-digit steps as gold arcs on a twenty-five-place clock. Below, their changes in character weight, head to tail, adding to D(χ).

On the clock the five steps are the short gold arcs at 000000, 111111, 222222, 333333 and 444444. Below, their weight changes are drawn head to tail. The first arrow, from 000 to 111, is exactly one unit along the real axis, and so is the last, from 242424 back to 000, because χ(24)=−1\chi(24)=-1χ(24)=−1 and χ(0)=0\chi(0)=0χ(0)=0. The three middle steps zigzag up and down between them, and the five arrows land at

D(χ)≈5.520147+0.206396i.D(\chi)\approx5.520147+0.206396i.D(χ)≈5.520147+0.206396i.

Nothing analytic has happened yet. Once the base, lag and character are chosen, this number is finished.

The character convention and larger digit tables

Here DDD uses χ\chiχ directly. It is the conjugate of the diagonal factor DχD_\chiDχ​ in The Collision Spectrum and the L-Function Landscape. The collision coefficient is unchanged by this notation choice.

At lag ℓ\ellℓ, the words have ℓ+1\ell+1ℓ+1 digits, including leading zeros. Their first and last digits must agree. There are bℓb^\ellbℓ such words among m=bℓ+1m=b^{\ell+1}m=bℓ+1 possibilities. Write their integer labels as GℓG_\ellGℓ​ and use

Dℓ(χ)=∑n∈Gℓ[χ(n+1)−χ(n)].D_\ell(\chi)=\sum_{n\in G_\ell}[\chi(n+1)-\chi(n)].Dℓ​(χ)=n∈Gℓ​∑​[χ(n+1)−χ(n)].

The gallery places all the integers in row order. At lag one this gives the familiar diagonal. With more intervening digits, the selected cells spread into bands. The colors identify the common end digit.

Twelve complete digit-selection grids compare bases two, three, five and seven at lags one, three and five. The smallest grids have isolated diagonal cells. The larger grids form narrow colored bands, with every cell retained. Twelve complete digit-selection grids compare bases two, three, five and seven at lags one, three and five. The smallest grids have isolated diagonal cells. The larger grids form narrow colored bands, with every cell retained.
Cells whose first and last base-b digits agree, colored by that digit, up to all 117,649 six-digit base-seven words.

Arrows that reach farther

The analytic family needs a kernel, and the classical one is the periodic zeta function. Put a turning arrow at each positive integer jjj, pointing jxjxjx full turns around, give it length 1/j1−s1/j^{1-s}1/j1−s for real sss, and add the arrows head to tail,

K(x;s)=∑j=1∞e2πijxj1−s.K(x;s)=\sum_{j=1}^{\infty}\frac{e^{2\pi i jx}}{j^{1-s}}.K(x;s)=j=1∑∞​j1−se2πijx​.

At s=0s=0s=0 the lengths are 1,1/2,1/3,…1,1/2,1/3,\ldots1,1/2,1/3,…, and at s=1/2s=1/2s=1/2 they are 1,1/2,1/3,…1,1/\sqrt2,1/\sqrt3,\ldots1,1/2​,1/3​,….

Four winding paths compare the first 250 kernel arrows at x equal to one fifth and one twenty-fifth, with s equal to zero and one half. Increasing s makes the later loops larger. Gold rings mark the corresponding infinite sums. Four winding paths compare the first 250 kernel arrows at x equal to one fifth and one twenty-fifth, with s equal to zero and one half. Increasing s makes the later loops larger. Gold rings mark the corresponding infinite sums.
The first 250 terms of K(x; s) head to tail at x = 1/5 and 1/25. Lengths 1/j close fast on the gold sum, and lengths 1/√j wind much longer.

At x=1/5x=1/5x=1/5 each arrow turns a fifth of a circle from the last, so the path winds in pentagons. With lengths 1/j1/j1/j the pentagons shrink quickly and close on the gold ring within a few laps. With lengths 1/j1/\sqrt j1/j​ they stay wide and wind many more times before settling, around a different sum. At x=1/25x=1/25x=1/25 the turns are smaller and the path curls into a spiral. For 0<x<10<x<10<x<1 the series converges whenever Re⁡s<1\operatorname{Re}s<1Res<1, analytic continuation supplies its values beyond that, and a complex s=σ+its=\sigma+its=σ+it adds a further turn of tlog⁡jt\log jtlogj radians to the jjjth arrow.

At s=0s=0s=0 the kernel has a very simple imaginary part,

Im⁡K(x;0)π=12−x,\frac{\operatorname{Im}K(x;0)}{\pi}=\frac12-x,πImK(x;0)​=21​−x,

a straight line, and that line is the Bernoulli factor of the finite collision calculation, already sitting inside the kernel.

Cancel the shared endpoint

Now put the kernel on the five steps. Multiply each step by an allowed residue aaa, reduce both ends modulo 252525, divide by 252525, and take the kernel at the finishing end minus the kernel at the starting end. One pair of steps needs care. With a=2a=2a=2 the first step becomes 0→20\to20→2 and the last becomes 23→023\to023→0, so both reach the kernel at zero, where its series diverges.

Two residue clocks compare the five doubled steps before and after pairing the endpoint terms. Gold arrows from twenty-three to zero and zero to two become one arrow from twenty-three to two. A lower graph places the twenty unit arguments on the straight line one half minus x. Two residue clocks compare the five doubled steps before and after pairing the endpoint terms. Gold arrows from twenty-three to zero and zero to two become one arrow from twenty-three to two. A lower graph places the twenty unit arguments on the straight line one half minus x.
At multiplier two, the end steps 23 → 0 and 0 → 2 join into 23 → 2. Below, Im K(x; 0)/π is the line 1/2 − x at the allowed arguments.

The left clock shows the two end steps meeting at 000, and the right clock shows them joined into a single step from 232323 to 222. Written out,

[K(0)−K(23/25)]+[K(2/25)−K(0)]=K(2/25)−K(23/25),[K(0)-K(23/25)]+[K(2/25)-K(0)]=K(2/25)-K(23/25),[K(0)−K(23/25)]+[K(2/25)−K(0)]=K(2/25)−K(23/25),

so the value at zero never has to be computed. The line at the bottom is the imaginary part of the kernel at s=0s=0s=0, the line 1/2−x1/2-x1/2−x, with the twenty allowed arguments as dots and the two gold ones at 2/252/252/25 and 23/2523/2523/25.

Doing this for all twenty allowed values of aaa, subtracting the mean within each final-digit family as in the centered collision table, and averaging against the conjugate character weights gives the transform Aχ(s)\mathcal A_\chi(s)Aχ​(s).

The complete definition

Let {y}\{y\}{y} mean the fractional part of yyy. At modulus m=bℓ+1m=b^{\ell+1}m=bℓ+1, the uncentered quantity is

A(a;s)=∑n∈Gℓ[K({(n+1)a/m};s)−K({na/m};s)].\begin{aligned} A(a;s)=\sum_{n\in G_\ell}\bigl[&K(\{(n+1)a/m\};s)\\ &-K(\{na/m\};s)\bigr]. \end{aligned}A(a;s)=n∈Gℓ​∑​[​K({(n+1)a/m};s)−K({na/m};s)].​

Combine the terms from n=0n=0n=0 and n=m−1n=m-1n=m−1 first. Their contribution is K(a/m;s)−K(1−a/m;s)K(a/m;s)-K(1-a/m;s)K(a/m;s)−K(1−a/m;s), so every argument actually evaluated lies strictly between zero and one.

Write UmU_mUm​ for the residues coprime to mmm. For a prime base, each final-digit family contains bℓb^\ellbℓ of them. Subtract its mean,

A∘(a;s)=A(a;s)−1bℓ∑u∈Umu≡a(modb)A(u;s).\begin{aligned} A^\circ(a;s)&=A(a;s)\\ &\quad-\frac1{b^\ell}\sum_{\substack{u\in U_m\\u\equiv a\pmod b}}A(u;s). \end{aligned}A∘(a;s)​=A(a;s)−bℓ1​u∈Um​u≡a(modb)​∑​A(u;s).​

Then take the character coefficient,

Aχ(s)=1φ(m)∑a∈UmA∘(a;s)χ(a)‾.\mathcal A_\chi(s)=\frac1{\varphi(m)} \sum_{a\in U_m}A^\circ(a;s)\overline{\chi(a)}.Aχ​(s)=φ(m)1​a∈Um​∑​A∘(a;s)χ(a)​.

Here φ(m)\varphi(m)φ(m) counts the allowed residues. It is 202020 at modulus 252525.

Five steps survive the transform

Inside the critical strip, 0<Re⁡s<10<\operatorname{Re}s<10<Res<1, the result factors exactly,

Aχ(s)=Cm(s)Dℓ(χ)L(s,χ‾),\mathcal A_\chi(s)=C_m(s)D_\ell(\chi)L(s,\overline\chi),Aχ​(s)=Cm​(s)Dℓ​(χ)L(s,χ​),

for every prime base and every primitive odd character. Primitive means the character needs the full modulus, and odd means reflection changes its sign. The eighteen-degree character is both.

The proof follows those two properties through the sum. Multiplying by a residue coprime to mmm only rearranges the kernel arguments and brings out a character value. For a residue sharing a factor with mmm, primitivity makes the weights cancel. Oddness pairs each kernel term with its reflection and leaves a sine. The digit geometry comes through untouched as the same five-step sum DDD the calculation started with.

The common factor and the proof

The factor independent of the character is

Cm(s)=2isin⁡(πs/2)Γ(s)φ(m)(m2π)s.C_m(s)=\frac{2i\sin(\pi s/2)\Gamma(s)}{\varphi(m)} \left(\frac{m}{2\pi}\right)^s.Cm​(s)=φ(m)2isin(πs/2)Γ(s)​(2πm​)s.

For a primitive character, its sum over every fiber of reduction to a smaller prime-power modulus is zero. That removes the family-centering term and all nonunit kernel models. On the remaining unit models, the periodic-zeta connection formula expresses the kernel in terms of two Hurwitz zeta functions. The finite character-weighted Hurwitz sum is msL(s,χ‾)m^sL(s,\overline\chi)msL(s,χ​). Reflection and oddness supply 2isin⁡(πs/2)2i\sin(\pi s/2)2isin(πs/2).

The Analytic Collision Transform gives the fiber-cancellation argument, endpoint accounting, factorization and both boundary proofs.

Two phase-colored rectangles compare a Dirichlet L-function with its analytic collision transform over the same part of the critical strip. Their colors differ, while the small-magnitude features occur in corresponding places. Two phase-colored rectangles compare a Dirichlet L-function with its analytic collision transform over the same part of the critical strip. Their colors differ, while the small-magnitude features occur in corresponding places.
Phase portraits of L(s, χ̄) and of the transform over the same rectangle of the critical strip. The colors differ, and the pinch points where zeros sit line up.

The two panels color the same rectangle of the critical strip by phase, L(s,χ‾)L(s,\overline\chi)L(s,χ​) on the left and the transform on the right. The colors differ, because multiplying by Cm(s)D(χ)C_m(s)D(\chi)Cm​(s)D(χ) shifts every phase and size, but the bright pinch points, where all the colors meet, line up row for row in the two panels. The theorem is what makes that exact. The common factor never vanishes in the critical strip and D(χ)D(\chi)D(χ) is nonzero, so the two functions have the same zeros with the same multiplicities. The picture only illustrates it. A character whose five-step sum vanished would have its whole component vanish instead. At modulus 252525 none does, since all eight primitive odd characters have nonzero diagonal sums.

All eight primitive odd components

At modulus 252525, write χj(2)=e2πij/20\chi_j(2)=e^{2\pi i j/20}χj​(2)=e2πij/20. The primitive odd choices are j=1,3,7,9,11,13,17,19j=1,3,7,9,11,13,17,19j=1,3,7,9,11,13,17,19. All eight diagonal sums are nonzero. Each panel below shows the full sampled rectangle, with the same phase colors and coordinate ranges.

Eight phase portraits show every primitive odd character component modulo twenty-five. All panels use the same coordinate range and phase colors. Each is labeled by its character exponent and its fixed diagonal sum. Eight phase portraits show every primitive odd character component modulo twenty-five. All panels use the same coordinate range and phase colors. Each is labeled by its character exponent and its fixed diagonal sum.
Phase portraits for all eight primitive odd characters modulo 25, on common ranges.

The numerical grid has 201201201 horizontal and 801801801 vertical samples per component. The direct kernel construction and its factored expression are checked separately. These pictures report finite computations.

This family is a different object from the prime-weighted series in The Collision Transform and the Critical Strip. There the complex parameter divides each prime’s weight, and here it enters through a kernel placed on a finite digit table. Identifying the two would take a separate argument.

The coefficient is waiting at zero

As sss moves to the left edge, the common factor tends to iπ/φ(m)i\pi/\varphi(m)iπ/φ(m), and the classical value L(0,χ‾)=−B1,χ‾L(0,\overline\chi)=-B_{1,\overline\chi}L(0,χ​)=−B1,χ​​ gives

Aχ(0)=−iπφ(m)B1,χ‾Dℓ(χ).\mathcal A_\chi(0)=-\frac{i\pi}{\varphi(m)} B_{1,\overline\chi}D_\ell(\chi).Aχ​(0)=−φ(m)iπ​B1,χ​​Dℓ​(χ).

At lag one in an odd prime base the right side is iπi\piiπ times the finite collision coefficient, so dividing by iπi\piiπ hands it back,

Aχ(0)iπ=S^∘(χ),\frac{\mathcal A_\chi(0)}{i\pi}=\widehat S^\circ(\chi),iπAχ​(0)​=S∘(χ),

direction as well as length.

The normalized transform for the eighteen-degree character follows a short complex-plane curve from its finite coefficient at s equal to zero to a different value at one. Beneath it, all eight primitive odd characters have their starting coefficients marked by gold rings. The normalized transform for the eighteen-degree character follows a short complex-plane curve from its finite coefficient at s equal to zero to a different value at one. Beneath it, all eight primitive odd characters have their starting coefficients marked by gold rings.
The transform divided by iπ as real s runs from 0 to 1, starting on the gold ring computed from the twenty fractions. Below, all eight characters.

The top panel follows Aχ(s)/(iπ)\mathcal A_\chi(s)/(i\pi)Aχ​(s)/(iπ) as sss runs along the real axis from 000 to 111. It starts on the gold ring, which comes from averaging the twenty signed fractions directly, at about 0.441164−0.520524i0.441164-0.520524i0.441164−0.520524i, and drifts right to 0.982604−0.462379i0.982604-0.462379i0.982604−0.462379i at s=1s=1s=1. No constant was adjusted to make the curve begin on the ring. In the lower panel all eight characters do the same, conjugate pairs mirrored across the real axis, each one starting from its own finite coefficient.

The far end is a different value. At s=1s=1s=1 the continued kernel is −1/2+(i/2)cot⁡(πx)-1/2+(i/2)\cot(\pi x)−1/2+(i/2)cot(πx), a Gauss sum enters the boundary formula, and the Bernoulli number switches from B1,χ‾B_{1,\overline\chi}B1,χ​​ to B1,χB_{1,\chi}B1,χ​. The Dirichlet functional equation connects the two edges without making them equal.

The two boundary formulas and all eight checks

With B1,χ=m−1∑a∈Umaχ(a)B_{1,\chi}=m^{-1}\sum_{a\in U_m}a\chi(a)B1,χ​=m−1∑a∈Um​​aχ(a) and the Gauss sum τ(χ‾)=∑a∈Umχ(a)‾e2πia/m\tau(\overline\chi)=\sum_{a\in U_m}\overline{\chi(a)}e^{2\pi ia/m}τ(χ​)=∑a∈Um​​χ(a)​e2πia/m, the right boundary is

Aχ(1)=−τ(χ‾)φ(m)B1,χDℓ(χ).\mathcal A_\chi(1)=-\frac{\tau(\overline\chi)}{\varphi(m)} B_{1,\chi}D_\ell(\chi).Aχ​(1)=−φ(m)τ(χ​)​B1,χ​Dℓ​(χ).

Notice the change from B1,χ‾B_{1,\overline\chi}B1,χ​​ at zero to B1,χB_{1,\chi}B1,χ​ at one. Conjugation changes the phase. Keeping only magnitudes would conceal that difference.

Both columns below are divided by iπi\piiπ. The first also agrees with an independent finite-table calculation. Values are rounded to six decimal places.

Character exponent At zero At one
1 0.441164−0.520524i0.441164-0.520524i0.441164−0.520524i 0.982604−0.462379i0.982604-0.462379i0.982604−0.462379i
3 −0.313818−0.765833i-0.313818-0.765833i−0.313818−0.765833i −0.082709−1.314625i-0.082709-1.314625i−0.082709−1.314625i
7 0.066605−0.004988i0.066605-0.004988i0.066605−0.004988i 0.006675−0.106091i0.006675-0.106091i0.006675−0.106091i
9 0.206050−0.050296i0.206050-0.050296i0.206050−0.050296i 0.305440+0.143729i0.305440+0.143729i0.305440+0.143729i
11 0.206050+0.050296i0.206050+0.050296i0.206050+0.050296i 0.305440−0.143729i0.305440-0.143729i0.305440−0.143729i
13 0.066605+0.004988i0.066605+0.004988i0.066605+0.004988i 0.006675+0.106091i0.006675+0.106091i0.006675+0.106091i
17 −0.313818+0.765833i-0.313818+0.765833i−0.313818+0.765833i −0.082709+1.314625i-0.082709+1.314625i−0.082709+1.314625i
19 0.441164+0.520524i0.441164+0.520524i0.441164+0.520524i 0.982604+0.462379i0.982604+0.462379i0.982604+0.462379i
The grid, the fixed factor and the boundary curve, first drawings
The five equal-digit cells in the original base-five grid, with their ordinary integer labels.
The five equal-digit cells in the original base-five grid, with their integer labels.
Nineteen real-parameter evaluations recover the same diagonal sum after the two changing factors are divided out.
Nineteen real values of s, each giving back the same diagonal sum once the two moving factors are divided out.
The original normalized boundary curve starts at the finite collision coefficient and ends at a different value at one.
The first drawing of the boundary curve from s = 0 to s = 1.

The factorization says nothing about where the zeros of L(s,χ‾)L(s,\overline\chi)L(s,χ​) lie, and it gives no estimate that holds as the modulus grows. It does fix the carrier exactly. For the eighteen-degree character at modulus 252525, the transform divided by iπi\piiπ is 0.441164−0.520524i0.441164-0.520524i0.441164−0.520524i at s=0s=0s=0, the same number the twenty fractions give, and 0.982604−0.462379i0.982604-0.462379i0.982604−0.462379i at s=1s=1s=1.

Companion paper: The Analytic Collision Transform →
Share

Discussion

Sign in to join the discussion.

← All articlesRead the paper →
← Previous: The Collision Spectrum and the L-Function Landscape
Next: The Collision Invariant →