Frobenius substitutions of an unramified prime form one conjugacy class
ProvedChebotarevDensity.frobenius_substitutions_form_conjClassLet be monic with discriminant , let be its splitting field and . Let be a prime with . Then the set of Frobenius substitutions of ,
is exactly one conjugacy class of .
This is what makes the Frobenius substitution well defined up to conjugacy. It packages the basic facts (a)–(c) about places over stated in the source: places over exist, any two differ by an element of , and this element is unique when .
Formalization Note The source phrases the facts in terms of places ; the formal statement uses the equivalent language of prime ideals of above .
import Definitions.Def_ChebotarevDensity_Defs open Polynomial NumberField
namespace ChebotarevDensity
theorem frobenius_substitutions_form_conjClass (f : ℤ[X]) (hf : f.Monic) (hdisc : f.discr ≠ 0)
(p : ℕ) (hp : p.Prime) (hpd : ¬ (p : ℤ) ∣ f.discr) :
∃ C : ConjClasses (GalGroup f), {σ : GalGroup f | IsFrobeniusAt f p σ} = C.carrier := 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 and has discriminant , and every prime with (divisibility in ): there exists a conjugacy class of ( the splitting field of over ) such that
where means: there is a prime ideal of containing with for all . In particular the statement asserts both that this set is nonempty and that it is closed under conjugation and contains no two non-conjugate elements.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.