16 CHAPTER 1. NOTATIONS AND PREREQUISITES( )kd−1 + 1but> a ′ by induction hypothesis, which is a contradiction.d − 1Since we have proved k d = max{k k ∈ N, ( kd)≤ a }, one can determine kd , k d−1 , . . . , k sone by one.Definition 1.14. Let d, a ∈ N. We calla =( ) ( )kd kd−1+ + . . . +d d − 1( )ks,swhere k d > k d−1 > . . . > k s ≥ s > 0 for s, k s , . . . , k d ∈ N, the d-th Macaulay representation<strong>of</strong> a.We have a look at an example:( ( 5 6Example 1.15. Let d := 3 and a := 12. Since = 10 ≤ 12 and = 20 > 12, we( 3)( ( 3)5 2 3have to choose k 3 = 5. From 12 − = 2 and = 1 ≤ 2 < = 3, we obtain( ( 3)2)( 2)( ( 5 2 5 2 1k 2 = 2. Finally 12 − − = 1 provides k 1 = 1. Thus, 12 = + + is3)2)3)2)1)the third Macaulay representation <strong>of</strong> 12.Definition 1.16. For a, d ∈ N we definea 〈d〉 :=( )kd + 1+d + 1( ) ( )kd kd−1where a = + + . . . +d d − 1case a = 0, we set 0 〈d〉 := 0.( )kd−1 + 1+ . . . +d( )ks + 1,s + 1( )ksis the d-th Macaulay representation <strong>of</strong> a. In thesExample ( ( 1.17. ( In the terminology <strong>of</strong> the preceding Example 1.15, we obtain: 12 〈3〉 =6 3 2+ + = 17.4)3)2)With this new terminology, we can characterize Hilbert functions, as mentioned above.Theorem 1.18. (Macaulay’s characterization <strong>of</strong> Hilbert functions) Let h : Z → Z be afunction. Then h = h R/I for a Hilbert function h R/I and some homogeneous ideal I ⊂ R,if and only if, h(j) = 0 for all j < 0, h(0) = 1 and 0 ≤ h(j + 1) ≤ h(j) 〈j〉 for j > 0.The theorem will not be proved within this thesis. For a pro<strong>of</strong>, see [2]. Instead, we willlook at an example.
1.3. CHARACTERIZATION OF HILBERT FUNCTIONS 17Example 1.19. Let h : Z → Z and ˜h : Z → Z be functions defined by⎧0 if j < 00 if j < 01 if j = 01 if j = 04 if j = 14 if j = 1⎪⎨⎧⎪10 if j = 2⎨10 if j = 2h(j) =and ˜h(j) =12 if j = 312 if j = 3⎪ ⎩16 if j = 41 if j = 5⎪⎩0 if j > 518 if j = 41 if j = 50 if j > 5Then h is the Hilbert function <strong>of</strong> R/I for some homogeneous ideal I, since all values fulfillthe conditions <strong>of</strong> Theorem 1.18. In contrast to this, ˜h cannot be a Hilbert function <strong>of</strong> anysuch ring, since by Example 1.17 we have 12 〈3〉 = 17 and 18 = ˜h(4) > ˜h(3) 〈3〉 = 17, whichcontradicts the last condition on ˜h <strong>of</strong> Theorem 1.18 (the value, which contradicts 1.18 isunderlined in the definition <strong>of</strong> ˜h above).Remark 1.20. In 1.3 we defined lexicographic ideals. For a lexicographic ideal L ⊂ R,which is generated by monomials <strong>of</strong> degree ≤ d for some d ≥ 1, we geth R/L (d + 1) = h R/L (d) 〈d〉 .This follows from [2], Chapter 4.2. A rather informal argument, which gives a hint, whythe equation above is valid, is the following: We know, [L] d is generated by the r greatestmonomials <strong>of</strong> [R] d for some r ≥ 1. We write the exponent vectors <strong>of</strong> these monomials indescending lexicographic order(d, 0, 0, . . . , 0, 0), (d − 1, 1, 0, . . . , 0, 0), (d − 1, 0, 1, . . . , 0, 0), . . . ,(d − 1, 0, 0, . . . , 1, 0), (d − 1, 0, 0, . . . , 0, 1), (d − 2, 2, 0, . . . , 0, 0),(d − 2, 1, 1, . . . , 0, 0), . . . , (d − 2, 1, 0, . . . , 1, 0), (d − 2, 1, 0, . . . , 0, 1), . . . , vup to some vector v, the exponent vector <strong>of</strong> the smallest monomial <strong>of</strong> degree d in L. Nowwe consider the exponent vectors <strong>of</strong> all monomials <strong>of</strong> degree d + 1, which can be obtainedfrom those above. This yields(d + 1, 0, . . . , 0, 0), (d, 1, . . . , 0, 0), . . . , (d, 0, 0, . . . , 1, 0), (d, 0, 0, . . . , 0, 1),(d, 1, 0, . . . , 0, 0), (d − 1, 2, 0, . . . , 0, 0), . . . , (d − 1, 1, 0, . . . , 1, 0), (d − 1, 1, 0, . . . , 0, 1),(d, 0, 1, . . . , 0, 0), (d − 1, 1, 1, . . . , 0, 0), . . . , (d − 1, 0, 1, . . . , 1, 0), (d − 1, 0, 1, . . . , 0, 1),.(d, 0, 0, . . . , 1, 0), (d − 1, 1, 0, . . . , 1, 0), . . . , (d − 1, 0, 1, . . . , 1, 0), (d − 1, 0, 0, . . . , 1, 1),(d, 0, 0, . . . , 0, 1), (d − 1, 1, 0, . . . , 0, 1), . . . , (d − 1, 0, 1, . . . , 0, 1), (d − 1, 0, 0, . . . , 0, 2),.