Open Homomorphisms between $m$-step Solvable Galois Groups Compatible with the Cyclotomic Characters
Yu Mao, Mohamed Saidi

TL;DR
This paper extends Hoshi's result by proving that open homomorphisms between certain solvable Galois groups of number fields, compatible with cyclotomic characters, originate from field embeddings, specifically for $m$-step solvable groups.
Contribution
It establishes an $m$-step solvable version of Hoshi's theorem, linking open homomorphisms and field embeddings under cyclotomic character compatibility.
Findings
Open homomorphisms between $m+3$-step solvable Galois groups correspond to field embeddings.
Compatibility with cyclotomic characters is necessary and sufficient for homomorphisms to arise from field embeddings.
The result generalizes Hoshi's theorem to a broader class of solvable Galois groups.
Abstract
In \cite{Ho3}, Hoshi proved that open homomorphisms between solvably closed Galois groups of number fields which are compatible with the cyclotomic characters arise from field embeddings. In this paper, we will prove an -step solvable version of Hoshi's result. More precisely, if and are number fields, we will prove that given an open homomorphism between the maximal -step solvable Galois groups of and , where , and the induced open homomorphism between the corresponding maximal -step solvable Galois groups, then the latter arises from a field embedding if and only if the open homomorphism between the -step solvable (and hence also the -step solvable) Galois groups is compatible with the cyclotomic characters of and .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgebraic Geometry and Number Theory · Finite Group Theory Research · Coding theory and cryptography
