• Non ci sono risultati.

COMBINATORIAL SECANT VARIETIES PART II

N/A
N/A
Protected

Academic year: 2021

Condividi "COMBINATORIAL SECANT VARIETIES PART II"

Copied!
108
0
0

Testo completo

(1)

COMBINATORIAL SECANT VARIETIES PART II

Bernd Sturmfels and Seth Sullivant

(2)

2-minors

Let X = (Xij) a n × m matrix of indeterminates over a field K , and I ⊆ K [X ] the ideal generated by the 2-minors of X .

Let ≺ be a term order which favours the diagonals of each minor, for instance the lexicographic order induced by

X11 X12 . . .  X1m  X21 . . .  X2m . . .  Xn1  . . .  Xnm. Therefore LT(XijXhk− XikXhj) = XijXhk if i < h and j < k. Using the Buchberger criterion, it is quite easy to see that the 2-minors of X form a Gr¨obner basis with respect to ≺.

In particular,LT(I ) = (XijXhk : i < h, j < k).

We will see that the above facts are true for t-minors, too.

(3)

2-minors

Let X = (Xij) a n × m matrix of indeterminates over a field K , and I ⊆ K [X ] the ideal generated by the 2-minors of X .

Let ≺ be a term order which favours the diagonals of each minor, for instance the lexicographic order induced by

X11 X12 . . .  X1m  X21 . . .  X2m . . .  Xn1  . . .  Xnm. Therefore LT(XijXhk− XikXhj) = XijXhk if i < h and j < k. Using the Buchberger criterion, it is quite easy to see that the 2-minors of X form a Gr¨obner basis with respect to ≺.

In particular,LT(I ) = (XijXhk : i < h, j < k).

We will see that the above facts are true for t-minors, too.

(4)

2-minors

Let X = (Xij) a n × m matrix of indeterminates over a field K , and I ⊆ K [X ] the ideal generated by the 2-minors of X .

Let ≺ be a term order which favours the diagonals of each minor, for instance the lexicographic order induced by

X11 X12 . . .  X1m  X21 . . .  X2m . . .  Xn1  . . .  Xnm.

Therefore LT(XijXhk− XikXhj) = XijXhk if i < h and j < k. Using the Buchberger criterion, it is quite easy to see that the 2-minors of X form a Gr¨obner basis with respect to ≺.

In particular,LT(I ) = (XijXhk : i < h, j < k).

We will see that the above facts are true for t-minors, too.

(5)

2-minors

Let X = (Xij) a n × m matrix of indeterminates over a field K , and I ⊆ K [X ] the ideal generated by the 2-minors of X .

Let ≺ be a term order which favours the diagonals of each minor, for instance the lexicographic order induced by

X11 X12 . . .  X1m  X21 . . .  X2m . . .  Xn1  . . .  Xnm. Therefore LT(XijXhk− XikXhj) = XijXhk if i < h and j < k.

Using the Buchberger criterion, it is quite easy to see that the 2-minors of X form a Gr¨obner basis with respect to ≺.

In particular,LT(I ) = (XijXhk : i < h, j < k).

We will see that the above facts are true for t-minors, too.

(6)

2-minors

Let X = (Xij) a n × m matrix of indeterminates over a field K , and I ⊆ K [X ] the ideal generated by the 2-minors of X .

Let ≺ be a term order which favours the diagonals of each minor, for instance the lexicographic order induced by

X11 X12 . . .  X1m  X21 . . .  X2m . . .  Xn1  . . .  Xnm. Therefore LT(XijXhk− XikXhj) = XijXhk if i < h and j < k.

Using the Buchberger criterion, it is quite easy to see that the 2-minors of X form a Gr¨obner basis with respect to ≺.

In particular,LT(I ) = (XijXhk : i < h, j < k).

We will see that the above facts are true for t-minors, too.

(7)

2-minors

Let X = (Xij) a n × m matrix of indeterminates over a field K , and I ⊆ K [X ] the ideal generated by the 2-minors of X .

Let ≺ be a term order which favours the diagonals of each minor, for instance the lexicographic order induced by

X11 X12 . . .  X1m  X21 . . .  X2m . . .  Xn1  . . .  Xnm. Therefore LT(XijXhk− XikXhj) = XijXhk if i < h and j < k.

Using the Buchberger criterion, it is quite easy to see that the 2-minors of X form a Gr¨obner basis with respect to ≺.

In particular,LT(I ) = (XijXhk : i < h, j < k).

We will see that the above facts are true for t-minors, too.

(8)

2-minors

Let X = (Xij) a n × m matrix of indeterminates over a field K , and I ⊆ K [X ] the ideal generated by the 2-minors of X .

Let ≺ be a term order which favours the diagonals of each minor, for instance the lexicographic order induced by

X11 X12 . . .  X1m  X21 . . .  X2m . . .  Xn1  . . .  Xnm. Therefore LT(XijXhk− XikXhj) = XijXhk if i < h and j < k.

Using the Buchberger criterion, it is quite easy to see that the 2-minors of X form a Gr¨obner basis with respect to ≺.

In particular,LT(I ) = (XijXhk : i < h, j < k).

We will see that the above facts are true for t-minors, too.

(9)

Notation

K will be an algebraically closed field.

x := x1, . . . , xn, y := y1, . . . , yn, z := z1, . . . , zn are indeterminates If I is an ideal of K [x], by I (y) (resp. I (z)) we denote the ideal of K [x, y, z] generated by the image of I under the homomorphism xi 7→ yi (resp. xi 7→ zi)

Given two ideals I , J ⊆ K [x], their join is

I ∗ J := (I (y) + J(z) + (yi + zi − xi : i = 1, . . . , n)) ∩ K [x] Recall that the join is associative, commutative and distributive with respect to the intersection. In particular, it makes sense write I1∗ I2∗ · · · ∗ Ir for r ideals of K [x].

Notice: f ∈ I ∗ J ⇔ f (y + z) ∈ I (y) + J(z)

(10)

Notation

K will be an algebraically closed field.

x := x1, . . . , xn, y := y1, . . . , yn, z := z1, . . . , zn are indeterminates If I is an ideal of K [x], by I (y) (resp. I (z)) we denote the ideal of K [x, y, z] generated by the image of I under the homomorphism xi 7→ yi (resp. xi 7→ zi)

Given two ideals I , J ⊆ K [x], their join is

I ∗ J := (I (y) + J(z) + (yi + zi − xi : i = 1, . . . , n)) ∩ K [x] Recall that the join is associative, commutative and distributive with respect to the intersection. In particular, it makes sense write I1∗ I2∗ · · · ∗ Ir for r ideals of K [x].

Notice: f ∈ I ∗ J ⇔ f (y + z) ∈ I (y) + J(z)

(11)

Notation

K will be an algebraically closed field.

x := x1, . . . , xn, y := y1, . . . , yn, z := z1, . . . , zn are indeterminates

If I is an ideal of K [x], by I (y) (resp. I (z)) we denote the ideal of K [x, y, z] generated by the image of I under the homomorphism xi 7→ yi (resp. xi 7→ zi)

Given two ideals I , J ⊆ K [x], their join is

I ∗ J := (I (y) + J(z) + (yi + zi − xi : i = 1, . . . , n)) ∩ K [x] Recall that the join is associative, commutative and distributive with respect to the intersection. In particular, it makes sense write I1∗ I2∗ · · · ∗ Ir for r ideals of K [x].

Notice: f ∈ I ∗ J ⇔ f (y + z) ∈ I (y) + J(z)

(12)

Notation

K will be an algebraically closed field.

x := x1, . . . , xn, y := y1, . . . , yn, z := z1, . . . , zn are indeterminates If I is an ideal of K [x], by I (y) (resp. I (z)) we denote the ideal of K [x, y, z] generated by the image of I under the homomorphism xi 7→ yi (resp. xi 7→ zi)

Given two ideals I , J ⊆ K [x], their join is

I ∗ J := (I (y) + J(z) + (yi + zi − xi : i = 1, . . . , n)) ∩ K [x] Recall that the join is associative, commutative and distributive with respect to the intersection. In particular, it makes sense write I1∗ I2∗ · · · ∗ Ir for r ideals of K [x].

Notice: f ∈ I ∗ J ⇔ f (y + z) ∈ I (y) + J(z)

(13)

Notation

K will be an algebraically closed field.

x := x1, . . . , xn, y := y1, . . . , yn, z := z1, . . . , zn are indeterminates If I is an ideal of K [x], by I (y) (resp. I (z)) we denote the ideal of K [x, y, z] generated by the image of I under the homomorphism xi 7→ yi (resp. xi 7→ zi)

Given two ideals I , J ⊆ K [x], their join is

I ∗ J := (I (y) + J(z) + (yi + zi − xi : i = 1, . . . , n)) ∩ K [x] Recall that the join is associative, commutative and distributive with respect to the intersection. In particular, it makes sense write I1∗ I2∗ · · · ∗ Ir for r ideals of K [x].

Notice: f ∈ I ∗ J ⇔ f (y + z) ∈ I (y) + J(z)

(14)

Notation

K will be an algebraically closed field.

x := x1, . . . , xn, y := y1, . . . , yn, z := z1, . . . , zn are indeterminates If I is an ideal of K [x], by I (y) (resp. I (z)) we denote the ideal of K [x, y, z] generated by the image of I under the homomorphism xi 7→ yi (resp. xi 7→ zi)

Given two ideals I , J ⊆ K [x], their join is

I ∗ J := (I (y) + J(z) + (yi + zi − xi : i = 1, . . . , n)) ∩ K [x]

Recall that the join is associative, commutative and distributive with respect to the intersection. In particular, it makes sense write I1∗ I2∗ · · · ∗ Ir for r ideals of K [x].

Notice: f ∈ I ∗ J ⇔ f (y + z) ∈ I (y) + J(z)

(15)

Notation

K will be an algebraically closed field.

x := x1, . . . , xn, y := y1, . . . , yn, z := z1, . . . , zn are indeterminates If I is an ideal of K [x], by I (y) (resp. I (z)) we denote the ideal of K [x, y, z] generated by the image of I under the homomorphism xi 7→ yi (resp. xi 7→ zi)

Given two ideals I , J ⊆ K [x], their join is

I ∗ J := (I (y) + J(z) + (yi + zi − xi : i = 1, . . . , n)) ∩ K [x]

Recall that the join is associative, commutative and distributive with respect to the intersection.

In particular, it makes sense write I1∗ I2∗ · · · ∗ Ir for r ideals of K [x].

Notice: f ∈ I ∗ J ⇔ f (y + z) ∈ I (y) + J(z)

(16)

Notation

K will be an algebraically closed field.

x := x1, . . . , xn, y := y1, . . . , yn, z := z1, . . . , zn are indeterminates If I is an ideal of K [x], by I (y) (resp. I (z)) we denote the ideal of K [x, y, z] generated by the image of I under the homomorphism xi 7→ yi (resp. xi 7→ zi)

Given two ideals I , J ⊆ K [x], their join is

I ∗ J := (I (y) + J(z) + (yi + zi − xi : i = 1, . . . , n)) ∩ K [x]

Recall that the join is associative, commutative and distributive with respect to the intersection. In particular, it makes sense write I1∗ I2∗ · · · ∗ Ir for r ideals of K [x].

Notice: f ∈ I ∗ J ⇔ f (y + z) ∈ I (y) + J(z)

(17)

Notation

K will be an algebraically closed field.

x := x1, . . . , xn, y := y1, . . . , yn, z := z1, . . . , zn are indeterminates If I is an ideal of K [x], by I (y) (resp. I (z)) we denote the ideal of K [x, y, z] generated by the image of I under the homomorphism xi 7→ yi (resp. xi 7→ zi)

Given two ideals I , J ⊆ K [x], their join is

I ∗ J := (I (y) + J(z) + (yi + zi − xi : i = 1, . . . , n)) ∩ K [x]

Recall that the join is associative, commutative and distributive with respect to the intersection. In particular, it makes sense write I1∗ I2∗ · · · ∗ Ir for r ideals of K [x].

Notice: f ∈ I ∗ J ⇔ f (y + z) ∈ I (y) + J(z)

(18)

Notation

If I is an ideal of K [x] we denote the join I ∗ I ∗ · · · ∗ I

| {z }

r

by I{r }: This is called the r th secant of I .

In the graded case, V(I{r }) is the r th secant variety of V(I ): i.e. the Zariski closure of the set of points of Pn−1

lying in a linear space spanned by r − 1 points of V(I ). If I and J are prime, radical, primary also I ∗ J is so. These and other properties about the join are proved in

A. Simis, B. Ulrich, On the ideal of embedded join, J. Alg. 226, 2000.

(19)

Notation

If I is an ideal of K [x] we denote the join I ∗ I ∗ · · · ∗ I

| {z }

r

by I{r }: This is called the r th secant of I .

In the graded case, V(I{r }) is the r th secant variety of V(I ): i.e. the Zariski closure of the set of points of Pn−1

lying in a linear space spanned by r − 1 points of V(I ). If I and J are prime, radical, primary also I ∗ J is so. These and other properties about the join are proved in

A. Simis, B. Ulrich, On the ideal of embedded join, J. Alg. 226, 2000.

(20)

Notation

If I is an ideal of K [x] we denote the join I ∗ I ∗ · · · ∗ I

| {z }

r

by I{r }: This is called the r th secant of I .

In the graded case, V(I{r }) is the r th secant variety of V(I ):

i.e. the Zariski closure of the set of points of Pn−1 lying in a linear space spanned by r − 1 points of V(I ). If I and J are prime, radical, primary also I ∗ J is so. These and other properties about the join are proved in

A. Simis, B. Ulrich, On the ideal of embedded join, J. Alg. 226, 2000.

(21)

Notation

If I is an ideal of K [x] we denote the join I ∗ I ∗ · · · ∗ I

| {z }

r

by I{r }: This is called the r th secant of I .

In the graded case, V(I{r }) is the r th secant variety of V(I ):

i.e. the Zariski closure of the set of points of Pn−1 lying in a linear space spanned by r − 1 points of V(I ).

If I and J are prime, radical, primary also I ∗ J is so. These and other properties about the join are proved in

A. Simis, B. Ulrich, On the ideal of embedded join, J. Alg. 226, 2000.

(22)

Notation

If I is an ideal of K [x] we denote the join I ∗ I ∗ · · · ∗ I

| {z }

r

by I{r }: This is called the r th secant of I .

In the graded case, V(I{r }) is the r th secant variety of V(I ):

i.e. the Zariski closure of the set of points of Pn−1 lying in a linear space spanned by r − 1 points of V(I ).

If I and J are prime, radical, primary also I ∗ J is so.

These and other properties about the join are proved in

A. Simis, B. Ulrich, On the ideal of embedded join, J. Alg. 226, 2000.

(23)

Notation

If I is an ideal of K [x] we denote the join I ∗ I ∗ · · · ∗ I

| {z }

r

by I{r }: This is called the r th secant of I .

In the graded case, V(I{r }) is the r th secant variety of V(I ):

i.e. the Zariski closure of the set of points of Pn−1 lying in a linear space spanned by r − 1 points of V(I ).

If I and J are prime, radical, primary also I ∗ J is so.

These and other properties about the join are proved in

A. Simis, B. Ulrich, On the ideal of embedded join, J. Alg. 226, 2000.

(24)

What Nam did the last time

The join operation is well understood when the ideals are monomial. First of all, the join of monomial ideals is monomial as well.

Of particular interest is the case of I (G ){r } where G is a graph and I (G ) = (xixj : {i , j } is an edge of G ).

chromatic properties of G ←→ algebraic properties of I (G ){r } When P is a poset on [n] then G (P) is the graph on [n]

whose edges are {i , j } where i and j are incomparable. In this case

I (G (P)){r }= (xi1· · · xir +1: {i1, . . . , ir +1} is an antichain of P)

where a subset of a poset is an antichain if it consists in incomparable elements.

(25)

What Nam did the last time

The join operation is well understood when the ideals are monomial.

First of all, the join of monomial ideals is monomial as well. Of particular interest is the case of I (G ){r } where G is a graph and

I (G ) = (xixj : {i , j } is an edge of G ).

chromatic properties of G ←→ algebraic properties of I (G ){r } When P is a poset on [n] then G (P) is the graph on [n]

whose edges are {i , j } where i and j are incomparable. In this case

I (G (P)){r }= (xi1· · · xir +1: {i1, . . . , ir +1} is an antichain of P)

where a subset of a poset is an antichain if it consists in incomparable elements.

(26)

What Nam did the last time

The join operation is well understood when the ideals are monomial.

First of all, the join of monomial ideals is monomial as well.

Of particular interest is the case of I (G ){r } where G is a graph and I (G ) = (xixj : {i , j } is an edge of G ).

chromatic properties of G ←→ algebraic properties of I (G ){r } When P is a poset on [n] then G (P) is the graph on [n]

whose edges are {i , j } where i and j are incomparable. In this case

I (G (P)){r }= (xi1· · · xir +1: {i1, . . . , ir +1} is an antichain of P)

where a subset of a poset is an antichain if it consists in incomparable elements.

(27)

What Nam did the last time

The join operation is well understood when the ideals are monomial.

First of all, the join of monomial ideals is monomial as well.

Of particular interest is the case of I (G ){r } where G is a graph and I (G ) = (xixj: {i , j } is an edge of G ).

chromatic properties of G ←→ algebraic properties of I (G ){r } When P is a poset on [n] then G (P) is the graph on [n]

whose edges are {i , j } where i and j are incomparable. In this case

I (G (P)){r }= (xi1· · · xir +1: {i1, . . . , ir +1} is an antichain of P)

where a subset of a poset is an antichain if it consists in incomparable elements.

(28)

What Nam did the last time

The join operation is well understood when the ideals are monomial.

First of all, the join of monomial ideals is monomial as well.

Of particular interest is the case of I (G ){r } where G is a graph and I (G ) = (xixj: {i , j } is an edge of G ).

chromatic properties of G ←→ algebraic properties of I (G ){r }

When P is a poset on [n] then G (P) is the graph on [n]

whose edges are {i , j } where i and j are incomparable. In this case

I (G (P)){r }= (xi1· · · xir +1: {i1, . . . , ir +1} is an antichain of P)

where a subset of a poset is an antichain if it consists in incomparable elements.

(29)

What Nam did the last time

The join operation is well understood when the ideals are monomial.

First of all, the join of monomial ideals is monomial as well.

Of particular interest is the case of I (G ){r } where G is a graph and I (G ) = (xixj: {i , j } is an edge of G ).

chromatic properties of G ←→ algebraic properties of I (G ){r } When P is a poset on [n] then G (P) is the graph on [n]

whose edges are {i , j } where i and j are incomparable.

In this case

I (G (P)){r }= (xi1· · · xir +1: {i1, . . . , ir +1} is an antichain of P)

where a subset of a poset is an antichain if it consists in incomparable elements.

(30)

What Nam did the last time

The join operation is well understood when the ideals are monomial.

First of all, the join of monomial ideals is monomial as well.

Of particular interest is the case of I (G ){r } where G is a graph and I (G ) = (xixj: {i , j } is an edge of G ).

chromatic properties of G ←→ algebraic properties of I (G ){r } When P is a poset on [n] then G (P) is the graph on [n]

whose edges are {i , j } where i and j are incomparable. In this case

I (G (P)){r }= (xi1· · · xir +1: {i1, . . . , ir +1} is an antichain of P)

where a subset of a poset is an antichain if it consists in incomparable elements.

(31)

What Nam did the last time

The join operation is well understood when the ideals are monomial.

First of all, the join of monomial ideals is monomial as well.

Of particular interest is the case of I (G ){r } where G is a graph and I (G ) = (xixj: {i , j } is an edge of G ).

chromatic properties of G ←→ algebraic properties of I (G ){r } When P is a poset on [n] then G (P) is the graph on [n]

whose edges are {i , j } where i and j are incomparable. In this case

I (G (P)){r }= (xi1· · · xir +1: {i1, . . . , ir +1} is an antichain of P)

where a subset of a poset is an antichain if it consists in incomparable elements.

(32)

Review of initial ideals with respect to weight vectors

If inω(I ) = LT(I ) we say that ω represents ≺ for I .

(33)

Review of initial ideals with respect to weight vectors

Let ω ∈ Zn

If inω(I ) = LT(I ) we say that ω represents ≺ for I .

(34)

Review of initial ideals with respect to weight vectors

Let ω ∈ Zn

f ∈ K [x],inω(f )∈ K [x] is the leading coefficient of f (x1tω1, . . . , xntωn)∈ K [x][t]

If inω(I ) = LT(I ) we say that ω represents ≺ for I .

(35)

Review of initial ideals with respect to weight vectors

Let ω ∈ Zn

f ∈ K [x],inω(f )∈ K [x] is the leading coefficient of f (x1tω1, . . . , xntωn)∈ K [x][t]

E. g., f = 2x1x23+ x1x33+ 3x24x3 ∈ K [x1, x2, x3] and ω = (3, 2, 1);

If inω(I ) = LT(I ) we say that ω represents ≺ for I .

(36)

Review of initial ideals with respect to weight vectors

Let ω ∈ Zn

f ∈ K [x],inω(f )∈ K [x] is the leading coefficient of f (x1tω1, . . . , xntωn)∈ K [x][t]

E. g., f = 2x1x23+ x1x33+ 3x24x3 ∈ K [x1, x2, x3] and ω = (3, 2, 1);

then f (x1t3, x2t2, x3t) =2x1x23t9+ x1x33t6+ 3x24x3t9

If inω(I ) = LT(I ) we say that ω represents ≺ for I .

(37)

Review of initial ideals with respect to weight vectors

Let ω ∈ Zn

f ∈ K [x],inω(f )∈ K [x] is the leading coefficient of f (x1tω1, . . . , xntωn)∈ K [x][t]

E. g., f = 2x1x23+ x1x33+ 3x24x3 ∈ K [x1, x2, x3] and ω = (3, 2, 1);

then f (x1t3, x2t2, x3t) =2x1x23t9+ x1x33t6+ 3x24x3t9, so inω(f ) = 2x1x23+ 3x24x3

If inω(I ) = LT(I ) we say that ω represents ≺ for I .

(38)

Review of initial ideals with respect to weight vectors

Let ω ∈ Zn

f ∈ K [x],inω(f )∈ K [x] is the leading coefficient of f (x1tω1, . . . , xntωn)∈ K [x][t]

inω(I ):= (inω(f ) : f ∈ I ) ⊆ K [x]

If inω(I ) = LT(I ) we say that ω represents ≺ for I .

(39)

Review of initial ideals with respect to weight vectors

Let ω ∈ Zn

f ∈ K [x],inω(f )∈ K [x] is the leading coefficient of f (x1tω1, . . . , xntωn)∈ K [x][t]

inω(I ):= (inω(f ) : f ∈ I ) ⊆ K [x]

for any I1, . . . , Ir, ≺ there exists ω s. t. LT(Ij) = inω(Ij)

If inω(I ) = LT(I ) we say that ω represents ≺ for I .

(40)

Review of initial ideals with respect to weight vectors

Let ω ∈ Zn

f ∈ K [x],inω(f )∈ K [x] is the leading coefficient of f (x1tω1, . . . , xntωn)∈ K [x][t]

inω(I ):= (inω(f ) : f ∈ I ) ⊆ K [x]

for any I1, . . . , Ir, ≺ there exists ω s. t. LT(Ij) = inω(Ij)

If inω(I ) = LT(I ) we say that ω represents ≺ for I .

(41)

Initial ideal of joins

What is the relation between LT(I ∗ J) and LT(I ) ∗ LT(J)?

LT(I1∗ I2∗ · · · ∗ Ir) ⊆ LT(I1) ∗ LT(I2) ∗ · · · ∗ LT(Ir)

(42)

Initial ideal of joins

What is the relation between LT(I ∗ J) and LT(I ) ∗ LT(J)?

LT(I1∗ I2∗ · · · ∗ Ir) ⊆ LT(I1) ∗ LT(I2) ∗ · · · ∗ LT(Ir)

(43)

Initial ideal of joins

What is the relation between LT(I ∗ J) and LT(I ) ∗ LT(J)?

LT(I1∗ I2∗ · · · ∗ Ir) ⊆ LT(I1) ∗ LT(I2) ∗ · · · ∗ LT(Ir)

(44)

Initial ideal of joins

What is the relation between LT(I ∗ J) and LT(I ) ∗ LT(J)?

LT(I1∗ I2∗ · · · ∗ Ir) ⊆ LT(I1) ∗ LT(I2) ∗ · · · ∗ LT(Ir)

We can suppose r = 2: the general case will follow by a trivial induction.

(45)

Initial ideal of joins

What is the relation between LT(I ∗ J) and LT(I ) ∗ LT(J)?

LT(I1∗ I2∗ · · · ∗ Ir) ⊆ LT(I1) ∗ LT(I2) ∗ · · · ∗ LT(Ir)

We can suppose r = 2: the general case will follow by a trivial induction.

So we must prove LT(I ∗ J) ⊆ LT(I ) ∗ LT(J)

(46)

Initial ideal of joins

What is the relation between LT(I ∗ J) and LT(I ) ∗ LT(J)?

LT(I1∗ I2∗ · · · ∗ Ir) ⊆ LT(I1) ∗ LT(I2) ∗ · · · ∗ LT(Ir)

Pick f ∈ I ∗ J, and set m := LT(f ).

(47)

Initial ideal of joins

What is the relation between LT(I ∗ J) and LT(I ) ∗ LT(J)?

LT(I1∗ I2∗ · · · ∗ Ir) ⊆ LT(I1) ∗ LT(I2) ∗ · · · ∗ LT(Ir)

Pick f ∈ I ∗ J, and set m := LT(f ).

Take a vector ω ∈ Zn representing ≺ for I , J and f .

(48)

Initial ideal of joins

What is the relation between LT(I ∗ J) and LT(I ) ∗ LT(J)?

LT(I1∗ I2∗ · · · ∗ Ir) ⊆ LT(I1) ∗ LT(I2) ∗ · · · ∗ LT(Ir)

Pick f ∈ I ∗ J, and set m := LT(f ).

Take a vector ω ∈ Zn representing ≺ for I , J and f . Consider the ideal I (y) + J(z) ⊆ K [x, y, z].

(49)

Initial ideal of joins

What is the relation between LT(I ∗ J) and LT(I ) ∗ LT(J)?

LT(I1∗ I2∗ · · · ∗ Ir) ⊆ LT(I1) ∗ LT(I2) ∗ · · · ∗ LT(Ir)

Pick f ∈ I ∗ J, and set m := LT(f ).

Take a vector ω ∈ Zn representing ≺ for I , J and f . Consider the ideal I (y) + J(z) ⊆ K [x, y, z]. We have

in(ω,ω,ω)(I (y) + J(z)) = in(ω,ω,ω)(I (y)) + in(ω,ω,ω)(J(z))

(50)

Initial ideal of joins

What is the relation between LT(I ∗ J) and LT(I ) ∗ LT(J)?

LT(I1∗ I2∗ · · · ∗ Ir) ⊆ LT(I1) ∗ LT(I2) ∗ · · · ∗ LT(Ir)

Pick f ∈ I ∗ J, and set m := LT(f ).

Take a vector ω ∈ Zn representing ≺ for I , J and f . Consider the ideal I (y) + J(z) ⊆ K [x, y, z]. We have

in(ω,ω,ω)(I (y) + J(z)) = in(ω,ω,ω)(I (y)) + in(ω,ω,ω)(J(z))

= LT(I )(y) + LT(J)(z).

(51)

Initial ideal of joins

What is the relation between LT(I ∗ J) and LT(I ) ∗ LT(J)?

LT(I1∗ I2∗ · · · ∗ Ir) ⊆ LT(I1) ∗ LT(I2) ∗ · · · ∗ LT(Ir)

Pick f ∈ I ∗ J, and set m := LT(f ).

Take a vector ω ∈ Zn representing ≺ for I , J and f . Consider the ideal I (y) + J(z) ⊆ K [x, y, z]. We have

in(ω,ω,ω)(I (y) + J(z)) = in(ω,ω,ω)(I (y)) + in(ω,ω,ω)(J(z))

= LT(I )(y) + LT(J)(z).

Since in(ω,ω,ω)(f (y + z)) = m(y + z),

(52)

Initial ideal of joins

What is the relation between LT(I ∗ J) and LT(I ) ∗ LT(J)?

LT(I1∗ I2∗ · · · ∗ Ir) ⊆ LT(I1) ∗ LT(I2) ∗ · · · ∗ LT(Ir)

Pick f ∈ I ∗ J, and set m := LT(f ).

Take a vector ω ∈ Zn representing ≺ for I , J and f . Consider the ideal I (y) + J(z) ⊆ K [x, y, z]. We have

in(ω,ω,ω)(I (y) + J(z)) = in(ω,ω,ω)(I (y)) + in(ω,ω,ω)(J(z))

= LT(I )(y) + LT(J)(z).

Since in(ω,ω,ω)(f (y + z)) = m(y + z), f ∈ I ∗ J ⇒ f (y + z) ∈ I (y) + J(z)

(53)

Initial ideal of joins

What is the relation between LT(I ∗ J) and LT(I ) ∗ LT(J)?

LT(I1∗ I2∗ · · · ∗ Ir) ⊆ LT(I1) ∗ LT(I2) ∗ · · · ∗ LT(Ir)

Pick f ∈ I ∗ J, and set m := LT(f ).

Take a vector ω ∈ Zn representing ≺ for I , J and f . Consider the ideal I (y) + J(z) ⊆ K [x, y, z]. We have

in(ω,ω,ω)(I (y) + J(z)) = in(ω,ω,ω)(I (y)) + in(ω,ω,ω)(J(z))

= LT(I )(y) + LT(J)(z).

Since in(ω,ω,ω)(f (y + z)) = m(y + z), f ∈ I ∗ J ⇒ f (y + z) ∈ I (y) + J(z)

⇒ m(y + z) ∈ LT(I )(y) + LT(J)(z)

(54)

Initial ideal of joins

What is the relation between LT(I ∗ J) and LT(I ) ∗ LT(J)?

LT(I1∗ I2∗ · · · ∗ Ir) ⊆ LT(I1) ∗ LT(I2) ∗ · · · ∗ LT(Ir)

Pick f ∈ I ∗ J, and set m := LT(f ).

Take a vector ω ∈ Zn representing ≺ for I , J and f . Consider the ideal I (y) + J(z) ⊆ K [x, y, z]. We have

in(ω,ω,ω)(I (y) + J(z)) = in(ω,ω,ω)(I (y)) + in(ω,ω,ω)(J(z))

= LT(I )(y) + LT(J)(z).

Since in(ω,ω,ω)(f (y + z)) = m(y + z), f ∈ I ∗ J ⇒ f (y + z) ∈ I (y) + J(z)

⇒ m(y + z) ∈ LT(I )(y) + LT(J)(z) ⇒m ∈ LT(I ) ∗ LT(J). 

(55)

Consequences

(1) LT(I{r }) ⊆ LT(I ){r }

(2)dim V(LT(I ){r }) ≤dim V(I{r })

If equality holds in (2), then

(3) deg V(LT(I ){r }) ≤deg V(I{r })

We say that ≺ isr -delightful for I if equality holds in (1). We say that ≺ isdeligthful if it is r -delightful for any r .

(56)

Consequences

(1) LT(I{r }) ⊆ LT(I ){r }

(2)dim V(LT(I ){r }) ≤dim V(I{r })

If equality holds in (2), then

(3) deg V(LT(I ){r }) ≤deg V(I{r })

We say that ≺ isr -delightful for I if equality holds in (1). We say that ≺ isdeligthful if it is r -delightful for any r .

(57)

Consequences

(1) LT(I{r }) ⊆ LT(I ){r }

(2)dim V(LT(I ){r }) ≤dim V(I{r })

If equality holds in (2), then

(3) deg V(LT(I ){r }) ≤deg V(I{r })

We say that ≺ isr -delightful for I if equality holds in (1). We say that ≺ isdeligthful if it is r -delightful for any r .

(58)

Consequences

(1) LT(I{r }) ⊆ LT(I ){r }

(2)dim V(LT(I ){r }) ≤dim V(I{r })

If equality holds in (2), then

(3) deg V(LT(I ){r }) ≤deg V(I{r })

We say that ≺ isr -delightful for I if equality holds in (1). We say that ≺ isdeligthful if it is r -delightful for any r .

(59)

Consequences

(1) LT(I{r }) ⊆ LT(I ){r }

(2)dim V(LT(I ){r }) ≤dim V(I{r })

If equality holds in (2), then

(3) deg V(LT(I ){r }) ≤deg V(I{r })

We say that ≺ isr -delightful for I if equality holds in (1).

We say that ≺ isdeligthful if it is r -delightful for any r .

(60)

Consequences

(1) LT(I{r }) ⊆ LT(I ){r }

(2)dim V(LT(I ){r }) ≤dim V(I{r })

If equality holds in (2), then

(3) deg V(LT(I ){r }) ≤deg V(I{r })

We say that ≺ isr -delightful for I if equality holds in (1). We say that ≺ isdeligthful if it is r -delightful for any r .

(61)

EXAMPLES

(62)

Minors of a generic matrix

Let X = (Xij) be a n × m matrix of indeterminates

and denote by Ir the ideal of K [X ] generated by the r -minors of X . The variety V(Ir) is the set of all the

matrices of Mn,m(K ) whose rank is less than or equal to r − 1. Clearly the sum of r − 1 matrices of rank ≤ 1

is a matrix of rank ≤ r − 1.

Therefore the elements of Ir vanish on V(I2{r −1}). Since I2 is radical I2{r −1} is radical as well. So

Ir ⊆ I2{r −1}

(63)

Minors of a generic matrix

Let X = (Xij) be a n × m matrix of indeterminates

and denote by Ir the ideal of K [X ] generated by the r -minors of X .

The variety V(Ir) is the set of all the

matrices of Mn,m(K ) whose rank is less than or equal to r − 1. Clearly the sum of r − 1 matrices of rank ≤ 1

is a matrix of rank ≤ r − 1.

Therefore the elements of Ir vanish on V(I2{r −1}). Since I2 is radical I2{r −1} is radical as well. So

Ir ⊆ I2{r −1}

(64)

Minors of a generic matrix

Let X = (Xij) be a n × m matrix of indeterminates

and denote by Ir the ideal of K [X ] generated by the r -minors of X . The variety V(Ir) is the set of all the

matrices of Mn,m(K ) whose rank is less than or equal to r − 1.

Clearly the sum of r − 1 matrices of rank ≤ 1 is a matrix of rank ≤ r − 1.

Therefore the elements of Ir vanish on V(I2{r −1}). Since I2 is radical I2{r −1} is radical as well. So

Ir ⊆ I2{r −1}

(65)

Minors of a generic matrix

Let X = (Xij) be a n × m matrix of indeterminates

and denote by Ir the ideal of K [X ] generated by the r -minors of X . The variety V(Ir) is the set of all the

matrices of Mn,m(K ) whose rank is less than or equal to r − 1.

Clearly the sum of r − 1 matrices of rank ≤ 1 is a matrix of rank ≤ r − 1.

Therefore the elements of Ir vanish on V(I2{r −1}). Since I2 is radical I2{r −1} is radical as well. So

Ir ⊆ I2{r −1}

(66)

Minors of a generic matrix

Let X = (Xij) be a n × m matrix of indeterminates

and denote by Ir the ideal of K [X ] generated by the r -minors of X . The variety V(Ir) is the set of all the

matrices of Mn,m(K ) whose rank is less than or equal to r − 1.

Clearly the sum of r − 1 matrices of rank ≤ 1 is a matrix of rank ≤ r − 1.

Therefore the elements of Ir vanish on V(I2{r −1}).

Since I2 is radical I2{r −1} is radical as well. So

Ir ⊆ I2{r −1}

(67)

Minors of a generic matrix

Let X = (Xij) be a n × m matrix of indeterminates

and denote by Ir the ideal of K [X ] generated by the r -minors of X . The variety V(Ir) is the set of all the

matrices of Mn,m(K ) whose rank is less than or equal to r − 1.

Clearly the sum of r − 1 matrices of rank ≤ 1 is a matrix of rank ≤ r − 1.

Therefore the elements of Ir vanish on V(I2{r −1}).

Since I2 is radical I2{r −1} is radical as well.

So

Ir ⊆ I2{r −1}

(68)

Minors of a generic matrix

Let X = (Xij) be a n × m matrix of indeterminates

and denote by Ir the ideal of K [X ] generated by the r -minors of X . The variety V(Ir) is the set of all the

matrices of Mn,m(K ) whose rank is less than or equal to r − 1.

Clearly the sum of r − 1 matrices of rank ≤ 1 is a matrix of rank ≤ r − 1.

Therefore the elements of Ir vanish on V(I2{r −1}).

Since I2 is radical I2{r −1} is radical as well. So

Ir ⊆ I2{r −1}

(69)

Minors of a generic matrix

We can get a poset structure on P = {{i , j } : i = 1, . . . , n, j = 1, . . . , m} (i , j ) ≤ (h, k) ⇔ i ≤ h and j ≥ k

At the beginning we said that if ≺ favours the diagonals then LT(I2) = (XijXhk : i < h, j < k). But then LT(I2) = I (G (P)), and therefore

LT(Ir) ⊆ LT(I2{r −1}) ⊆ LT(I2){r −1}=

= (Xi1j1Xi2j2· · · Xirjr : i1< . . . < ir, j1< . . . < jr) =: Jr

The monomials generating Jr are the leading terms of the minors [i1, . . . , ir | j1, . . . , jr],

soLT(Ir) = Jr, and the r -minors of X are a Gr¨obener basis

(70)

Minors of a generic matrix

We can get a poset structure on P = {{i , j } : i = 1, . . . , n, j = 1, . . . , m}

(i , j ) ≤ (h, k) ⇔ i ≤ h and j ≥ k

At the beginning we said that if ≺ favours the diagonals then LT(I2) = (XijXhk : i < h, j < k). But then LT(I2) = I (G (P)), and therefore

LT(Ir) ⊆ LT(I2{r −1}) ⊆ LT(I2){r −1}=

= (Xi1j1Xi2j2· · · Xirjr : i1< . . . < ir, j1< . . . < jr) =: Jr

The monomials generating Jr are the leading terms of the minors [i1, . . . , ir | j1, . . . , jr],

soLT(Ir) = Jr, and the r -minors of X are a Gr¨obener basis

(71)

Minors of a generic matrix

We can get a poset structure on P = {{i , j } : i = 1, . . . , n, j = 1, . . . , m}

(i , j ) ≤ (h, k) ⇔ i ≤ h and j ≥ k

At the beginning we said that if ≺ favours the diagonals then LT(I2) = (XijXhk : i < h, j < k). But then LT(I2) = I (G (P)), and therefore

LT(Ir) ⊆ LT(I2{r −1}) ⊆ LT(I2){r −1}=

= (Xi1j1Xi2j2· · · Xirjr : i1< . . . < ir, j1< . . . < jr) =: Jr

The monomials generating Jr are the leading terms of the minors [i1, . . . , ir | j1, . . . , jr],

soLT(Ir) = Jr, and the r -minors of X are a Gr¨obener basis

(72)

Minors of a generic matrix

We can get a poset structure on P = {{i , j } : i = 1, . . . , n, j = 1, . . . , m}

(i , j ) ≤ (h, k) ⇔ i ≤ h and j ≥ k

At the beginning we said that if ≺ favours the diagonals then LT(I2) = (XijXhk : i < h, j < k).

But then LT(I2) = I (G (P)), and therefore

LT(Ir) ⊆ LT(I2{r −1}) ⊆ LT(I2){r −1}=

= (Xi1j1Xi2j2· · · Xirjr : i1< . . . < ir, j1< . . . < jr) =: Jr

The monomials generating Jr are the leading terms of the minors [i1, . . . , ir | j1, . . . , jr],

soLT(Ir) = Jr, and the r -minors of X are a Gr¨obener basis

(73)

Minors of a generic matrix

We can get a poset structure on P = {{i , j } : i = 1, . . . , n, j = 1, . . . , m}

(i , j ) ≤ (h, k) ⇔ i ≤ h and j ≥ k

At the beginning we said that if ≺ favours the diagonals then LT(I2) = (XijXhk : i < h, j < k).

But then LT(I2) = I (G (P)),

and therefore

LT(Ir) ⊆ LT(I2{r −1}) ⊆ LT(I2){r −1}=

= (Xi1j1Xi2j2· · · Xirjr : i1< . . . < ir, j1< . . . < jr) =: Jr

The monomials generating Jr are the leading terms of the minors [i1, . . . , ir | j1, . . . , jr],

soLT(Ir) = Jr, and the r -minors of X are a Gr¨obener basis

(74)

Minors of a generic matrix

We can get a poset structure on P = {{i , j } : i = 1, . . . , n, j = 1, . . . , m}

(i , j ) ≤ (h, k) ⇔ i ≤ h and j ≥ k

At the beginning we said that if ≺ favours the diagonals then LT(I2) = (XijXhk : i < h, j < k).

But then LT(I2) = I (G (P)), and therefore

LT(Ir) ⊆ LT(I2{r −1}) ⊆ LT(I2){r −1}=

= (Xi1j1Xi2j2· · · Xirjr : i1< . . . < ir, j1< . . . < jr) =: Jr

The monomials generating Jr are the leading terms of the minors [i1, . . . , ir | j1, . . . , jr],

soLT(Ir) = Jr, and the r -minors of X are a Gr¨obener basis

Riferimenti

Documenti correlati

The temperatures shown here are: local equilibrium tem- perature T , thermodynamic non-equilibrium temperature T neq (equal to the kinetic temperature along the x axis), the

Without loss of generality we may assume that A, B, C are complex numbers along the unit circle. |z|

Anthropology is a well suited example of a social field of inquiry where disciplines as diverse as history, sociology, cultural critique, biology, cognitive science – to name a few

It is submitted that the probable intention of the drafters of the Restatement (Second) was to achieve a balance (in section 187 (2) (a)) between the older reasonable

Tuttavia, il prezzo predatorio rappresenta un dilemma che ha tradizionalmente sollecitato l’attenzione della comunità antitrust: da un lato la storia e la teoria economica

In order to perform the investigation on the RTD fluctuations the mixer was divided along the axial direction into six identical portions. In this way six bins to be used as

There- fore an important development of the present work would be represented by the implementation of the developed algorithms on GPU-base hardware, which would allow the

[r]