Paper IXReading edition

Hurwitz series and finite field subgroup inversion

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.2 Hurwitz series and finite field subgroup inversion

Current status. This dated statement is superseded for the stated divisor-branch family by Theorem 3.7, with the \(j!\) normalization and factorial valuation loss explicitly retained. It makes no claim for unrestricted families.

D.2.1 The Hurwitz ring

Historical definition D.1: Hurwitz series ring

Let \(R\) be a commutative ring with identity. The Hurwitz series ring \({\mathcal H}(R)\) is the set \(R^{{\mathbb N}}\) with componentwise addition and product

\[ (a{\mathbin{\star}} b)_n = \sum_{r=0}^{n} \binom nr a_r b_{n-r}. \]

Its identity is

\[ \delta=(1,0,0,\ldots). \]

When the factorials are invertible, the sequence \(a\) may be written as the exponential generating series

\[ A(t)=\sum_{n\geq0}a_n\frac{t^n}{n!}, \]

and the Hurwitz product becomes ordinary multiplication. The sequence definition remains valid in every characteristic.

Historical definition D.2: Exponential mode

For \(u\in R\), define

\[ \epsilon_u=(u^n)_{n\geq0}, \]

where \(0^0=1\).

Historical proposition D.3: Addition law for modes

For every \(u,v\in R\),

\[ \boxed{ \epsilon_u{\mathbin{\star}}\epsilon_v = \epsilon_{u+v}. } \]
Proof

The \(n\)th coefficient is

\[ \sum_{r=0}^{n} \binom nr u^rv^{n-r} = (u+v)^n \]

by the binomial theorem.

D.2.2 The finite additive group algebra

Let \(p\) be prime. Write \({\mathbb F}_p^+\) for the additive group of the finite field.

Historical theorem D.4: Finite field mode algebra

The map

\[ \Theta: {\mathbb F}_p[{\mathbb F}_p^+] \longrightarrow {\mathcal H}({\mathbb F}_p), \qquad [u]\longmapsto\epsilon_u, \]

is an injective algebra homomorphism. Its image is the \(p\) dimensional subalgebra spanned by the modes \(\epsilon_u\).

Proof

The product law follows from Historical proposition D.3. To prove injectivity, suppose

\[ \sum_{u\in{\mathbb F}_p}c_u\epsilon_u=0. \]

Looking at the coordinates \(n=0,1,\ldots,p-1\) gives a Vandermonde system with matrix

\[ (u^n)_{0\leq n\leq p-1,\ u\in{\mathbb F}_p}. \]

Its determinant is the product of all differences between distinct field elements, so it is nonzero. Hence every \(c_u\) vanishes.

Historical proposition D.5: Augmentation criterion

Let

\[ x=\sum_{u\in{\mathbb F}_p}c_u[u] \in {\mathbb F}_p[{\mathbb F}_p^+]. \]

Then \(x\) is a unit if and only if

\[ \operatorname{aug}(x) = \sum_uc_u \]

is nonzero. If \(J\) is the augmentation ideal, then

\[ J^p=0. \]
Proof

Choose a generator \(g\) of the cyclic additive group. Then

\[ {\mathbb F}_p[{\mathbb F}_p^+] \cong {\mathbb F}_p[y]/(y^p-1) = {\mathbb F}_p[y]/(y-1)^p. \]

The augmentation ideal is generated by \(y-1\), so its \(p\)th power is zero. Every element has the form \(a+n\) with \(a\in{\mathbb F}_p\) and \(n\in J\). It is invertible exactly when \(a\neq0\), which is the augmentation condition.

Historical corollary D.6: Finite inverse formula

If \(x\) has augmentation one and \(n=x-1\), then

\[ \boxed{ x^{-1} = \sum_{r=0}^{p-1}(-n)^r. } \]
Proof

By Historical proposition D.5, \(n^p=0\). The finite geometric sum gives the inverse.

D.2.3 Subgroup selectors

Fix a divisor \(m\) of \(p-1\). Let

\[ H_m = \{\zeta\in{\mathbb F}_p^\times:\zeta^m=1\}. \]

This group has order \(m\).

Historical definition D.7: Multiple selector

Define \(a^{(m)}\in{\mathcal H}({\mathbb F}_p)\) by

\[ a_n^{(m)} = \begin{cases} 1,&m\mid n,\\ 0,&m\nmid n. \end{cases} \]
Historical lemma D.8: Subgroup average

The multiple selector has the mode expansion

\[ \boxed{ a^{(m)} = \frac1m \sum_{\zeta\in H_m} \epsilon_\zeta. } \]
Proof

The \(n\)th coefficient on the right is

\[ \frac1m \sum_{\zeta\in H_m}\zeta^n. \]

The character sum is one when \(m\mid n\) and zero otherwise.

New reconstruction. A subgroup average in the additive group algebra. The highlighted modes select coefficient degrees divisible by the subgroup order.
New reconstruction. A subgroup average in the additive group algebra. The highlighted modes select coefficient degrees divisible by the subgroup order.

View full-size figure (new tab)

Since the subgroup average has augmentation one, it has a unique Hurwitz inverse. Write

\[ b^{(m,p)} = (a^{(m)})^{-1}. \]
Historical theorem D.9: Support and positive degree period

The inverse \(b^{(m,p)}\) has the following properties.

  1. \(b_n^{(m,p)}=0\) unless \(m\mid n\).

  2. For every positive \(n\),

    \[ \boxed{ b_{n+p-1}^{(m,p)} = b_n^{(m,p)}. } \]
Proof

Multiplication by an element \(\eta\in H_m\) gives an automorphism of the additive group and therefore an automorphism

\[ \epsilon_u\longmapsto\epsilon_{\eta u} \]

of the mode algebra. The selector \(a^{(m)}\) is fixed by every such automorphism, so its unique inverse is fixed as well.

Write

\[ b^{(m,p)} = \sum_{u\in{\mathbb F}_p}c_u\epsilon_u. \]

Invariance gives \(c_{\eta u}=c_u\). After the change of variable \(u\mapsto\eta u\),

\[ b_n^{(m,p)} = \eta^n b_n^{(m,p)} \]

for every \(\eta\in H_m\). If \(m\nmid n\), some \(\eta\) satisfies \(\eta^n\neq1\), so the coefficient vanishes.

For positive \(n\), the zero mode contributes nothing. Every nonzero mode satisfies \(u^{p-1}=1\). Hence

\[ b_{n+p-1}^{(m,p)} = \sum_{u\neq0}c_uu^{n+p-1} = \sum_{u\neq0}c_uu^n = b_n^{(m,p)}. \]
Historical definition D.10: Compressed inverse

Set

\[ e_n^{(m,p)} = b_{mn}^{(m,p)}. \]
Historical proposition D.11: Compressed inverse recurrence

The compressed coefficients satisfy

\[ \boxed{ \sum_{q=0}^{n} \binom{mn}{mq} e_q^{(m,p)} = \delta_{n0}. } \]

In particular, \(e_0^{(m,p)}=1\), and the positive coefficients are determined recursively because the diagonal is one.

Proof

Evaluate the Hurwitz identity

\[ a^{(m)}{\mathbin{\star}} b^{(m,p)}=\delta \]

at degree \(mn\). Both factors vanish outside degrees divisible by \(m\). Reindexing the surviving terms gives the displayed recurrence.

Historical corollary D.12: Uniform compressed period

Let

\[ h=\frac{p-1}{m}. \]

Then

\[ \boxed{ e_{n+h}^{(m,p)} = e_n^{(m,p)} \qquad(n\geq1). } \]
Proof

Since \(m(n+h)=mn+p-1\), the conclusion follows from Historical theorem D.9.

Historical corollary D.13: Rational ordinary generating function

In \({\mathbb F}_p[[z]]\),

\[ \boxed{ \sum_{n\geq0}e_n^{(m,p)}z^n = 1+ \frac{ \sum_{r=1}^{h}e_r^{(m,p)}z^r }{1-z^h}. } \]
Proof

Separate the constant coefficient and group the positive indices into residue classes modulo \(h\).

Historical theorem D.14: Exponential form and minimal period

Let

\[ G_m=({\mathbb F}_p^\times)^m. \]

This cyclic group has order \(h\). There are uniquely determined coefficients \(d_v\in{\mathbb F}_p\), indexed by \(v\in G_m\), such that

\[ \boxed{ e_n^{(m,p)} = \sum_{v\in G_m}d_vv^n \qquad(n\geq1). } \]

The minimal positive period is the least common multiple of the orders of those \(v\) for which \(d_v\neq0\). In particular, it divides \(h\).

Proof

The coefficients \(c_u\) in the proof of Historical theorem D.9 are constant on the cosets of \(H_m\). For \(u\neq0\), the value \(u^m\) depends only on the coset, and every element of \(G_m\) arises. Grouping the modes by cosets gives the displayed expansion.

Distinct elements of \(G_m\) define linearly independent functions on one full period, by the Vandermonde determinant. Therefore a positive integer \(r\) is a period exactly when \(v^r=1\) for every active mode. The least such \(r\) is the stated least common multiple.

Historical example D.15: A compressed inverse modulo seven

Editorial numerical correction. The positive-index standard-window tail printed below is erroneous. The defining recurrence gives \(e_1=-1\equiv6\), \(e_2=5\) and \(e_3=-61\equiv2\pmod7\), so the correct positive tail is \(6,5,2,6,5,2,\ldots\). The period-three conclusion remains correct. The original line is retained only as a corrected historical record. Take \(p=7\) and \(m=2\), so \(h=3\). The recurrence gives

\[ e_n^{(2,7)} = 1,6,4,1,6,4,\ldots \qquad(n\geq1). \]

The positive tail has exact period three.

New reconstruction. Several compressed inverses. Every row is periodic after the constant term, as proved in cref hist:cor:compressed period .
New reconstruction. Several compressed inverses. Every row is periodic after the constant term, as proved in Historical corollary D.12.

View full-size figure (new tab)

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