In this paper, improving on the results of Del Corso (1992), we describe a method to factorize prime ideal extensions in Dedekind domains. This method needs factorization modulo \(P\) of a polynomial in at least two variables.
On Capitulation of S-Ideals in Zp-Extensions
β Scribed by Hiroki Sumida
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 167 KB
- Volume
- 86
- Category
- Article
- ISSN
- 0022-314X
No coin nor oath required. For personal study only.
β¦ Synopsis
Let k be a finite extension of Q and p a prime number. Let K be a Z p -extension of k and S the set of all prime ideals in k which are ramified in K. We denote by A$ the p-Sylow subgroup of the S-divisor class group of K. We give a criterion for A$ =0 which can be applied for general Z p -extensions. Further, we especially investigate the criterion for a totally real number field k in which p splits completely.
2001 Academic Press
1. Introduction
Let k be a finite extension of Q and p a prime number. Let K be a Z p -extension of k and k n /K the unique cyclic extension of k of degree p n . Further, let S be the set of all prime ideals in k which are ramified in K. By Theorem 1 in [11], all prime ideals in S lie above p. We assume that all prime ideals in S are fully ramified in K. We denote by A n the p-Sylow subgroup of the ideal class group of k n . We put A = A n , where the map: A n Γ A m is induced by the natural inclusion map i n, m : k n / Γ k m for m n. We will denote the induced maps by i n, m . Similarly, we denote by A$ n the p-Sylow subgroup of the S-ideal class group of k n and put
π SIMILAR VOLUMES
For y # R >0 an integral ideal of an algebraic number field F is called y-smooth if the norms of all of its prime ideal factors are bounded by y. Assuming the generalized Riemann hypothesis we prove a lower bound for the number F (x, y) of integral y-smooth ideals in F whose norms are bounded by x #
A graph H is a cover of a graph G, if there exists a mapping Ο from V (H) onto V (G) such that for every vertex v of G, Ο maps the neighbors of v in H bijectively onto the neighbors of Ο(v) in G. Negami conjectured in 1987 that a connected graph has a finite planar cover if and only if it embeds in
A graph G is k-critical if it has chromatic number k but every proper subgraph of G has a (k&1)-coloring. We prove the following result. If G is a k-critical graph of order n>k 3, then G contains fewer than n&3kΓ5+2 complete subgraphs of order k&1.
## Abstract We show that large fragments of MM, e. g. the tree property and stationary reflection, are preserved by strongly (__Ο__~1~ + 1)βgameβclosed forcings. PFA can be destroyed by a strongly (__Ο__~1~ + 1)βgameβclosed forcing but not by an __Ο__~2~βclosed. (Β© 2004 WILEYβVCH Verlag GmbH & Co.