Admissibility and field relations (Q375802)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Admissibility and field relations
scientific article

    Statements

    Admissibility and field relations (English)
    0 references
    0 references
    1 November 2013
    0 references
    Let \(K\) be a field. A finite group \(G\) is called \(K\)-admissible if there exists a \(K\)-central division algebra with maximal subfield \(L\) such that \(L/K\) is Galois with \(\mathrm{Gal}(L/K) \simeq G\). Two number fields \(K\) and \(L\) are equivalent by admissibility if \(K\) and \(L\) have the same admissible groups. In [Isr. J. Math. 52, 239--244 (1985; Zbl 0592.12006)], \textit{J. Sonn} proved that number fields which are equivalent by admissibility have the same \(\mathbb{Q}\)-normal closure. In the paper under review the question is considered whether two number fields which are equivalent by admissibility are necessarily isomorphic. The author considers a local necessary property for \(K\)-admissibility, called \(K\)-preadmissibility. This latter condition happens to be easier to handle and is often equivalent to \(K\)-admissibility. The corresponding notion of equivalence by preadmissibility between number fields is defined. The author constructs infinitely many pairs \((K,L)\) of number fields such that \(K\) is a proper subfield of \(L\) and \(K\) and \(L\) are equivalent by preadmissibility. It follows from his construction that \(K\) and \(L\) have the same odd order admissible groups. These results lead the author to conjecture that there exists a number field \(L\) with a proper subfield \(K\) such that \(K\) and \(L\) have the same admissible groups.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    equivalence relations between number fields
    0 references
    admissibility of finite groups
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references