Local cohomology with support in determinantal ideals Claudiu Raicu - - PowerPoint PPT Presentation

local cohomology with support in determinantal ideals
SMART_READER_LITE
LIVE PREVIEW

Local cohomology with support in determinantal ideals Claudiu Raicu - - PowerPoint PPT Presentation

Local cohomology with support in determinantal ideals Claudiu Raicu and Jerzy Weyman Fort Collins, August 2013 Resolutions Example I 2 = 2 2 minors of a 3 3 matrix . S = Sym ( C 3 C 3 ) . 1 . . . . ( S / I 2 ) : . 9 16


slide-1
SLIDE 1

Local cohomology with support in determinantal ideals

Claudiu Raicu∗ and Jerzy Weyman Fort Collins, August 2013

slide-2
SLIDE 2

Resolutions

Example

I2 = 2 × 2 minors of a 3 × 3 matrix. S = Sym(C3 ⊗ C3). β(S/I2) : 1 . . . . . 9 16 9 . . . . . 1

slide-3
SLIDE 3

Resolutions

Example

I2 = 2 × 2 minors of a 3 × 3 matrix. S = Sym(C3 ⊗ C3). β(S/I2) : 1 . . . . . 9 16 9 . . . . . 1 More generally, Ip = p × p minors of m × n matrix, S = Sym(Cm ⊗ Cn). β(S/Ip) : Lascoux, J´

  • zefiak, Pragacz, Weyman ’80.

Feature: Ip is a GLm × GLn–representation. Assume m ≥ n.

slide-4
SLIDE 4

Resolutions

Example

I2 = 2 × 2 minors of a 3 × 3 matrix. S = Sym(C3 ⊗ C3). β(S/I2) : 1 . . . . . 9 16 9 . . . . . 1 More generally, Ip = p × p minors of m × n matrix, S = Sym(Cm ⊗ Cn). β(S/Ip) : Lascoux, J´

  • zefiak, Pragacz, Weyman ’80.

Feature: Ip is a GLm × GLn–representation. Assume m ≥ n. Cauchy’s formula: S =

  • x=(x1≥x2≥···≥xn)

SxCm ⊗ SxCn. Ip = p

  • Cm ⊗

p

  • Cn
  • =
  • S(1p)Cm ⊗ S(1p)Cn

.

slide-5
SLIDE 5

The ideals Ix

Ix = (SxCm ⊗ SxCn) =

  • x⊂y

SyCm ⊗ SyCn. [De Concini–Eisenbud–Procesi ’80]

slide-6
SLIDE 6

The ideals Ix

Ix = (SxCm ⊗ SxCn) =

  • x⊂y

SyCm ⊗ SyCn. [De Concini–Eisenbud–Procesi ’80]

Problem

Compute the resolution of all Ix.

slide-7
SLIDE 7

The ideals Ix

Ix = (SxCm ⊗ SxCn) =

  • x⊂y

SyCm ⊗ SyCn. [De Concini–Eisenbud–Procesi ’80]

Problem

Compute the resolution of all Ix.

Example

m = n = 3, Ix = I(2,2). β(S/I2,2) : 1 . . . . . . . . . . . . . . . . . . . . . 36 90 84 36 9 1 . . . . . . . . . . . 1 . .

slide-8
SLIDE 8

Regularity of the ideals Ix

Unfortunately, we don’t know how to compute β(S/Ix) for arbitrary x!

Question

What about the regularity? Effective bounds?

slide-9
SLIDE 9

Regularity of the ideals Ix

Unfortunately, we don’t know how to compute β(S/Ix) for arbitrary x!

Question

What about the regularity? Effective bounds?

Theorem (–, Weyman ’13)

reg(Ix) = max

p=1,··· ,n xp>xp+1

(n · (xp − p) + p2 + 2 · (p − 1) · (n − p)). In particular, the only ideals Ix which have a linear resolution are those for which x1 = · · · = xn or x1 − 1 = x2 = · · · = xn.

slide-10
SLIDE 10

Regularity of the ideals Ix

Unfortunately, we don’t know how to compute β(S/Ix) for arbitrary x!

Question

What about the regularity? Effective bounds?

Theorem (–, Weyman ’13)

reg(Ix) = max

p=1,··· ,n xp>xp+1

(n · (xp − p) + p2 + 2 · (p − 1) · (n − p)). In particular, the only ideals Ix which have a linear resolution are those for which x1 = · · · = xn or x1 − 1 = x2 = · · · = xn.

Example

For m = n = 3, reg(I(1,1)) = 3, reg(I(2,2)) = 6.

slide-11
SLIDE 11

Local cohomology

The ˇ Cech complex C•(f1, · · · , ft) is defined by 0 − → S − →

  • 1≤i≤t

Sfi − →

  • 1≤i<j≤t

Sfifj − → · · · − → Sf1···ft − → 0.

slide-12
SLIDE 12

Local cohomology

The ˇ Cech complex C•(f1, · · · , ft) is defined by 0 − → S − →

  • 1≤i≤t

Sfi − →

  • 1≤i<j≤t

Sfifj − → · · · − → Sf1···ft − → 0. For I = (f1, · · · , ft), i ≥ 0, the local cohomology modules Hi

I(S) are

defined by Hi

I(S) = Hi(C•(f1, · · · , ft)).

slide-13
SLIDE 13

Local cohomology

The ˇ Cech complex C•(f1, · · · , ft) is defined by 0 − → S − →

  • 1≤i≤t

Sfi − →

  • 1≤i<j≤t

Sfifj − → · · · − → Sf1···ft − → 0. For I = (f1, · · · , ft), i ≥ 0, the local cohomology modules Hi

I(S) are

defined by Hi

I(S) = Hi(C•(f1, · · · , ft)).

Problem

Compute H•

I (S) for all I

slide-14
SLIDE 14

Local cohomology

The ˇ Cech complex C•(f1, · · · , ft) is defined by 0 − → S − →

  • 1≤i≤t

Sfi − →

  • 1≤i<j≤t

Sfifj − → · · · − → Sf1···ft − → 0. For I = (f1, · · · , ft), i ≥ 0, the local cohomology modules Hi

I(S) are

defined by Hi

I(S) = Hi(C•(f1, · · · , ft)).

Problem

Compute H•

I (S) for all I = Ix.

slide-15
SLIDE 15

Local cohomology

The ˇ Cech complex C•(f1, · · · , ft) is defined by 0 − → S − →

  • 1≤i≤t

Sfi − →

  • 1≤i<j≤t

Sfifj − → · · · − → Sf1···ft − → 0. For I = (f1, · · · , ft), i ≥ 0, the local cohomology modules Hi

I(S) are

defined by Hi

I(S) = Hi(C•(f1, · · · , ft)).

Problem

Compute H•

I (S) for all I = Ix.

Note that H•

I (S) = H• √ I(S),

and

  • Ix = Ip,

where p is the number of non-zero parts of x.

slide-16
SLIDE 16

Characters

Problem

For each p = 1, · · · , n, determine H•

Ip(S).

slide-17
SLIDE 17

Characters

Problem

For each p = 1, · · · , n, determine H•

Ip(S).

H•

Ip(S) is an example of a doubly-graded module Mj i , equivariant with

respect to the action of GLm × GLn. i − → internal degree, j − → cohomological degree.

slide-18
SLIDE 18

Characters

Problem

For each p = 1, · · · , n, determine H•

Ip(S).

H•

Ip(S) is an example of a doubly-graded module Mj i , equivariant with

respect to the action of GLm × GLn. i − → internal degree, j − → cohomological degree. For such M, we define the character χM by χM(z, w) =

  • i,j

[Mj

i ] · zi · wj,

where [Mj

i ] is the class of Mj i in the representation ring of GLm × GLn.

slide-19
SLIDE 19

Dominant weights

We define the set of dominant weights in Zr (for r = m or n) Zr

dom = {λ ∈ Zr : λ1 ≥ · · · ≥ λr}.

slide-20
SLIDE 20

Dominant weights

We define the set of dominant weights in Zr (for r = m or n) Zr

dom = {λ ∈ Zr : λ1 ≥ · · · ≥ λr}.

For λ ∈ Zn

dom, s = 0, 1, · · · , n − 1, let

λ(s) = (λ1, · · · , λs, s − n, · · · , s − n

  • m−n

, λs+1 + (m − n), · · · , λn + (m − n)). For m > n, λ(s) is dominant if and only if λs ≥ s − n and λs+1 ≤ s − m.

slide-21
SLIDE 21

Dominant weights

We define the set of dominant weights in Zr (for r = m or n) Zr

dom = {λ ∈ Zr : λ1 ≥ · · · ≥ λr}.

For λ ∈ Zn

dom, s = 0, 1, · · · , n − 1, let

λ(s) = (λ1, · · · , λs, s − n, · · · , s − n

  • m−n

, λs+1 + (m − n), · · · , λn + (m − n)). For m > n, λ(s) is dominant if and only if λs ≥ s − n and λs+1 ≤ s − m. The following Laurent power series are the key players in the description of H•

Ip(S).

hs(z) =

  • λ∈Zn

dom

λs≥s−n λs+1≤s−m

[Sλ(s)Cm ⊗ SλCn] · z|λ|.

slide-22
SLIDE 22

An example

Take m = 11, n = 9, s = 5, λ = (4, 2, 1, −2, −3, −6, −8, −8, −10). We have m − n = 2 and λ(s) = (λ1, · · · , λs, s − n, · · · , s − n

  • m−n

, λs+1 + (m − n), · · · , λn + (m − n)) = (4, 2, 1, −2, −3, −4, −4, −4, −6, −6, −8).

slide-23
SLIDE 23

An example

Take m = 11, n = 9, s = 5, λ = (4, 2, 1, −2, −3, −6, −8, −8, −10). We have m − n = 2 and λ(s) = (λ1, · · · , λs, s − n, · · · , s − n

  • m−n

, λs+1 + (m − n), · · · , λn + (m − n)) = (4, 2, 1, −2, −3, −4, −4, −4, −6, −6, −8). The coefficient of z−30 in hs(z) involves (among other terms)             C11             ⊗          C9         

slide-24
SLIDE 24

Local cohomology with support in determinantal ideals

Theorem (–, Weyman, Witt ’13)

χH•

In(S)(z, w) =

n−1

  • s=0

hs(z) · w1+(n−s)·(m−n).

slide-25
SLIDE 25

Local cohomology with support in determinantal ideals

Theorem (–, Weyman, Witt ’13)

χH•

In(S)(z, w) =

n−1

  • s=0

hs(z) · w1+(n−s)·(m−n). We define the Gauss polynomial a

b

  • to be the generating function

a b

  • (w) =
  • b≥t1≥t2≥···≥ta−b≥0

wt1+···+ta−b =

  • c≥0

p(a − b, b; c) · wc, where p(a − b, b; c) = #{t ⊢ c : t ⊂ (ba−b)}.

slide-26
SLIDE 26

Local cohomology with support in determinantal ideals

Theorem (–, Weyman, Witt ’13)

χH•

In(S)(z, w) =

n−1

  • s=0

hs(z) · w1+(n−s)·(m−n). We define the Gauss polynomial a

b

  • to be the generating function

a b

  • (w) =
  • b≥t1≥t2≥···≥ta−b≥0

wt1+···+ta−b =

  • c≥0

p(a − b, b; c) · wc, where p(a − b, b; c) = #{t ⊢ c : t ⊂ (ba−b)}.

Theorem (–, Weyman ’13)

χH•

Ip(S)(z, w) =

p−1

  • s=0

hs(z) · w(n−p+1)2+(n−s)·(m−n) · n − s − 1 p − s − 1

  • (w2).
slide-27
SLIDE 27

Ext modules

reg(M) = max{−r − j : Extj

S(M, S)r = 0}.

slide-28
SLIDE 28

Ext modules

reg(S/Ix) = max{−r − j : Extj

S(S/Ix, S)r = 0}.

slide-29
SLIDE 29

Ext modules

reg(S/Ix) = max{−r − j : Extj

S(S/Ix, S)r = 0}.

Hi

I(S) = lim

− →

d

Exti

S(S/Id, S).

slide-30
SLIDE 30

Ext modules

reg(S/Ix) = max{−r − j : Extj

S(S/Ix, S)r = 0}.

Hi

Ip(S) = lim

− →

d

Exti

S(S/Id p , S)

slide-31
SLIDE 31

Ext modules

reg(S/Ix) = max{−r − j : Extj

S(S/Ix, S)r = 0}.

Hi

Ip(S) = lim

− →

d

Exti

S(S/Id p , S) = lim

− →

d

Exti

S(S/I(dp), S)

slide-32
SLIDE 32

Ext modules

reg(S/Ix) = max{−r − j : Extj

S(S/Ix, S)r = 0}.

Hi

Ip(S) = lim

− →

d

Exti

S(S/Id p , S) = lim

− →

d

Exti

S(S/I(dp), S)

Theorem (–, Weyman ’13)

Consider partitions x, y, where x is obtained by removing some of the columns at the end of y. The natural quotient map S/Iy ։ S/Ix induces injective maps Exti

S(S/Ix, S) ֒

− → Exti

S(S/Iy, S)

∀i.