2009
DOI: 10.1016/j.jalgebra.2009.07.003
|View full text |Cite
|
Sign up to set email alerts
|

On pseudo algebraically closed extensions of fields

Abstract: The notion of 'Pseudo Algebraically Closed (PAC) extensions' is a generalization of the classical notion of PAC fields. In this work we develop a basic machinery to study PAC extensions. This machinery is based on a generalization of embedding problems to field extensions. The main goal is to prove that the Galois closure of any proper separable algebraic PAC extension is its separable closure. As a result we get a classification of all finite PAC extensions which in turn proves the 'bottom conjecture' for fin… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
6
0

Year Published

2009
2009
2016
2016

Publication Types

Select...
6

Relationship

2
4

Authors

Journals

citations
Cited by 8 publications
(6 citation statements)
references
References 21 publications
0
6
0
Order By: Relevance
“…A C double embedding problem, or in short C-DEP, for the pair (Γ, Λ) is a commutative diagram (1) where G, H, A, B ∈ C, A B, G H , i, j, ϕ are the inclusion maps, and α, μ, β, ν are surjective. Therefore a C-DEP consists of two compatible C-EPs: the lower embedding problem (μ, α) for Γ and the higher embedding problem (ν, β) for Λ.…”
Section: Double Embedding Problemsmentioning
confidence: 99%
See 3 more Smart Citations
“…A C double embedding problem, or in short C-DEP, for the pair (Γ, Λ) is a commutative diagram (1) where G, H, A, B ∈ C, A B, G H , i, j, ϕ are the inclusion maps, and α, μ, β, ν are surjective. Therefore a C-DEP consists of two compatible C-EPs: the lower embedding problem (μ, α) for Γ and the higher embedding problem (ν, β) for Λ.…”
Section: Double Embedding Problemsmentioning
confidence: 99%
“…In the above theorem we actually prove that for almost all σ ∈ Λ e the pair ( σ , Λ) has the following stronger lifting property. For any C-EP (1) and for any h ∈ G e that satisfies α(h) = μ(σ )…”
Section: Random Finitely Generated Subgroupsmentioning
confidence: 99%
See 2 more Smart Citations
“…We mention that Lior Bary-Soroker [1] strengthened the bottom theorem in the following way: Let K be a finitely generated extension of Q and let e ≥ 2 be an integer. Then, for almost all (σ 1 , .…”
Section: Introductionmentioning
confidence: 99%