• Aucun résultat trouvé

Introduction to Deligne-Lusztig Theory

N/A
N/A
Protected

Academic year: 2021

Partager "Introduction to Deligne-Lusztig Theory"

Copied!
55
0
0

Texte intégral

(1)

Introduction to Deligne-Lusztig Theory

C´edric Bonnaf´e

CNRS (UMR 6623) - Universit´e de Franche-Comt´e (Besan¸con)

Berkeley (MSRI), Feb. 2008

(2)

Eigenvalues of F

F(Hc1(Y)θ) =Hc1(Y)θ−1

F stabilizes Hc1(Y)1 and Hc1(Y)θ0

By Schur’s lemma, only one eigenvalue on Hc1(Y)1: ρ1 ?

I LetX=Y/µq+1 =P1\P1(Fq)

I Hc1(X) =Hc1(Y)1

I 0=|XF| |{z}=

Lefschetz

q−Tr(F,Hc1(Y)1

| {z }

dim. q

).

⇒ ρ1=1.

By Schur’s lemma, two eigenvalues onHc1(Y)θ0: ρ+, ρ with multiplicities(q−1)/2

I 0=|YF|=q−Tr(F,Hc1(Y)) = q−Tr(F,Hc1(Y)1) −Tr(F,Hc1(Y)θ0)

⇒ ρ+= −ρ.

(3)

Eigenvalues of F

F(Hc1(Y)θ) =Hc1(Y)θ−1

F stabilizes Hc1(Y)1 and Hc1(Y)θ0

By Schur’s lemma, only one eigenvalue on Hc1(Y)1: ρ1 ?

I LetX=Y/µq+1 =P1\P1(Fq)

I Hc1(X) =Hc1(Y)1

I 0=|XF| |{z}=

Lefschetz

q−Tr(F,Hc1(Y)1

| {z }

dim. q

).

⇒ ρ1=1.

By Schur’s lemma, two eigenvalues onHc1(Y)θ0: ρ+, ρ with multiplicities(q−1)/2

I 0=|YF|=q−Tr(F,Hc1(Y)) = q−Tr(F,Hc1(Y)1) −Tr(F,Hc1(Y)θ0)

⇒ ρ+= −ρ.

(4)

Eigenvalues of F

F(Hc1(Y)θ) =Hc1(Y)θ−1

F stabilizes Hc1(Y)1 and Hc1(Y)θ0

By Schur’s lemma, only one eigenvalue on Hc1(Y)1: ρ1 ?

I LetX=Y/µq+1 =P1\P1(Fq)

I Hc1(X) =Hc1(Y)1

I 0=|XF| |{z}=

Lefschetz

q−Tr(F,Hc1(Y)1

| {z }

dim. q

).

⇒ ρ1=1.

By Schur’s lemma, two eigenvalues onHc1(Y)θ0: ρ+, ρ with multiplicities(q−1)/2

I 0=|YF|=q−Tr(F,Hc1(Y)) = q−Tr(F,Hc1(Y)1) −Tr(F,Hc1(Y)θ0)

⇒ ρ+= −ρ.

(5)

Eigenvalues of F

F(Hc1(Y)θ) =Hc1(Y)θ−1

F stabilizes Hc1(Y)1 and Hc1(Y)θ0

By Schur’s lemma, only one eigenvalue on Hc1(Y)1: ρ1

?

I LetX=Y/µq+1 =P1\P1(Fq)

I Hc1(X) =Hc1(Y)1

I 0=|XF| |{z}=

Lefschetz

q−Tr(F,Hc1(Y)1

| {z }

dim. q

).

⇒ ρ1=1.

By Schur’s lemma, two eigenvalues onHc1(Y)θ0: ρ+, ρ with multiplicities(q−1)/2

I 0=|YF|=q−Tr(F,Hc1(Y)) = q−Tr(F,Hc1(Y)1) −Tr(F,Hc1(Y)θ0)

⇒ ρ+= −ρ.

(6)

Eigenvalues of F

F(Hc1(Y)θ) =Hc1(Y)θ−1

F stabilizes Hc1(Y)1 and Hc1(Y)θ0

By Schur’s lemma, only one eigenvalue on Hc1(Y)1: ρ1 ?

I LetX=Y/µq+1

=P1\P1(Fq)

I Hc1(X) =Hc1(Y)1

I 0=|XF| |{z}=

Lefschetz

q−Tr(F,Hc1(Y)1

| {z }

dim. q

).

⇒ ρ1=1.

By Schur’s lemma, two eigenvalues onHc1(Y)θ0: ρ+, ρ with multiplicities(q−1)/2

I 0=|YF|=q−Tr(F,Hc1(Y)) = q−Tr(F,Hc1(Y)1) −Tr(F,Hc1(Y)θ0)

⇒ ρ+= −ρ.

(7)

Eigenvalues of F

F(Hc1(Y)θ) =Hc1(Y)θ−1

F stabilizes Hc1(Y)1 and Hc1(Y)θ0

By Schur’s lemma, only one eigenvalue on Hc1(Y)1: ρ1 ?

I LetX=Y/µq+1 =P1\P1(Fq)

I Hc1(X) =Hc1(Y)1

I 0=|XF| |{z}=

Lefschetz

q−Tr(F,Hc1(Y)1

| {z }

dim. q

).

⇒ ρ1=1.

By Schur’s lemma, two eigenvalues onHc1(Y)θ0: ρ+, ρ with multiplicities(q−1)/2

I 0=|YF|=q−Tr(F,Hc1(Y)) = q−Tr(F,Hc1(Y)1) −Tr(F,Hc1(Y)θ0)

⇒ ρ+= −ρ.

(8)

Eigenvalues of F

F(Hc1(Y)θ) =Hc1(Y)θ−1

F stabilizes Hc1(Y)1 and Hc1(Y)θ0

By Schur’s lemma, only one eigenvalue on Hc1(Y)1: ρ1 ?

I LetX=Y/µq+1 =P1\P1(Fq)

I Hc1(X) =Hc1(Y)1

I 0=|XF| |{z}=

Lefschetz

q−Tr(F,Hc1(Y)1

| {z }

dim. q

).

⇒ ρ1=1.

By Schur’s lemma, two eigenvalues onHc1(Y)θ0: ρ+, ρ with multiplicities(q−1)/2

I 0=|YF|=q−Tr(F,Hc1(Y)) = q−Tr(F,Hc1(Y)1) −Tr(F,Hc1(Y)θ0)

⇒ ρ+= −ρ.

(9)

Eigenvalues of F

F(Hc1(Y)θ) =Hc1(Y)θ−1

F stabilizes Hc1(Y)1 and Hc1(Y)θ0

By Schur’s lemma, only one eigenvalue on Hc1(Y)1: ρ1 ?

I LetX=Y/µq+1 =P1\P1(Fq)

I Hc1(X) =Hc1(Y)1

I 0=|XF|

|{z}=

Lefschetz

q−Tr(F,Hc1(Y)1

| {z }

dim. q

).

⇒ ρ1=1.

By Schur’s lemma, two eigenvalues onHc1(Y)θ0: ρ+, ρ with multiplicities(q−1)/2

I 0=|YF|=q−Tr(F,Hc1(Y)) = q−Tr(F,Hc1(Y)1) −Tr(F,Hc1(Y)θ0)

⇒ ρ+= −ρ.

(10)

Eigenvalues of F

F(Hc1(Y)θ) =Hc1(Y)θ−1

F stabilizes Hc1(Y)1 and Hc1(Y)θ0

By Schur’s lemma, only one eigenvalue on Hc1(Y)1: ρ1 ?

I LetX=Y/µq+1 =P1\P1(Fq)

I Hc1(X) =Hc1(Y)1

I 0=|XF| |{z}=

Lefschetz

q−Tr(F,Hc1(Y)1

| {z }

dim. q

).

⇒ ρ1=1.

By Schur’s lemma, two eigenvalues onHc1(Y)θ0: ρ+, ρ with multiplicities(q−1)/2

I 0=|YF|=q−Tr(F,Hc1(Y)) = q−Tr(F,Hc1(Y)1) −Tr(F,Hc1(Y)θ0)

⇒ ρ+= −ρ.

(11)

Eigenvalues of F

F(Hc1(Y)θ) =Hc1(Y)θ−1

F stabilizes Hc1(Y)1 and Hc1(Y)θ0

By Schur’s lemma, only one eigenvalue on Hc1(Y)1: ρ1 ?

I LetX=Y/µq+1 =P1\P1(Fq)

I Hc1(X) =Hc1(Y)1

I 0=|XF| |{z}=

Lefschetz

q−Tr(F,Hc1(Y)1

| {z }

dim. q

).

⇒ ρ1=1.

By Schur’s lemma, two eigenvalues onHc1(Y)θ0: ρ+, ρ with multiplicities(q−1)/2

I 0=|YF|=q−Tr(F,Hc1(Y)) = q−Tr(F,Hc1(Y)1) −Tr(F,Hc1(Y)θ0)

⇒ ρ+= −ρ.

(12)

Eigenvalues of F

F(Hc1(Y)θ) =Hc1(Y)θ−1

F stabilizes Hc1(Y)1 and Hc1(Y)θ0

By Schur’s lemma, only one eigenvalue on Hc1(Y)1: ρ1 ?

I LetX=Y/µq+1 =P1\P1(Fq)

I Hc1(X) =Hc1(Y)1

I 0=|XF| |{z}=

Lefschetz

q−Tr(F,Hc1(Y)1

| {z }

dim. q

).

⇒ ρ1=1.

By Schur’s lemma, two eigenvalues onHc1(Y)θ0: ρ+, ρ

with multiplicities(q−1)/2

I 0=|YF|=q−Tr(F,Hc1(Y)) = q−Tr(F,Hc1(Y)1) −Tr(F,Hc1(Y)θ0)

⇒ ρ+= −ρ.

(13)

Eigenvalues of F

F(Hc1(Y)θ) =Hc1(Y)θ−1

F stabilizes Hc1(Y)1 and Hc1(Y)θ0

By Schur’s lemma, only one eigenvalue on Hc1(Y)1: ρ1 ?

I LetX=Y/µq+1 =P1\P1(Fq)

I Hc1(X) =Hc1(Y)1

I 0=|XF| |{z}=

Lefschetz

q−Tr(F,Hc1(Y)1

| {z }

dim. q

).

⇒ ρ1=1.

By Schur’s lemma, two eigenvalues onHc1(Y)θ0: ρ+, ρ with multiplicities(q−1)/2

I 0=|YF|

=q−Tr(F,Hc1(Y)) = q−Tr(F,Hc1(Y)1) −Tr(F,Hc1(Y)θ0)

⇒ ρ+= −ρ.

(14)

Eigenvalues of F

F(Hc1(Y)θ) =Hc1(Y)θ−1

F stabilizes Hc1(Y)1 and Hc1(Y)θ0

By Schur’s lemma, only one eigenvalue on Hc1(Y)1: ρ1 ?

I LetX=Y/µq+1 =P1\P1(Fq)

I Hc1(X) =Hc1(Y)1

I 0=|XF| |{z}=

Lefschetz

q−Tr(F,Hc1(Y)1

| {z }

dim. q

).

⇒ ρ1=1.

By Schur’s lemma, two eigenvalues onHc1(Y)θ0: ρ+, ρ with multiplicities(q−1)/2

I 0=|YF|=q−Tr(F,Hc1(Y))

= q−Tr(F,Hc1(Y)1) −Tr(F,Hc1(Y)θ0)

⇒ ρ+= −ρ.

(15)

Eigenvalues of F

F(Hc1(Y)θ) =Hc1(Y)θ−1

F stabilizes Hc1(Y)1 and Hc1(Y)θ0

By Schur’s lemma, only one eigenvalue on Hc1(Y)1: ρ1 ?

I LetX=Y/µq+1 =P1\P1(Fq)

I Hc1(X) =Hc1(Y)1

I 0=|XF| |{z}=

Lefschetz

q−Tr(F,Hc1(Y)1

| {z }

dim. q

).

⇒ ρ1=1.

By Schur’s lemma, two eigenvalues onHc1(Y)θ0: ρ+, ρ with multiplicities(q−1)/2

I 0=|YF|=q−Tr(F,Hc1(Y)) = q−Tr(F,Hc1(Y)1) −Tr(F,Hc1(Y)θ0)

⇒ ρ+= −ρ.

(16)

Eigenvalues of F

F(Hc1(Y)θ) =Hc1(Y)θ−1

F stabilizes Hc1(Y)1 and Hc1(Y)θ0

By Schur’s lemma, only one eigenvalue on Hc1(Y)1: ρ1 ?

I LetX=Y/µq+1 =P1\P1(Fq)

I Hc1(X) =Hc1(Y)1

I 0=|XF| |{z}=

Lefschetz

q−Tr(F,Hc1(Y)1

| {z }

dim. q

).

⇒ ρ1=1.

By Schur’s lemma, two eigenvalues onHc1(Y)θ0: ρ+, ρ with multiplicities(q−1)/2

I 0=|YF|=q−Tr(F,Hc1(Y)) = q−Tr(F,Hc1(Y)1) −Tr(F,Hc1(Y)θ0)

⇒ ρ+= −ρ.

(17)

Eigenvalues of F

2

F2 stabilizes Hci(Y)θ and its action commutes with G Schur’s lemma ⇒F2 acts by scalar mult. by λθ on Hc1(Y)θ (well..., except for θ0 where an extra-argument is needed) Note that λ1 =1

By Lefschetz Formula, we have, for all ξ∈µq+1,

|YξF2| = |{z}q2

action onHc2

−qλ1−X

θ6=1

θ(ξ)λθ(q−1)

= q2−1− (q−1)X

θ

θ(ξ)λθ.

On the other hand,|YξF2|=

q3−q if ξ= −1

0 otherwise

⇒ Soλθ = −θ(−1)q if θ6=1

(18)

Eigenvalues of F

2

F2 stabilizes Hci(Y)θ and its action commutes with G

Schur’s lemma ⇒F2 acts by scalar mult. by λθ on Hc1(Y)θ (well..., except for θ0 where an extra-argument is needed) Note that λ1 =1

By Lefschetz Formula, we have, for all ξ∈µq+1,

|YξF2| = |{z}q2

action onHc2

−qλ1−X

θ6=1

θ(ξ)λθ(q−1)

= q2−1− (q−1)X

θ

θ(ξ)λθ.

On the other hand,|YξF2|=

q3−q if ξ= −1

0 otherwise

⇒ Soλθ = −θ(−1)q if θ6=1

(19)

Eigenvalues of F

2

F2 stabilizes Hci(Y)θ and its action commutes with G Schur’s lemma ⇒F2 acts by scalar mult. by λθ on Hc1(Y)θ

(well..., except for θ0 where an extra-argument is needed) Note that λ1 =1

By Lefschetz Formula, we have, for all ξ∈µq+1,

|YξF2| = |{z}q2

action onHc2

−qλ1−X

θ6=1

θ(ξ)λθ(q−1)

= q2−1− (q−1)X

θ

θ(ξ)λθ.

On the other hand,|YξF2|=

q3−q if ξ= −1

0 otherwise

⇒ Soλθ = −θ(−1)q if θ6=1

(20)

Eigenvalues of F

2

F2 stabilizes Hci(Y)θ and its action commutes with G Schur’s lemma ⇒F2 acts by scalar mult. by λθ on Hc1(Y)θ (well..., except for θ0 where an extra-argument is needed)

Note that λ1 =1

By Lefschetz Formula, we have, for all ξ∈µq+1,

|YξF2| = |{z}q2

action onHc2

−qλ1−X

θ6=1

θ(ξ)λθ(q−1)

= q2−1− (q−1)X

θ

θ(ξ)λθ.

On the other hand,|YξF2|=

q3−q if ξ= −1

0 otherwise

⇒ Soλθ = −θ(−1)q if θ6=1

(21)

Eigenvalues of F

2

F2 stabilizes Hci(Y)θ and its action commutes with G Schur’s lemma ⇒F2 acts by scalar mult. by λθ on Hc1(Y)θ (well..., except for θ0 where an extra-argument is needed) Note that λ1 =1

By Lefschetz Formula, we have, for all ξ∈µq+1,

|YξF2| = |{z}q2

action onHc2

−qλ1−X

θ6=1

θ(ξ)λθ(q−1)

= q2−1− (q−1)X

θ

θ(ξ)λθ.

On the other hand,|YξF2|=

q3−q if ξ= −1

0 otherwise

⇒ Soλθ = −θ(−1)q if θ6=1

(22)

Eigenvalues of F

2

F2 stabilizes Hci(Y)θ and its action commutes with G Schur’s lemma ⇒F2 acts by scalar mult. by λθ on Hc1(Y)θ (well..., except for θ0 where an extra-argument is needed) Note that λ1 =1

By Lefschetz Formula, we have, for all ξ∈µq+1,

|YξF2|

= |{z}q2

action onHc2

−qλ1−X

θ6=1

θ(ξ)λθ(q−1)

= q2−1− (q−1)X

θ

θ(ξ)λθ.

On the other hand,|YξF2|=

q3−q if ξ= −1

0 otherwise

⇒ Soλθ = −θ(−1)q if θ6=1

(23)

Eigenvalues of F

2

F2 stabilizes Hci(Y)θ and its action commutes with G Schur’s lemma ⇒F2 acts by scalar mult. by λθ on Hc1(Y)θ (well..., except for θ0 where an extra-argument is needed) Note that λ1 =1

By Lefschetz Formula, we have, for all ξ∈µq+1,

|YξF2| = |{z}q2

action onHc2

−qλ1−X

θ6=1

θ(ξ)λθ(q−1)

= q2−1− (q−1)X

θ

θ(ξ)λθ.

On the other hand,|YξF2|=

q3−q if ξ= −1

0 otherwise

⇒ Soλθ = −θ(−1)q if θ6=1

(24)

Eigenvalues of F

2

F2 stabilizes Hci(Y)θ and its action commutes with G Schur’s lemma ⇒F2 acts by scalar mult. by λθ on Hc1(Y)θ (well..., except for θ0 where an extra-argument is needed) Note that λ1 =1

By Lefschetz Formula, we have, for all ξ∈µq+1,

|YξF2| = |{z}q2

action onHc2

−qλ1−X

θ6=1

θ(ξ)

λθ(q−1)

= q2−1− (q−1)X

θ

θ(ξ)λθ.

On the other hand,|YξF2|=

q3−q if ξ= −1

0 otherwise

⇒ Soλθ = −θ(−1)q if θ6=1

(25)

Eigenvalues of F

2

F2 stabilizes Hci(Y)θ and its action commutes with G Schur’s lemma ⇒F2 acts by scalar mult. by λθ on Hc1(Y)θ (well..., except for θ0 where an extra-argument is needed) Note that λ1 =1

By Lefschetz Formula, we have, for all ξ∈µq+1,

|YξF2| = |{z}q2

action onHc2

−qλ1−X

θ6=1

θ(ξ)λθ

(q−1)

= q2−1− (q−1)X

θ

θ(ξ)λθ.

On the other hand,|YξF2|=

q3−q if ξ= −1

0 otherwise

⇒ Soλθ = −θ(−1)q if θ6=1

(26)

Eigenvalues of F

2

F2 stabilizes Hci(Y)θ and its action commutes with G Schur’s lemma ⇒F2 acts by scalar mult. by λθ on Hc1(Y)θ (well..., except for θ0 where an extra-argument is needed) Note that λ1 =1

By Lefschetz Formula, we have, for all ξ∈µq+1,

|YξF2| = |{z}q2

action onHc2

−qλ1−X

θ6=1

θ(ξ)λθ(q−1)

= q2−1− (q−1)X

θ

θ(ξ)λθ.

On the other hand,|YξF2|=

q3−q if ξ= −1

0 otherwise

⇒ Soλθ = −θ(−1)q if θ6=1

(27)

Eigenvalues of F

2

F2 stabilizes Hci(Y)θ and its action commutes with G Schur’s lemma ⇒F2 acts by scalar mult. by λθ on Hc1(Y)θ (well..., except for θ0 where an extra-argument is needed) Note that λ1 =1

By Lefschetz Formula, we have, for all ξ∈µq+1,

|YξF2| = |{z}q2

action onHc2

−qλ1−X

θ6=1

θ(ξ)λθ(q−1)

= q2−1− (q−1)X

θ

θ(ξ)λθ.

On the other hand,|YξF2|=

q3−q if ξ= −1

0 otherwise

⇒ Soλθ = −θ(−1)q if θ6=1

(28)

Eigenvalues of F

2

F2 stabilizes Hci(Y)θ and its action commutes with G Schur’s lemma ⇒F2 acts by scalar mult. by λθ on Hc1(Y)θ (well..., except for θ0 where an extra-argument is needed) Note that λ1 =1

By Lefschetz Formula, we have, for all ξ∈µq+1,

|YξF2| = |{z}q2

action onHc2

−qλ1−X

θ6=1

θ(ξ)λθ(q−1)

= q2−1− (q−1)X

θ

θ(ξ)λθ.

On the other hand,|YξF2|=

q3−q if ξ= −1

0 otherwise

⇒ Soλθ = −θ(−1)q if θ6=1

(29)

Eigenvalues of F

2

F2 stabilizes Hci(Y)θ and its action commutes with G Schur’s lemma ⇒F2 acts by scalar mult. by λθ on Hc1(Y)θ (well..., except for θ0 where an extra-argument is needed) Note that λ1 =1

By Lefschetz Formula, we have, for all ξ∈µq+1,

|YξF2| = |{z}q2

action onHc2

−qλ1−X

θ6=1

θ(ξ)λθ(q−1)

= q2−1− (q−1)X

θ

θ(ξ)λθ.

On the other hand,|YξF2|=

q3−q if ξ= −1

0 otherwise

⇒ Soλθ = −θ(−1)q if θ6=1

(30)

Modular representations

From now on, `|q+1, ` odd LetS be the Sylow subgroup of µq+1. We identify S and (µq+1)` .

Blocks?

If α2 6=1, then {Rα} is a block of defect zero {Rα+0}and {Rα0} are two blocks of defect zero

(1) If θis an `-regular linear character of µq+1 such thatθ2 6=1, then {Rθη0 |η∈S}is a block of defect S.

(2) {Rθ0+

0,Rθ0−

0}∪{Rθ00η | η∈S, η6=1}is a block of defect S (3) {1G,StG}∪{Rη0 |η∈S, η6=1}: principal block (defect S).

(31)

Modular representations

From now on, `|q+1, ` odd

LetS be the Sylow subgroup of µq+1. We identify S and (µq+1)` .

Blocks?

If α2 6=1, then {Rα} is a block of defect zero {Rα+0}and {Rα0} are two blocks of defect zero

(1) If θis an `-regular linear character of µq+1 such thatθ2 6=1, then {Rθη0 |η∈S}is a block of defect S.

(2) {Rθ0+

0,Rθ0−

0}∪{Rθ00η | η∈S, η6=1}is a block of defect S (3) {1G,StG}∪{Rη0 |η∈S, η6=1}: principal block (defect S).

(32)

Modular representations

From now on, `|q+1, ` odd LetS be the Sylow subgroup of µq+1.

We identify S and (µq+1)` . Blocks?

If α2 6=1, then {Rα} is a block of defect zero {Rα+0}and {Rα0} are two blocks of defect zero

(1) If θis an `-regular linear character of µq+1 such thatθ2 6=1, then {Rθη0 |η∈S}is a block of defect S.

(2) {Rθ0+

0,Rθ0−

0}∪{Rθ00η | η∈S, η6=1}is a block of defect S (3) {1G,StG}∪{Rη0 |η∈S, η6=1}: principal block (defect S).

(33)

Modular representations

From now on, `|q+1, ` odd LetS be the Sylow subgroup of µq+1. We identify S and (µq+1)` .

Blocks?

If α2 6=1, then {Rα} is a block of defect zero {Rα+0}and {Rα0} are two blocks of defect zero

(1) If θis an `-regular linear character of µq+1 such thatθ2 6=1, then {Rθη0 |η∈S}is a block of defect S.

(2) {Rθ0+

0,Rθ0−

0}∪{Rθ00η | η∈S, η6=1}is a block of defect S (3) {1G,StG}∪{Rη0 |η∈S, η6=1}: principal block (defect S).

(34)

Modular representations

From now on, `|q+1, ` odd LetS be the Sylow subgroup of µq+1. We identify S and (µq+1)` .

Blocks?

If α2 6=1, then {Rα} is a block of defect zero {Rα+0}and {Rα0} are two blocks of defect zero

(1) If θis an `-regular linear character of µq+1 such thatθ2 6=1, then {Rθη0 |η∈S}is a block of defect S.

(2) {Rθ0+

0,Rθ0−

0}∪{Rθ00η | η∈S, η6=1}is a block of defect S (3) {1G,StG}∪{Rη0 |η∈S, η6=1}: principal block (defect S).

(35)

Modular representations

From now on, `|q+1, ` odd LetS be the Sylow subgroup of µq+1. We identify S and (µq+1)` .

Blocks?

If α2 6=1, then {Rα} is a block of defect zero

{Rα+0}and {Rα0} are two blocks of defect zero

(1) If θis an `-regular linear character of µq+1 such thatθ2 6=1, then {Rθη0 |η∈S}is a block of defect S.

(2) {Rθ0+

0,Rθ0−

0}∪{Rθ00η | η∈S, η6=1}is a block of defect S (3) {1G,StG}∪{Rη0 |η∈S, η6=1}: principal block (defect S).

(36)

Modular representations

From now on, `|q+1, ` odd LetS be the Sylow subgroup of µq+1. We identify S and (µq+1)` .

Blocks?

If α2 6=1, then {Rα} is a block of defect zero {Rα+

0} and {Rα

0} are two blocks of defect zero

(1) If θis an `-regular linear character of µq+1 such thatθ2 6=1, then {Rθη0 |η∈S}is a block of defect S.

(2) {Rθ0+

0,Rθ0−

0}∪{Rθ00η | η∈S, η6=1}is a block of defect S (3) {1G,StG}∪{Rη0 |η∈S, η6=1}: principal block (defect S).

(37)

Modular representations

From now on, `|q+1, ` odd LetS be the Sylow subgroup of µq+1. We identify S and (µq+1)` .

Blocks?

If α2 6=1, then {Rα} is a block of defect zero {Rα+

0} and {Rα

0} are two blocks of defect zero

(1) If θis an `-regular linear character of µq+1 such thatθ2 6=1, then {Rθη0 |η∈S}is a block of defect S.

(2) {Rθ0+

0,Rθ0−

0}∪{Rθ00η | η∈S, η6=1}is a block of defect S (3) {1G,StG}∪{Rη0 |η∈S, η6=1}: principal block (defect S).

(38)

Modular representations

From now on, `|q+1, ` odd LetS be the Sylow subgroup of µq+1. We identify S and (µq+1)` .

Blocks?

If α2 6=1, then {Rα} is a block of defect zero {Rα+

0} and {Rα

0} are two blocks of defect zero

(1) If θis an `-regular linear character of µq+1 such thatθ2 6=1, then {Rθη0 |η∈S}is a block of defect S.

(2) {Rθ0+

0,Rθ0−

0}∪{Rθ00η | η∈S, η6=1}is a block of defect S

(3) {1G,StG}∪{Rη0 |η∈S, η6=1}: principal block (defect S).

(39)

Modular representations

From now on, `|q+1, ` odd LetS be the Sylow subgroup of µq+1. We identify S and (µq+1)` .

Blocks?

If α2 6=1, then {Rα} is a block of defect zero {Rα+

0} and {Rα

0} are two blocks of defect zero

(1) If θis an `-regular linear character of µq+1 such thatθ2 6=1, then {Rθη0 |η∈S}is a block of defect S.

(2) {Rθ0+

0,Rθ0−

0}∪{Rθ00η | η∈S, η6=1}is a block of defect S (3) {1G,StG}∪{Rη0 |η∈S, η6=1}: principal block (defect S).

(40)

What has been illustrated?

Blocks are parametrized using the`0-part of linear characters of tori (in general, see Brou´e-Michel)

Some Morita equivalences: “Jordan decomposition” (in general, see Brou´e for tori and B.-Rouquier for a more general situation) Derived equivalences: Brou´e’s abelian defect conjecture admits a

“geometric version” (proved only for the “Coxeter” torus of GLn(Fq) by B.-Rouquier: cyclic defect...)

Role of the Frobenius What has been omitted?

Non-abelian defect (for`=2 inG, see Gonard’s thesis) Decomposition matrices, Schur algebras

...

(41)

What has been illustrated?

Blocks are parametrized using the`0-part of linear characters of tori (in general, see Brou´e-Michel)

Some Morita equivalences: “Jordan decomposition” (in general, see Brou´e for tori and B.-Rouquier for a more general situation) Derived equivalences: Brou´e’s abelian defect conjecture admits a

“geometric version” (proved only for the “Coxeter” torus of GLn(Fq) by B.-Rouquier: cyclic defect...)

Role of the Frobenius What has been omitted?

Non-abelian defect (for`=2 inG, see Gonard’s thesis) Decomposition matrices, Schur algebras

...

(42)

What has been illustrated?

Blocks are parametrized using the`0-part of linear characters of tori (in general, see Brou´e-Michel)

Some Morita equivalences: “Jordan decomposition” (in general, see Brou´e for tori and B.-Rouquier for a more general situation)

Derived equivalences: Brou´e’s abelian defect conjecture admits a

“geometric version” (proved only for the “Coxeter” torus of GLn(Fq) by B.-Rouquier: cyclic defect...)

Role of the Frobenius What has been omitted?

Non-abelian defect (for`=2 inG, see Gonard’s thesis) Decomposition matrices, Schur algebras

...

(43)

What has been illustrated?

Blocks are parametrized using the`0-part of linear characters of tori (in general, see Brou´e-Michel)

Some Morita equivalences: “Jordan decomposition” (in general, see Brou´e for tori and B.-Rouquier for a more general situation) Derived equivalences: Brou´e’s abelian defect conjecture admits a

“geometric version” (proved only for the “Coxeter” torus of GLn(Fq) by B.-Rouquier: cyclic defect...)

Role of the Frobenius What has been omitted?

Non-abelian defect (for`=2 inG, see Gonard’s thesis) Decomposition matrices, Schur algebras

...

(44)

What has been illustrated?

Blocks are parametrized using the`0-part of linear characters of tori (in general, see Brou´e-Michel)

Some Morita equivalences: “Jordan decomposition” (in general, see Brou´e for tori and B.-Rouquier for a more general situation) Derived equivalences: Brou´e’s abelian defect conjecture admits a

“geometric version” (proved only for the “Coxeter” torus of GLn(Fq) by B.-Rouquier: cyclic defect...)

Role of the Frobenius

What has been omitted?

Non-abelian defect (for`=2 inG, see Gonard’s thesis) Decomposition matrices, Schur algebras

...

(45)

What has been illustrated?

Blocks are parametrized using the`0-part of linear characters of tori (in general, see Brou´e-Michel)

Some Morita equivalences: “Jordan decomposition” (in general, see Brou´e for tori and B.-Rouquier for a more general situation) Derived equivalences: Brou´e’s abelian defect conjecture admits a

“geometric version” (proved only for the “Coxeter” torus of GLn(Fq) by B.-Rouquier: cyclic defect...)

Role of the Frobenius What has been omitted?

Non-abelian defect (for`=2 inG, see Gonard’s thesis) Decomposition matrices, Schur algebras

...

(46)

What has been illustrated?

Blocks are parametrized using the`0-part of linear characters of tori (in general, see Brou´e-Michel)

Some Morita equivalences: “Jordan decomposition” (in general, see Brou´e for tori and B.-Rouquier for a more general situation) Derived equivalences: Brou´e’s abelian defect conjecture admits a

“geometric version” (proved only for the “Coxeter” torus of GLn(Fq) by B.-Rouquier: cyclic defect...)

Role of the Frobenius What has been omitted?

Non-abelian defect (for`=2 inG, see Gonard’s thesis)

Decomposition matrices, Schur algebras ...

(47)

What has been illustrated?

Blocks are parametrized using the`0-part of linear characters of tori (in general, see Brou´e-Michel)

Some Morita equivalences: “Jordan decomposition” (in general, see Brou´e for tori and B.-Rouquier for a more general situation) Derived equivalences: Brou´e’s abelian defect conjecture admits a

“geometric version” (proved only for the “Coxeter” torus of GLn(Fq) by B.-Rouquier: cyclic defect...)

Role of the Frobenius What has been omitted?

Non-abelian defect (for`=2 inG, see Gonard’s thesis) Decomposition matrices, Schur algebras

...

(48)

Curiosities

Abhyankar’s conjecture (Raynaud’s Theorem): A finite groupΓ is the Galois group of a Galois ´etale covering of A1(F) if and only if it is generated by its Sylow p-subgroups.

Example: Γ =SL2(Fq),

Y −→ A1(F) (x,y) 7−→ xyq2−yxq2

q =7, Y/{±1}is acted on by PSL2(F7)'GL3(F2): it is the reduction modulo 7 of the Klein’s quartic (whose group of automorphism is exactlyPSL2(F7), reaching Hurwitz’ bound).

(49)

Curiosities

Abhyankar’s conjecture (Raynaud’s Theorem): A finite groupΓ is the Galois group of a Galois ´etale covering of A1(F) if and only if it is generated by its Sylow p-subgroups.

Example: Γ =SL2(Fq),

Y −→ A1(F) (x,y) 7−→ xyq2−yxq2

q =7, Y/{±1}is acted on by PSL2(F7)'GL3(F2): it is the reduction modulo 7 of the Klein’s quartic (whose group of automorphism is exactlyPSL2(F7), reaching Hurwitz’ bound).

(50)

Curiosities

Abhyankar’s conjecture (Raynaud’s Theorem): A finite groupΓ is the Galois group of a Galois ´etale covering of A1(F) if and only if it is generated by its Sylow p-subgroups.

Example: Γ =SL2(Fq),

Y −→ A1(F) (x,y) 7−→ xyq2−yxq2

q =7, Y/{±1}is acted on by PSL2(F7)'GL3(F2): it is the reduction modulo 7 of the Klein’s quartic (whose group of automorphism is exactlyPSL2(F7), reaching Hurwitz’ bound).

(51)

Curiosities

Abhyankar’s conjecture (Raynaud’s Theorem): A finite groupΓ is the Galois group of a Galois ´etale covering of A1(F) if and only if it is generated by its Sylow p-subgroups.

Example: Γ =SL2(Fq),

Y −→ A1(F) (x,y) 7−→ xyq2−yxq2

q =7, Y/{±1}is acted on by PSL2(F7)'GL3(F2): it is the reduction modulo 7 of the Klein’s quartic (whose group of automorphism is exactlyPSL2(F7), reaching Hurwitz’ bound).

(52)

Curiosities

Abhyankar’s conjecture (Raynaud’s Theorem): A finite groupΓ is the Galois group of a Galois ´etale covering of A1(F) if and only if it is generated by its Sylow p-subgroups.

Example: Γ =SL2(Fq),

Y −→ A1(F) (x,y) 7−→ xyq2−yxq2

q=7, Y/{±1}is acted on by PSL2(F7)

'GL3(F2): it is the reduction modulo 7 of the Klein’s quartic (whose group of automorphism is exactlyPSL2(F7), reaching Hurwitz’ bound).

(53)

Curiosities

Abhyankar’s conjecture (Raynaud’s Theorem): A finite groupΓ is the Galois group of a Galois ´etale covering of A1(F) if and only if it is generated by its Sylow p-subgroups.

Example: Γ =SL2(Fq),

Y −→ A1(F) (x,y) 7−→ xyq2−yxq2

q=7, Y/{±1}is acted on by PSL2(F7)'GL3(F2):

it is the reduction modulo 7 of the Klein’s quartic (whose group of automorphism is exactlyPSL2(F7), reaching Hurwitz’ bound).

(54)

Curiosities

Abhyankar’s conjecture (Raynaud’s Theorem): A finite groupΓ is the Galois group of a Galois ´etale covering of A1(F) if and only if it is generated by its Sylow p-subgroups.

Example: Γ =SL2(Fq),

Y −→ A1(F) (x,y) 7−→ xyq2−yxq2

q=7, Y/{±1}is acted on by PSL2(F7)'GL3(F2): it is the reduction modulo 7 of the Klein’s quartic

(whose group of automorphism is exactlyPSL2(F7), reaching Hurwitz’ bound).

(55)

Curiosities

Abhyankar’s conjecture (Raynaud’s Theorem): A finite groupΓ is the Galois group of a Galois ´etale covering of A1(F) if and only if it is generated by its Sylow p-subgroups.

Example: Γ =SL2(Fq),

Y −→ A1(F) (x,y) 7−→ xyq2−yxq2

q=7, Y/{±1}is acted on by PSL2(F7)'GL3(F2): it is the reduction modulo 7 of the Klein’s quartic (whose group of automorphism is exactlyPSL2(F7), reaching Hurwitz’ bound).

Références

Documents relatifs

• We propose a notion of admissible scheduler for the above systems, in which the global constituent is not allowed to see the secrets, and each local constituent is not allowed to

The main point of this paper is to prove a similar decomposition theorem for some generalisations of quiver Hecke algebras and hence obtain an analogue of the Dipper–Mathas

— La nature géométrique des groupes réductifs finis a permis à Deligne et Lusztig d’en construire des représentations (en caractéristique zéro) dans la cohomologie de

Proof.. Shifts of t-structures. The statement about I is immediate. The last statement follows from Lemma 2.9.. The inclusions are clear. This follows immediately from Lemma 2.8. Let

Le principe de la th´eorie de Deligne-Lusztig modulaire, initi´ee par Brou´e [12], [15], [17] et principalement d´evelopp´ee par Bonnaf´e et Rouquier [6], r´eside dans la

Parametrization of characters using character of finite subtori (in general, “Jordan decomposition”). Degrees are polynomials

We deduce a proof of Brou´e’s conjecture on equivalences of derived categories arising from Deligne-Lusztig varieties, for a split group of type A n and a Coxeter element.. Our study

J’en adresse copie aux chefs des ´ etablissements concern´ es au premier chef, l’ ´ Ecole normale sup´ erieure et l’Universit´ e Paris–Diderot Paris 7, qui auront ` a