DOCSLIB.ORG

R → R Be a Ring Homomorphism

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text

Load more

Lecture Notes Math 371: Algebra (Fall 2006) by Nathanael Leedom Ackerman October 3, 2006 1 TALK SLOWLY AND WRITE NEATLY!! 0.1 Rings Today we are going to introduce a new structure which you haven't seen before. They are called Rings and they are a generalization of the integers. 0.1.1 De¯nitions De¯nition of Ring De¯nition 0.1.1.1. We say hR; +; £; 0; 1i is a Ring if ² R is a set with 0; 1 2 R ² +; £ : R £ R ! R ² R+ = hR; +; 0i is an abelian group ² (8x; y; z 2 R)(x £ y) £ z = x £ (y £ z) 2 ² (8x 2 R)x £ 1 = 1 £ x (Distributive Laws) (8x; y; z 2 R)x £ (y + z) = x £ y + x £ z (8x; y; z 2 R)(y + z) £ x = y £ x + z £ x We say a ring is Commutative if (8a; b 2 R) De¯nition of Subring De¯nition 0.1.1.2. Let hR; +; £; 0; 1i be a ring. We say that S ⊆ R is a Subring of hR:+; £; 0; 1i if 0; 1 2 S (8x; y 2 S)x + y 2 X ^ (¡x) 2 S ^ x £ y 2 S 0.1.2 Examples Integers Integers: 3 One of the most important examples of a commutative ring is the ring of integers Z. Some properties of the ring of integers which are inter- esting are ² Z is commutative. ² Z has no subrings. This is because if S ⊆ Z is a subring then it contains 0; 1 and hence contains 1 + 1 + ¢ ¢ ¢ + 1 n times for all n. And similarly contains ¡(1 + ¢ ¢ ¢ + 1) and hence contains all the integers. Gaussian Integers Gaussian Integers: 4 De¯nition 0.1.2.1. We say that Z[i] = fa + bi : a; b 2 Zg is the ring of Gaussian Integers The Gaussian integers are the points of a square lat- tice in the complex plane. DRAW THE COMPLEX PLANE WITH THE POINTS OF THE GAUSSIAN IN- TEGERS. Subring of C generated by ®: Similar to the ring of Gaussian integers, given any com- plex number ® 2 C we can form i Z[®] = f§i·nai® :(8i)ai 2 Z and n 2 f0; 1; 2;::: gg Notice that Z[®] is the smallest subring of C containing ®. We call Z[®] the subring generated by ®. ASK IF THEY WANT ME TO PROVE THAT Z[®] IS THE SMALLEST SUBRING CONTAINING ®. 5 Algebraic/Transcendental Number De¯nition 0.1.2.2. We say that ® 2 C is algebraic if 1 2 n (9a0; a1; : : : ; an 2 Z)a0 + a1® + a2® + ¢ ¢ ¢ + an® = 0 We say that ® is transcendental if it is not algebraic. p pp Some examples of algebraic numbers are i; 2; 2 + 17 while some examples of transcendental numbers are e; ¼. If ® is transcendental then there is a bijection p(®) à p(x) From the ring generated by ® to the ring of polynomials with coe±cients in Z. Polynomial Rings Ring of Polynomials over a Ring: In general we have that if R is a ring then i R[x] = f§i·naix : ai 2 Rg 6 is also a ring. Zero Ring Zero Ring: De¯nition 0.1.2.3. We de¯ne hf0g; +; ¤; 0; 0i to be the Zero Ring We then have that Theorem 0.1.2.4. If R is a ring such that 0 = 1 then R is the zero ring. Proof. First note that 0a = 0 for any element of a ring. This is because 0a + 0a = (0 + 0)a = 0a so subtracting 0a from both sides we see 0a = 0. Now assume 0 = 1 in a ring R. Then for all a 2 R, a = 1a = 0a = 0. Fields Fields: 7 Every ¯eld is also a ring. In fact ¯elds are special types of rings because every element other than 0 has a multiplica- tive inverse. There is a special name for such elements. De¯nition of Unit De¯nition 0.1.2.5. Let hR; £; +; 0; 1i be a ring. We say that u 2 R is a unit of R if (9u¡1 2 R)u £ u¡1 = u¡1 £ u = 1 So a ¯eld is a commutative ring where every element other than 0 is a unit. Matrixes Real Matrixes: Our last example of a ring are the real n £ n matrixes. This is an important example of a ring because it is an example of a non-commutative ring. 0.2 Homomorphisms and Ideals 0.2.1 De¯nitions Ring Homomorphism 8 De¯nition 0.2.1.1. Let hR; £; +; 0; 1i; hR0; £0; +0; 00; 10i be rings. A Homomorphism from R to R0 is a map Á : R ! R0 such that Á(0) = 00;Á(1) = 10;Á(a+b) = Á(a)+0Á(b);Á(a£b) = Á(a)£0Á(b) for all a; b 2 R. We say that Á is an isomorphism if it is a bijective ho- momorphism. If there is an isomorphism between R; R0 then we say R and R0 are isomorphic 0.2.2 Theorems The most important ring homomorphisms are those which are obtained by evaluating a polynomial at a value. For example, if a 2 R then we have Á : p(x) à p(a) is a homomorphism Á : R[x] ! R. 9 This leads to the following theorem. Substitution Principle Theorem 0.2.2.1 (Substitution Principle). Let ' : R ! R0 be a ring homomorphism. (a) Given an element ® 2 R0 there is a unique ho- momorphism © : R[x] ! R0 which agrees with the map ' on constant polynomials and sends x à ® 0 (b) More generally, given elements ®1; : : : ; ®n 2 R there is a unique homomorphism © : R[x1; : : : ; xn] ! R0 from the polynomial ring in n over R to R0 which agrees with ' on constant polynomials and which sends xi à ®i Proof. First note that the proof of (b) is obtained by sim- ply repeatedly applying (a). 10 Note that if © exists then we must for each polynomial that i i ©(§rix ) = §'(ri)® because we have determined where © send coe±cients of the polynomial as well as where it sends x (and it is a ring homomorphism. Hence, if © exists it must be unique. To prove its existence lets take the above formulas as the de¯nition for © and show that it is in fact a homo- morphism from R[x] to R0. ² Note that ©(1) = '(1) = 1. ² It is obviously true that © commutes with addition i j ² Let f = §iaix ; g = §jbjx . Then i i+j i j ©(fg) = ©(§i;jaibjx +j) = §i;j'(ai)'(bj)® = (§i'(ai)® )(§j'(bj)® = ©(f)©(g) 11 Corollary 0.2.2.2. Let x = (x1; : : : ; xn); y = (y1; : : : ; ym) denote sets of variables. Then there is a unique mor- phism ' : R[x; y] ! R[x][y] which is the identity on R [ x [ y. Proof. Note that R is a subring of R[x] and R[x] is a subring of R[x][y] so R is a subring of R[x][y]. Let ' : R ! R[x][y] be the inclusion map. The substitu- tion principle tells us that there is a unique extension of ' to a map from © : R[x; y] ! R[x][y] sending x to x and y to y while agreeing with ' on R. However, we also know that there is an inclusion map à : R[x] ! R[x; y]. And so by the substitution principle there must be a unique extension ª : R[x][y] ! R[x; y] sending y to y and agreeing with à on R[x]. 12 But then ª© and ©ª are both the identity on R and on x; y so they must be the identity on their respective domains. And hence inverse isomorphisms. We also have a relationship between polynomials as ele- ments of R[x] and polynomials as functions via the above substitution maps. This can be seen by the following the- orem. Theorem 0.2.2.3. Let R denote the ring of contin- uous real-valued functions on Rn. The map ' : R[x1; ¢ ¢ ¢ ; xn] !R sending a polynomial to its associated polynomial func- tion is an injective homomorphism. Proof. Immediate. Another set of important ring homomorphisms comes from the following Integers are an Initial Object 13 Theorem 0.2.2.4. For every ring R there is exactly one homomorphism ' : Z ! R It is the map which takes '(n) = 1R + 1R + ¢ ¢ ¢ + 1R n times if n > 0 and '(¡n) = ¡'(n). Proof. First we will show uniqueness. Suppose there are two homomorphisms '; ÃZ ! R. Then we must have '(1) = 1R = Ã(1). Now lets assume ' and à agree on all numbers between x, ¡n · x · n. Then '(n + 1) = '(n) + '(1) = Ã(n) + Ã(1) = Ã(n + 1). And so by induction ' = psi on Z. Now lets consider the map de¯ned by ² '(1) = 1R ² '(n + 1) = '(n) + 1 ² '(¡n) = ¡'(n) 14 This is the only possible homomorphism from Z ! R. So all that is left is to show that it is an actual homomor- phism. Addition: First notice that '(1 + 1) = '(1) + '(1). Now assume that if m + n = r (and both are positive) then '(m + n) = '(m) + '(n). Now let s + t = r + 1. Then we have '(s+t) = '(r+1) = '(r)+'(1) = '(s+(t¡1))+'(1) = '(s)+'(t¡1)+'(1) = '(s)+'(t) And so by induction we have ' commutes with addition. Multiplication: First notice that '(1 ¤ r) = '(1) ¤ '(r) = '(r). Now assume that '(m ¤ n) = '(m) ¤ '(n). We then have '((m+1)¤n) = '(m¤n+m) = '(m)¤'(n)+'(m) = ('(m)+'(1))¤'(n) = '(m+1)¤'(n) 15 And so by induction (and the previous result concerning addition) we have ' commutes with multiplication and hence is a homomorphism.
Recommended publications
  • Exercises and Solutions in Groups Rings and Fields

    Exercises and Solutions in Groups Rings and Fields

    EXERCISES AND SOLUTIONS IN GROUPS RINGS AND FIELDS Mahmut Kuzucuo˘glu Middle East Technical University [email protected] Ankara, TURKEY April 18, 2012 ii iii TABLE OF CONTENTS CHAPTERS 0. PREFACE . v 1. SETS, INTEGERS, FUNCTIONS . 1 2. GROUPS . 4 3. RINGS . .55 4. FIELDS . 77 5. INDEX . 100 iv v Preface These notes are prepared in 1991 when we gave the abstract al- gebra course. Our intention was to help the students by giving them some exercises and get them familiar with some solutions. Some of the solutions here are very short and in the form of a hint. I would like to thank B¨ulent B¨uy¨ukbozkırlı for his help during the preparation of these notes. I would like to thank also Prof. Ismail_ S¸. G¨ulo˘glufor checking some of the solutions. Of course the remaining errors belongs to me. If you find any errors, I should be grateful to hear from you. Finally I would like to thank Aynur Bora and G¨uldaneG¨um¨u¸sfor their typing the manuscript in LATEX. Mahmut Kuzucuo˘glu I would like to thank our graduate students Tu˘gbaAslan, B¨u¸sra C¸ınar, Fuat Erdem and Irfan_ Kadık¨oyl¨ufor reading the old version and pointing out some misprints. With their encouragement I have made the changes in the shape, namely I put the answers right after the questions. 20, December 2011 vi M. Kuzucuo˘glu 1. SETS, INTEGERS, FUNCTIONS 1.1. If A is a finite set having n elements, prove that A has exactly 2n distinct subsets.
  • The Structure Theory of Complete Local Rings

    The Structure Theory of Complete Local Rings

    The structure theory of complete local rings Introduction In the study of commutative Noetherian rings, localization at a prime followed by com- pletion at the resulting maximal ideal is a way of life. Many problems, even some that seem \global," can be attacked by first reducing to the local case and then to the complete case. Complete local rings turn out to have extremely good behavior in many respects. A key ingredient in this type of reduction is that when R is local, Rb is local and faithfully flat over R. We shall study the structure of complete local rings. A complete local ring that contains a field always contains a field that maps onto its residue class field: thus, if (R; m; K) contains a field, it contains a field K0 such that the composite map K0 ⊆ R R=m = K is an isomorphism. Then R = K0 ⊕K0 m, and we may identify K with K0. Such a field K0 is called a coefficient field for R. The choice of a coefficient field K0 is not unique in general, although in positive prime characteristic p it is unique if K is perfect, which is a bit surprising. The existence of a coefficient field is a rather hard theorem. Once it is known, one can show that every complete local ring that contains a field is a homomorphic image of a formal power series ring over a field. It is also a module-finite extension of a formal power series ring over a field. This situation is analogous to what is true for finitely generated algebras over a field, where one can make the same statements using polynomial rings instead of formal power series rings.
  • Ring Homomorphisms Definition

    Ring Homomorphisms Definition

    4-8-2018 Ring Homomorphisms Definition. Let R and S be rings. A ring homomorphism (or a ring map for short) is a function f : R → S such that: (a) For all x,y ∈ R, f(x + y)= f(x)+ f(y). (b) For all x,y ∈ R, f(xy)= f(x)f(y). Usually, we require that if R and S are rings with 1, then (c) f(1R) = 1S. This is automatic in some cases; if there is any question, you should read carefully to find out what convention is being used. The first two properties stipulate that f should “preserve” the ring structure — addition and multipli- cation. Example. (A ring map on the integers mod 2) Show that the following function f : Z2 → Z2 is a ring map: f(x)= x2. First, f(x + y)=(x + y)2 = x2 + 2xy + y2 = x2 + y2 = f(x)+ f(y). 2xy = 0 because 2 times anything is 0 in Z2. Next, f(xy)=(xy)2 = x2y2 = f(x)f(y). The second equality follows from the fact that Z2 is commutative. Note also that f(1) = 12 = 1. Thus, f is a ring homomorphism. Example. (An additive function which is not a ring map) Show that the following function g : Z → Z is not a ring map: g(x) = 2x. Note that g(x + y)=2(x + y) = 2x + 2y = g(x)+ g(y). Therefore, g is additive — that is, g is a homomorphism of abelian groups. But g(1 · 3) = g(3) = 2 · 3 = 6, while g(1)g(3) = (2 · 1)(2 · 3) = 12.
  • A Review of Commutative Ring Theory Mathematics Undergraduate Seminar: Toric Varieties

    A Review of Commutative Ring Theory Mathematics Undergraduate Seminar: Toric Varieties

    A REVIEW OF COMMUTATIVE RING THEORY MATHEMATICS UNDERGRADUATE SEMINAR: TORIC VARIETIES ADRIANO FERNANDES Contents 1. Basic Definitions and Examples 1 2. Ideals and Quotient Rings 3 3. Properties and Types of Ideals 5 4. C-algebras 7 References 7 1. Basic Definitions and Examples In this first section, I define a ring and give some relevant examples of rings we have encountered before (and might have not thought of as abstract algebraic structures.) I will not cover many of the intermediate structures arising between rings and fields (e.g. integral domains, unique factorization domains, etc.) The interested reader is referred to Dummit and Foote. Definition 1.1 (Rings). The algebraic structure “ring” R is a set with two binary opera- tions + and , respectively named addition and multiplication, satisfying · (R, +) is an abelian group (i.e. a group with commutative addition), • is associative (i.e. a, b, c R, (a b) c = a (b c)) , • and the distributive8 law holds2 (i.e.· a,· b, c ·R, (·a + b) c = a c + b c, a (b + c)= • a b + a c.) 8 2 · · · · · · Moreover, the ring is commutative if multiplication is commutative. The ring has an identity, conventionally denoted 1, if there exists an element 1 R s.t. a R, 1 a = a 1=a. 2 8 2 · ·From now on, all rings considered will be commutative rings (after all, this is a review of commutative ring theory...) Since we will be talking substantially about the complex field C, let us recall the definition of such structure. Definition 1.2 (Fields).
  • Kernel Methods for Knowledge Structures

    Kernel Methods for Knowledge Structures

    Kernel Methods for Knowledge Structures Zur Erlangung des akademischen Grades eines Doktors der Wirtschaftswissenschaften (Dr. rer. pol.) von der Fakultät für Wirtschaftswissenschaften der Universität Karlsruhe (TH) genehmigte DISSERTATION von Dipl.-Inform.-Wirt. Stephan Bloehdorn Tag der mündlichen Prüfung: 10. Juli 2008 Referent: Prof. Dr. Rudi Studer Koreferent: Prof. Dr. Dr. Lars Schmidt-Thieme 2008 Karlsruhe Abstract Kernel methods constitute a new and popular field of research in the area of machine learning. Kernel-based machine learning algorithms abandon the explicit represen- tation of data items in the vector space in which the sought-after patterns are to be detected. Instead, they implicitly mimic the geometry of the feature space by means of the kernel function, a similarity function which maintains a geometric interpreta- tion as the inner product of two vectors. Knowledge structures and ontologies allow to formally model domain knowledge which can constitute valuable complementary information for pattern discovery. For kernel-based machine learning algorithms, a good way to make such prior knowledge about the problem domain available to a machine learning technique is to incorporate it into the kernel function. This thesis studies the design of such kernel functions. First, this thesis provides a theoretical analysis of popular similarity functions for entities in taxonomic knowledge structures in terms of their suitability as kernel func- tions. It shows that, in a general setting, many taxonomic similarity functions can not be guaranteed to yield valid kernel functions and discusses the alternatives. Secondly, the thesis addresses the design of expressive kernel functions for text mining applications. A first group of kernel functions, Semantic Smoothing Kernels (SSKs) retain the Vector Space Models (VSMs) representation of textual data as vec- tors of term weights but employ linguistic background knowledge resources to bias the original inner product in such a way that cross-term similarities adequately con- tribute to the kernel result.
  • 2.2 Kernel and Range of a Linear Transformation

    2.2 Kernel and Range of a Linear Transformation

    2.2 Kernel and Range of a Linear Transformation Performance Criteria: 2. (c) Determine whether a given vector is in the kernel or range of a linear trans- formation. Describe the kernel and range of a linear transformation. (d) Determine whether a transformation is one-to-one; determine whether a transformation is onto. When working with transformations T : Rm → Rn in Math 341, you found that any linear transformation can be represented by multiplication by a matrix. At some point after that you were introduced to the concepts of the null space and column space of a matrix. In this section we present the analogous ideas for general vector spaces. Definition 2.4: Let V and W be vector spaces, and let T : V → W be a transformation. We will call V the domain of T , and W is the codomain of T . Definition 2.5: Let V and W be vector spaces, and let T : V → W be a linear transformation. • The set of all vectors v ∈ V for which T v = 0 is a subspace of V . It is called the kernel of T , And we will denote it by ker(T ). • The set of all vectors w ∈ W such that w = T v for some v ∈ V is called the range of T . It is a subspace of W , and is denoted ran(T ). It is worth making a few comments about the above: • The kernel and range “belong to” the transformation, not the vector spaces V and W . If we had another linear transformation S : V → W , it would most likely have a different kernel and range.
  • 23. Kernel, Rank, Range

    23. Kernel, Rank, Range

    23. Kernel, Rank, Range We now study linear transformations in more detail. First, we establish some important vocabulary. The range of a linear transformation f : V ! W is the set of vectors the linear transformation maps to. This set is also often called the image of f, written ran(f) = Im(f) = L(V ) = fL(v)jv 2 V g ⊂ W: The domain of a linear transformation is often called the pre-image of f. We can also talk about the pre-image of any subset of vectors U 2 W : L−1(U) = fv 2 V jL(v) 2 Ug ⊂ V: A linear transformation f is one-to-one if for any x 6= y 2 V , f(x) 6= f(y). In other words, different vector in V always map to different vectors in W . One-to-one transformations are also known as injective transformations. Notice that injectivity is a condition on the pre-image of f. A linear transformation f is onto if for every w 2 W , there exists an x 2 V such that f(x) = w. In other words, every vector in W is the image of some vector in V . An onto transformation is also known as an surjective transformation. Notice that surjectivity is a condition on the image of f. 1 Suppose L : V ! W is not injective. Then we can find v1 6= v2 such that Lv1 = Lv2. Then v1 − v2 6= 0, but L(v1 − v2) = 0: Definition Let L : V ! W be a linear transformation. The set of all vectors v such that Lv = 0W is called the kernel of L: ker L = fv 2 V jLv = 0g: 1 The notions of one-to-one and onto can be generalized to arbitrary functions on sets.
  • Formal Power Series Rings, Inverse Limits, and I-Adic Completions of Rings

    Formal Power Series Rings, Inverse Limits, and I-Adic Completions of Rings

    Formal power series rings, inverse limits, and I-adic completions of rings Formal semigroup rings and formal power series rings We next want to explore the notion of a (formal) power series ring in finitely many variables over a ring R, and show that it is Noetherian when R is. But we begin with a definition in much greater generality. Let S be a commutative semigroup (which will have identity 1S = 1) written multi- plicatively. The semigroup ring of S with coefficients in R may be thought of as the free R-module with basis S, with multiplication defined by the rule h k X X 0 0 X X 0 ( risi)( rjsj) = ( rirj)s: i=1 j=1 s2S 0 sisj =s We next want to construct a much larger ring in which infinite sums of multiples of elements of S are allowed. In order to insure that multiplication is well-defined, from now on we assume that S has the following additional property: (#) For all s 2 S, f(s1; s2) 2 S × S : s1s2 = sg is finite. Thus, each element of S has only finitely many factorizations as a product of two k1 kn elements. For example, we may take S to be the set of all monomials fx1 ··· xn : n (k1; : : : ; kn) 2 N g in n variables. For this chocie of S, the usual semigroup ring R[S] may be identified with the polynomial ring R[x1; : : : ; xn] in n indeterminates over R. We next construct a formal semigroup ring denoted R[[S]]: we may think of this ring formally as consisting of all functions from S to R, but we shall indicate elements of the P ring notationally as (possibly infinite) formal sums s2S rss, where the function corre- sponding to this formal sum maps s to rs for all s 2 S.
  • On Semifields of Type

    On Semifields of Type

    I I G ◭◭ ◮◮ ◭ ◮ On semifields of type (q2n,qn,q2,q2,q), n odd page 1 / 19 ∗ go back Giuseppe Marino Olga Polverino Rocco Tromebtti full screen Abstract 2n n 2 2 close A semifield of type (q , q , q , q , q) (with n > 1) is a finite semi- field of order q2n (q a prime power) with left nucleus of order qn, right 2 quit and middle nuclei both of order q and center of order q. Semifields of type (q6, q3, q2, q2, q) have been completely classified by the authors and N. L. Johnson in [10]. In this paper we determine, up to isotopy, the form n n of any semifield of type (q2 , q , q2, q2, q) when n is an odd integer, proving n−1 that there exist 2 non isotopic potential families of semifields of this type. Also, we provide, with the aid of the computer, new examples of semifields of type (q14, q7, q2, q2, q), when q = 2. Keywords: semifield, isotopy, linear set MSC 2000: 51A40, 51E20, 12K10 1. Introduction A finite semifield S is a finite algebraic structure satisfying all the axioms for a skew field except (possibly) associativity. The subsets Nl = {a ∈ S | (ab)c = a(bc), ∀b, c ∈ S} , Nm = {b ∈ S | (ab)c = a(bc), ∀a, c ∈ S} , Nr = {c ∈ S | (ab)c = a(bc), ∀a, b ∈ S} and K = {a ∈ Nl ∩ Nm ∩ Nr | ab = ba, ∀b ∈ S} are fields and are known, respectively, as the left nucleus, the middle nucleus, the right nucleus and the center of the semifield.
  • Ring Homomorphisms

    Ring Homomorphisms

    Ring Homomorphisms 26 Ring Homomorphism and Isomorphism Definition A ring homomorphism φ from a ring R to a ring S is a mapping from R to S that preserves the two ring operations; that is, for all a; b in R, φ(a + b) = φ(a) + φ(b) and φ(ab) = φ(a)φ(b): Definition A ring isomorphism is a ring homomorphism that is both one-to-one and onto. 27 Properties of Ring Homomorphisms Theorem Let φ be a ring homomorphism from a ring R to a ring S. Let A be a subring of R and let B be an ideal of S. 1. For any r in R and any positive integer n, φ(nr) = nφ(r) and φ(r n) = (φ(r))n. 2. φ(A) = fφ(a): a 2 Ag is a subring of S. 3. If A is an ideal and φ is onto S, then φ(A) is an ideal. 4. φ−1(B) = fr 2 R : φ(r) 2 Bg is an ideal of R. 28 Properties of Ring Homomorphisms Cont. Theorem Let φ be a ring homomorphism from a ring R to a ring S. Let A be a subring of R and let B be an ideal of S. 5. If R is commutative, then φ(R) is commutative. 6. If R has a unity 1, S 6= f0g, and φ is onto, then φ(1) is the unity of S. 7. φ is an isomorphism if and only if φ is onto and Ker φ = fr 2 R : φ(r) = 0g = f0g.
  • Definition: a Semiring S Is Said to Be Semi-Isomorphic to the Semiring The

    Definition: a Semiring S Is Said to Be Semi-Isomorphic to the Semiring The

    118 MA THEMA TICS: S. BO URNE PROC. N. A. S. that the dodecahedra are too small to accommodate the chlorine molecules. Moreover, the tetrakaidecahedra are barely long enough to hold the chlorine molecules along the polar axis; the cos2 a weighting of the density of the spherical shells representing the centers of the chlorine atoms.thus appears to be justified. On the basis of this structure for chlorine hydrate, the empirical formula is 6Cl2. 46H20, or C12. 72/3H20. This is in fair agreement with the gener- ally accepted formula C12. 8H20, for which Harris7 has recently provided further support. For molecules slightly smaller than chlorine, which could occupy the dodecahedra also, the predicted formula is M * 53/4H20. * Contribution No. 1652. 1 Davy, H., Phil. Trans. Roy. Soc., 101, 155 (1811). 2 Faraday, M., Quart. J. Sci., 15, 71 (1823). 3 Fiat Review of German Science, Vol. 26, Part IV. 4 v. Stackelberg, M., Gotzen, O., Pietuchovsky, J., Witscher, O., Fruhbuss, H., and Meinhold, W., Fortschr. Mineral., 26, 122 (1947); cf. Chem. Abs., 44, 9846 (1950). 6 Claussen, W. F., J. Chem. Phys., 19, 259, 662 (1951). 6 v. Stackelberg, M., and Muller, H. R., Ibid., 19, 1319 (1951). 7 In June, 1951, a brief description of the present structure was communicated by letter to Prof. W. H. Rodebush and Dr. W. F. Claussen. The structure was then in- dependently constructed by Dr. Claussen, who has published a note on it (J. Chem. Phys., 19, 1425 (1951)). Dr. Claussen has kindly informed us that the structure has also been discovered by H.
  • The Kernel of a Derivation

    The Kernel of a Derivation

    Journal of Pure and Applied Algebra I34 (1993) 13-16 13 North-Holland The kernel of a derivation H.G.J. Derksen Department of Mathematics, CathoCk University Nijmegen, Nijmegen, The h’etherlands Communicated by C.A. Weibel Receircd 12 November 1991 Revised 22 April 1992 Derksen, H.G.J., The kernel of a deriv+ Jn, Journal of Pure and Applied Algebra 84 (1993) 13-i6. Let K be a field of characteristic 0. Nagata and Nowicki have shown that the kernel of a derivation on K[X, , . , X,,] is of F.&e type over K if n I 3. We construct a derivation of a polynomial ring in 32 variables which kernel is not of finite type over K. Furthermore we show that for every field extension L over K of finite transcendence degree, every intermediate field which is algebraically closed in 6. is the kernel of a K-derivation of L. 1. The counterexample In this section we construct a derivation on a polynomial ring in 32 variables, based on Nagata’s counterexample to the fourteenth problem of Hilbert. For the reader’s convenience we recari the f~ia~~z+h problem of iX~ert and Nagata’:: counterexample (cf. [l-3]). Hilbert’s fourteenth problem. Let L be a subfield of @(X,, . , X,, ) a Is the ring Lnc[x,,.. , X,] of finite type over @? Nagata’s counterexample. Let R = @[Xl, . , X,, Y, , . , YrJ, t = 1; Y2 - l = yy and vi =tXilYi for ~=1,2,. ,r. Choose for j=1,2,3 and i=1,2,. e ,I ele- ments aj i E @ algebraically independent over Q.