Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedaudited 2026-10-02
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Arithmetic Frobenius is the power map in an unramified cyclotomic field

Statement

Let f≥1 be a reduced index, that is f is odd or 4∣f, let ℓ be a rational prime with ℓ∤f, let ζf be a primitive f-th root of unity and K=Q(ζf). Let σℓ be the automorphism of K with σℓ(ζf)=ζf ℓ. Then for every prime P of OK above ℓ, the element σℓ is the arithmetic Frobenius Frob⁡P: it is the unique σ∈Gal⁡(K/Q) with σ(P)=P and σ(a)≡aℓ(modP) for all a∈OK. In particular it does not depend on the chosen prime above ℓ, the Galois group being abelian.

Facts & Assumptions

Given: A reduced index f≥1, a rational prime ℓ with ℓ∤f, a primitive f-th root of unity ζ=ζf, the field K=Q(ζ), and the automorphism σℓ∈Gal⁡(K/Q) with σℓ(ζ)=ζℓ.

[F1]

OK=Z[ζ], and 1,ζ,…,ζφ(f)−1 is an integral basis (Ring of integers of every cyclotomic field).

[F2]
[F3]

K/Q is Galois with Gal⁡(K/Q)≅(Z/f)× via σb(ζ)=ζb; this group is abelian and every automorphism has this form ([Q(ζn):Q]=φ(n) and Gal⁡(Q(μn)/Q)≅(Z/n)×).

[F4]

For gcd⁡(f,ℓ)=1, the reduction of Φf in Fℓ[t] is a product of pairwise distinct monic irreducibles, each of degree d:=ord⁡f(ℓ) (For gcd⁡(n,q)=1 the reduction of Φn in Fq[t] is a product of distinct monic irreducibles, each of degree the order of [q] modulo n).

[F5]

Since OK=Z[ζ], applying the monogenic factorisation lemma to Φˉf=∏igi gives ℓOK=∏iPi where Pi=(ℓ,g~i(ζ)) are distinct primes above ℓ, each of residue degree d, where g~i∈Z[t] is the coefficientwise lift of gi with coefficients in {0,…,ℓ−1} (Choice-free prime factorisation for a monogenic number ring, Primes above and residue degree).

[F6]

Over a field whose characteristic does not divide f, the roots of Φf in a splitting field of tf−1 are exactly the primitive f-th roots of unity. For the residue field κ(Pi), take a splitting field of tf−1 over it; its natural field embedding is injective and preserves the multiplicative order of each element. Since κ(Pi) has characteristic ℓ and ℓ∤f, the theorem applies to the image of ζˉ there (Over a field whose characteristic does not divide n, the roots of Φn are exactly the primitive roots of unity, The cyclotomic extension K(μn) as a splitting field of tn−1).

[F7]

For a prime P above an unramified rational prime ℓ in a finite Galois extension, there is a unique arithmetic Frobenius Frob⁡P in the decomposition group satisfying Frob⁡P(a)≡aℓ(modP) for all algebraic integers a (Unramified frobenius element exists uniquely).

Proof

technique · direct
1.1F1F2F3

By [F1] and [F2], the ring of integers is Z[ζ], the minimal polynomial of ζ is Φf, and its degree is φ(f). By [F3], K/Q is abelian and each automorphism is σb for a unit class b modulo f, in particular σℓ exists. If f=1, then K=Q and the unique prime over ℓ is ℓZ; the trivial automorphism is its arithmetic Frobenius.

1.2F4F5

Since ℓ∤f, [F4] and [F5] give ℓOK=∏i=1gPi with distinct primes Pi=(ℓ,g~i(ζ)), each of residue degree d=ord⁡f(ℓ). Thus ℓ is unramified and these are all the primes above it.

1.3F7

Fix i. By [F7] the prime Pi has an arithmetic Frobenius Frob⁡Pi satisfying the ℓ-power congruence. Evaluating it at ζ gives Frob⁡Pi(ζ)≡ζℓ(modPi).

1.4F6

The residue class ζˉ=ζ+Pi is a root of the reduction of Φf, since Φf(ζ)=0. Embed the residue field into a splitting field of tf−1 over it. By [F6], the image of ζˉ has multiplicative order exactly f there; injectivity of the field embedding gives the same order for ζˉ in the residue field.

2.1F3step 1.3step 1.4

Write Frob⁡Pi=σb using [F3]. Reducing the congruence in step 1.3 gives ζˉ b=ζˉ ℓ. Since ζˉ has order f by step 1.4, b≡ℓ(modf); hence σb=σℓ. This comparison is made directly in the residue field at Pi, so it does not require σℓ to stabilise Pi in advance.

3.1F3step 2.1∎

The argument applies to every prime Pi above ℓ, and each gives the same automorphism σℓ. Thus this arithmetic Frobenius is independent of the prime above ℓ, as also follows from the abelian Galois group in [F3].

Remarks

  • Reduced index. The hypothesis that f is odd or 4∣f is the standing reduced-index convention of this pair; for the present lemma the essential hypothesis is ℓ∤f, which makes Φf separable modulo ℓ.
  • Power map, not inverse. The identification uses the arithmetic convention ζ↦ζℓ; the geometric inverse would send ζ to ζℓ−1 and agrees with the arithmetic map exactly when ℓ2≡1(modf), since ℓ is a unit modulo f.

Depends on

Used by

Dependency tree · two levels

73 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources