We use the Hecke automaton defined and studied in the companion paper . Briefly: is the elliptic curve of conductor and rank , with Mordell–Weil generator , and its weight- newform. The six small Hecke operators have eigenvalues Their gate types on the formal-group quotient at the prime are The transition rule on a unit state under a non-annihilator gate is The shell coordinate is therefore a deterministic counter on each trajectory, additively driven by the values of the applied gates .
Throughout this section, let be i.i.d. uniform random variables on the five-element set of non-annihilator gates of . Given an initial state , define the random trajectory by iterating the transition rule with . Set
[lem:single] Each is a Bernoulli random variable with parameter .
Reading off the gate table, exactly two of the five gates in have (namely and ), and the remaining three have . Since is uniform on , with probability and with probability .
[thm:drift] For every initial state and every , The rate is independent of the state and of the residue coordinate.
By Lemma [lem:single], are i.i.d. . Independence of state follows from the fact that the increment depends only on the gate , not on . Linearity of expectation gives , and independence gives .
[thm:law] For every , the random variable is binomial: In particular, the moment generating function is .
is a sum of i.i.d. Bernoulli variables by Lemma [lem:single].
[thm:hoeff] For every and every , $$\Pr\!\Bigl[\,\bigl|K_n-k_0-\tfrac{2n}{5}\bigr|\geq \epsilon n\,\Bigr] \;\leq\; 2\exp\!\bigl(-2n\epsilon^2\bigr).$$ Equivalently, a.s. exponentially fast in .
Hoeffding’s inequality applied to the bounded i.i.d. sum with .
[cor:clt] $\displaystyle \frac{K_n-k_0-\frac{2n}{5}}{\sqrt{6n/25}} \;\xrightarrow{d}\; \mathcal N(0,1).$
[prop:formula] Let be any finite set of gate primes for an elliptic newform , and let be the subset on which . Then under uniform i.i.d. sampling from , the mean shift increment of the associated Hecke automaton is
Linearity of expectation, exactly as in the proof of Theorem [thm:drift].
For with , we have and , giving .
The constant is independent of the residue coordinate, of the initial state, of which permutation gate appears (swap vs. identity), and of the Atkin–Lehner sign of the level. It depends only on the multiset for the chosen gate set.
In the trace Gram matrix on the seven-element Heegner set was shown to satisfy We record one quantitative consequence which the present paper makes visible.
[prop:trace-asymp] Let be the non-annihilator subset. The arithmetic mean of over is bounded above and below by absolute constants independent of which Heegner prime one picks; numerically, with the data of , The diagonals are roughly linear in across the gate set (within a factor of ), while the off-diagonals are bounded by twice the smaller diagonal — a nontrivial constraint compatible with, but not implied by, the linear growth on the diagonal.
Using , , , , from , the ratios are , , , , . Direct evaluation.
We do not claim a closed form for the diagonal growth, nor a conceptual link between the drift rate and the trace constants. The two phenomena live on different objects: the drift is a property of the formal-group automaton, while the trace inequality is a property of . Whether the gate-level identity controls anything about the modular trace remains open.
[prop:family] For any imaginary quadratic field of class number one with prime discriminant , , and any rational elliptic newform at level (when one exists), the same construction yields a Hecke automaton with a well-defined drift rate under uniform sampling from any chosen non-annihilator gate set . The map is a finite, computable invariant of the level once a gate set has been chosen.
Proposition [prop:formula] applied at each level.
We do not evaluate for here. Doing so requires a choice of gate set at each level and the corresponding Sage computation of . At levels the space is zero so no exists, and at the space is one-dimensional and the construction reduces trivially. The interesting cases are . We state Proposition [prop:family] only as an existence result; numerical evaluation across the family is deferred.
No connection between the drift rate and the trace inequality of is proved or even conjectured.
No statement is made about the orbit of the Mordell–Weil generator under multiplication-by-. As noted in , that orbit is not monotone in , and the drift theorem here applies only to the random gating model on the automaton, not to the integer orbit.
The choice of uniform sampling over is a modelling choice, not derived from arithmetic. Other natural sampling measures (e.g. weighted by as in the trace Gram matrix, or by for prime-density reasons) yield different drift rates. We compute one of them.
[prop:weighted] Under sampling proportional to on , with weights summing to , the mean shift increment is Equivalently, where is the cofactor in from .
Weighted average of with weights .
The two natural drift rates are Their ratio is . We record this without interpretation.
The five-line verification of all numerical claims in this paper:
ap = {3:0, 7:2, 11:-6, 19:-6, 43:7, 67:-2}
nonzero = {p:a for p,a in ap.items() if a != 0}
v3 = lambda n: 0 if n%3 else 1+v3(n//3)
mu = sum(v3(abs(a)) for a in nonzero.values()) / len(nonzero)
assert mu == 2/5
9
R. Hoekstra, The Hecke automaton at conductor : monotonicity, symmetry, and confinement on the formal-group quotient, companion paper.
R. Hoekstra, A trace inequality for Hecke operators at class-number-one Heegner primes of level .