Geometry of Calogero-Moser spaces
C´edric Bonnaf´e
CNRS (UMR 5149) - Universit´e de Montpellier
Poitiers, November 2016
Set-up
Set-up
dimCV =n <∞
W <GLC(V), |W|<∞. Ref(W) ={s ∈W | codimCVs =1}
Set-up
dimCV =n <∞
W <GLC(V), |W|<∞. Ref(W) ={s ∈W | codimCVs =1}
Hypothesis. W =hRef(W)i
Set-up
dimCV =n <∞
W <GLC(V), |W|<∞. Ref(W) ={s ∈W | codimCVs =1}
Hypothesis. W =hRef(W)i (i.e. V/W ≃Cn)
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
Cherednik algebra at t = 0
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
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
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)
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
Definition
TheCalogero-Moser space associated with the datum (W,c) is the affine variety
Zc =Spec(Zc).
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
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.
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|.
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).
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,
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,
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.
Two extra-structures
Two extra-structures
There is a C×-action onHc (i.e. a Z-grading):
Two extra-structures
There is a C×-action onHc (i.e. a Z-grading):
◮ deg(V) = −1
◮ deg(V∗) =1
◮ deg(W) =0
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.
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
GLn(Fq),q =p?,ℓ6=p.
GLn(Fq),q =p?,ℓ6=p.
Steinberg (1952), Lusztig (1976):
GLn(Fq),q =p?,ℓ6=p.
Steinberg (1952), Lusztig (1976):
{partitions of n}←→∼ {Unip. char. of GLn(Fq)}
GLn(Fq),q =p?,ℓ6=p.
Steinberg (1952), Lusztig (1976):
{partitions of n}←→∼ {Unip. char. of GLn(Fq)}
λ 7−→ ρλ
GLn(Fq),q =p?,ℓ6=p.
Steinberg (1952), Lusztig (1976):
{partitions of n}←→∼ {Unip. char. of GLn(Fq)}
λ 7−→ ρλ Hypothesis: order(q mod ℓ) =d
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):
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(µ)
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))
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))
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))
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))
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))
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))
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))
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))
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))
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)).
Symplectic singularities
Symplectic singularities
Theorem (Brown-Gordon, 2003)
(a) The symplectic leaves are obtained as follows
Symplectic singularities
Theorem (Brown-Gordon, 2003)
(a) The symplectic leaves are obtained as follows
◮ (Zc)smooth is a symplectic leaf;
Symplectic singularities
Theorem (Brown-Gordon, 2003)
(a) The symplectic leaves are obtained as follows
◮ (Zc)smooth is a symplectic leaf;
◮ ((Zc)sing)
Symplectic singularities
Theorem (Brown-Gordon, 2003)
(a) The symplectic leaves are obtained as follows
◮ (Zc)smooth is a symplectic leaf;
◮ ((Zc)sing)smooth
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;
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;
◮ . . .
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).
Symplectic resolutions
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.
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|.
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).
Cohomology
Cohomology
Theorem (Ginzburg-Kaledin, 2004)
Assume thatZ˜0 →Z0 is a symplectic resolution.
Cohomology
Theorem (Ginzburg-Kaledin, 2004)
Assume thatZ˜0 →Z0 is a symplectic resolution.
(1) H2i+1(Z˜0,C) =0
Cohomology
Theorem (Ginzburg-Kaledin, 2004)
Assume thatZ˜0 →Z0 is a symplectic resolution.
(1) H2i+1(Z˜0) = 0;
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)).
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.
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;
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)).
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)).
Theorem (Vasserot, 2001)
(EC) holds if W = Sn (Z˜0 =Hilbn(C2)).
Theorem (Vasserot, 2001)
(EC) holds if W = Sn (Z˜0 =Hilbn(C2)).
Other cases. W =W(B2) or G4 (Shan-B. 2016).
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?
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)).
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)).
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).
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.
Example of a symplectic singularity
Example of a symplectic singularity
W =W(B2) =hs,t|s2 =t2 = (st)4 =1i
Example of a symplectic singularity
W =W(B2) =hs,t|s2 =t2 = (st)4 =1i Leta =cs and b=ct.
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
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
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.
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.
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
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.
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.
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.
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!
Example (continued)
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 {,}
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) (!)
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).
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}
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.
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
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:
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.
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.