First-degree prime ideals of composite extensions
Giordano Santilli, Daniele Taufer

TL;DR
This paper investigates the relationship between first-degree prime ideals in composite number fields and their constituent fields, providing a classification of exceptions and demonstrating computational efficiencies in prime ideal calculations.
Contribution
It establishes a near-universal correspondence between prime ideals of composite and component fields, classifies exceptions, and shows computational improvements in prime ideal determination.
Findings
Almost always, prime ideals in composite fields relate to those in component fields.
Explicit counterexamples where the correspondence fails are provided.
Computational methods are improved, reducing time for prime ideal calculations.
Abstract
Let and be linearly disjoint number fields and let be their compositum. We prove that the first-degree prime ideals of may almost always be constructed in terms of the first-degree prime ideals of and , and vice-versa. We also classify the cases in which this correspondence does not hold, by providing explicit counterexamples. We show that for every pair of coprime integers , such a correspondence almost always respects the divisibility of principal ideals of the form , with a few exceptions that we characterize. Finally, we discuss the computational improvement of such an approach, and we verify the reduction in time needed for computing such primes for certain concrete cases.
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgebraic Geometry and Number Theory · Analytic Number Theory Research · Ginkgo biloba and Cashew Applications
