ON the CONSTRUCTIBLE NUMBERS 1. Introduction in 1930

ON the CONSTRUCTIBLE NUMBERS 1. Introduction in 1930

PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 127, Number 3, March 1999, Pages 851{860 S 0002-9939(99)04611-0 ON THE CONSTRUCTIBLE NUMBERS CARLOS R. VIDELA (Communicated by Andreas R. Blass) Abstract. Let Ω be the field of constructible numbers, i.e. the numbers con- structed from a given unit length using ruler and compass. We prove Z Ωis definable in Ω. \ e 1. Introduction In 1930 A. Tarski [7] proved that the theory of the structure R =(R,+, ,<0,1) is decidable. He asked whether or not his result could be extended to include· certain expansions of the reals, most notably by a predicate for the field ofe rational numbers, a predicate for the field of real constructible numbers or by the function f(x)=2x. J. Robinson in [5] defined Z inside Q and thus answered negatively Tarski’s first problem. The exponential function problem has been studied intensively for the past 12 years and recently A. Macintyre and A. Wilkie [3] have made an important advance. Our paper concerns the second question. If we write Ω for the field of constructible numbers and Z for the ring of algebraic integers, then our result is that Z Ω is first order definable in Ω. We expect that Z should be definable in ∩ Z Ω. Hence, this paper ise a step towards resolving the question negatively. ∩Oure proof relies heavily on R. Rumely’s work in the theory of global fields [6]. Heree Rumely defines a predicate P (x, l, c, d), x a variable and l, c, d parameters, such that for K anumberfieldandpa prime ideal of OK there is a choice of c, d K and l a prime integer so that for t K, K P (t, l, c, d) t Op. ∈ ∈ ⇔ ∈ Op is the valuation ring of p, i.e. x K : ordp x 0 . Rumely’s idea is to use the norm map from cyclic extensions{ of∈K. More precisely,≥ } for a number field K 1=l containing the 2lth roots of unity if K0 = K(b ) is a nontrivial extension for some b K,thenK0/K is cyclic and the norm map NK0=K : K0× K× defines a norm form∈ → 1=l l 1=l Nl(b,~a)=NK =K (a0 + a1b + +al 1b− ) 0 ··· − (l) where ~a =(a0,a1,...,al 1) K . − ∈ By the theorem on symmetric functions Nl(b,~a) is a homogeneous form of degree l in the ~a variables with coefficients in Z[b]. For example, N (b, a ,a )=a2 a2b. 2 0 1 0− 1 Received by the editors March 20, 1996 and, in revised form, June 25, 1997. 1991 Mathematics Subject Classification. Primary 03C68, 11R04. Key words and phrases. Algebraic integer, constructible number, definable. c 1999 American Mathematical Society 851 License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use 852 CARLOS R. VIDELA These forms are therefore expressible in the usual vocabulary of fields. Rumely’s basic predicate is: Rl(t, c, d) ~a ~a ~a ω(ω=Nl(d,~a ) cω = Nl(cd,~a ) t = Nl(ω,~a )). ⇔∃ 1∃ 2∃ 3∃ 1 ∧ 2 ∧ 3 In section 2 we review some of Rumely’s results and make some minor but crucial extensions. In section 3 we discuss the local-global properties of sets defined by the l predicate Ol(x, c, d)whereOl(x, c, d) Rl(1 + cx ,c,d). Section 4 contains our main result. ⇔ All the facts that we need to know about the constructible field may be found in [1]. On the number theory side one uses the Hasse local-global Norm theorem (for cyclic extensions) and Artin’s Reciprocity Theorem. These can be found in [4]. For p a prime of K, Kp will denote the p-adic completion of K.Ifpis archimedean we write K . The notation Lβ/Kp implicitly means that L/K is a finite extension of number∞ fields, p a prime of K,andβis a prime of L above p, i.e. β/p. 2. Rumely's results and extensions Define the predicate Rl(t, c, d)by ~a ~a ~a ω(ω=Nl(d,~a ) cω = Nl(cd,~a ) t = Nl(ω,~a )). ∃ 1∃ 2∃ 3∃ 1 ∧ 2 ∧ 3 To simplify notation the image N (K ) will sometimes be written as N(K ) K0=K 0× 0× 1=l and statements like ω = Nl(d,~a ) will simply be expressed as ω N(d ). 1 ∈ Lemma 2.1. Let l be a prime number and assume K contains the 2lth roots of unity. Suppose p is a prime of K such that the characteristic of the residue class field K¯ p is not l. Then we have: (a) If ordp(b) 0modl,thenKβ0/Kp is totally ramified and of degree l and 6≡ l N(Kβ0×) is generated by b and (Kp×) . l (b) If ordp(b) 0modl but b/(K×),thenK0/Kp is unramified and of degree ≡ ∈ p β l and N(Kβ0×)= x Kp× ordp(x) 0modl . l { ∈ | ≡ } (c) If b (K×) ,thenK0/Kp is trivial and N(K0×)=K×. ∈ p β β p For a proof see [6], Lemma 2.1. Lemma 2.2. Suppose l is a prime and p aprimeofKsuch that p - l. Assume the 2lth roots of unity belong to Kp.Ifd Kis a non-lth power unit at p and c K is ∈ ∈ a prime element at p, then over Kp, Rl(t, c, d) is satisfied only by 0 and by t K× ∈ p for which ordp t 0modl. ≡ For a proof, see [6], Lemma 2.2. The result there is stated for the global case, but the proof remains valid for the local case given here. We will need a generalization of Lemma 2.2 for finite extensions L/K with L Ω. Given a prime β of L over p, ⊂ we ask what happens when the variables in Rl(t, c, d) are allowed to range over Lβ instead of Kp. Because [L : K] is a power of 2, we are able to determine this. Lemma 2.3. Let L/K be a finite Galois extension with L Ω.Fixc, d K, l =2 ⊂ ∈ 6 a prime integer, and p aprimeofKwith p - l. Suppose the hypotheses of Lemma 2.2 hold, and let β be a prime of L with β/p. Then over Lβ , Rl(t, c, d) is satisfied only by 0 and by t L× for which ordβ(t) 0(modl). ∈ β ≡ Proof. The proof breaks into two cases, according to whether β/p is ramified or not. License or copyright restrictions may apply to redistribution; see https://www.ams.org/journal-terms-of-use ON THE CONSTRUCTIBLE NUMBERS 853 (a) First suppose p is unramified in L/K. The ideal pOL is either prime or a product β1β2 ...βg of distinct primes of L. For any β p ordβ c =1and | s ordβ d = 0. The degree [Lβ : Kp]=f is a power of 2 since [L : K]=2 =fg. 1=l It follows that d is a non-lth power in Lβ ;otherwiseKp(d ) Lβ,so ⊂ l[L:K]. The hypotheses of Lemma 2.2 apply to Lβ so ordβ(t) 0modl. | e e ≡ (b) Now suppose p is ramified in L/K;writepOL = β1 βg. The ramification index e is a power of 2 larger than 1. ··· Fix β p.Letc0be a prime element at β.Notethatdis still a non-lth power unit at β. | 1=l Consider the number ω in the predicate Rl(t, c, d). By Lemma 2.1 Lβ(d )/Lβ 1=l is unramified of degree l and Lβ((cd) )/Lβ is totally ramified of degree l (since ordβ c = e 0modl); hence from the description of the norm groups we have: 6≡ nl m l ω = uc0 , ordβ u =0; cω =(cd) x ,x(L×). ∈ β e We may write c = c0 v with v β-unit. ∈e m l Substituting we get cω =(c0 vd) x . nl e m l Multiplying the first equation by c and equating we get cuc0 =(c0 vd) x . Taking ord values we have e + nl = me + l ordβ x. Rearranging, l(n ordβ x)=e(m 1). − l − l 1=l 1=l 1=l 1=l If m =1,thencω = cdx so ω = dx .Soω = xd and Lβ(ω )=Lβ(d ). Hence ordβ t 0modl by Lemma 2.1. If m =1,then≡ lm 1. Therefore there is an integer s so that 1 + ls = m.We get 6 | − cω =(cd)1+lsxl =(cd)(csdsx)l. It follows from this equation that ω = d(csdsx)l; hence ω1=l = d1=lcsdsx with s s 1=l 1=l c d x L×. Therefore the fields Lβ(ω )andLβ(d ) are equal which implies ∈ β that ordβ(t) 0(modl). ≡ Lemma 2.4. Let M be any algebraic field extension of Q and suppose K M is ⊂ a finite field extension of Q.Fixla prime number and assume the 2lth roots of unity belong to K.Takec, d K. Then there is a finite set of primes Sc;d;K of K such that for t M: ∈ ∈ M Rl(t, c, d) L/K finite L M,t L ⇔∃ ⊂ ∈ such that for any β prime of L above some prime p Sc;d;K we have Lβ Rl(t, c, d). ∈ Proof. The set Sc;d;K is primes p of OK : p l or p (d)orp(c) . Here, p (d)orp(c) { | | | } | | means that p appears in the fractional ideal decomposition of (d)or(c)inOK.

View Full Text

Details

  • File Type
    pdf
  • Upload Time
    -
  • Content Languages
    English
  • Upload User
    Anonymous/Not logged-in
  • File Pages
    10 Page
  • File Size
    -

Download

Channel Download Status
Express Download Enable

Copyright

We respect the copyrights and intellectual property rights of all users. All uploaded documents are either original works of the uploader or authorized works of the rightful owners.

  • Not to be reproduced or distributed without explicit permission.
  • Not used for commercial purposes outside of approved use cases.
  • Not used to infringe on the rights of the original creators.
  • If you believe any content infringes your copyright, please contact us immediately.

Support

For help with questions, suggestions, or problems, please contact us