Embedding problem
In Galois theory, a branch of mathematics, the embedding problem is a generalization of the inverse Galois problem. Roughly speaking, it asks whether a given Galois extension can be embedded into a Galois extension in such a way that the restriction map between the corresponding Galois groups is given.
01Definition
Given a field K and a finite group H, one may pose the following question (the so called inverse Galois problem). Is there a Galois extension F/K with Galois group isomorphic to H. The embedding problem is a generalization of this problem:
Let L/K be a Galois extension with Galois group G and let f : H → G be an epimorphism. Is there a Galois extension F/K with Galois group H and an embedding α : L → F fixing K under which the restriction map from the Galois group of F/K to the Galois group of L/K coincides with f?
Analogously, an embedding problem for a profinite group F consists of the following data: Two profinite groups H and G and two continuous epimorphisms φ : F → G and f : H → G. The embedding problem is said to be finite if the group H is. A solution (sometimes also called weak solution) of such an embedding problem is a continuous homomorphism γ : F → H such that φ = f γ. If the solution is surjective, it is called a proper solution.
02Properties
Finite embedding problems characterize profinite groups. The following theorem gives an illustration for this principle.
Theorem. Let F be a countably (topologically) generated profinite group. Then
- F is projective if and only if any finite embedding problem for F is solvable.
- F is free of countable rank if and only if any finite embedding problem for F is properly solvable.
Sources and credits
This article is adapted from the Wikipedia article “Embedding problem”, written by its contributors and licensed under CC BY-SA 4.0. Fathomly has changed the layout, removed citation markers, navigation and maintenance notices, and adjusted punctuation. This adapted version is shared under the same license. For references, see the original article.
Fathomly is not affiliated with or endorsed by the Wikimedia Foundation. Spotted a problem? Tell us.