---
title: Generalized k-th Power Symbol
url: https://www.emergentmind.com/topics/generalized-k-th-power-symbol
type: topic
---

# Generalized k-th Power Symbol

The generalized \(k\)-th power symbol is a family of constructions that encode \(k\)-th power residuosity, or closely related power-congruence data, in algebraic settings ranging from finite fields and residue class rings to mixed characteristic local fields. In the supplied literature, it appears in three principal forms: as a multiplicative-character indicator for membership in the subgroup of \(k\)-th powers in \(\mathbb{F}_q^\times\); as the “Exponential Congruence Symbol” \(\left(\frac{a}{n}\right)_k\in\{-1,0,1\}\), defined by the congruences \(a^k\equiv \pm1 \pmod n\); and as the tame \(n\)-th power residue symbol \((\cdot,\cdot)_n:K^\times\times K^\times\to\mu_n\) for local fields, together with K-theoretic and central-extension enhancements. A related analytic literature studies the distribution of \(k\)-th power residues and nonresidues, especially over finite fields and prime moduli, via primitive elements, character sums, and arithmetic progressions [2104.12185], [2510.00017], [2010.07682], [2405.13159].

## 1. Finite-field formulation and character-theoretic detection

Let \(\mathbb{F}_q\) be the finite field of \(q\) elements. Its multiplicative group \(\mathbb{F}_q^\times\) is cyclic of order \(q-1\), so there is a primitive element \(\gamma\in\mathbb{F}_q^\times\) such that
\[
\mathbb{F}_q^\times=\langle \gamma\rangle=\{\gamma^0,\gamma^1,\dots,\gamma^{q-2}\}.
\]
If \(k\mid q-1\), then
\[
\mathbb{F}_q^{\times k}=\{x^k:x\in\mathbb{F}_q^\times\}
\]
is a subgroup of \(\mathbb{F}_q^\times\) of index \(k\), and in fact \(\mathbb{F}_q^{\times k}=\langle\gamma^k\rangle\), a cyclic group of order \((q-1)/k\).

In this setting, a generalized \(k\)-th power symbol is any function that determines whether a given \(x\in\mathbb{F}_q^\times\) lies in \(\mathbb{F}_q^{\times k}\). Two incarnations are standard. The first is the indicator function
\[
\mathbf{1}_{\mathbb{F}_q^{\times k}}(x)=
\begin{cases}
1 & \text{if }x\in\mathbb{F}_q^{\times k},\\
0 & \text{otherwise}.
\end{cases}
\]
The second is the multiplicative-character formulation: if \(\chi_k\) is a multiplicative character of order \(k\) on \(\mathbb{F}_q^\times\), extended by \(\chi_k(0)=0\), then
\[
\frac{1}{k}\sum_{j=0}^{k-1}\chi_k^j(x)=
\begin{cases}
1 & \text{if }x\in\mathbb{F}_q^{\times k},\\
0 & \text{otherwise}.
\end{cases}
\tag{\(*\)}
\]
This is the standard generalized \(k\)-th power symbol in character-theoretic form [2104.12185].

For \(k=2\), this reduces to the usual quadratic residue symbol. The unique nontrivial character \(\chi\) of order \(2\) satisfies \((*)\) with \(k=2\), and \(\chi(x)=1\) for squares and \(-1\) for nonsquares. For higher \(k\), \(\chi_k\) and \((*)\) generalize the same mechanism. The same finite-field criterion also appears in analytic work modulo a prime \(p\): if \(k\mid p-1\), then an element \(a\in\mathbb{F}_p^\times\) is a \(k\)-th power residue if and only if
\[
a^{(p-1)/k}\equiv 1 \pmod p,
\]
and otherwise it is a \(k\)-th power nonresidue [2405.13159].

This finite-field formulation supplies the basic algebraic template for much of the later theory. It turns residuosity into an indicator, a character, or an exponent test, depending on the problem at hand.

## 2. Symbols on residue class rings: the Exponential Congruence Symbol

A second formulation is the Exponential Congruence Symbol
\[
\left(\frac{a}{n}\right)_k\in\{-1,0,1\},
\]
defined for integers \(n\ge 2\), \(k\ge 1\), and \(a\in\mathbb{Z}\) by
\[
\left(\frac{a}{n}\right)_k=
\begin{cases}
1, & \text{if } a^k\equiv 1 \pmod n,\\[4pt]
-1, & \text{if } a^k\equiv -1 \pmod n,\\[4pt]
0, & \text{otherwise}.
\end{cases}
\]
The symbol only records whether \(a^k\equiv 1\pmod n\), \(a^k\equiv -1\pmod n\), or neither holds. If the symbol is nonzero, then necessarily \(\gcd(a,n)=1\). It is invariant on residue classes modulo \(n\): if \(a\equiv b\pmod n\), then
\[
\left(\frac{a}{n}\right)_k=\left(\frac{b}{n}\right)_k.
\]
This follows because \(a^k\equiv b^k\pmod n\) [2510.00017].

The supplied literature attributes several algebraic properties to this symbol. On the subgroup
\[
A_{n,k}:=\{a\in(\mathbb{Z}/n\mathbb{Z})^\times:a^k\in\{\pm1\}\},
\]
the map \(a\mapsto a^k\) is a homomorphism \(A_{n,k}\to\{\pm1\}\), and on this natural domain the symbol is multiplicative:
\[
\left(\frac{ab}{n}\right)_k=\left(\frac{a}{n}\right)_k\left(\frac{b}{n}\right)_k.
\]
The paper also states the more general multiplicativity
\[
\left(\frac{ab}{n}\right)_k=\left(\frac{a}{n}\right)_k\cdot \left(\frac{b}{n}\right)_k
\]
when \(\gcd(a,n)=\gcd(b,n)=1\). It further records inversion symmetry,
\[
\left(\frac{a^{-1}}{n}\right)_k=\left(\frac{a}{n}\right)_k,
\]
power compatibility,
\[
\left(\frac{a^t}{n}\right)_k=\left(\frac{a}{n}\right)_{tk},
\]
and periodicity in \(k\): if \(r=\operatorname{ord}_n(a)\), then
\[
\left(\frac{a}{n}\right)_k=\left(\frac{a}{n}\right)_{k+r}.
\]

The dependence on multiplicative order is explicit. If \(d=\operatorname{ord}_n(a)\), then
\[
\left(\frac{a}{n}\right)_k=
\begin{cases}
1, & d\mid k,\\[0.3em]
-1, & a^k\equiv -1\pmod n \text{ (equivalently } d\mid 2k,\ d\nmid k),\\[0.3em]
0, & \text{otherwise}.
\end{cases}
\]
This makes the symbol a compact encoding of order-theoretic information in \((\mathbb{Z}/n\mathbb{Z})^\times\) [2510.00017].

The Chinese remainder theorem governs composite moduli. If \(n=\prod_i n_i\) with the \(n_i\) pairwise coprime, then
\[
\left(\frac{a}{n}\right)_k=s\in\{\pm1\}
\iff
\left(\frac{a}{n_i}\right)_k=s \text{ for all }i.
\]
If different factors yield different signs, or some factor yields \(0\), then the global symbol is \(0\). This is not presented as a product formula, but as a consistency criterion across local components.

## 3. Relation to classical residue symbols and higher-power residuosity

The generalized \(k\)-th power symbol specializes to classical symbols for specific choices of \(k\). For an odd prime \(p\), if \(k=(p-1)/2\), then Euler’s criterion gives
\[
a^{(p-1)/2}\equiv \left(\frac{a}{p}\right)\pmod p,
\]
so that
\[
\left(\frac{a}{p}\right)_{(p-1)/2}=\left(\frac{a}{p}\right),
\]
where \(\left(\frac{a}{p}\right)\) is the Legendre symbol. For odd composite \(n\), the Exponential Congruence Symbol with \(k=\varphi(n)/2\) is described as “compatible” with the Jacobi symbol when \(\gcd(a,n)=1\). If \(p\equiv 1\pmod m\) with \(m\ge 3\) and \(k=(p-1)/m\), then
\[
\left(\frac{a}{p}\right)_k=1 \iff a \text{ is an } m\text{-th power residue mod }p.
\]
This places quadratic, cubic, and higher residue tests inside a common formalism [2510.00017].

For prime modulus \(p\), the cyclic structure of \((\mathbb{Z}/p\mathbb{Z})^\times\) makes the symbol fully explicit. If \(g\) is a primitive root modulo \(p\) and \(a\equiv g^r\pmod p\), then
\[
\left(\frac{a}{p}\right)_k=
\begin{cases}
1, & kr\equiv 0 \pmod{p-1},\\[0.3em]
-1, & kr\equiv \frac{p-1}{2}\pmod{p-1},\\[0.3em]
0, & \text{otherwise}.
\end{cases}
\]
The number of residues \(a\pmod p\) with symbol \(=1\) is \(\gcd(k,p-1)\). The number with symbol \(=-1\) is
\[
\begin{cases}
\gcd(k,p-1), & \text{if }\gcd(k,p-1)\mid \frac{p-1}{2},\\
0, & \text{otherwise}.
\end{cases}
\]
Thus the distribution of symbol values modulo \(p\) is controlled explicitly by \(\gcd(k,p-1)\) [2510.00017].

The finite-field literature uses a different but equivalent language. For \(k\mid p-1\), the generalized symbol modulo \(p\) is described conceptually by
\[
\left(\frac{a}{p}\right)_k:=a^{(p-1)/k}\pmod p.
\]
Then \(a\) is a \(k\)-th power residue if and only if \(\left(\frac{a}{p}\right)_k=1\), and a \(k\)-th power nonresidue if and only if \(\left(\frac{a}{p}\right)_k\neq 1\). The associated characteristic functions can be realized through primitive roots and exponential sums: if \(T\) is a primitive root mod \(p\), then
\[
x_k(a)=
\sum_{0\le m<p/k}\frac{1}{p}\sum_{0\le s<p-1}e^{2\pi i\,(T^{km}-a)s/p}
=
\begin{cases}
1 & \text{if }a\text{ is a }k\text{-th power residue},\\
0 & \text{if }a\text{ is a }k\text{-th power nonresidue},
\end{cases}
\]
and
\[
\chi_k(a):=
\sum_{0\le m<p/k}\frac{1}{p}\sum_{0\le s<p-1}e^{2\pi i\,(T^{km+1}-a)s/p}
=
\begin{cases}
1 & \text{if }a\text{ is a }k\text{-th power nonresidue},\\
0 & \text{if }a\text{ is a }k\text{-th power residue}.
\end{cases}
\]
These are indicator functions built from orthogonality rather than root-of-unity values, but they serve the same detecting function [2405.13159].

## 4. Primitive elements, polynomial values, and finite-field distribution

A major finite-field application concerns the interaction between primitive elements and \(k\)-th power values of polynomials. Let
\[
f(x)=ax^2+bx+c\in \mathbb{F}_q[x]
\]
with \(b^2-4ac\neq 0\), and let \(k\mid q-1\) with \(k\ge 2\). The problem is whether there exists a primitive element \(g\in\mathbb{F}_q\) such that \(f(g)\in\mathbb{F}_q^{\times k}\). Wu and She prove that this is true for sufficiently large \(q\): if
\[
q>\max\{e^{e^3},(2k)^6\},
\]
then there exists a primitive element \(g\) such that
\[
f(g)\in\mathbb{F}_q^{\times k}.
\]
They also establish a refined criterion. Let \(t\) be a positive divisor of \(q-1\) with \(\operatorname{Rad}(t)<\operatorname{Rad}(q-1)\); let \(p_1,\dots,p_s\) be all primes dividing \(q-1\) but not \(t\); and set
\[
\delta=1-\sum_{i=1}^s\frac{1}{p_i}.
\]
Then such a primitive element exists if
\[
q>\frac{4\,W(t)^2(2+s-1)^2}{\delta^2}.
\]
Here \(W(n)\) denotes the number of square-free positive divisors of \(n\) [2104.12185].

The proof combines two indicator mechanisms. Primitive elements are detected through the Cohen–Huczynska character-sum criterion for \(t\)-free elements:
\[
\sum_{d\mid t}\frac{\mu(d)}{\varphi(d)}\sum_{\chi\in\mathcal{G}_d}\chi(x)=
\begin{cases}
1 & \text{if }x\text{ is }t\text{-free},\\
0 & \text{otherwise},
\end{cases}
\tag{2.1}
\]
and \(k\)-th powers are detected through
\[
\frac{1}{k}\sum_{i=0}^{k-1}\chi_k^i(x)=
\begin{cases}
1 & \text{if }x\in\mathbb{F}_q^{\times k},\\
0 & \text{otherwise}.
\end{cases}
\tag{2.2}
\]
The resulting count
\[
N(q-1,k):=
|\{x\in\mathbb{F}_q:x\text{ is primitive and }f(x)\in\mathbb{F}_q^{\times k}\}|
\]
is expressed as a double character sum. Weil’s bound
\[
\left|\sum_{x\in\mathbb{F}_q}\chi(af(x))\right|\le (r-1)\sqrt{q}
\tag{2.3}
\]
controls the error terms, leading to a lower bound of the form
\[
N(q-1,k)\ge q-2k\,W(q-1)\sqrt{q},
\]
up to small refinements [2104.12185].

The quadratic case \(k=2\) yields a sharper consequence. If \(f(x)=ax^2+bx+c\in\mathbb{F}_q[x]\) with \(b^2-4ac\neq 0\), then there is a primitive element \(g\) such that
\[
f(g)\in \mathbb{F}_q^{\times 2}
\]
provided
\[
q\notin \{3,5,7,9,11,13,19,25,27,31,81,125,121,169\}.
\]
This confirms a conjecture of Sun in the prime-field case and shows that, except for an explicit finite exceptional list of small fields, a nondegenerate quadratic polynomial takes a nonzero square value at some primitive element [2104.12185].

Conceptually, these results show that the generalized \(k\)-th power symbol, restricted to the sparse set of polynomial values \(f(g)\) at primitive \(g\), is not identically zero once \(q\) is sufficiently large.

## 5. Local fields, Hilbert symbols, and structural generalizations

In mixed characteristic local fields, the generalized power-symbol framework appears as the tame \(n\)-th power residue symbol. Let \(K\) be a local field of characteristic \(0\) with residue field \(k\) of cardinality \(q\), and let \(n\mid q-1\). Then \(\mu_n\subset K^\times\), and the tame Hilbert symbol is
\[
(\cdot,\cdot)_n:K^\times\times K^\times\to \mu_n.
\]
Writing \(a=\pi^{v(a)}u_a\) and \(b=\pi^{v(b)}u_b\) with \(u_a,u_b\in\mathcal{O}^\times\), it is defined by
\[
(a,b)_n=
\left((-1)^{v(a)v(b)}\,\frac{a^{v(b)}}{b^{v(a)}}\bmod \pi\right)^{\frac{q-1}{n}}.
\]
For \(n=2\), this is the usual tame quadratic Hilbert symbol. More generally, it is a Steinberg symbol and defines a homomorphism
\[
K_2^M(K)\to \mu_n,\qquad \{a,b\}\mapsto (a,b)_n,
\]
hence also \(K_2(K)\to \mu_n\) via Matsumoto’s theorem [2010.07682].

Tamiozzo develops a K-theoretic enhancement of this symbol. For a DVR \(A=\mathcal{O}\) with fraction field \(K\) and residue field \(k\), the localization sequence yields boundary maps
\[
\partial_{i-1}:K_i(K)\to K_{i-1}(k).
\]
For \(i=2\),
\[
\partial_1(\{a,b\})=
(-1)^{v(a)v(b)}\frac{a^{v(b)}}{b^{v(a)}}\bmod \pi,
\]
so the tame symbol is obtained by composing \(\partial_1\) with the power map
\[
p_n:k^\times\to \mu_n,\qquad x\mapsto x^{\frac{q-1}{n}}.
\]
The enhancement proceeds by replacing vector spaces over \(k\) with finite free pointed \(\mu_n\)-sets and constructing maps
\[
h_n^i:K_i(K)\xrightarrow{\partial_{i-1}}K_{i-1}(k)\longrightarrow K_{i-1}(V_{\mu_n}).
\]
The composite \(\Delta\circ h_n^2:K_2(K)\to\mu_n\) recovers the tame \(n\)-th power residue symbol [2010.07682].

The same paper also gives a group-cohomological realization. It constructs central extensions
\[
1\to\mu_n\to \widetilde{GL_m(K)}\to GL_m(K)\to 1,
\]
using determinant lines of finite free pointed \(\mu_n\)-sets attached to commensurable \(\mathcal{O}\)-lattices. For commuting \(f,g\in GL_m(K)\), the commutator of lifts defines a symbol
\[
\{f,g\}=[\tilde f,\tilde g]\in\mu_n.
\]
When \(m=1\), this yields a pairing on \(K^\times\times K^\times\). The paper proves
\[
\{a,b\}=
\left(\frac{a^{v(b)}}{b^{v(a)}}\bmod \pi\right)^{\frac{q-1}{n}},
\]
and after a sign correction based on a dimension function,
\[
\langle a,b\rangle=
\left((-1)^{v(a)v(b)}\frac{a^{v(b)}}{b^{v(a)}}\bmod \pi\right)^{\frac{q-1}{n}}
=
(a,b)_n
\]
when \(q\) is odd. In this form, the generalized power symbol is simultaneously a Steinberg symbol, a K-theoretic boundary construction, and a commutator pairing in a central extension [2010.07682].

## 6. Analytic distribution in arithmetic progressions and broader interpretation

The analytic study of \(k\)-th power symbols over prime fields focuses on the existence and distribution of small prime residues and nonresidues in arithmetic progressions. Let \(p\) be a large odd prime, let
\[
x=(\log p)^{1+\varepsilon},
\]
with \(\varepsilon>0\) small, and let \(q\ll \log\log p\). If \(k\mid p-1\) and \(k,q\ll \log\log p\), then there exists a prime \(k\)-th power residue in
\[
n=a+qm\ll (\log p)^{1+\varepsilon},
\]
for every reduced residue class \(1\le a<q\) with \((a,q)=1\). Under the same hypotheses, there also exists a prime \(k\)-th power nonresidue in
\[
n=a+qm\ll (\log p)^{1+\varepsilon}.
\]
The quadratic cases \(k=2\) are stated separately and satisfy the same logarithmic bound [2405.13159].

The method uses characteristic functions \(x_k(a)\) and \(\chi_k(a)\), the von Mangoldt function
\[
\Lambda(n)=
\begin{cases}
\log p & \text{if }n=p^m,\\
0 & \text{otherwise},
\end{cases}
\]
and prime number theory in arithmetic progressions. The counting function
\[
N_k(x,q,a)=\#\{n\le x:n^{(p-1)/k}\equiv -1\pmod p,\ n\equiv a\pmod q,\ n\text{ prime}\}
\]
is written in weighted form as
\[
N_k(x,q,a)=
\sum_{\substack{n\le x\\ n\equiv a\pmod q}}\chi_k(n)\Lambda(n),
\]
then decomposed into a main term and an error term. The main term is of size
\[
M(x,q,a)\approx \frac{1}{k}\frac{x}{\varphi(q)},
\]
while the error satisfies
\[
E_k(x,q,a)\ll (\log p)(\log\log p)^2.
\]
For \(x=(\log p)^{1+\varepsilon}\), the main term dominates [2405.13159].

The same paper proposes the heuristic asymptotic
\[
N_k(x,q,a)=c(k,q,a)\,\frac{1}{k}\,\frac{1}{\varphi(q)}\,\log\big((\log p)^{1+\varepsilon}\big)\cdot (\log p)^{1+\varepsilon}+\text{Error},
\tag{1.5}
\]
or more transparently,
\[
N_k(x,q,a)\approx c(k,q,a)\,\frac{1}{k}\,\frac{x}{\varphi(q)\log x},
\]
where \(c(k,q,a)\ge 0\) is a correction factor and \(d(k,q,a)=c(k,q,a)/k\) is called the density. If \(c(k,q,a)=1\), the properties of being prime, being a \(k\)-th power nonresidue, and lying in the progression \(a\bmod q\) behave as statistically independent; if \(c(k,q,a)=0\), the counting function is finite. This suggests a link between generalized \(k\)-th power symbols and entanglement phenomena in Artin-type distribution problems [2405.13159].

Across these settings, the generalized \(k\)-th power symbol functions as a detector of multiplicative structure. In finite fields it marks membership in \(\mathbb{F}_q^{\times k}\); in residue class rings it records whether \(a^k\equiv \pm1\pmod n\); in local fields it becomes a tame Hilbert symbol valued in \(\mu_n\). The supplied literature further shows that these symbols are not merely formal definitions: they support character-sum estimates, order-theoretic classifications, K-theoretic liftings, central extensions, and quantitative distribution results for primitive elements and prime values [2104.12185], [2510.00017], [2010.07682], [2405.13159].

Source: https://www.emergentmind.com/topics/generalized-k-th-power-symbol