Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Frobenius substitution in cyclotomic fields: σ_p(ζ) = ζ^p

Proved
ChebotarevDensity.cyclotomic_frobenius_eq_pow

by Lucas · Sep 27, 2026 · Mathlib 0df444a (Lean v4.33.1)

algebraic-number-theorynumber-theory

Let mmm be a positive integer, let KKK be the splitting field of Xm−1X^m-1Xm−1 over Q\mathbb QQ (the mmm-th cyclotomic field) and GGG its Galois group. Let ppp be a prime not dividing mmm, and let σ∈G\sigma\in Gσ∈G be a Frobenius substitution of ppp. Then for every primitive mmm-th root of unity ζ∈K\zeta\in Kζ∈K,

σ(ζ)=ζp.\sigma(\zeta)=\zeta^p .σ(ζ)=ζp.

In other words, under the isomorphism G≅(Z/mZ)×G\cong(\mathbb Z/m\mathbb Z)^\timesG≅(Z/mZ)×, the Frobenius substitution σp\sigma_pσp​ is a well-defined element (not just a conjugacy class) and corresponds to p mod mp \bmod mpmodm.

This identifies Dirichlet's theorem with the case f=Xm−1f=X^m-1f=Xm−1 of Chebotarëv's theorem.

Preamble
import Definitions.Def_ChebotarevDensity_Defs

open Polynomial NumberField
Formal statement
namespace ChebotarevDensity

theorem cyclotomic_frobenius_eq_pow (m : ℕ) (hm : 0 < m) (p : ℕ) (hp : p.Prime) (hpm : ¬ p ∣ m)
    (σ : GalGroup (X ^ m - 1)) (hσ : IsFrobeniusAt (X ^ m - 1) p σ)
    (ζ : SplitField (X ^ m - 1)) (hζ : IsPrimitiveRoot ζ m) :
    σ ζ = ζ ^ p := by sorry

end ChebotarevDensity
Source
P. Stevenhagen and H. W. Lenstra, Jr., "Chebotarëv and his density theorem", The Mathematical Intelligencer 18 (1996), no. 2, 26–37, https://doi.org/10.1007/BF03027290, p. 34: "if p is a prime number not dividing m, then the Frobenius substitution σ_p is the element of G that under the isomorphism G ≅ (Z/mZ)^* corresponds to (p mod m)"
Read-back

What the Lean code literally says, in plain math · Aristotle (Harmonic) - non-blind, same agent that drafted the statements

Non-blind read-back. This read-back was written by the same agent that drafted the Lean statements (Aristotle, by Harmonic), at the proposal owner's explicit request. It is not independent testimony: the author knew the intended meaning when writing it. Reviewers should compare it against the Lean code themselves rather than rely on it as a blind audit.

For every natural m>0m>0m>0, every prime ppp with p∤mp\nmid mp∤m, every σ\sigmaσ in the Galois group GGG of the splitting field KKK of Xm−1X^m-1Xm−1 over Q\mathbb QQ (the polynomial Xm−1X^m-1Xm−1 taken in Z[X]\mathbb Z[X]Z[X] and mapped to Q[X]\mathbb Q[X]Q[X]) such that IsFrobeniusAt(Xm−1,p,σ)\mathrm{IsFrobeniusAt}(X^m-1,p,\sigma)IsFrobeniusAt(Xm−1,p,σ) holds (some prime ideal Q∋p\mathfrak Q\ni pQ∋p of OK\mathcal O_KOK​ with σ(x)≡xp mod Q\sigma(x)\equiv x^p\bmod\mathfrak Qσ(x)≡xpmodQ for all x∈OKx\in\mathcal O_Kx∈OK​), and every ζ∈K\zeta\in Kζ∈K that is a primitive mmm-th root of unity: σ(ζ)=ζp\sigma(\zeta)=\zeta^{p}σ(ζ)=ζp.

Human review
  • Endorsed by Shuze Chen · Oct 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Lucas · Oct 1, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me