The cycle pattern of σ_p equals the decomposition type of f mod p
ProvedChebotarevDensity.cyclePattern_eq_decompositionTypeLet be monic with discriminant , with splitting field and Galois group , and let be a prime with . If is a Frobenius substitution of , then the cycle pattern of as a permutation of the zeros of equals the decomposition type of modulo :
Combined with Chebotarëv's theorem this yields Frobenius's theorem.
import Definitions.Def_ChebotarevDensity_Defs open Polynomial NumberField
namespace ChebotarevDensity
theorem cyclePattern_eq_decompositionType (f : ℤ[X]) (hf : f.Monic) (hdisc : f.discr ≠ 0)
(p : ℕ) [Fact p.Prime] (hpd : ¬ (p : ℤ) ∣ f.discr) (σ : GalGroup f)
(hσ : IsFrobeniusAt f p σ) :
cyclePattern f σ = decompositionType f p := by sorry
end ChebotarevDensityRead-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 that is monic with , every prime (typeclass fact) with in , and every such that holds (some prime ideal of with for all ): the multiset of cycle lengths (fixed points included) of the permutation that induces on the distinct complex roots of equals the multiset of degrees of the monic irreducible factors of in , counted with multiplicity.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.