加载中…
Let be a finite group. Then there exists a first-order statement in the language of rings without parameters and depending only on such that, for any field , we have that if and only if has a Galois extension with the Galois group isomorphic to . Further, there is an effective procedure which takes the table of multiplication of as its input and produces . Therefore, given a field , the Inverse Galois Problem for , that is, the problem of deciding whether has a Galois extension with a particular Galois group as input, is Turing reducible to the first-order theory of . Similar results hold for the Finite Split Embedding Problem and the Inverse Automorphism Problem.

生成讲解博客的中文版本

生成AI智能校验的中文版本