This paper studies how small perturbations of uniformizers in totally ramified extensions over local fields affect their minimal polynomials, providing improved congruences that extend previous results.
Contribution
It derives new congruences for the coefficients of perturbed minimal polynomials, extending Krasner's work on Eisenstein polynomials over local fields.
Findings
01
Provides explicit congruences for polynomial coefficients after perturbation.
02
Extends Krasner's results with more general and refined conditions.
03
Enhances understanding of ramification and polynomial stability in local field extensions.
Abstract
Let K be a local field whose residue field has characteristic p and let L/K be a finite separable totally ramified extension. Let πL be a uniformizer for L and let f(X) be the minimum polynomial for πL over K. Suppose π~L is another uniformizer for L such that π~L≡πL+rπLℓ+1(modπLℓ+2) for some ℓ≥1 and r∈OK. Let f~(X) be the minimum polynomial for π~L over K. In this paper we give congruences for the coefficients of f~(X) in terms of r and the coefficients of f(X). These congruences improve and extend work of Krasner.
Equations122
f(X)=Xn−c1Xn−1+⋯+(−1)n−1cn−1X+(−1)ncn
f(X)=Xn−c1Xn−1+⋯+(−1)n−1cn−1X+(−1)ncn
f~(X)=Xn−c~1Xn−1+⋯+(−1)n−1c~n−1X+(−1)nc~n
f~(X)=Xn−c~1Xn−1+⋯+(−1)n−1c~n−1X+(−1)nc~n
dλμ=(−1)∣λ∣+∣μ∣⋅Γ∑sgn(Γ)ηλμ(Γ),
dλμ=(−1)∣λ∣+∣μ∣⋅Γ∑sgn(Γ)ηλμ(Γ),
ψμ(X1,…,Xn)=λ∑dλμ⋅Xλ1Xλ2…Xλk,
ψμ(X1,…,Xn)=λ∑dλμ⋅Xλ1Xλ2…Xλk,
dλμ={(−1)r+s+w+1w(−1)r+s+w+1(w−ab)if b∤c or sb<c,if b∣c and sb≥c.
dλμ={(−1)r+s+w+1w(−1)r+s+w+1(w−ab)if b∤c or sb<c,if b∣c and sb≥c.
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Algebra and Geometry · Algebraic Geometry and Number Theory · Advanced Combinatorial Mathematics
Let K be a local field whose residue field has
characteristic p and let L/K be a finite separable
totally ramified extension. Let πL be a
uniformizer for L and let f(X) be the minimum
polynomial for πL over K. Suppose
π~L is another uniformizer for L such
that π~L≡πL+rπLℓ+1(modπLℓ+2) for some ℓ≥1 and
r∈OK. Let f~(X) be the minimum
polynomial for π~L over K. In this paper
we give congruences for the coefficients of
f~(X) in terms of r and the coefficients of
f(X). These congruences improve and extend work of
Krasner [7].
1 Introduction
Let K be a field which is complete with respect to a
discrete valuation vK. Let OK be the ring of
integers of K and let MK be the maximal ideal of
OK. Assume that the residue field
K=OK/MK of K is a perfect field of
characteristic p. Let Ksep be a separable
closure of K and let L/K be a finite totally
ramified subextension of Ksep/K. Let πL be a
uniformizer for L and let
[TABLE]
be the minimum polynomial of πL over K. Let
ℓ≥1, let r∈OK, and let π~L be
another uniformizer for L such that
π~L≡πL+rπLℓ+1(modMLℓ+2). Let
[TABLE]
be the minimum polynomial of π~L over K.
In this paper we use the techniques developed in
[6] to obtain congruences for the coefficients
c~i of f~(X) in terms of r and the
coefficients of f(X).
Let ϕL/K:R≥0→R≥0 be the
Hasse-Herbrand function of L/K, as defined for
instance in Chapter IV of [9]. For 1≤h≤n
set kh=⌈ϕL/K(ℓ)+nh⌉.
Krasner [7, p. 157] showed that for
1≤h≤n we have
c~h≡ch(modMKkh). In
Theorem 4.3 we prove that
c~h≡ch(modMKkh′) for certain
integers kh′ such that kh′≥kh. Let h be the
unique integer such that 1≤h≤n and n divides
nϕL/K(ℓ)+h. Krasner [7, p. 157]
gave a formula for the congruence class modulo
MKkh+1 of c~h−ch. In
Theorem 4.5 we give similar formulas for up to
ν+1 values of h, where ν=vp(n).
Heiermann [3] gave formulas which are
analogous to the results presented here. Let
S⊂OK be the set of Teichmul̈ler
representatives for K. Let πK be a
uniformizer for K and let F(X) be the unique power
series with coefficients in S such that
πK=πLnF(πL). Suppose π~L is
another uniformizer for L such that π~L≡πL+rπLℓ+1(modMLℓ+2) for
some ℓ≥1 and r∈S. Let F~ be the
series with coefficients in S such that
πK=π~LnF~(π~L). Using
Theorem 4.6 of [3] one can compute certain
coefficients of F~ in terms of r and the
coefficients of F.
In Section 2 and we recall some facts
about symmetric polynomials from [6]. The main
focus is on expressing monomial symmetric polynomials in
terms of elementary symmetric polynomials. In
Section 3 we define the indices of
inseparability of L/K and some generalizations of the
function ϕL/K. In Section 4 we prove
our main results. In Section 5 we give some
examples which illustrate how the theorems from
Section 4 are applied.
2 Symmetric polynomials and cycle digraphs
Let n≥1, let w≥1, and let μ be a
partition of w. We view μ as a multiset
of positive integers
such that the sum Σ(μ) of the elements
of μ is equal to w. The cardinality of
μ is denoted by ∣μ∣. For μ such
that ∣μ∣≤n we let
mμ(X1,…,Xn) be the monomial symmetric
polynomial in n variables associated to μ.
For 1≤h≤n let eh(X1,…,Xn) denote the
elementary symmetric polynomial of degree h in n
variables. By the fundamental theorem of symmetric
polynomials there is a unique polynomial
ψμ∈Z[X1,…,Xn] such that
mμ=ψμ(e1,…,en). In this
section we use a theorem of Kulikauskas and Remmel
[8] to compute certain coefficients of
ψμ.
The formula of Kulikauskas and Remmel can be
expressed in terms of tilings of a certain type of
digraph. We say that a directed graph Γ is a
cycle digraph if it is a disjoint union of finitely many
directed cycles of length ≥1. We denote the vertex
set of Γ by V(Γ), and we define the sign
of Γ to be sgn(Γ)=(−1)w−c, where
w=∣V(Γ)∣ and c is the number of cycles that
make up Γ.
Let Γ be a cycle digraph with w≥1
vertices and let λ be a partition of w.
A λ-tiling of Γ is a set S of
subgraphs of Γ such that
Each γ∈S is a directed path of length
≥0.
2. 2.
The collection {V(γ):γ∈S} forms a
partition of the set V(Γ).
3. 3.
The multiset {∣V(γ)∣:γ∈S} is
equal to λ.
Let μ be another partition of w. A
(λ,μ)-tiling of Γ is an ordered
pair (S,T), where S is a λ-tiling of
Γ and T is a μ-tiling of Γ. Let
Γ′ be another cycle digraph with w vertices and
let (S′,T′) be a (λ,μ)-tiling of
Γ′. An isomorphism from (Γ,S,T) to
(Γ′,S′,T′) is an isomorphism of digraphs
θ:Γ→Γ′ which carries S onto S′
and T onto T′. Say that the
(λ,μ)-tilings (S,T) and (S′,T′) of
Γ are isomorphic if there exists an isomorphism
from (Γ,S,T) to (Γ,S′,T′). Say that
(S,T) is an admissible (λ,μ)-tiling
of Γ if (Γ,S,T) has no nontrivial
automorphisms. Let ηλμ(Γ)
denote the number of isomorphism classes of admissible
(λ,μ)-tilings of Γ.
Let w≥1 and let λ,μ be
partitions of w. Set
[TABLE]
where the sum is over all isomorphism classes of cycle
digraphs Γ with w vertices. Since
ημλ=ηλμ we
have dμλ=dλμ.
Kulikauskas and Remmel [8, Th. 1(ii)] proved the
following:
Theorem 2.1
Let n≥1, let w≥1, and let μ be a
partition of w with at most n parts. Let
ψμ be the unique element of
Z[X1,…,Xn] such that
mμ=ψμ(e1,…,en). Then
[TABLE]
where the sum is over all partitions
λ={λ1,…,λk} of w such
that 1≤λi≤n for 1≤i≤k.
We now recall some formulas from [6] for
computing values of ηλμ(Γ).
Proposition 2.2
*Let a,b,c,d,w be positive integers such
that a=c, b=d, and let r,s be
nonnegative integers. Let Γ be a directed cycle
of length w.
(a) Suppose w=ra=sb+d. Let λ be the
partition of w consisting of r copies of a, and
let μ be the partition of w consisting of
s copies of b and one copy of d. Then
ηλμ(Γ)=a.
(b) Suppose w=ra+c=sb+d. Let λ be the
partition of w consisting of r copies of a and one
copy of c, and let μ be the partition of w
consisting of s copies of b and one copy of d.
Then ηλμ(Γ)=w.*
*Proof: *Statement (a) follows from Proposition 2.5 of
[6] if s=0, and from Proposition 2.3 of
[6] if s≥1. Statement (b) follows from
Proposition 2.2 of [6]. □
Using these formulas we can compute
dλμ in some cases.
Proposition 2.3
Let a,b,c,d,w be positive integers such that a=c
and b=d. Let r,s be nonnegative integers such
that w=ra+c=sb+d and a>sb.
Let λ be the partition of
w consisting of r copies of a and 1 copy of c,
and let μ be the partition of w consisting of
s copies of b and 1 copy of d. Then
[TABLE]
*Proof: *Let Γ be a cycle digraph which has an
admissible (λ,μ)-tiling. Suppose
Γ consists of a single cycle of length w.
Then by Proposition 2.2(b) we have
ηλμ(Γ)=w. Suppose
Γ has more than one cycle. Since Γ has a
μ-tiling, Γ has a cycle Γ1 such
that ∣V(Γ1)∣≤sb. Since a>sb and
Γ has a λ-tiling, it follows that
∣V(Γ1)∣=c=mb for some m such that
1≤m≤s. Hence if Γ has more than one
cycle we must have b∣c and c≤sb. Let
λ1 be the partition
of c consisting of one copy of c and let μ1
be the partition of c consisting of m copies of
b. Then every λ-tiling of Γ
restricts to a λ1-tiling of Γ1, and
every μ-tiling of Γ restricts to a
μ1-tiling of Γ1. It follows from
Proposition 2.2(a) that
ηλ1μ1(Γ1)=b.
Let Γ2 be another cycle of Γ.
Since Γ has a λ-tiling,
∣V(Γ2)∣≥a>sb. Hence every
μ-tiling of Γ restricts to a tiling of
Γ2 which includes a path δ with
∣V(δ)∣=d. Since μ has only one part
equal to d, it follows that
Γ=Γ1∪Γ2. Therefore we have
∣V(Γ2)∣=ra=(s−m)b+d. Let λ2 be
the partition of ra consisting of
r copies of a and let μ2 be the partition
of (s−m)b+d=ra consisting of s−m copies of b
and 1 copy of d. Then every λ-tiling of
Γ restricts to a λ2-tiling of
Γ2, and every μ-tiling of Γ
restricts to a μ2-tiling of Γ2. It
follows from Proposition 2.2(a) that
ηλ2μ2(Γ2)=a. Hence
[TABLE]
Suppose b∤c or c>sb. Then it follows
from the above that the only cycle digraph which has a
(λ,μ)-tiling consists of a single
cycle of length w. Hence by (2.1) we get
[TABLE]
Suppose b∣c and sb≥c. Then c=mb with
1≤m≤s. Hence there are two cycle digraphs
which have a (λ,μ)-tiling: a single
cycle of length w, and the union of two cycles with
lengths c=mb and ra=(s−m)b+d. Therefore by
(2.1) we get
[TABLE]
Hence the formula for dλμ given in
the theorem holds in both cases. □
We recall some results from [6] regarding
the p-adic properties of the coefficients
dλμ. Let w≥1 and let
λ be a partition of w. For
k≥1 let k∗λ be the partition of kw
which is the multiset sum of k copies of
λ, and let k⋅λ be the
partition of kw obtained by multiplying the parts of
λ by k.
Proposition 2.4
Let t≥j≥0, let w′≥1, and set w=w′pt.
Let λ′ be a partition of w′ and set
λ=pt⋅λ′. Let μ
be a partition of w such that there does not exist a
partition μ′ with μ=pj+1∗μ′.
Then pt−j divides dλμ.
*Proof: *This is proved in Corollary 3.4 of [6].
□
Proposition 2.5
Let w′≥1, j≥1, and t≥0. Let
λ′, μ′ be partitions of w′ such
that the parts of λ′ are all divisible by
pt. Set w=w′pj, so that
λ=pj⋅λ′ and
μ=pj∗μ′ are partitions of w. Then
dλμ≡dλ′μ′(modpt+1).
*Proof: *This is proved in Proposition 3.5 of [6].
□
3 Indices of inseparability
Let L/K be a totally ramified extension of degree
n=upν, with p∤u. Let πL be a
uniformizer for L whose minimum polynomial over K is
[TABLE]
For k∈Z define vp(k)=min{vp(k),ν}.
For 0≤j≤ν set
[TABLE]
Then ijπL is either a nonnegative integer or
∞; if char(K)=p then ijπL must be
finite, since L/K is separable. Let eL=vL(p)
denote the absolute ramification index of L. We
define the jth index of inseparability of L/K to be
[TABLE]
By Proposition 3.12 and Theorem 7.1 of [3],
ij does not depend on the choice of πL.
Furthermore, our definition of ij agrees with
Definition 7.3 in [3]; for the
characteristic-p case see also
[1, pp. 232–233] and [2, §2].
Write ij=Ajn−bj with 1≤bj≤n.
Remark 3.1
If ijπL is finite we can write
ijπL=ajn−bj with aj≥1 (see Section 4
of [6]). Thus if ij=ij′πL+(j′−j)eL
then Aj=aj′+(j′−j)eK.
The following facts are easy consequences of the
definitions:
0=iν<iν−1≤⋯≤i1≤i0<∞.
2. 2.
If char(K)=p then ij=ijπL.
3. 3.
Let m=vp(ij). If m≤j then
ij=im=ijπL=imπL. If m>j then
char(K)=0 and ij=imπL+(m−j)eL.
Following [3, (4.4)], for 0≤j≤ν
we define functions
ϕ~j:[0,∞)→[0,∞) by
ϕ~j(x)=ij+pjx. The generalized
Hasse-Herbrand functions
ϕj:[0,∞)→[0,∞) are then defined by
[TABLE]
Hence we have ϕj(x)≤ϕj′(x) for
0≤j′≤j. Let
ϕL/K:[0,∞)→[0,∞) be the usual
Hasse-Herbrand function. Then by Corollary 6.11 of
[3] we have ϕν(x)=nϕL/K(x).
For a partition λ={λ1,…,λk} whose parts satisfy
1≤λi≤n define
cλ=cλ1cλ2…cλk. The following is proved in
Proposition 4.2 of [6].
Proposition 3.2
Let w≥1 and let
λ={λ1,…,λk} be a
partition of w whose parts satisfy
1≤λi≤n. Choose q to minimize
vp(λq) and set t=vp(λq).
Then vL(cλ)≥itπL+w. If
vL(cλ)=itπL+w and
itπL<∞ then λq=bt and
λi=bν=n for all i=q.
4 Perturbing πL
In this section we prove our main theorems. We begin by
applying the results of Section 2 to the
totally ramified extension L/K. Write
[L:K]=n=upν with p∤u. Let πL,
π~L be uniformizers for L, with minimum
polynomials over K given by
[TABLE]
Let 1≤h≤n and set j=vp(h). Define a
function ρh:N→N by
[TABLE]
Let ℓ≥1. We say f~∼ℓf
if c~h≡ch(modMKρh(ℓ)) for
1≤h≤n. Thus ∼ℓ is an equivalence
relation on the set of minimum polynomials over K for
uniformizers of L.
Let σ1,…,σn be the K-embeddings
of L into Ksep. For each partition μ
with at most n parts define Mμ:L→K by
[TABLE]
For 1≤h≤n define Eh:L→K by
[TABLE]
Then ch=Eh(πL) and
c~h=Eh(π~L).
Proposition 4.1
Let ϕ(X)=r1X+r2X2+⋯ be a power series
with coefficients in OK such that
π~L=ϕ(πL). Then for 1≤h≤n we
have
[TABLE]
where the sum ranges over all partitions
μ={μ1,…,μh} with h parts.
*Proof: *This is a special case of Proposition 4.4 in
[6]. □
Proposition 4.2
Let n≥1, let w≥1, and let μ be a
partition of w with at most n parts. Then
[TABLE]
where the sum is over all partitions
λ={λ1,…,λk} of w such
that 1≤λi≤n for 1≤i≤k.
*Proof: *This follows from Theorem 2.1 by
setting Xi=Ei(πL)=ci. □
Let ℓ≥1. Our first main result gives
congruences between the coefficients of f(X) and the
coefficients of f~(X) under the assumption
π~L≡πL(modMLℓ+1).
Theorem 4.3
Let πL, π~L be uniformizers for L and
let f(X), f~(X) be the minimum polynomials
for πL, π~L over K. Suppose there
are ℓ≥1 and σ∈AutK(L) such that
σ(π~L)≡πL(modMLℓ+1).
Then f~∼ℓf.
*Proof: *We first show that the theorem holds in the case
where π~L=πL+rπLℓ+1, with
r∈OK.
Let 1≤h≤n and set j=vp(h). For
0≤s≤h let μs be the partition of
ℓs+h consisting of h−s copies of 1 and s
copies of ℓ+1. Then by Proposition 4.1 we
have
[TABLE]
To prove that c~h≡ch(modMKρh(ℓ)) it’s enough to show that
vK(Mμs(πL))≥ρh(ℓ) for
1≤s≤h. Therefore by Proposition 4.2
it suffices to show
vL(dλμscλ)≥ϕj(ℓ)+h for all 1≤s≤h and all partitions
λ of ℓs+h whose parts are at most n.
Let 1≤s≤h, set j=vp(h), and set
m=min{j,vp(s)}. Then m≤j and s≥pm.
Let λ={λ1,…,λk} be a
partition of ℓs+h such that 1≤λi≤n
for 1≤i≤k. Choose q to minimize
vp(λq) and set t=vp(λq).
By Proposition 3.2 we have
vL(cλ)≥itπL+ℓs+h.
Suppose m<t. Then m<ν, so we have
pm+1∤gcd(h−s,s). Hence by
Proposition 2.4 we get
vp(dλμs)≥t−m. Thus
[TABLE]
Suppose m≥t. Then
[TABLE]
In both cases we get
vL(dλμscλ)≥ϕ~m(ℓ)+h≥ϕj(ℓ)+h, and hence
c~h≡ch(modMKρh(ℓ)).
Since this holds for 1≤h≤n we get
f~∼ℓf.
We now prove the general case. Since f~
is the minimum polynomial of σ(π~L)
over K we may assume without loss of generality that
π~L≡πL(modMLℓ+1). By
repeated application of the special case above we get a
sequence
πL(0)=πL,πL(1),πL(2),… of
uniformizers for L with minimum polynomials
f(0)=f,f(1),f(2),… such that for all
i≥0 we have
πL(i)≡π~L(modMLℓ+i+1)
and f(i+1)∼ℓ+if(i). It follows that
f(i+1)∼ℓf(i), and hence that
f(i)∼ℓf for all i≥0. Since the
sequence (f(i)) converges coefficientwise to
f~ it follows that f~∼ℓf.
□
Remark 4.4
It follows from Theorem 4.3 that if
σ(π~L)≡πL(modMLℓ+1)
for some σ∈AutK(L) then
c~h≡ch(modMKρh(ℓ)) for
1≤h≤n. Define functions κh:N→N by
[TABLE]
Krasner [7, p. 157] showed that
c~h≡ch(modMKκh(ℓ)).
Since κh(ℓ)≤ρh(ℓ) Krasner’s
congruences are in general weaker than the congruences
that follow from Theorem 4.3. However, if
ℓ is greater than or equal to the largest lower
ramification break of L/K then
ϕj(ℓ)=ϕν(ℓ) for 0≤j≤ν.
Therefore Theorem 4.3 does not improve on
[7] in these cases.
For certain values of h we get a more refined
version of the congruences that follow from
Theorem 4.3.
Theorem 4.5
Let L/K be a finite totally ramified extension of
degree n=upν. For 0≤m≤ν write the mth
index of inseparability of L/K in the form
im=Amn−bm with 1≤bm≤n. Let πL,
π~L be uniformizers for L such that there
are ℓ≥1, r∈OK, and σ∈AutK(L)
with σ(π~L)≡πL+rπLℓ+1(modMLℓ+2). Let 0≤j≤ν satisfy
vp(ϕj(ℓ))=j, and let h be the unique
integer such that 1≤h≤n and n divides
ϕj(ℓ)+h. Set k=(ϕj(ℓ)+h)/n and
h0=h/pj. Then
[TABLE]
where
[TABLE]
*Proof: *We first prove that the theorem holds for
π^L=πL+rπLℓ+1. Let
[TABLE]
be the minimum polynomial for π^L over K.
Let 1≤s≤h and let λ be a partition
of ℓs+h whose parts are at most n. Choose q
to minimize vp(λq) and set
t=vp(λq). Recall that μs is the
partition of ℓs+h consisting of h−s copies of 1
and s copies of ℓ+1. Since
vp(h)=vp(ϕj(ℓ))=j it follows from
the proof of Theorem 4.3 that
vK(dλμscλ)≥k.
Suppose vK(dλμscλ)=k.
Then the inequalities in the proof of
Theorem 4.3 must be equalities. Hence there
is 0≤m≤j such that s=pm,
vL(cλ)=itπL+ℓpm+h,
and ϕj(ℓ)=ϕ~m(ℓ). In particular,
we have m∈Sj.
Let wm=ℓpm+h and let κm be the
partition of wm consisting of k−Am copies of n
and 1 copy of bm. By Proposition 3.2 we see
that λ has at most one element not equal to
n. Since λ is a partition of wm, and
[TABLE]
it follows that λ=κm. Hence
cλ=cκm=cnk−Amcbm
and vp(bm)=vp(λq)=t. Using equation
(4.1) and Proposition 4.2 we get
[TABLE]
Let m∈Sj. Since
[TABLE]
and m≤j we get m≤vp(im)=vp(bm).
Hence bm′=bm/pm is an integer. Let κm′
be the partition of
[TABLE]
consisting of k−Am copies of upν−m and 1 copy
of bm′. Let μpm′ be the partition of
wm′ consisting of h0pj−m−1 copies of 1 and 1
copy of ℓ+1. Since h≤n we have
upν−m>h0pj−m−1. Hence if
bm′=upν−m then we can compute
dκm′μpm′ using
Proposition 2.3.
Suppose bm<h. Then h0pj−m−1≥bm′, so
by Proposition 2.3 we get
[TABLE]
Suppose h≤bm<n. Then h0pj−m−1<bm′, so by
Proposition 2.3 we get
[TABLE]
Suppose bm=n, so that bm′=upν−m. Since
upν−m>h0pj−m−1, the only cycle digraph which
admits a (κm′,μpm′)-tiling consists
of a single cycle Γ of length wm′. By
Proposition 2.2(a) we get
ηκm′μpm′(Γ)=upν−m.
It then follows from (2.1) that
We now prove the theorem in the general case. We
may assume that
[TABLE]
It follows that
π~L≡π^L(modMLℓ+2), so
by Theorem 4.3 we get c~h≡c^h(modMKρh(ℓ+1)).
Since (ϕj(ℓ)+h)/n=k and
ϕj(ℓ+1)>ϕj(ℓ) this implies
c~h≡c^h(modMKk+1). Hence
the theorem holds for π~L. □
Remark 4.6
Suppose vp(ϕj(ℓ))=j′≤j. Then
ϕj(ℓ)=ϕj′(ℓ). In particular,
ϕν(ℓ)=ϕj′(ℓ) with
j′=vp(ϕν(ℓ)). Hence if 1≤h≤n
and n divides ϕν(ℓ)+h then
Theorem 4.5 gives a congruence for
c~h modulo MKk+1, where
k=(ϕν(ℓ)+h)/n. This is the congruence
obtained by Krasner [7, p. 157]. If ℓ is
greater than or equal to the largest lower ramification
break of L/K then ϕj(ℓ)=ϕν(ℓ) for
0≤j≤ν. Therefore Theorem 4.5 does
not extend [7] in these cases.
5 Some examples
In this section we give two examples related to the
theorems proved in Section 4. We first apply
these theorems to a 3-adic extension of degree 9:
Example 5.1
Let K be a finite extension of the 3-adic field Q3
such that vK(3)≥2. Let
[TABLE]
be an Eisenstein polynomial over K such that
vK(c2)=vK(c6)=2, vK(ch)≥2 for h∈{1,3},
and vK(ch)≥3 for h∈{4,5,7,8}. Let πL
be a root of f(X). Then L=K(πL) is a totally
ramified extension of K of degree 9, so we have u=1,
ν=2. It follows from our assumptions about the
valuations of the coefficients of f(X) that the
indices of inseparability of L/K are i0=16,
i1=12, and i2=0. Therefore A0=2, A1=2,
A2=1, and b0=2, b1=6, b2=9. We get the
following values for
ϕ~j(ℓ) and ϕj(ℓ):
[TABLE]
Now let π~L be another uniformizer for
L, with minimum polynomial
[TABLE]
Suppose π~L≡πL(modML2). Then
by Theorem 4.3 we get
f~∼1f. Using the table above we find
that
[TABLE]
This is an improvement on [7], which gives
c~h≡ch(modMK2) for 1≤h≤9.
If π~L≡πL(modML3) we get
f~∼2f, and hence c~h≡ch(modMK3) for 1≤h≤9. If
π~L≡πL(modML4) we get
f~∼3f, and hence
[TABLE]
Since the largest lower ramification break of L/K is
2, the congruences we get for ℓ≥2 are the same as
those in [7].
Suppose π~L≡πL+rπL2(modML3), with r∈OK. By the table above we
get v3(ϕ0(1))=0, v3(ϕ1(1))=1,
v3(ϕ2(1))=2 and S0={0}, S1={1},
S2={2}. The corresponding values of h are 1, 3,
9, and we have h0=1, k=2 in all three cases. By
applying Theorem 4.5 with ℓ=1, j=0,1,2
we get the following congruences:
Suppose π~L≡πL+rπL3(modML4). Then v3(ϕ2(2))=2 and
S2={0,1,2}, which gives h=9, h0=1, and k=3.
By applying Theorem 4.5 with ℓ=2, j=2
we get the following congruence:
[TABLE]
Suppose π~L≡πL+rπL4(modML5). Then v3(ϕ0(3))=0 and
S0={0}, so we get h=8, h0=8, and k=3. By
applying Theorem 4.5 with ℓ=3, j=0 we
get the following congruence:
[TABLE]
Again, since the largest lower ramification break of
L/K is 2, the congruences we get for ℓ≥2 are
the same as those in [7]. □
One might hope to prove the following converse to
Theorem 4.3: If πL, π~L
are uniformizers for L whose minimum polynomials
satisfy f~∼ℓf, then there is
σ∈AutK(L) such that
σ(π~L)≡πL(modMLℓ+1).
The example below shows that this is not necessarily the
case:
Example 5.2
Let πL be a root of the Eisenstein polynomial
f(X)=X4+6X2+4X+2 over the 2-adic field Q2.
Then L=Q2(πL) is a totally ramified
extension of Q2 of degree 4, with indices of
inseparability i0=5, i1=2, and i2=0. We get
the following values for ϕ~j(ℓ) and
ϕj(ℓ):
[TABLE]
Set π~L=πL+πL2, and let the
minimum polynomial for π~L over Q2 be
Theorem 4.5 gives a refinement of the last
congruence:
[TABLE]
Using this refinement we get f~∼2f.
Using [5] (see also Table 4.2 in [4])
we obtain a list of the degree-4 extensions of Q2.
Using the data in this list we find that L/Q2 is not
Galois, and the only quadratic subextension of L/Q2
is M/Q2, where M=Q2(−1). Hence
AutQ2(L)=Gal(L/M). Since the lower
ramification breaks of L/Q2 are 1, 3, and the lower
ramification break of M/Q2 is 1, the lower
ramification break of L/M is 3. Hence if
σ∈AutQ2(L) then
σ(π~L)≡π~L(modML4).
Since π~L=πL+πL2 we get
σ(π~L)≡πL(modML3).
□
Bibliography9
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] M. Fried, Arithmetical properties of function fields II, The generalized Schur problem, Acta Arith. 25 (1973/74), 225–258.
2[2] M. Fried and A. Mézard, Configuration spaces for wildly ramified covers, appearing in Arithmetic Fundamental Groups and Noncommutative Algebra , Proc. Sympos. Pure Math. 70 (2002), 353–376.
3[3] V. Heiermann, De nouveaux invariants numériques pour les extensions totalement ramifiées de corps locaux, J. Number Theory 59 (1996), 159–202.
4[4] J. Jones and D. Roberts, A database of local fields, J. Symbolic Comput. 41 (2006), 80–97.
5[5] J. Jones and D. Roberts, Database of Local Fields, retrieved 31 December 2016 from https://math.la.asu.edu/~jj/localfields/ .
6[6] K. Keating, Extensions of local fields and elementary symmetric polynomials, ar Xiv:1608.07350 [math.NT] .
7[7] M. Krasner, Sur la primitivité des corps 𝔓 𝔓 \mathfrak{P} -adic, Mathematica (Cluj) 13 (1937), 72–191.
8[8] A. Kulikauskas and J. Remmel, Lyndon words and transition matrices between elementary, homogeneous and monomial symmetric functions, Electronic J. Combinatorics 13 (2006), #R 18.