2020
DOI: 10.2140/pjm.2020.307.121
|View full text |Cite
|
Sign up to set email alerts
|

Eliminating tame ramification : generalizations of Abhyankar’s lemma

Abstract: A basic version of Abhyankar's Lemma states that for two finite extensions L and F of a local field K, if L|K is tamely ramified and if the ramification index of L|K divides the ramification index of F |K, then the compositum L.F is an unramified extension of F . In this paper, we generalize the result to valued fields with value groups of rational rank 1, and show that the latter condition is necessary. Replacing the condition on the ramification indices by the condition that the value group of L be contained… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(2 citation statements)
references
References 10 publications
0
2
0
Order By: Relevance
“…The condition that p = char kv implies that Kv|k(X)v is a separable extension. It now follows from [5,Theorem 3(2)] that…”
Section: Proposition 23 Let K|k Be An Algebraic Function Field Such Thatmentioning
confidence: 99%
“…The condition that p = char kv implies that Kv|k(X)v is a separable extension. It now follows from [5,Theorem 3(2)] that…”
Section: Proposition 23 Let K|k Be An Algebraic Function Field Such Thatmentioning
confidence: 99%
“…There are also variants of Abhyankar's lemma in other settings, such as [16, Lemme 3.6 in Exp. 10] when the residue field extension may be inseparable, [28,Lemma 15.105.4] for formally smooth madic topologies, [13] for transcendental extensions and henselizations, and [2] for perfectoid spaces. Proposition 1.4 has the desirable feature of being sufficiently general to apply to questions in many different branches of math, while also having a concise and easily understood statement and a short self-contained proof.…”
Section: Introductionmentioning
confidence: 99%