• Aucun résultat trouvé

Geometry of Calogero-Moser spaces

N/A
N/A
Protected

Academic year: 2021

Partager "Geometry of Calogero-Moser spaces"

Copied!
91
0
0

Texte intégral

(1)

Geometry of Calogero-Moser spaces

C´edric Bonnaf´e

CNRS (UMR 5149) - Universit´e de Montpellier

Poitiers, November 2016

(2)

Set-up

(3)

Set-up

dimCV =n <∞

W <GLC(V), |W|<∞. Ref(W) ={s ∈W | codimCVs =1}

(4)

Set-up

dimCV =n <∞

W <GLC(V), |W|<∞. Ref(W) ={s ∈W | codimCVs =1}

Hypothesis. W =hRef(W)i

(5)

Set-up

dimCV =n <∞

W <GLC(V), |W|<∞. Ref(W) ={s ∈W | codimCVs =1}

Hypothesis. W =hRef(W)i (i.e. V/W ≃Cn)

(6)

Set-up

dimCV =n <∞

W <GLC(V), |W|<∞. Ref(W) ={s ∈W | codimCVs =1}

Hypothesis. W =hRef(W)i (i.e. V/W ≃Cn) C ={c :Ref(W)/∼ −→C}

We fix c ∈ C

(7)

Cherednik algebra at t = 0

(8)

Cherednik algebra at t = 0

Hc =C[V]⊗CW ⊗C[V] (as a vector space)

∀y ∈V, ∀x ∈V, [y,x] = X

s∈Ref(W)

cshy,s(x) −xis

(9)

Cherednik algebra at t = 0

Hc =C[V]⊗CW ⊗C[V] (as a vector space)

∀y ∈V, ∀x ∈V, [y,x] = X

s∈Ref(W)

cshy,s(x) −xis

(10)

Cherednik algebra at t = 0

Hc =C[V]⊗CW ⊗C[V] (as a vector space)

∀y ∈V, ∀x ∈V, [y,x] = X

s∈Ref(W)

cshy,s(x) −xis

Let

Zc =Z(Hc)

(11)

Cherednik algebra at t = 0

Hc =C[V]⊗CW ⊗C[V] (as a vector space)

∀y ∈V, ∀x ∈V, [y,x] = X

s∈Ref(W)

cshy,s(x) −xis

Let

Zc =Z(Hc)

Easy fact.

C[V]W,C[V]W ⊂Zc. Let

P =C[V]W ⊗C[V]W ⊂Zc

(12)

Definition

TheCalogero-Moser space associated with the datum (W,c) is the affine variety

Zc =Spec(Zc).

(13)

Definition

TheCalogero-Moser space associated with the datum (W,c) is the affine variety

Zc =Spec(Zc).

It is endowed with a morphism

ϕc :Zc −→Spec(P) =V/W ×V/W

(14)

Definition

TheCalogero-Moser space associated with the datum (W,c) is the affine variety

Zc =Spec(Zc).

It is endowed with a morphism

ϕc :Zc −→Spec(P) =V/W ×V/W ≃C2n.

(15)

Definition

TheCalogero-Moser space associated with the datum (W,c) is the affine variety

Zc =Spec(Zc).

It is endowed with a morphism

ϕc :Zc −→Spec(P) =V/W ×V/W ≃C2n.

Theorem (Etingof-Ginzburg, 2002)

Zc is an integrally closed domain, and is a free P-module of rank |W|.

(16)

Definition

TheCalogero-Moser space associated with the datum (W,c) is the affine variety

Zc =Spec(Zc).

It is endowed with a morphism

ϕc :Zc −→Spec(P) =V/W ×V/W ≃C2n.

Theorem (Etingof-Ginzburg, 2002)

Zc is an integrally closed domain, and is a free P-module of rank |W|.

Example (the case where c =0).

(17)

Definition

TheCalogero-Moser space associated with the datum (W,c) is the affine variety

Zc =Spec(Zc).

It is endowed with a morphism

ϕc :Zc −→Spec(P) =V/W ×V/W ≃C2n.

Theorem (Etingof-Ginzburg, 2002)

Zc is an integrally closed domain, and is a free P-module of rank |W|.

Example (the case where c =0). Then H0 =C[V ×V]⋊W,

(18)

Definition

TheCalogero-Moser space associated with the datum (W,c) is the affine variety

Zc =Spec(Zc).

It is endowed with a morphism

ϕc :Zc −→Spec(P) =V/W ×V/W ≃C2n.

Theorem (Etingof-Ginzburg, 2002)

Zc is an integrally closed domain, and is a free P-module of rank |W|.

Example (the case where c =0). Then H0 =C[V ×V]⋊W,

Z0 =C[V ×V]W,

(19)

Definition

TheCalogero-Moser space associated with the datum (W,c) is the affine variety

Zc =Spec(Zc).

It is endowed with a morphism

ϕc :Zc −→Spec(P) =V/W ×V/W ≃C2n.

Theorem (Etingof-Ginzburg, 2002)

Zc is an integrally closed domain, and is a free P-module of rank |W|.

Example (the case where c =0). Then H0 =C[V ×V]⋊W,

Z0 =C[V ×V]W, Z0 = (V ×V)/W.

(20)

Two extra-structures

(21)

Two extra-structures

There is a C×-action onHc (i.e. a Z-grading):

(22)

Two extra-structures

There is a C×-action onHc (i.e. a Z-grading):

deg(V) = −1

deg(V) =1

deg(W) =0

(23)

Two extra-structures

There is a C×-action onHc (i.e. a Z-grading):

deg(V) = −1

deg(V) =1

deg(W) =0

So there is a C×-action onZc and on Zc.

(24)

Two extra-structures

There is a C×-action onHc (i.e. a Z-grading):

deg(V) = −1

deg(V) =1

deg(W) =0

So there is a C×-action onZc and on Zc. Poisson bracket:

{,}: Zc×Zc −→ Zc

(z,z) 7−→ limt→0[z,z]Ht,c

t

(25)

GLn(Fq),q =p?,ℓ6=p.

(26)

GLn(Fq),q =p?,ℓ6=p.

Steinberg (1952), Lusztig (1976):

(27)

GLn(Fq),q =p?,ℓ6=p.

Steinberg (1952), Lusztig (1976):

{partitions of n}←→ {Unip. char. of GLn(Fq)}

(28)

GLn(Fq),q =p?,ℓ6=p.

Steinberg (1952), Lusztig (1976):

{partitions of n}←→ {Unip. char. of GLn(Fq)}

λ 7−→ ρλ

(29)

GLn(Fq),q =p?,ℓ6=p.

Steinberg (1952), Lusztig (1976):

{partitions of n}←→ {Unip. char. of GLn(Fq)}

λ 7−→ ρλ Hypothesis: order(q mod ℓ) =d

(30)

GLn(Fq),q =p?,ℓ6=p.

Steinberg (1952), Lusztig (1976):

{partitions of n}←→ {Unip. char. of GLn(Fq)}

λ 7−→ ρλ Hypothesis: order(q mod ℓ) =d Fact (Fong-Srinivasan, 1980’s):

(31)

GLn(Fq),q =p?,ℓ6=p.

Steinberg (1952), Lusztig (1976):

{partitions of n}←→ {Unip. char. of GLn(Fq)}

λ 7−→ ρλ

Hypothesis: order(q mod ℓ) =d Fact (Fong-Srinivasan, 1980’s):

ρλ and ρµ are in the same ℓ-block m

d(λ) =♥d(µ)

(32)

GLn(Fq),q =p?,ℓ6=p.

Steinberg (1952), Lusztig (1976):

{partitions of n}←→ {Unip. char. of GLn(Fq)}

λ 7−→ ρλ

Hypothesis: order(q mod ℓ) =d Fact (Fong-Srinivasan, 1980’s):

ρλ and ρµ are in the same ℓ-block m

d(λ) =♥d(µ)

Conjecture (Brou´e-Malle-Michel, 1993)

Ifγ is a d-core and n=|γ|+dr, then there exists a Deligne-Lusztig varietyXγ(r) for G such that:

ρλ |Hc(X(r),Q)⇐⇒♥d(λ) =γ.

EndQ

GLn(Fq) Hc(Xγ(r))

≃Heckeparams(G(d,1,r))

(33)

GLn(Fq),q =p?,ℓ6=p.

Steinberg (1952), Lusztig (1976):

{partitions of n}←→ {Unip. char. of GLn(Fq)}

λ 7−→ ρλ

Hypothesis: order(q mod ℓ) =d Fact (Fong-Srinivasan, 1980’s):

ρλ and ρµ are in the same ℓ-block m

d(λ) =♥d(µ)

Conjecture (Brou´e-Malle-Michel, 1993)

Ifγ is a d-core and n=|γ|+dr, then there exists a Deligne-Lusztig varietyXγ(r) for G such that:

ρλ |Hc(X(r),Q)⇐⇒♥d(λ) =γ.

EndQ

GLn(Fq) Hc(Xγ(r))

≃Heckeparams(G(d,1,r))

(34)

Z1(Sn), smooth, C×-action, ζ ∈C× Steinberg (1952), Lusztig (1976):

{partitions of n}←→ {Unip. char. of GLn(Fq)}

λ 7−→ ρλ

Hypothesis: order(q mod ℓ) =d Fact (Fong-Srinivasan, 1980’s):

ρλ and ρµ are in the same ℓ-block m

d(λ) =♥d(µ)

Conjecture (Brou´e-Malle-Michel, 1993)

Ifγ is a d-core and n=|γ|+dr, then there exists a Deligne-Lusztig varietyXγ(r) for G such that:

ρλ |Hc(X(r),Q)⇐⇒♥d(λ) =γ.

EndQ

GLn(Fq) Hc(Xγ(r))

≃Heckeparams(G(d,1,r))

(35)

Z1(Sn), smooth, C×-action, ζ ∈C× Gordon (2003):

{partitions of n}←→ {Unip. char. of GLn(Fq)}

λ 7−→ ρλ

Hypothesis: order(q mod ℓ) =d Fact (Fong-Srinivasan, 1980’s):

ρλ and ρµ are in the same ℓ-block m

d(λ) =♥d(µ)

Conjecture (Brou´e-Malle-Michel, 1993)

Ifγ is a d-core and n=|γ|+dr, then there exists a Deligne-Lusztig varietyXγ(r) for G such that:

ρλ |Hc(X(r),Q)⇐⇒♥d(λ) =γ.

EndQ

GLn(Fq) Hc(Xγ(r))

≃Heckeparams(G(d,1,r))

(36)

Z1(Sn), smooth, C×-action, ζ ∈C× Gordon (2003):

{partitions of n}←→ Z1(Sn)C× λ 7−→ ρλ

Hypothesis: order(q mod ℓ) =d Fact (Fong-Srinivasan, 1980’s):

ρλ and ρµ are in the same ℓ-block m

d(λ) =♥d(µ)

Conjecture (Brou´e-Malle-Michel, 1993)

Ifγ is a d-core and n=|γ|+dr, then there exists a Deligne-Lusztig varietyXγ(r) for G such that:

ρλ |Hc(X(r),Q)⇐⇒♥d(λ) =γ. EndQ

GLn(Fq) Hc(Xγ(r))

≃Heckeparams(G(d,1,r))

(37)

Z1(Sn), smooth, C×-action, ζ ∈C× Gordon (2003):

{partitions of n}←→ Z1(Sn)C× λ 7−→ zλ

Hypothesis: order(q mod ℓ) =d Fact (Fong-Srinivasan, 1980’s):

ρλ and ρµ are in the same ℓ-block m

d(λ) =♥d(µ)

Conjecture (Brou´e-Malle-Michel, 1993)

Ifγ is a d-core and n=|γ|+dr, then there exists a Deligne-Lusztig varietyXγ(r) for G such that:

ρλ |Hc(X(r),Q)⇐⇒♥d(λ) =γ. EndQ

GLn(Fq) Hc(Xγ(r))

≃Heckeparams(G(d,1,r))

(38)

Z1(Sn), smooth, C×-action, ζ ∈C× Gordon (2003):

{partitions of n}←→ Z1(Sn)C× λ 7−→ zλ

Hypothesis: order(ζ) =d Fact (Fong-Srinivasan, 1980’s):

ρλ and ρµ are in the same ℓ-block m

d(λ) =♥d(µ)

Conjecture (Brou´e-Malle-Michel, 1993)

Ifγ is a d-core and n=|γ|+dr, then there exists a Deligne-Lusztig varietyXγ(r) for G such that:

ρλ |Hc(X(r),Q)⇐⇒♥d(λ) =γ. EndQ

GLn(Fq) Hc(Xγ(r))

≃Heckeparams(G(d,1,r))

(39)

Z1(Sn), smooth, C×-action, ζ ∈C× Gordon (2003):

{partitions of n}←→ Z1(Sn)C× λ 7−→ zλ

Hypothesis: order(ζ) =d Fact (Haiman, 2000):

ρλ and ρµ are in the same ℓ-block m

d(λ) =♥d(µ)

Conjecture (Brou´e-Malle-Michel, 1993)

Ifγ is a d-core and n=|γ|+dr, then there exists a Deligne-Lusztig varietyXγ(r) for G such that:

ρλ |Hc(X(r),Q)⇐⇒♥d(λ) =γ. EndQ

GLn(Fq) Hc(Xγ(r))

≃Heckeparams(G(d,1,r))

(40)

Z1(Sn), smooth, C×-action, ζ ∈C× Gordon (2003):

{partitions of n}←→ Z1(Sn)C× λ 7−→ zλ

Hypothesis: order(ζ) =d Fact (Haiman, 2000):

zλ and zµ are in the same irr. comp. of Z1(Sn)ζ m

d(λ) =♥d(µ)

Conjecture (Brou´e-Malle-Michel, 1993)

Ifγ is a d-core and n=|γ|+dr, then there exists a Deligne-Lusztig varietyXγ(r) for G such that:

ρλ |Hc(X(r),Q)⇐⇒♥d(λ) =γ. EndQ

GLn(Fq) Hc(Xγ(r))

≃Heckeparams(G(d,1,r))

(41)

Z1(Sn), smooth, C×-action, ζ ∈C× Gordon (2003):

{partitions of n}←→ Z1(Sn)C× λ 7−→ zλ

Hypothesis: order(ζ) =d Fact (Haiman, 2000):

zλ and zµ are in the same irr. comp. of Z1(Sn)ζ m

d(λ) =♥d(µ)

Theorem (Haiman, ∼ 2000)

Ifγ is a d-core and n=|γ|+dr, then there exists an irreducible componentZ1(Sn)ζγ of Z1(Sn)ζ such that:

zλ ∈Z1(Sn)ζγ ⇐⇒♥d(λ) =γ.

Z1(Sn)ζγ is diffeo. (conj. isom.) to Zparams(G(d,1,r)).

(42)

Symplectic singularities

(43)

Symplectic singularities

Theorem (Brown-Gordon, 2003)

(a) The symplectic leaves are obtained as follows

(44)

Symplectic singularities

Theorem (Brown-Gordon, 2003)

(a) The symplectic leaves are obtained as follows

(Zc)smooth is a symplectic leaf;

(45)

Symplectic singularities

Theorem (Brown-Gordon, 2003)

(a) The symplectic leaves are obtained as follows

(Zc)smooth is a symplectic leaf;

((Zc)sing)

(46)

Symplectic singularities

Theorem (Brown-Gordon, 2003)

(a) The symplectic leaves are obtained as follows

(Zc)smooth is a symplectic leaf;

((Zc)sing)smooth

(47)

Symplectic singularities

Theorem (Brown-Gordon, 2003)

(a) The symplectic leaves are obtained as follows

(Zc)smooth is a symplectic leaf;

((Zc)sing)smooth is a symplectic leaf;

(48)

Symplectic singularities

Theorem (Brown-Gordon, 2003)

(a) The symplectic leaves are obtained as follows

(Zc)smooth is a symplectic leaf;

((Zc)sing)smooth is a symplectic leaf;

(((Zc)sing)sing)smooth is a symplectic leaf;

. . .

(49)

Symplectic singularities

Theorem (Brown-Gordon, 2003)

(a) The symplectic leaves are obtained as follows

(Zc)smooth is a symplectic leaf;

((Zc)sing)smooth is a symplectic leaf;

(((Zc)sing)sing)smooth is a symplectic leaf;

. . .

(b) Zc is a symplectic singularity (as defined by Beauville).

(50)

Symplectic resolutions

(51)

Symplectic resolutions

Theorem (Ginzburg-Kaledin 2004, Namikawa 2007)

Z0 = (V ×V)/W admits a symplectic resolution if and only if there exists c ∈C such thatZc is smooth.

(52)

Symplectic resolutions

Theorem (Ginzburg-Kaledin 2004, Namikawa 2007)

Z0 = (V ×V)/W admits a symplectic resolution if and only if there exists c ∈C such thatZc is smooth.

Theorem (Brown-Gordon, 2003)

Zc is smooth if and only if all the simple Hc-modules have dimension |W|.

(53)

Symplectic resolutions

Theorem (Ginzburg-Kaledin 2004, Namikawa 2007)

Z0 = (V ×V)/W admits a symplectic resolution if and only if there exists c ∈C such thatZc is smooth.

Theorem (Brown-Gordon, 2003)

Zc is smooth if and only if all the simple Hc-modules have dimension |W|.

Corollary (G.-K., B.-G., Bellamy 2008)

Assume that W is irreducible.

ThenZ0 = (V ×V)/W admits a symplectic resolution if and only if W =G(d,1,n) = Sn⋉(µd)n ⊂GLn(C) or W =G4 ⊂GL2(C).

(54)

Cohomology

(55)

Cohomology

Theorem (Ginzburg-Kaledin, 2004)

Assume thatZ˜0 →Z0 is a symplectic resolution.

(56)

Cohomology

Theorem (Ginzburg-Kaledin, 2004)

Assume thatZ˜0 →Z0 is a symplectic resolution.

(1) H2i+1(Z˜0,C) =0

(57)

Cohomology

Theorem (Ginzburg-Kaledin, 2004)

Assume thatZ˜0 →Z0 is a symplectic resolution.

(1) H2i+1(Z˜0) = 0;

(58)

Cohomology

Theorem (Ginzburg-Kaledin, 2004)

Assume thatZ˜0 →Z0 is a symplectic resolution.

(1) H2i+1(Z˜0) = 0;

(2) H2(Z˜0)≃grF(Z(CW)).

(59)

Cohomology

Theorem (Ginzburg-Kaledin, 2004)

Assume thatZ˜0 →Z0 is a symplectic resolution.

(1) H2i+1(Z˜0) = 0;

(2) H2(Z˜0)≃grF(Z(CW)).

Conjecture EC (Ginzburg-Kaledin, 2004)

Assume thatZ˜0 →Z0 is a symplectic resolution.

(60)

Cohomology

Theorem (Ginzburg-Kaledin, 2004)

Assume thatZ˜0 →Z0 is a symplectic resolution.

(1) H2i+1(Z˜0) = 0;

(2) H2(Z˜0)≃grF(Z(CW)).

Conjecture EC (Ginzburg-Kaledin, 2004)

Assume thatZ˜0 →Z0 is a symplectic resolution.

(EC1) HC2i+1× (Z˜0) =0;

(61)

Cohomology

Theorem (Ginzburg-Kaledin, 2004)

Assume thatZ˜0 →Z0 is a symplectic resolution.

(1) H2i+1(Z˜0) = 0;

(2) H2(Z˜0)≃grF(Z(CW)).

Conjecture EC (Ginzburg-Kaledin, 2004)

Assume thatZ˜0 →Z0 is a symplectic resolution.

(EC1) HC2i+1× (Z˜0) =0;

(EC2) HC2×(Z˜0)≃ReesF(Z(CW)).

(62)

Cohomology

Theorem (Ginzburg-Kaledin, 2004)

Assume thatZ˜0 →Z0 is a symplectic resolution.

(1) H2i+1(Z˜0) = 0;

(2) H2(Z˜0)≃grF(Z(CW)).

Conjecture EC (Ginzburg-Kaledin, 2004)

Assume thatZ˜0 →Z0 is a symplectic resolution.

(EC1) HC2i+1× (Z˜0) =0;

(EC2) HC2×(Z˜0)≃ReesF(Z(CW)).

(63)

Theorem (Vasserot, 2001)

(EC) holds if W = Sn (Z˜0 =Hilbn(C2)).

(64)

Theorem (Vasserot, 2001)

(EC) holds if W = Sn (Z˜0 =Hilbn(C2)).

Other cases. W =W(B2) or G4 (Shan-B. 2016).

(65)

Theorem (Vasserot, 2001)

(EC) holds if W = Sn (Z˜0 =Hilbn(C2)).

Other cases. W =W(B2) or G4 (Shan-B. 2016).

Question. What about the general case?

(66)

Cohomology

Theorem (Ginzburg-Kaledin, 2004)

Assume thatZ˜0 →Z0 is a symplectic resolution.

(1) H2i+1(Z˜0) = 0;

(2) H2(Z˜0)≃grF(Z(CW)).

Conjecture EC (Ginzburg-Kaledin, 2004)

Assume thatZ˜0 →Z0 is a symplectic resolution.

(EC1) HC2i+1× (Z˜0) =0;

(EC2) HC2×(Z˜0)≃ReesF(Z(CW)).

(67)

Cohomology (smooth case)

Theorem (Ginzburg-Kaledin, 2004)

Assume thatZc is smooth.

(1) H2i+1(Zc) =0;

(2) H2(Zc)≃grF(Z(CW)).

Conjecture EC (Ginzburg-Kaledin, 2004)

Assume thatZc is smooth.

(EC1) HC2i+1× (Zc) =0;

(EC2) HC2×(Zc)≃ReesF(Z(CW)).

(68)

Cohomology (general case)

Conjecture C (Rouquier-B.)

(C1) H2i+1(Zc) =0;

(C2) H2(Zc)≃grF(ImΩc).

Conjecture EC (Rouquier-B.)

(EC1) HC2i+1× (Zc) =0;

(EC2) HC2×(Zc)≃ReesF(ImΩc).

(69)

Cohomology (general case)

Conjecture C (Rouquier-B.)

(C1) H2i+1(Zc) =0;

(C2) H2(Zc)≃grF(ImΩc).

Conjecture EC (Rouquier-B.)

(EC1) HC2i+1× (Zc) =0;

(EC2) HC2×(Zc)≃ReesF(ImΩc).

Example (B.). (C) and (EC) are true if dimC(V) =1.

(70)

Example of a symplectic singularity

(71)

Example of a symplectic singularity

W =W(B2) =hs,t|s2 =t2 = (st)4 =1i

(72)

Example of a symplectic singularity

W =W(B2) =hs,t|s2 =t2 = (st)4 =1i Leta =cs and b=ct.

(73)

Example of a symplectic singularity

W =W(B2) =hs,t|s2 =t2 = (st)4 =1i Leta =cs and b=ct.

Minimal presentation ofZc: 8 generators, 9 equations

(74)

Example of a symplectic singularity

W =W(B2) =hs,t|s2 =t2 = (st)4 =1i Leta =cs and b=ct.

Minimal presentation ofZc: 8 generators, 9 equations Zc ֒−→C8, dimZc =4

(75)

Example of a symplectic singularity

W =W(B2) =hs,t|s2 =t2 = (st)4 =1i Leta =cs and b=ct.

Minimal presentation ofZc: 8 generators, 9 equations Zc ֒−→C8, dimZc =4

Easy fact: Zc is smooth if and only ifab(a2−b2)6=0.

(76)

Example of a symplectic singularity

W =W(B2) =hs,t|s2 =t2 = (st)4 =1i Leta =cs and b=ct.

Minimal presentation ofZc: 8 generators, 9 equations Zc ֒−→C8, dimZc =4

Easy fact: Zc is smooth if and only ifab(a2−b2)6=0.

The interesting case: assume from now on that a=b6=0.

(77)

Example of a symplectic singularity

W =W(B2) =hs,t|s2 =t2 = (st)4 =1i Leta =cs and b=ct.

Minimal presentation ofZc: 8 generators, 9 equations Zc ֒−→C8, dimZc =4

Easy fact: Zc is smooth if and only ifab(a2−b2)6=0.

The interesting case: assume from now on that a=b6=0.

⇒Zc has only one singular point, named 0

(78)

Example of a symplectic singularity

W =W(B2) =hs,t|s2 =t2 = (st)4 =1i Leta =cs and b=ct.

Minimal presentation ofZc: 8 generators, 9 equations Zc ֒−→C8, dimZc =4

Easy fact: Zc is smooth if and only ifab(a2−b2)6=0.

The interesting case: assume from now on that a=b6=0.

⇒Zc has only one singular point, named 0 Easy fact: dimCT0(Zc) =8.

(79)

Example of a symplectic singularity

W =W(B2) =hs,t|s2 =t2 = (st)4 =1i Leta =cs and b=ct.

Minimal presentation ofZc: 8 generators, 9 equations Zc ֒−→C8, dimZc =4

Easy fact: Zc is smooth if and only ifab(a2−b2)6=0.

The interesting case: assume from now on that a=b6=0.

⇒Zc has only one singular point, named 0 Easy fact: dimCT0(Zc) =8.

Letm0 denote the maximal ideal of Zc corresponding to 0.

(80)

Example of a symplectic singularity

W =W(B2) =hs,t|s2 =t2 = (st)4 =1i Leta =cs and b=ct.

Minimal presentation ofZc: 8 generators, 9 equations Zc ֒−→C8, dimZc =4

Easy fact: Zc is smooth if and only ifab(a2−b2)6=0.

The interesting case: assume from now on that a=b6=0.

⇒Zc has only one singular point, named 0 Easy fact: dimCT0(Zc) =8.

Letm0 denote the maximal ideal of Zc corresponding to 0. Then {m0,m0}⊂m0 because{0}is a symplectic leaf.

(81)

Example of a symplectic singularity

W =W(B2) =hs,t|s2 =t2 = (st)4 =1i Leta =cs and b=ct.

Minimal presentation ofZc: 8 generators, 9 equations Zc ֒−→C8, dimZc =4

Easy fact: Zc is smooth if and only ifab(a2−b2)6=0.

The interesting case: assume from now on that a=b6=0.

⇒Zc has only one singular point, named 0 Easy fact: dimCT0(Zc) =8.

Letm0 denote the maximal ideal of Zc corresponding to 0. Then {m0,m0}⊂m0 because{0}is a symplectic leaf.

⇒T0(Zc) = m0/m20 inherits from {,} a structure of Lie algebra!

(82)

Example (continued)

(83)

Example (continued)

W =W(B2) =hs,t|s2 =t2 = (st)4 =1i a=cs =ct,

Zc ֒−→C8 =T0(Zc)

⇒T0(Zc) is a Lie algebra for {,}

(84)

Example (continued)

W =W(B2) =hs,t|s2 =t2 = (st)4 =1i a=cs =ct,

Zc ֒−→C8 =T0(Zc)

⇒T0(Zc) is a Lie algebra for {,}

Computation (thanks toMAGMA): T0(Zc) ≃sl3(C) (!)

(85)

Example (continued)

W =W(B2) =hs,t|s2 =t2 = (st)4 =1i a=cs =ct,

Zc ֒−→C8 =T0(Zc)

⇒T0(Zc) is a Lie algebra for {,}

Computation (thanks toMAGMA): T0(Zc) ≃sl3(C) (!) So Zc ֒−→sl3(C) ≃sl3(C) (trace form).

(86)

Example (continued)

W =W(B2) =hs,t|s2 =t2 = (st)4 =1i a=cs =ct,

Zc ֒−→C8 =T0(Zc)

⇒T0(Zc) is a Lie algebra for {,}

Computation (thanks toMAGMA): T0(Zc) ≃sl3(C) (!) So Zc ֒−→sl3(C) ≃sl3(C) (trace form).

Computation (MAGMA):

TC0(Zc) ={M ∈sl3(C) | M2 =0}

(87)

Example (continued)

W =W(B2) =hs,t|s2 =t2 = (st)4 =1i a=cs =ct,

Zc ֒−→C8 =T0(Zc)

⇒T0(Zc) is a Lie algebra for {,}

Computation (thanks toMAGMA): T0(Zc) ≃sl3(C) (!) So Zc ֒−→sl3(C) ≃sl3(C) (trace form).

Computation (MAGMA):

TC0(Zc) ={M ∈sl3(C) | M2 =0}=Omin.

(88)

Example (continued)

W =W(B2) =hs,t|s2 =t2 = (st)4 =1i a=cs =ct,

Zc ֒−→C8 =T0(Zc)

⇒T0(Zc) is a Lie algebra for {,}

Computation (thanks toMAGMA): T0(Zc) ≃sl3(C) (!) So Zc ֒−→sl3(C) ≃sl3(C) (trace form).

Computation (MAGMA):

TC0(Zc) ={M ∈sl3(C) | M2 =0}=Omin. So PTC0(Zc) =Omin/C× is smooth

(89)

Example (continued)

W =W(B2) =hs,t|s2 =t2 = (st)4 =1i a=cs =ct,

Zc ֒−→C8 =T0(Zc)

⇒T0(Zc) is a Lie algebra for {,}

Computation (thanks toMAGMA): T0(Zc) ≃sl3(C) (!) So Zc ֒−→sl3(C) ≃sl3(C) (trace form).

Computation (MAGMA):

TC0(Zc) ={M ∈sl3(C) | M2 =0}=Omin.

So PTC0(Zc) =Omin/C× is smooth so Beauville classification theorem applies:

(90)

Example (continued)

W =W(B2) =hs,t|s2 =t2 = (st)4 =1i a=cs =ct,

Zc ֒−→C8 =T0(Zc)

⇒T0(Zc) is a Lie algebra for {,}

Computation (thanks toMAGMA): T0(Zc) ≃sl3(C) (!) So Zc ֒−→sl3(C) ≃sl3(C) (trace form).

Computation (MAGMA):

TC0(Zc) ={M ∈sl3(C) | M2 =0}=Omin.

So PTC0(Zc) =Omin/C× is smooth so Beauville classification theorem applies:

Conclusion (Juteau-B.)

The symplectic singularities(Zc,0)and (Omin,0)are equivalent.

(91)

Example (continued)

W =W(B2) =hs,t|s2 =t2 = (st)4 =1i a=cs =ct,

Zc ֒−→C8 =T0(Zc)

⇒T0(Zc) is a Lie algebra for {,}

Computation (thanks toMAGMA): T0(Zc) ≃sl3(C) (!) So Zc ֒−→sl3(C) ≃sl3(C) (trace form).

Computation (MAGMA):

TC0(Zc) ={M ∈sl3(C) | M2 =0}=Omin.

So PTC0(Zc) =Omin/C× is smooth so Beauville classification theorem applies:

Conclusion (Juteau-B.)

The symplectic singularities(Zc,0)and (Omin,0)are equivalent. In particular,Zc is not rationally smooth.

Références

Documents relatifs

This allows us to exhibit a coarse invariant for Banach spaces, namely the non equi-coarse embeddability of this family of graphs, which is very close to but different from

For a deviation parameter s = 0 (Bragg condition) and s &lt; 0, the theoretical BSE curves show hollows and peaks of intensity corresponding to the black and white dislocation

The estimation process is composed of several steps: first, a preliminary estimation of the sideslip angles relying on the extended kinematic model (slow-varying es- timation), then

Mots clés: Mangue (Mangifera indica L.), arôme, composés volatils, glycosides, précurseurs d'arôme, traitement thermique, traitement

La ramification de ce revêtement donne lieu à des partitions du groupe de réflexion dont nous conjecturons qu’elles coïncident avec les cellules de Kazhdan-Lusztig, dans le cas

+ The combinatoric fits with observations made in the representation theory of finite reductive groups. ◮ Lusztig families of

The SIVIA algorithm, based on interval computation, provides a systematic, efficient, and general solution to the estimation problem when a model is available to compute