Paper IXReading edition

Recurrence packets and a common integral spine

Reading tools
Reading libraryFind statementsInspect Lean
Switch work

Saved reading

Read side by side

Start reading

Resources & source

Original TeX with line links · Download TeX

The wording and mathematics follow the retained manuscript. This reading format does not add a proof review or extend Lean coverage.

Skip contents and start reading

D.9 Recurrence packets and a common integral spine

Linear recurrences provide a setting where residue subsequences, local completions, and a common global source can all be described exactly. Background on recurrence sequences may be found in [EverestVanDerPoortenShparlinskiWard2003], [Stanley2012].

D.9.1 Companion jumps

Let \(R\) be a commutative ring. Let

\[ v_{n+1}=Cv_n, \qquad C\in M_d(R). \]

For a positive integer \(N\) and an address \(j\in\{0,\ldots,N-1\}\), define the residue state packet

\[ u_k^{(j)}=v_{Nk+j}. \]
Historical theorem D.96: Companion jump recurrence

Every residue state packet satisfies

\[ \boxed{ u_{k+1}^{(j)}=C^Nu_k^{(j)}.} \]

More explicitly,

\[ \boxed{ u_k^{(j)}=C^j(C^N)^kv_0.} \]
Proof

The state relation gives \(v_n=C^nv_0\). Substitute \(n=Nk+j\).

New reconstruction. Fibonacci residues F 3k+j , with F 0=0 and F 1=1. Each packet evolves by the same jump matrix (C 3 ) and has a different initial address.
New reconstruction. Fibonacci residues \(F_{3k+j}\), with \(F_0=0\) and \(F_1=1\). Each packet evolves by the same jump matrix \(C^3\) and has a different initial address.

View full-size figure (new tab)

We use the resultant convention

\[ {\operatorname{Res}}_y(f,g) = \prod_{f(\alpha)=0}g(\alpha) \]

when \(f\) is monic, with roots counted with multiplicity.

Historical theorem D.97: Characteristic polynomial of the jump

Let

\[ \chi_C(y)=\det(yI-C). \]

Then

\[ \boxed{ \chi_{C^N}(x) = {\operatorname{Res}}_y\bigl(\chi_C(y),x-y^N\bigr). } \]

The identity holds over the coefficient ring after interpreting the resultant universally.

Proof

After passage to an algebraic closure, let \(\alpha_1,\ldots,\alpha_d\) be the eigenvalues of \(C\), counted with algebraic multiplicity. The resultant is

\[ \prod_{i=1}^{d}(x-\alpha_i^N), \]

which is the characteristic polynomial of \(C^N\). Both sides are polynomial expressions with integer coefficients in the entries of \(C\), so the identity descends to every commutative coefficient ring.

New reconstruction. Passing to every (N )th term raises each characteristic root to its (N )th power.
New reconstruction. Passing to every \(N\)th term raises each characteristic root to its \(N\)th power.

View full-size figure (new tab)

D.9.2 Second order recurrences

Historical theorem D.98: Residue subsequences of a second order recurrence

Suppose

\[ x_{n+2}=Px_{n+1}-Qx_n \]

over a commutative ring. Define \(V_0=2\), \(V_1=P\), and

\[ V_{n+2}=PV_{n+1}-QV_n. \]

For every positive integer \(N\) and every address \(j\), the subsequence

\[ u_k=x_{Nk+j} \]

satisfies

\[ \boxed{ u_{k+2}=V_Nu_{k+1}-Q^Nu_k.} \]
Proof

The companion matrix

\[ C= \begin{pmatrix} P&-Q\\ 1&0 \end{pmatrix} \]

has trace \(P\) and determinant \(Q\). The trace of \(C^N\) is \(V_N\), while its determinant is \(Q^N\). Cayley Hamilton applied to \(C^N\) gives

\[ (C^N)^2-V_NC^N+Q^NI=0. \]

Apply this identity to the residue state packet and take its scalar coordinate.

Historical corollary D.99: Fibonacci residue packets

Let \(F_0=0\), \(F_1=1\), and \(F_{n+2}=F_{n+1}+F_n\). Let \(L_N\) denote the Lucas number. For every \(N\geq1\) and every address \(j\),

\[ \boxed{ F_{N(k+2)+j} = L_NF_{N(k+1)+j} -(-1)^NF_{Nk+j}. } \]
Proof

Apply Historical theorem D.98 with \(P=1\) and \(Q=-1\). Then \(V_N=L_N\).

D.9.3 Finite and local periodicity

Historical theorem D.100: Periodicity of an invertible recurrence modulo a prime power

Let

\[ C\in M_d({\mathbb Z}), \qquad p\nmid\det C. \]

For every \(L\geq1\), every state orbit modulo \(p^L\) is purely periodic. Its period divides the order of \(C\) in

\[ \operatorname{GL}_d({\mathbb Z}/p^L{\mathbb Z}). \]

If \(p\mid\det C\), every orbit is still eventually periodic.

Proof

When \(p\nmid\det C\), multiplication by \(C\) is a permutation of the finite state set \(({\mathbb Z}/p^L{\mathbb Z})^d\). Every orbit of a permutation is periodic, and applying the group order relation for \(C\) gives the divisibility statement. Without invertibility, repeated application of a map on a finite set eventually repeats a state, after which the orbit is periodic.

Historical corollary D.101: Residue packet periods

Under the invertibility hypothesis of Historical theorem D.100, every residue packet with jump \(N\) has period dividing the order of \(C^N\) modulo \(p^L\).

Proof

Use the jump matrix from Historical theorem D.96.

D.9.4 The common integral spine

Historical theorem D.102: Base change of an integral recurrence

Let

\[ C\in M_d({\mathbb Z}), \qquad v_0\in{\mathbb Z}^d. \]

The integral orbit

\[ v_n=C^nv_0 \]

determines, by base change, compatible orbits in every ring \(R\) equipped with a homomorphism \({\mathbb Z}\to R\). In particular, the reductions modulo every positive integer and the orbits in every \({\mathbb Z_p}^d\) share the same companion matrix, characteristic polynomial, and integer recurrence relations.

Proof

Every coordinate of \(C^nv_0\) is an integer polynomial in the entries of \(C\) and \(v_0\). Applying a ring homomorphism commutes with matrix multiplication and preserves every polynomial relation with integer coefficients.

Historical corollary D.103: Prime independent recurrence spine

An integral companion system gives a canonical common source for all of its local realizations. No choice of coefficient prime is required to define the recurrence or its residue packets.

Proof

Apply Historical theorem D.102 to the companion matrix and its initial state.

Historical remark D.104

This theorem supplies a prime independent spine for integral linear recurrences. It does not prove that every unrelated family of local arithmetic packets arises from one global object.

Source and conversion record

Source SHA-256: 87ee9bd6c3df86066ea44a9db069d8cf75a1b673a7dffb8dfbbebb7dfe1b68c4

Unsupported prose commands stop the build. The mathematical expression sequence is checked against the source, with manuscript macros expanded for display.

Conversion records

Notation in Paper IX

Look up a symbol without leaving this chapter. Select text before opening help to search for it.

Search this work’s notation.

    Symbols can have different meanings in different passages. Read each result in its own context.

    Open the full notation index