
An ordinary mean gives every value the same share. Add eight numbers and divide by eight. Here, the digit function chooses the shares.
In base five, they look like this.
Each bar belongs to one Dirichlet -function value. Its height tells us how much the squared magnitude of that value counts in a weighted mean. The shares come from the boundaries between digits in long division.
The Collision Spectrum and the L-Function Landscape develops the factorization and the exact base-five fourth moment. This preprint also determines the total diagonal weight at every odd prime base. That total makes the averaging rule exact.
To calculate what these weights give us, start with the collision table.
A collision occurs when multiplication moves a remainder into another remainder that produces the same digit. The Collision Invariant gives a finite table for the deviation of this count from . At lag one, the entry depends only on the last two base- digits of the prime .
Here is the table in base five. The row and column labels are the two digits. The entries are ordinary signed integers.
| First digit | Ends in 1 | Ends in 2 | Ends in 3 | Ends in 4 |
|---|---|---|---|---|
| 0 | 0 | 1 | 0 | 3 |
| 1 | 0 | −1 | 2 | −1 |
| 2 | 0 | 1 | −2 | −1 |
| 3 | 0 | −3 | 0 | −1 |
| 4 | −4 | −1 | −2 | −1 |
The column ending in zero is absent because its residues are divisible by five.
For a concrete entry, take the denominator . Multiplication by five gives eight collisions among its twenty-eight nonzero remainders. Subtract and the deviation is . Since , it belongs in cell . That is the at the top right.
Now read down the first column. Four zeros and a . Its mean is . Subtracting that mean leaves four copies of and one . Their squares add to
Do the same in the other three columns. Their means are , and . The figure shows every centered entry and each column’s sum of squares.
I write the centered entries as and call their sum of squares the collision energy. Here it is
The sum includes all twenty residue classes coprime to . Centering is essential. Squaring the original integers would give a different number.
A Dirichlet character assigns a complex weight to each residue class, with one rule. The weight of a product is the product of the weights. Modulo , these weights repeat every twenty-five integers and are zero at multiples of five.
Use such a pattern to weight the harmonic series,
For a nontrivial character, the weights in a complete period sum to zero. The cancellation makes this series converge. Its value is a complex number. The notation means its magnitude, its distance from zero.
These are the same character weights that appear in Euler products over primes. That connection gives -functions their place in the analytic theory of primes.
The character also reads the finite table. Multiply each centered entry by the conjugate character weight and average over the twenty entries. The result, , is one Fourier coefficient of the table. The bar in the formulas below denotes complex conjugation.
The Collision Transform explains which coefficients can survive. Reflection removes the even characters. Column centering removes characters whose pattern already repeats modulo . In base five, this leaves eight possible channels. They are the primitive odd characters modulo .
We now have two numbers attached to the same character. One comes from an infinite series. The other comes from twenty entries in a table.
There are two finite sums to look at first.
The generalized Bernoulli number weights each residue by , adds over the twenty coprime classes and divides by . A classical identity gives its magnitude,
A finite sum has given us the size of the infinite one.
For the other sum, mark the equal-digit positions in base five. In ordinary notation these are . At each position , take the difference and add the five differences. This is the diagonal factor . It records how the character weights change across those digit boundaries.
Then the coefficients factor.
This is the decomposition theorem at base five. The Bernoulli sum supplies the -value. The diagonal sum supplies the contribution from the digit geometry. Their product gives the Fourier coefficient, including its phase.
The proof follows the floor jumps that define the collision table. Their character sums turn into Bernoulli terms. The part depending only on the final digit cancels, leaving the differences along the equal-digit diagonal. That is where the product comes from.
The factorization holds for every odd prime base . The denominator becomes , the number of coprime classes modulo .
Parseval’s identity now lets us add the squares. It says that the total squared size of a finite signal agrees with the total squared size of its Fourier coefficients, with the normalization accounted for. Here each coefficient has an -value inside it. Substituting the factorization gives
The set consists of the primitive odd characters modulo . The energy sums over all coprime classes.
So the table evaluates a weighted second moment of the -values. Each squared -value receives a weight supplied by the digit diagonal. The total of these weights is exact too,
Divide by that total and the weights add to one. This gives the shares in the opening figure. At base five the unnormalized total is , and the resulting weighted mean of the squared -value magnitudes is .
The exact total follows from character orthogonality. When the squared diagonal sums are expanded, we compare every pair of positions on the diagonal. Matching positions contribute. The two remaining congruence contributions cancel. Counting the surviving pairs gives at every odd prime base.
We therefore know both the weights and the weighted mean. The digit function supplies the rule for averaging, and the collision energy evaluates the answer.
How the diagonal weights and the -values vary together as the prime base grows remains open. At base five, their relationship can be settled in every channel.
At base five, the two finite factors have proportional magnitudes,
The proof is a polynomial identity. The residue generates all twenty coprime classes modulo , so a character is determined by its value at . For each of our eight characters, that value is a primitive twentieth root of unity. Both finite sums become polynomials in the same root. Reducing those polynomials gives the equality above.
The Bernoulli factor already carries . Now the diagonal factor carries a second copy. Multiplying them gives
Each Fourier magnitude is a squared -value with the same scaling constant. Squaring those magnitudes once more produces fourth powers.
Call their sum ,
Both members of each conjugate pair are counted. There are eight terms. Parseval says their corresponding squared Fourier magnitudes add to . Substituting the coefficient formula and rearranging gives .
The energy is the we calculated from the table. Hence
I began with a question about two remainders producing the same digit. That question gave a finite table. Its symmetry gave a character expansion. The factorization now tells us what those coefficients contain.
Here, at base five, we can carry the calculation to an exact answer. Twenty entries, four column means and a sum of squares have evaluated the fourth moment of eight infinite series. The number that made it possible was .
Comments
Sign in to join the discussion.