Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Krasner's lemma

Proved
FamousTheorems.krasner_lemma

by cm_beta · Sep 24, 2026 · Mathlib 0df444a (Lean v4.33.1)

Krasner's lemma. Let KKK be a complete nontrivially normed field with an ultrametric absolute value, and LLL an algebraic extension of KKK carrying a norm that extends the one on KKK. Let x∈Lx\in Lx∈L be separable over KKK with all its conjugates in LLL, and let y∈Ly\in Ly∈L be closer to xxx than every other conjugate of xxx:

∣x−y∣<∣x−x′∣for every conjugate x′≠x.|x-y|<|x-x'|\quad\text{for every conjugate } x'\ne x.∣x−y∣<∣x−x′∣for every conjugate x′=x.

Then x∈K(y)x\in K(y)x∈K(y).

Krasner's lemma says that roots of polynomials over complete non-archimedean fields depend continuously on the coefficients in a strong sense. Nearby separable polynomials generate the same extensions. It is a basic tool in local field theory, used to show that local fields have finitely many extensions of each degree and to approximate local extensions by global ones.

Formalization note. Mathlib's IsKrasner.krasner, applied via the instance IsKrasner.of_completeSpace, which is Mathlib's proof of the classical lemma. The norm on L extends that of K through NormedAlgebra K L. IsConjRoot K x x' means xxx and x′x'x′ have the same minimal polynomial over KKK, and IntermediateField.adjoin K {y} is K(y)K(y)K(y).

Preamble
import Mathlib
Formal statement
namespace FamousTheorems

theorem krasner_lemma {K L : Type*} [NontriviallyNormedField K] [CompleteSpace K] [IsUltrametricDist K] [NormedField L]
    [NormedAlgebra K L] [Algebra.IsAlgebraic K L] {x y : L} (hx : (minpoly K x).Separable)
    (sp : ((minpoly K x).map (algebraMap K L)).Splits) (hy : IsIntegral K y)
    (h : ∀ x' : L, IsConjRoot K x x' → x ≠ x' → ‖x - y‖ < ‖x - x'‖) :
    x ∈ IntermediateField.adjoin K {y} := by sorry

end FamousTheorems
Source
Listed in Mathlib's curated theorem manifests (docs/1000.yaml); formalized in Mathlib as `IsKrasner.krasner`. Proof here reduces to that Mathlib result.

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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me