Local GCD Equivalence is a relation between extensions of number fields which is weaker than the classical arithmetic equivalence. It was originally studied by Lochter under the name « Weak Kronecker Equivalence. » Among the many results he got, Lochter discovered that number fields extensions of degree ≤ 5 ≤5 which are locally GCD equivalent are in fact isomorphic. This fact can be restated saying that number fields extensions of low degree are uniquely characterized by the splitting behaviour of a restricted set of primes: in particular, also extensions of degree 3 and 5 are uniquely determined by their inert primes, just like the quadratic fields. The goal of this note is to present this rigidity result with a different proof, which insists especially on the densities of sets of prime ideals and their use in the classification of number fields up to isomorphism. Alongside Chebotarev’s Theorem, no harder tools than basic Group and Galois Theory are required.
Battistoni, F., On locally {GCD} equivalent number fields, <<The Graduate Journal of Mathematics>>, 2020; 5 (1): 28-37 [https://hdl.handle.net/10807/270249]
On locally {GCD} equivalent number fields
Battistoni, Francesco
2020
Abstract
Local GCD Equivalence is a relation between extensions of number fields which is weaker than the classical arithmetic equivalence. It was originally studied by Lochter under the name « Weak Kronecker Equivalence. » Among the many results he got, Lochter discovered that number fields extensions of degree ≤ 5 ≤5 which are locally GCD equivalent are in fact isomorphic. This fact can be restated saying that number fields extensions of low degree are uniquely characterized by the splitting behaviour of a restricted set of primes: in particular, also extensions of degree 3 and 5 are uniquely determined by their inert primes, just like the quadratic fields. The goal of this note is to present this rigidity result with a different proof, which insists especially on the densities of sets of prime ideals and their use in the classification of number fields up to isomorphism. Alongside Chebotarev’s Theorem, no harder tools than basic Group and Galois Theory are required.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.