This paper characterizes and classifies centrally generated primitive ideals of the universal enveloping algebra of the nilradical in complex semisimple Lie algebras, especially focusing on exceptional types, using the Dixmier map and Kostant cascade.
Contribution
It provides an explicit description of centrally generated primitive ideals for exceptional Lie algebras, extending previous results from classical types to exceptional cases.
Findings
01
Explicit characterization of primitive ideals in exceptional types
02
Classification of centrally generated primitive ideals for any semisimple algebra
03
Extension of classical results to exceptional Lie algebras
Abstract
Let g be a complex semisimple Lie algebra, b be a Borel subalgebra of g, n be the nilradical of b, and U(n) be the universal enveloping algebra of n. We study primitive ideals of U(n). Almost all primitive ideals are centrally generated, i.e., are generated by their intersections with the center Z(n) of U(n). We present an explicit characterization of the centrally generated primitive ideals of U(n) in terms of the Dixmier map and the Kostant cascade in the case when g is a simple algebra of exceptional type. (For classical simple Lie algebras, a similar characterization was obtained by Ivan Penkov and the first author.) As a corollary, we establish a classification of centrally generated primitive ideals of U(n) for an…
Tables6
1
2
,
,
,
3
,
,
,
4
,
,
,
5
,
,
6
,
,
,
7
,
,
,
,
8
,
,
,
9
,
10
,
,
,
,
11
,
,
,
12
,
,
,
,
13
,
,
14
,
,
,
,
1
2
,
,
3
,
,
4
,
,
5
,
6
,
,
7
,
,
,
,
8
,
,
,
9
,
10
,
,
,
11
,
,
,
12
,
,
,
,
,
13
,
,
14
,
,
,
,
Type of
Type of
Type of
1
2
3
4
5
6
7
8
9
10
11
12
13
14
Type of
Type of
1
2
1
2
,
,
,
,
3
,
,
,
,
,
,
4
,
,
,
,
,
,
5
,
,
,
,
6
,
,
,
,
,
,
7
,
,
,
,
,
,
8
,
,
,
,
,
9
,
,
,
,
,
,
10
,
,
,
,
,
11
,
,
,
,
,
12
,
,
,
,
13
,
,
,
,
,
,
14
,
,
,
,
15
,
,
,
,
,
16
,
,
,
,
,
,
,
17
,
,
,
,
18
,
,
,
,
,
,
19
,
,
,
,
,
,
20
,
,
,
,
,
21
,
,
,
22
,
,
,
,
,
23
,
,
,
,
,
24
,
,
,
,
,
,
,
25
,
,
,
,
,
26
,
,
,
,
,
,
,
27
,
,
,
,
,
,
,
28
,
,
,
,
,
,
29
,
,
,
,
30
,
,
,
,
,
,
31
,
,
,
,
,
,
32
,
,
,
,
,
,
,
,
33
,
,
34
,
,
,
35
,
,
,
,
,
,
36
,
,
,
,
,
,
,
37
,
,
,
38
,
,
,
,
39
,
,
,
,
,
40
,
,
,
,
,
,
41
,
,
,
,
,
,
42
,
,
,
,
,
,
,
43
,
,
,
,
44
,
,
,
,
,
45
,
,
,
,
,
46
,
,
,
,
,
,
47
,
,
,
,
,
,
,
48
,
,
,
,
,
,
,
,
49
,
,
,
,
50
,
,
,
,
,
51
,
,
,
,
,
52
,
,
,
,
,
,
53
,
,
,
54
,
,
,
,
55
,
,
,
,
56
,
,
,
,
,
57
,
,
,
,
,
58
,
,
,
,
,
,
59
,
,
,
,
,
,
60
,
,
,
,
,
,
,
61
,
,
,
,
62
,
,
,
,
,
63
,
,
,
,
,
64
,
,
,
,
,
,
65
,
66
,
,
,
67
,
,
,
,
,
68
,
,
,
,
69
,
,
,
,
,
70
,
,
,
,
,
,
,
71
,
,
,
,
,
,
,
72
,
,
,
,
,
,
73
,
,
,
,
,
74
,
,
,
,
,
,
,
75
,
,
,
,
,
,
,
76
,
,
,
,
,
,
77
,
,
,
,
,
,
,
78
,
,
,
,
,
79
,
,
,
,
,
,
80
,
,
,
,
,
,
,
,
81
,
,
,
82
,
,
,
,
,
83
,
,
,
,
,
84
,
,
,
,
,
,
,
85
,
,
,
,
86
,
,
,
,
,
,
87
,
,
,
,
,
,
88
,
,
,
,
,
,
,
,
89
,
,
,
,
90
,
,
,
,
,
,
91
,
,
,
,
,
,
92
,
,
,
,
,
,
,
,
93
,
,
,
,
,
94
,
,
,
,
,
,
,
95
,
,
,
,
,
,
,
96
,
,
,
,
,
,
,
,
,
97
,
,
98
,
,
,
99
,
,
,
,
100
,
,
,
,
,
101
,
,
,
,
102
,
,
,
,
,
103
,
,
,
,
,
,
104
,
,
,
,
,
,
,
105
,
,
,
,
106
,
,
,
,
,
107
,
,
,
,
,
,
108
,
,
,
,
,
,
,
109
,
,
,
,
,
,
110
,
,
,
,
,
,
,
111
,
,
,
,
,
,
,
,
112
,
,
,
,
,
,
,
,
,
1
2
,
,
,
,
3
,
,
,
,
,
,
4
,
,
,
,
,
,
5
,
,
,
,
,
,
6
,
,
,
,
,
,
7
,
,
,
,
,
8
,
,
,
,
,
9
,
,
,
,
,
,
10
,
,
,
,
,
11
,
,
,
,
,
,
12
,
,
,
,
13
,
,
,
,
,
14
,
,
,
,
15
,
,
,
,
16
,
,
,
,
,
,
,
17
,
,
,
,
,
,
18
,
,
,
,
,
,
19
,
,
,
,
,
20
,
,
,
,
,
21
,
,
,
,
,
,
22
,
,
,
,
,
23
,
,
,
,
24
,
,
,
,
25
,
,
,
,
,
,
,
26
,
,
,
,
,
,
,
27
,
,
,
,
,
,
28
,
,
,
,
,
,
29
,
,
,
,
,
,
,
30
,
,
,
,
,
,
31
,
,
,
,
,
32
,
,
,
,
,
33
,
,
,
,
34
,
,
,
35
,
,
,
,
,
,
,
,
36
,
,
,
,
,
,
,
37
,
,
,
,
,
38
,
,
,
,
39
,
,
,
,
,
,
,
40
,
,
,
,
,
,
41
,
,
,
,
,
,
,
,
42
,
,
,
,
,
,
,
43
,
,
,
,
,
,
,
,
44
,
,
,
,
,
45
,
,
,
,
,
,
,
46
,
,
,
,
,
,
47
,
,
,
,
,
,
48
,
,
,
,
,
,
,
,
49
,
,
,
,
,
,
50
,
,
,
,
,
51
,
,
,
,
,
,
,
52
,
,
,
,
,
,
53
,
,
,
,
,
54
,
,
,
,
55
,
,
,
,
,
,
56
,
,
,
,
,
57
,
,
,
,
,
,
,
58
,
,
,
,
,
,
59
,
,
,
,
,
,
,
,
60
,
,
,
,
,
,
,
61
,
,
,
,
,
,
62
,
,
,
,
,
63
,
,
,
,
,
,
,
64
,
,
,
,
,
,
65
,
,
66
,
,
,
67
,
,
,
,
,
,
68
,
,
,
,
69
,
,
,
,
,
,
,
,
70
,
,
,
,
,
,
,
71
,
,
,
,
,
,
,
,
72
,
,
,
,
,
,
73
,
,
,
,
,
,
,
,
74
,
,
,
,
,
,
,
75
,
,
,
,
,
,
,
,
76
,
,
,
,
,
,
77
,
,
,
,
,
,
78
,
,
,
,
,
79
,
,
,
,
,
80
,
,
,
,
,
,
,
,
81
,
,
,
,
,
,
82
,
,
,
,
,
83
,
,
,
,
84
,
,
,
,
,
,
,
85
,
,
,
,
,
,
,
86
,
,
,
,
,
,
87
,
,
,
,
,
88
,
,
,
,
,
,
,
,
89
,
,
,
,
,
,
,
90
,
,
,
,
,
,
91
,
,
,
,
,
92
,
,
,
,
,
,
,
,
93
,
,
,
,
,
,
,
,
94
,
,
,
,
,
,
,
95
,
,
,
,
,
,
96
,
,
,
,
,
,
,
,
,
97
,
,
,
,
98
,
,
,
99
,
,
,
,
,
,
,
,
100
,
,
,
,
,
101
,
,
,
,
,
,
,
,
102
,
,
,
,
,
103
,
,
,
,
,
,
,
,
,
,
104
,
,
,
,
,
,
,
105
,
,
,
,
,
,
,
,
106
,
,
,
,
,
107
,
,
,
,
,
,
,
,
,
,
108
,
,
,
,
,
,
,
109
,
,
,
,
,
,
,
,
,
,
110
,
,
,
,
,
,
,
111
,
,
,
,
,
,
,
112
,
,
,
,
,
,
,
,
,
113
,
,
,
,
,
114
,
,
,
,
,
,
,
115
,
,
,
,
,
,
116
,
,
,
,
,
,
,
,
117
,
,
,
,
,
,
118
,
,
,
,
,
,
,
,
119
,
,
,
,
,
,
,
120
,
,
,
,
,
,
,
,
,
121
,
,
,
,
,
,
122
,
,
,
,
,
,
,
,
123
,
,
,
,
,
,
,
124
,
,
,
,
,
,
,
,
,
125
,
,
,
,
,
,
,
126
,
,
,
,
,
,
,
,
,
127
,
,
,
,
,
,
,
,
128
,
,
,
,
,
,
,
,
,
,
129
,
130
,
,
,
,
,
131
,
,
,
,
,
,
,
132
,
,
,
,
,
,
,
133
,
,
,
,
,
134
,
,
,
,
,
,
,
135
,
,
,
,
,
,
,
136
,
,
,
,
,
,
137
,
,
,
,
,
,
,
138
,
,
,
,
,
,
139
,
,
,
,
,
,
140
,
,
,
,
,
141
,
,
,
,
,
,
,
142
,
,
,
,
,
143
,
,
,
,
,
,
144
,
,
,
,
,
,
,
,
145
,
,
,
,
,
146
,
,
,
,
,
,
,
147
,
,
,
,
,
,
,
148
,
,
,
,
,
,
149
,
,
,
,
150
,
,
,
,
,
,
151
,
,
,
,
,
,
152
,
,
,
,
,
,
,
,
153
,
,
,
,
,
,
154
,
,
,
,
,
,
,
,
155
,
,
,
,
,
,
,
,
156
,
,
,
,
,
,
,
157
,
,
,
,
,
158
,
,
,
,
,
,
,
159
,
,
,
,
,
,
,
160
,
,
,
,
,
,
,
,
,
161
,
,
,
162
,
,
,
,
163
,
,
,
,
,
,
,
164
,
,
,
,
,
,
,
,
165
,
,
,
,
166
,
,
,
,
,
167
,
,
,
,
,
,
168
,
,
,
,
,
,
,
169
,
,
,
,
,
,
,
170
,
,
,
,
,
,
,
,
171
,
,
,
,
,
172
,
,
,
,
,
,
173
,
,
,
,
,
,
174
,
,
,
,
,
,
,
175
,
,
,
,
,
,
,
,
176
,
,
,
,
,
,
,
,
,
177
,
,
,
,
,
178
,
,
,
,
,
,
179
,
,
,
,
,
,
180
,
,
,
,
,
,
,
181
,
,
,
,
182
,
,
,
,
,
183
,
,
,
,
,
184
,
,
,
,
,
,
185
,
,
,
,
,
,
186
,
,
,
,
,
,
,
187
,
,
,
,
,
,
,
188
,
,
,
,
,
,
,
,
189
,
,
,
,
,
190
,
,
,
,
,
,
191
,
,
,
,
,
,
192
,
,
,
,
,
,
,
193
,
,
194
,
,
,
,
195
,
,
,
,
,
,
196
,
,
,
,
,
197
,
,
,
,
,
,
198
,
,
,
,
,
,
,
,
199
,
,
,
,
,
,
,
,
200
,
,
,
,
,
,
,
201
,
,
,
,
,
,
202
,
,
,
,
,
,
,
,
203
,
,
,
,
,
,
,
,
204
,
,
,
,
,
,
,
205
,
,
,
,
,
,
,
,
206
,
,
,
,
,
,
207
,
,
,
,
,
,
,
208
,
,
,
,
,
,
,
,
,
209
,
,
,
,
210
,
,
,
,
,
,
211
,
,
,
,
,
,
212
,
,
,
,
,
,
,
,
213
,
,
,
,
,
214
,
,
,
,
,
,
,
215
,
,
,
,
,
,
,
216
,
,
,
,
,
,
,
,
,
217
,
,
,
,
,
218
,
,
,
,
,
,
,
219
,
,
,
,
,
,
,
220
,
,
,
,
,
,
,
,
,
221
,
,
,
,
,
,
222
,
,
,
,
,
,
,
,
223
,
,
,
,
,
,
,
,
224
,
,
,
,
,
,
,
,
,
,
225
,
,
,
226
,
,
,
,
227
,
,
,
,
,
228
,
,
,
,
,
,
229
,
,
,
,
,
230
,
,
,
,
,
,
231
,
,
,
,
,
,
,
232
,
,
,
,
,
,
,
,
233
,
,
,
,
,
234
,
,
,
,
,
,
235
,
,
,
,
,
,
,
236
,
,
,
,
,
,
,
,
237
,
,
,
,
,
,
,
238
,
,
,
,
,
,
,
,
239
,
,
,
,
,
,
,
,
,
240
,
,
,
,
,
,
,
,
,
,
Equations98
i)J is centrally generated;ii) all scalars cβ, β∈B∖Δ, are nonzero;iii)J=J(f) for a Kostant form f.
i)J is centrally generated;ii) all scalars cβ, β∈B∖Δ, are nonzero;iii)J=J(f) for a Kostant form f.
An−1+Bn+Cn+Dn+E6+E7+E8+F4+G2+={ϵi−ϵj,\leavevmode1≤i<j≤n},={ϵi−ϵj,\leavevmode1≤i<j≤n}∪{ϵi+ϵj,\leavevmode1≤i<j≤n}∪{ϵi,\leavevmode1≤i≤n},={ϵi−ϵj,\leavevmode1≤i<j≤n}∪{ϵi+ϵj,\leavevmode1≤i<j≤n}∪{2ϵi,\leavevmode1≤i≤n},={ϵi−ϵj,\leavevmode1≤i<j≤n}∪{ϵi+ϵj,\leavevmode1≤i<j≤n},={±ϵi+ϵj,\leavevmode1≤i<j≤5}∪{21(ϵ8−ϵ7−ϵ6+i=1∑5(−1)ν(i)ϵi),\leavevmodei=1∑5ν(i) is even},={±ϵi+ϵj,\leavevmode1≤i<j≤6}∪{ϵ8−ϵ7}∪{21(ϵ8−ϵ7+i=1∑6(−1)ν(i)ϵi),\leavevmodei=1∑6ν(i) is even},={±ϵi+ϵj,1≤i<j≤8}∪{21(ϵ8+i=1∑7(−1)ν(i)ϵi),\leavevmodei=1∑7ν(i) is even},={ϵi±ϵj,\leavevmode1≤i<j≤4}∪{(ϵ1±ϵ2±ϵ3±ϵ4)/2}∪{ϵi,1≤i≤4},={ϵ1−ϵ2,\leavevmode−2ϵ1+ϵ2+ϵ3,\leavevmode−ϵ1+ϵ3,−ϵ2+ϵ3,\leavevmodeϵ1−2ϵ2+ϵ3,\leavevmode−ϵ1−ϵ2+2ϵ3}.
An−1+Bn+Cn+Dn+E6+E7+E8+F4+G2+={ϵi−ϵj,\leavevmode1≤i<j≤n},={ϵi−ϵj,\leavevmode1≤i<j≤n}∪{ϵi+ϵj,\leavevmode1≤i<j≤n}∪{ϵi,\leavevmode1≤i≤n},={ϵi−ϵj,\leavevmode1≤i<j≤n}∪{ϵi+ϵj,\leavevmode1≤i<j≤n}∪{2ϵi,\leavevmode1≤i≤n},={ϵi−ϵj,\leavevmode1≤i<j≤n}∪{ϵi+ϵj,\leavevmode1≤i<j≤n},={±ϵi+ϵj,\leavevmode1≤i<j≤5}∪{21(ϵ8−ϵ7−ϵ6+i=1∑5(−1)ν(i)ϵi),\leavevmodei=1∑5ν(i) is even},={±ϵi+ϵj,\leavevmode1≤i<j≤6}∪{ϵ8−ϵ7}∪{21(ϵ8−ϵ7+i=1∑6(−1)ν(i)ϵi),\leavevmodei=1∑6ν(i) is even},={±ϵi+ϵj,1≤i<j≤8}∪{21(ϵ8+i=1∑7(−1)ν(i)ϵi),\leavevmodei=1∑7ν(i) is even},={ϵi±ϵj,\leavevmode1≤i<j≤4}∪{(ϵ1±ϵ2±ϵ3±ϵ4)/2}∪{ϵi,1≤i≤4},={ϵ1−ϵ2,\leavevmode−2ϵ1+ϵ2+ϵ3,\leavevmode−ϵ1+ϵ3,−ϵ2+ϵ3,\leavevmodeϵ1−2ϵ2+ϵ3,\leavevmode−ϵ1−ϵ2+2ϵ3}.
fhα0,eα=fe−γ,eβ0=0 for all eα<teβ0 and all e−γ,\leavevmodeα,γ∈Φ+.
fhα0,eα=fe−γ,eβ0=0 for all eα<teβ0 and all e−γ,\leavevmodeα,γ∈Φ+.
fhα0,eβ=−ξ(β)(α0,α0)2(α0,β)=0,
fhα0,eβ=−ξ(β)(α0,α0)2(α0,β)=0,
\begin{split}&\text{{i)} $D$ is linear independent {(}in fact{,} orthogonal{,} except cases $11${,} $12$ and $14$ for $F_{4}$ in Table {\ref{table:D_D'_F_4}}{)}};\\
&\text{{ii)} if $c_{\beta_{i}}=0$ for some $\beta_{i}\in\mathcal{B}$ then $\mu_{\beta_{i}}$ does not belong to the $\mathbb{Z}_{\geq 0}$-linear span of $D$};\\
&\text{{iii)} if $c_{\beta_{i}}\neq 0$ for some $\beta_{i}\in\mathcal{B}$ then $\mu_{\beta_{i}}$ belongs to the $\mathbb{Z}_{\geq_{0}}$-linear span of $D$};\\
&\text{{iv)} there exist $\alpha_{0}\in\Delta$ and $\beta_{0}\in D^{\prime}$ such that $(\alpha_{0},\beta_{0})\neq 0$ and $(\alpha_{0},\beta)=0$ for all $\beta\in D\setminus D^{\prime}$}.\\
\end{split}
\begin{split}&\text{{i)} $D$ is linear independent {(}in fact{,} orthogonal{,} except cases $11${,} $12$ and $14$ for $F_{4}$ in Table {\ref{table:D_D'_F_4}}{)}};\\
&\text{{ii)} if $c_{\beta_{i}}=0$ for some $\beta_{i}\in\mathcal{B}$ then $\mu_{\beta_{i}}$ does not belong to the $\mathbb{Z}_{\geq 0}$-linear span of $D$};\\
&\text{{iii)} if $c_{\beta_{i}}\neq 0$ for some $\beta_{i}\in\mathcal{B}$ then $\mu_{\beta_{i}}$ belongs to the $\mathbb{Z}_{\geq_{0}}$-linear span of $D$};\\
&\text{{iv)} there exist $\alpha_{0}\in\Delta$ and $\beta_{0}\in D^{\prime}$ such that $(\alpha_{0},\beta_{0})\neq 0$ and $(\alpha_{0},\beta)=0$ for all $\beta\in D\setminus D^{\prime}$}.\\
\end{split}
i)J is centrally generated;ii) the scalars cβ,β∈B∖Δ, are nonzero;iii)J=J(fξ) for a Kostant form fξ∈n∗.
i)J is centrally generated;ii) the scalars cβ,β∈B∖Δ, are nonzero;iii)J=J(fξ) for a Kostant form fξ∈n∗.
R={t=∑β∈Btβeβ∗,\leavevmodetβ∈C×}
R={t=∑β∈Btβeβ∗,\leavevmodetβ∈C×}
ξβi(t)=β∈B∏tβrβi(β), where μβi=β∈B∑rβi(β)β,
ξβi(t)=β∈B∏tβrβi(β), where μβi=β∈B∑rβi(β)β,
μβi=βi+j<i∑rβi(βj)βj, so ξβi(t)=tβij<i∏tβjrβi(βj).
μβi=βi+j<i∑rβi(βj)βj, so ξβi(t)=tβij<i∏tβjrβi(βj).
fξ=j=1∑mξ(βj)eβj∗,\leavevmodem=∣B∣,
fξ=j=1∑mξ(βj)eβj∗,\leavevmodem=∣B∣,
ξβi(fξ)=ξ(βi)j<i∏ξ(βj)rβi(βj)
ξβi(fξ)=ξ(βi)j<i∏ξ(βj)rβi(βj)
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topics in Algebra · Algebraic structures and combinatorial models · Advanced Algebra and Geometry
Full text
Centrally generated primitive ideals of U(n) for exceptional types00footnotetext: The work was supported by the Foundation for the Advancement of Theoretical Physics and Mathematics ‘‘BASIS’’, grant no. 18–1–7–2–1.
Mikhail V. Ignatyev
Aleksandr A. Shevchenko
[TABLE]
1. Introduction
The ground field is the field C of complex numbers. The theory of primitive ideals in enveloping algebras of Lie algebras can be considered as a part of the representation theory of Lie algebras. In general, it is impossible to classify all irreducible representations of Lie algebras (except in a few very special cases), while a classification of annihilators of irreducible representations, i.e., of primitive ideals, can be achieved in much greater generality. In the case when n is a finite-dimensional nilpotent Lie algebra, the primitive ideals in the universal enveloping algebra U(n) can be described in terms of the Dixmier map assigning to any linear form f∈n∗ a primitive ideal J(f) of U(n).
If n is abelian, J(f) is simply the annihilator of f. For a general finite-dimensional nilpotent Lie algebra n, the theory of primitive ideals retains many properties from the abelian case: in particular, J(f) is always a maximal ideal and every primitive ideal in U(n) is of the form J(f) for some f∈n∗. Moreover, J(f)=J(f′) if and only if f and f′ belong to the same coadjoint orbit in n∗ [Di4, Theorem 6.2.4]. Note that, according to the Kostant–Kirillov orbit method, the set of all unitary irreducible representations of the Lie group expn is also in one-to-one correspondence with the set of all coadjoint orbits in n∗ [Ki1]. Note also that there exists a natural topology, called the Jacobson topology, on the set PrimU(n) of all primitive ideals of U(n). It turns out that PrimU(n) is irreducible, and each primitive ideal from a certain (dense) open subset of PrimU(n) is generated by its intersection with the center Z(n) of U(n); such an ideal is called centrally generated (see Section Centrally generated primitive ideals of U(n) for exceptional types00footnotetext: The work was supported by the Foundation for the Advancement of Theoretical Physics and Mathematics ‘‘BASIS’’, grant no. 18–1–7–2–1. for the details).
Suppose that n is the nilradical of a Borel subalgebra b of a complex finite-dimensional semisimple Lie algebra g. The description of Z(n) goes back to Dixmier, Joseph and Kostant. It turns out that Z(n) is a polynomial algebra whose generators are parametrized by the positive roots from the Kostant cascade B, a certain strongly orthogonal subset of the set Φ+ of positive roots of g with respect to b [Ko2, Theorem 7] (see Section Centrally generated primitive ideals of U(n) for exceptional types00footnotetext: The work was supported by the Foundation for the Advancement of Theoretical Physics and Mathematics ‘‘BASIS’’, grant no. 18–1–7–2–1. for the precise definition). Let {eα,\leavevmodeα∈Φ+} be a basis of n consisting of root vectors. We say that a linear form f∈n∗ is a Kostant form if f(eα)=0 for α∈/B and f(eβ)=0 for β∈B∖Δ, where Δ is the set of simple roots. Note that the coadjoint orbit of a Kostant form has maximal possible dimension.
It was proved in [IP, Theorem 3.1] and [Ig1, Theorem 2.4] that, when Φ is of classical type (i.e., Φ=An−1, Bn, Cn or Dn), J∈PrimU(n) is centrally generated if and only if J=J(f) for a certain Kostant form f. In this paper, we prove that this fact is also true when Φ is of exceptional type, i.e., Φ=E6, E7, E8, F4 or G2. Namely, let Δβ, β∈B, be the set of canonical generators of Z(n) (see Section Centrally generated primitive ideals of U(n) for exceptional types00footnotetext: The work was supported by the Foundation for the Advancement of Theoretical Physics and Mathematics ‘‘BASIS’’, grant no. 18–1–7–2–1.). Let J be a primitive ideal of U(n). Since J is the annihilator of a simple n-module, given β∈B, there exists unique cβ∈C such that Δβ−cβ∈J. Our main result, Theorem Centrally generated primitive ideals of U(n) for exceptional types00footnotetext: The work was supported by the Foundation for the Advancement of Theoretical Physics and Mathematics ‘‘BASIS’’, grant no. 18–1–7–2–1., claims that the following conditions are equivalent:
[TABLE]
If these conditions are satisfied, then f can be explicitly reconstructed from J. As a corollary, we conclude that the same is true for arbitrary root system.
The paper is organized as follows. In Section Centrally generated primitive ideals of U(n) for exceptional types00footnotetext: The work was supported by the Foundation for the Advancement of Theoretical Physics and Mathematics ‘‘BASIS’’, grant no. 18–1–7–2–1., we briefly recall Kostant’s characterization of Z(n) and present a (more or less) explicit description of the canonical generators of Z(n) based on Panov’s work [Pa2]. Using this description, in Section Centrally generated primitive ideals of U(n) for exceptional types00footnotetext: The work was supported by the Foundation for the Advancement of Theoretical Physics and Mathematics ‘‘BASIS’’, grant no. 18–1–7–2–1. we prove that certain centrally generated ideals are primitive (in fact, it is the key ingredient in the proof of the main result, see Proposition Centrally generated primitive ideals of U(n) for exceptional types00footnotetext: The work was supported by the Foundation for the Advancement of Theoretical Physics and Mathematics ‘‘BASIS’’, grant no. 18–1–7–2–1.). Section Centrally generated primitive ideals of U(n) for exceptional types00footnotetext: The work was supported by the Foundation for the Advancement of Theoretical Physics and Mathematics ‘‘BASIS’’, grant no. 18–1–7–2–1. is devoted to some particular classes of coadjoint orbits. Namely, we prove that certain orbits are disjoint, see Proposition Centrally generated primitive ideals of U(n) for exceptional types00footnotetext: The work was supported by the Foundation for the Advancement of Theoretical Physics and Mathematics ‘‘BASIS’’, grant no. 18–1–7–2–1.. Finally, in Section 4, combining our results from two previous sections, we prove the main result, Theorem Centrally generated primitive ideals of U(n) for exceptional types00footnotetext: The work was supported by the Foundation for the Advancement of Theoretical Physics and Mathematics ‘‘BASIS’’, grant no. 18–1–7–2–1.. As an immediate corollary, we obtain that the similar result is true for an arbitrary semisimple Lie algebra, see Theorem Centrally generated primitive ideals of U(n) for exceptional types00footnotetext: The work was supported by the Foundation for the Advancement of Theoretical Physics and Mathematics ‘‘BASIS’’, grant no. 18–1–7–2–1..
Acknowledgments. We express our gratitude to A. Panov and I. Penkov for useful discussions. The work was supported by the Foundation for the Advancement of Theoretical Physics and Mathematics ‘‘BASIS’’, grant no. 18–1–7–2–1.
2. The center of U(n)
Let G be a complex semisimple algebraic group, let H be a Cartan subgroup of G, let B be a Borel subgroup of G containing H, and let N be the unipotent radical of B. We denote by Φ the root system of G with respect to B, and by Φ+ the set of positive roots with respect to B. Let g (respectively, h, b and n) be the Lie algebra of G (respectively, of H, B and N), so that b=h⊕n as vector spaces. The Lie algebra n has a basis consisting of root vectors eα, α∈Φ+. We denote the dual basis of the dual space n∗ by {eα∗,\leavevmodeα∈Φ+}.
Let Rn be the n-dimensional Euclidean space with the standard inner product (⋅,⋅), and {ϵi}i=1n be the standard basis of Rn. If Φ is irreducible then we identify Φ+ with the following subset of Rn [Bo]:
[TABLE]
Under this identification, the set Δ⊂Φ+ of the simple roots has the following form:
[TABLE]
Recall that there exists a natural partial order on Φ: by definition, α<β if β−α can be represented as a sum of positive roots. Denote by B the subset of Φ+ constructed by the following inductive procedure. Let B1 be the set consisting of the maximal roots of all irreducible components of Φ. For n≥2, we denote Φn={α∈Φ∣α⊥β for all β∈B1∪…∪Bn−1}, and set Bn to be the set of the maximal roots of all irreducible components of Φn. Finally, we denote by B the union of all Bn’s. Note that B is a maximal strongly orthogonal subset of Φ+, i.e., B is maximal with the property that if α,\leavevmodeβ∈B then neither α−β nor α+β belongs to Φ+.
**Definition 2.1. **We call B the Kostant cascade of orthogonal roots in Φ+.
Let [n/2] be the largest integer not exceeding n/2. For irreducible Φ, B has the following form:
[TABLE]
Denote by U(n) the enveloping algebra of n, and by S(n) the symmetric algebra of n. Then n and S(n) are B-modules as B normalizes N. Denote by Z(n) the center of U(n). It is well-known that the restriction of the symmetrization map
[TABLE]
to the algebra Y(n) of N-invariants in S(n) is an algebra isomorphism between Y(n) and Z(n).
We next present a canonical set of generators of Z(n) (or, equivalently, of Y(n)), whose description goes back to Dixmier, Joseph and Kostant [Di3], [Jo1], [Ko1], [Ko2]. Let X be the group of rational multiplicative characters of H, i.e., of algebraic group morphisms from H to C×=C∖{0}. We can consider ZΦ, the Z-linear span of Φ, as a subgroup of X. Recall that a vector λ∈Rn is called a weight if c(α,λ):=2(α,λ)/(α,α) is an integer for any α∈Φ+. A weight λ is called dominant if c(α,λ)≥0 for all α∈Φ+. An element a of an H-module is called a weight vector if there exists ν∈X such that h⋅a=ν(h)a for all h∈H. By [Ko2, Theorems 6, 7], every weight occurs in Y(n) with multiplicity at most 1. Furthermore, there exist unique (up to scalars) prime polynomials ξβ∈Y(n), β∈B, such that each ξβ is a weight polynomial of a dominant weight μβ belonging to the Z-linear span ZB of B. A remarkable fact is that
[TABLE]
so Y(n) and Z(n) are polynomial rings [Ko2, Theorem 7]. It turns out that the weights μβ’s have the following form [Pa2, Theorem 2.12].
Table 1. Weights μβ for β∈B
Φ=An−1μβi=ϵ1+…+ϵi−ϵn−i+1−…−ϵn, 1≤i≤[n/2]
Φ=Bn\mu_{\beta_{i}}=\begin{cases}2\epsilon_{1}+\ldots+2\epsilon_{i-1}&\text{for even i},\\
\epsilon_{1}+\ldots+\epsilon_{i}+\epsilon_{i+1}&\text{for odd i<n,}\\
\epsilon_{1}+\ldots+\epsilon_{i}&\text{for odd i=n,}\end{cases}
Φ=Cnμβi=2ϵ1+…+2ϵi, 1≤i≤n
Φ=Dn\mu_{\beta_{i}}=\begin{cases}2\epsilon_{1}+\ldots+2\epsilon_{i-1}&\text{for even i<n},\\
\epsilon_{1}+\ldots+\epsilon_{n-1}-\epsilon_{n}&\text{for even i=n},\\
\epsilon_{1}+\ldots+\epsilon_{i+1}&\text{for odd i}\end{cases}
For the sequel, we need to express the weights μβ’s as linear combination of simple roots. Such expressions are presented in Table Centrally generated primitive ideals of U(n) for exceptional types00footnotetext: The work was supported by the Foundation for the Advancement of Theoretical Physics and Mathematics ‘‘BASIS’’, grant no. 18–1–7–2–1..
Table 2. Weights μβ, β∈B, as linear combinations of simple roots
[TABLE]
Further, we also need to express the weights μβi’s as linear combinations of roots from B (it is possible since μβi∈ZB for all i). Such expressions are presented in Table Centrally generated primitive ideals of U(n) for exceptional types00footnotetext: The work was supported by the Foundation for the Advancement of Theoretical Physics and Mathematics ‘‘BASIS’’, grant no. 18–1–7–2–1..
Table 3. Weights μβ, β∈B, as linear combinations of roots from B
Φ=An−1μβi=β1+…+βi, 1≤i≤[n/2]
Φ=Bn\mu_{\beta_{i}}=\begin{cases}2\beta_{1}+2\beta_{3}+\ldots+2\beta_{i-2}+\beta_{i-1}+\beta_{i}&\text{for even i},\\
\beta_{1}+\beta_{3}\ldots+\beta_{i}&\text{for odd i<n}\\
\end{cases}
Φ=Cnμβi=β1+…+βi, 1≤i≤n
Φ=Dn\mu_{\beta_{i}}=\begin{cases}2\beta_{1}+2\beta_{3}+\ldots+2\beta_{i-2}+\beta_{i-1}+\beta_{i}&\text{for even i<n},\\
\beta_{1}+\beta_{3}+\ldots+\beta_{n-3}+\beta_{n}&\text{for even i=n},\\
\beta_{1}+\beta_{3}\ldots+\beta_{i}&\text{for odd i}\end{cases}
**Remark 2.2. **i) In fact, we will use Tables Centrally generated primitive ideals of U(n) for exceptional types00footnotetext: The work was supported by the Foundation for the Advancement of Theoretical Physics and Mathematics ‘‘BASIS’’, grant no. 18–1–7–2–1., Centrally generated primitive ideals of U(n) for exceptional types00footnotetext: The work was supported by the Foundation for the Advancement of Theoretical Physics and Mathematics ‘‘BASIS’’, grant no. 18–1–7–2–1., Centrally generated primitive ideals of U(n) for exceptional types00footnotetext: The work was supported by the Foundation for the Advancement of Theoretical Physics and Mathematics ‘‘BASIS’’, grant no. 18–1–7–2–1. only for exceptional root systems, but for the reader’s convenience we describe the weights μβi for all irreducible root systems.
ii) Note that the correspondence between βi and μβi is uniquely determined by the fact that
[TABLE]
where ⟨⋅⟩R, as usual, denotes the linear span over R. Furthermore, each β∈B occurs in μβ with coefficient 1. Note also that if β∈B∩Δ then μβ is the unique weight in Table Centrally generated primitive ideals of U(n) for exceptional types00footnotetext: The work was supported by the Foundation for the Advancement of Theoretical Physics and Mathematics ‘‘BASIS’’, grant no. 18–1–7–2–1. in which expression β occurs. Our enumeration of the weights μβi slightly differs from [Pa2], [Ig1] and [IP].
iii) Recall that {eα∗,\leavevmodeα∈Φ+} is the basis of n∗ dual to the basis {eα,\leavevmodeα∈Φ+} of n. Put
[TABLE]
and denote by X the union of all N-orbits in n∗ of elements of R. In fact, X is a single B-orbit in n∗, and the N-orbits of two distinct point of R are disjoint [Ko1, Theorem 2.5]. Kostant [Ko1, Theorems 2.8, 3.11] proved that X is a Zariski dense subset of n∗, and for t∈R, up to scalar, for each βi∈B,
[TABLE]
(Here we identify S(n) with the algebra of polynomial functions on n∗.) Clearly, rβi(β) is nothing but the coefficient at β in the expression of μβi in Table Centrally generated primitive ideals of U(n) for exceptional types00footnotetext: The work was supported by the Foundation for the Advancement of Theoretical Physics and Mathematics ‘‘BASIS’’, grant no. 18–1–7–2–1..
We fix the generators ξβ, β∈B, so that the formulas (4) are satisfied (without any additional scalars). Recall the definition of the map σ from (2). For β∈B, we denote Δβ=σ(ξβ)∈Z(n). Explicit formulas for ξβ and Δβ for classical root systems can be found in [IP, Subsection 2.1].
**Definition 2.3. **We call Δβ (respectively, ξβ), β∈B, the canonical generators of the algebra Z(n) (respectively, of the algebra Y(n)).
3. Centrally generated ideals
Let g, n, Φ, Δ, etc., be as in Section Centrally generated primitive ideals of U(n) for exceptional types00footnotetext: The work was supported by the Foundation for the Advancement of Theoretical Physics and Mathematics ‘‘BASIS’’, grant no. 18–1–7–2–1.. A (two-sided) ideal J⊂U(n) is called primitive if J is the annihilator of a simple n-module. An ideal J is called centrally generated if J is generated (as an ideal) by its intersection J∩Z(n) with the center Z(n) of U(n).
In the 1960s Kirillov, Kostant and Souriau discovered that the orbits of the coadjoint action play a crucial role in the representation theory of B and N (see, e.g., [Ki1], [Ki2]). Works of Dixmier, Duflo, Vergne, Mathieu, Conze and Rentschler led to the result that the orbit method provides a nice description of primitive ideals of the universal enveloping algebra of a nilpotent Lie algebra (in particular, of n). Below we briefly recall this description.
To any linear form λ∈n∗ one can assign a bilinear form βλ on n by putting βλ(x,y)=λ([x,y]) for x,y∈n. A subalgebra p⊆n is a polarization of n atλ if it is a maximal βλ-isotropic subspace. By [Ve], such a subalgebra always exists. Let p be a polarization of n at λ, and let W be the one-dimensional representation of p defined by x↦λ(x). Then the annihilator J(λ)=AnnU(n)V of the induced representation V=U(n)⊗U(p)W is a primitive two-sided ideal of U(n). It turns out that J(λ) depends only on λ and not on the choice of polarization. Further, J(λ)=J(μ) if and only if the coadjoint N-orbits of λ and μ coincide. Finally, the Dixmier map
[TABLE]
induces a homeomorphism between n∗/N and PrimU(n), where the latter set is endowed with the Jacobson topology. (See [Di2], [Di4], [BGR] for the details.)
In addition, it is well known that the following conditions on an ideal J⊂U(n) are equivalent[Di4, Proposition 4.7.4, Theorem 4.7.9]:
[TABLE]
Recall that the Weyl algebra As of 2s variables is the unital associative algebra with generators pi, qi for 1≤i≤s, and relations [pi,qi]=1, [pi,qj]=0 for i=j, [pi,pj]=[qi,qj]=0 for all i,\leavevmodej. Furthermore, in (5) we have U(n)/J≅As where s equals one half of the dimension of the coadjoint N-orbit of λ, given that J=J(λ).
**Definition 3.1. **To a map ξ:B→C we assign the linear form fξ=∑β∈Bξ(β)eβ∗∈n∗. We call a form fξ a Kostant form if ξ(β)=0 for any β∈B∖Δ.
Let V be a simple (and hence at most countably dimensional) n-module and let J=AnnU(n)V be the corresponding primitive ideal of U(n). By a version of Schur’s Lemma [Di1], each central element of U(n) acts on V as a scalar operator. Given a tuple c=(cβ)β∈B of complex numbers, we denote by Jc the ideal of U(n) generated by all Δβ−cβ, β∈B. If, for each β∈B, Δβ acts on V by the scalar cβ, then, clearly, Jc⊆J. Further, since Z(n) is a polynomial ring and the center of U(n)/J is trivial, J is centrally generated if and only if J=Jc.
The following result was proved in [IP, Theorem 3.1] and [Ig1, Theorem 2.4].
Theorem 3.2. Suppose Φ is an irreducible root system of classical type, i.e., Φ=An−1, Bn, Cn or Dn. The following conditions on a primitive ideal J⊂U(n) are equivalent:
[TABLE]
If these conditions are satisfied, then the map ξ can be reconstructed from J.
The main result of the paper is to prove that this is also true for exceptional root systems, see Theorem Centrally generated primitive ideals of U(n) for exceptional types00footnotetext: The work was supported by the Foundation for the Advancement of Theoretical Physics and Mathematics ‘‘BASIS’’, grant no. 18–1–7–2–1. in Section 4. One of the key ingredients in the proof of Theorem Centrally generated primitive ideals of U(n) for exceptional types00footnotetext: The work was supported by the Foundation for the Advancement of Theoretical Physics and Mathematics ‘‘BASIS’’, grant no. 18–1–7–2–1. was to check that if condition (ii) is satisfied then Jc is primitive. To do this for An−1 and Cn, in [IP] an explicit set of generators of the quotient algebra U(n)/Jc was constructed. It turns out that these generators satisfy (up to scalars) the defining relations of the Weyl algebra As for s=∣Φ+∖B∣/2. Since As is simple and, as one can check, Jc=U(n), we conclude that U(n)/Jc≅As, and, consequently, Jc is primitive. On the other hand, for Bn and Dn, in [Ig1] an explicit set of generators for U(n)/Jc was constructed a posteriori (see [Ig1, Theorem 2.9]), while primitivity of Jc was established by another argument. In this section we modify the idea from [Ig1, Proposition 2.5] to check that Jc is primitive if cβ=0 for β∈B∖Δ for exceptional types.
To do this, we need some additional notation. From now to the end of this section we assume that Φ is an irreducible root system of exceptional type, i.e., Φ=E6, E7, E8, F4 or G2. Recall that β1 is the maximal root with respect to the natural order on Φ. It is obvious that (α,β1)≥0 for all α∈Φ+. We put Φ={α∈Φ∣(α,β1)=0} and Φ+=Φ∩Φ+, Δ=Φ∩Δ. Then Φ is of respective type D5, E6, E7, C3 or A1. Denote
[TABLE]
where ⟨⋅⟩C is the C-linear span. Then n is a Lie subalgebra of n isomorphic to the nilradical of the Borel subalgebra b=g∩b of the simple Lie algebra g with the root system Φ, where g is the subalgebra of g generated by the root vectors eα, α∈Φ.
On the other hand, k is an ideal of n isomorphic to the Heisenberg Lie algebra heis, where s=(∣Φ+∖Φ+∣−1)/2, with the center Ceβ1. (This follows from the fact that if α∈Φ+ and (α,β1)>0 then β1−α is again a positive root, see [Jo2, Corollary 2.3] for the details.) Recall that heis is the (2s+1)-dimensional Lie algebra with basis {z,\leavevmodexi,\leavevmodeyi,\leavevmode1≤i≤s} and relations [xi,\leavevmodeyi]=z for all i, [xi,z]=[yj,z]=[xi,yj]=0 for all i=j.
Given c1∈C×, denote by J1 the ideal of U(k) generated by eβ1−c1, so, clearly, U(k)/J1≅As. Since k is an ideal of the Lie algebra n, given x∈n, one can consider adx as a derivation of k. Since eβ1−c1 is a central element of U(n), one has adx(J1)⊆J1, so adx can be considered as a derivation of As. It is well known (see, e.g., [Di4, 10.1.1–10.1.4]) that there exists unique θ(x)∈As such that adx(y)=[θ(x),y] for all y∈As, and θ:n→As is a morphism of Lie algebras. Furthermore, there exists the unique epimorphism of associative algebras r:U(n)↠U(n)⊗As such that r(y)=1⊗y for y∈k and r(x)=x⊗1+1⊗θ(x) for x∈n. (Here a is the image of an element a∈U(k) under the canonical projection U(k)↠U(k)/J1≅As.) It turns out that the kernel of the epimorphism r coincides with the ideal J0 of U(n) generated by eβ1−c1 [Di4, Lemma 10.1.5].
Proposition 3.3. Let Jc be the ideal of U(n) generated by Δβ−cβ for all β∈B with cβ=0 for β∈B∖Δ. Then Jc is primitive.
Proof. Put c1=cβ1. Since r is surjective, r(Jc) is an ideal of U(n)⊗As generated by r(Δβ)−cβ, β∈B=B∖{β1}. Note that B is the Kostant cascade of Φ. Denote by Δβ, β∈Φ, the set of canonical generators of Z(n). We will show that, up to nonzero scalar, r(Δβ) coincides with Δβ⊗1 for all β∈B.
To check this fact, we will use Tables Centrally generated primitive ideals of U(n) for exceptional types00footnotetext: The work was supported by the Foundation for the Advancement of Theoretical Physics and Mathematics ‘‘BASIS’’, grant no. 18–1–7–2–1., Centrally generated primitive ideals of U(n) for exceptional types00footnotetext: The work was supported by the Foundation for the Advancement of Theoretical Physics and Mathematics ‘‘BASIS’’, grant no. 18–1–7–2–1., Centrally generated primitive ideals of U(n) for exceptional types00footnotetext: The work was supported by the Foundation for the Advancement of Theoretical Physics and Mathematics ‘‘BASIS’’, grant no. 18–1–7–2–1.. Pick a root β∈B. Since r is surjective, r(Δβ) is central in U(n)⊗As. The center of this algebra has the form Z(n)⊗C, so in fact r(Δβ)∈Z(n)⊗C. Denote h=g∩h, so h is a Cartan subalgebra of g and b=h⊕n as vector spaces. By [Ko2, Theorem 6] (see also [Jo1, Lemma 4.4]), Z(n) (respectively, Z(n)) is a direct sum of one-dimensional weight spaces of h (respectively, of h) with respect to the adjoint action of the corresponding Cartan subalgebras. Since [h,eβ1]=0 for all h∈h, the algebra h naturally acts on As, and so on U(n)⊗As. We define the result of this action by h.x, h∈h, x∈U(n)⊗As. Hence it is enough to check that, given β∈B, r(Δβ) is a nonzero h-weight element of weight μβ=μβ−rβ(β1)β1, because rβ(β1) is just the coefficient of β1 in the expression of μβ as a linear combination of roots from B.
To prove that r(Δβ) is an h-weight element of weight μβ, denote the result of the natural (adjoint) action of h on U(n) by h⋅x, h∈h, x∈U(n). As above, since h⋅eβ1=0, the algebra h naturally acts on U(n)/J0 by the formula h⋅r(x)=r(h⋅x). We claim that this action coincides with the action of h on U(n)⊗As defined above, i.e., h.x=h⋅x for all h∈h, x∈U(n)⊗As.
Indeed, if y∈k, then
[TABLE]
as required. On the other hand, if eα∈n for some root α∈Φ+, then, by [Jo1, Subsection 4.8], θ(eα) is a linear combination of elements of the form eα+γeβ1−γ, γ∈Φ+∖Φ+ (i.e., (γ,β1)>0). We conclude that
[TABLE]
because β1(h)=0. Thus, we obtain
[TABLE]
It remains to note that Δβ is an h-weight element of U(n) of weight rβ(β1)β1+μβ, but β1(h)=0.
To show that r(Δβ)=0, recall that the kernel of r is J0. If Δβ∈J0 (i.e., if Δβ=(eβ1−cβ1)a for some a∈U(n)), then, clearly, a∈Z(n). But this contradicts the fact that Δβ and Δβ1 are algebraically independent, because, as one can deduce from [Pa2], Δβ1=eβ1 for all irreducible root systems.
So, given β∈B, there exists unique aβ∈C× such that r(Δβ)=aβΔβ⊗1. Consequently, r(Jc) is generated by Δβ⊗1−cβ, β∈B, where cβ=aβ−1cβ. In particular, cβ=0 if β∈B is not a simple root of Φ+. Now we will use the induction on rkΦ to prove that Jc is primitive. The base (i.e., the case of classical Φ of low rank) immediately follows from [IP, Theorem 3.1] and [Ig1, Theorem 2.4]. Denote by Jc the ideal of U(n) generated by Δβ−cβ, β∈B. By the inductive assumption, Jc is a primitive ideal of U(n), so U(n)/Jc≅At for certain t. We conclude that
[TABLE]
Thus, Jc is primitive. The proof is complete.□
4. Distinct coadjoint orbits
Recall that, given a primitive ideal J in U(n), there exist unique scalars cβ∈C such that Δβ−cβ∈J for all β∈B. To prove our main result, Theorem Centrally generated primitive ideals of U(n) for exceptional types00footnotetext: The work was supported by the Foundation for the Advancement of Theoretical Physics and Mathematics ‘‘BASIS’’, grant no. 18–1–7–2–1., we need to check that if J is centrally generated then cβ=0 for β∈B∖Δ. To do this, we will prove that certain coadjoint N-orbits on n∗ are distinct.
Namely, let D be a subset of Φ+. To each map ξ:D→C× one can assign the linear form
[TABLE]
Denote by ΩD,ξ the coadjoint N-orbit of fD,ξ. We say that fD,ξ and ΩD,ξ are associated with the subset D. For example, fD,ξ is a Kostant form if and only if B∖Δ⊂D⊂B.
It was proved in [Pa1, Corollary 1.4] that if Φ=An−1, D is an orthogonal subset (i.e., (α,β)=0 for all α,\leavevmodeβ∈D, α=β) and ξ1, ξ2 are two distinct maps from D to C× then ΩD,ξ1=ΩD,ξ2. It is not hard to deduce from this result that the same is true for all classical root systems, see the proofsof [IP, Theorem 3.1] and [Ig1, Theorem 2.4]. But for exceptional types this is not an immediate consequence of the result for An−1. In this section, we prove that if ξ1=ξ2 then ΩD,ξ1 and ΩD,ξ2 are distinct for some particular orthogonal subsets D and some particular maps ξ1, ξ2, which will be used in the next section in the proof of our main result.
To do this, we need to introduce the notion of singular roots.
**Definition 4.1. **Let β, α be positive roots. We say that α is β-singular (or singular for β) if there exists γ∈Φ+ such that β=α+γ. The set of all β-singular roots is denoted by S(β).
Note that if Φ is irreducible and simple-laced (i.e., if all roots in Φ have the same length) then, given β>α, α is β-singular if and only if (α,β)>0. It turns out that if D is an orthogonal subset of Φ+, ξ is a map from D to C×, and β, β′∈D are such that β′∈S(β) then ΩD,ξ=ΩD′,ξ′, where D′=D∖β′ and ξ′ is the restriction of ξ to D′ [Ig2, Lemma 1.3].
Proposition 4.2. Let Φ be an irreducible root system, and let D be a subset of Φ+ such that if β1, β2∈D then β1∈/S(β2). Let β0 be a root in D, and let ξ1, ξ2 be maps from D to C× for which ξ1(β0)=ξ2(β0). Fix a total order ≤t on {eα,\leavevmodeα∈Φ+} such that if α>β then eα<teβ. Assume that there exists a simple root α0∈Δ satisfying (α0,β0)=0 and (α0,β)=0 for all β∈D such that eβ<teβ0. Then ΩD,ξ1=ΩD,ξ2.
Proof. As usual, given a vector space V, we denote by gl(V) the Lie algebra of all linear operators on V. Recall that Φ is the root system of the Lie algebra g. Denote by ad:g→gl(g) the adjoint representation of the Lie algebra g, i.e., ad(x)=adx. It is well known that the adjoint representation is faithful, so ad(g) and g are isomorphic as Lie algebras. Let rkΦ=n. To each simple root αi, 1≤i≤n, one can assign unique hαi∈h such that αi(hαj)=2(αi,αj)/(αj,αj) for all i,\leavevmodej. Recall that {eα,\leavevmodeα∈Φ+} is a basis of n. It can be uniquely extended to the Chevalley basis {eα,\leavevmodeα∈Φ+}∪{hαi,\leavevmode1≤i≤n}∪{e−α,\leavevmodeα∈Φ+} of g. We extend the total order ≤t on the set {eα.\leavevmodeα∈Φ++} to a total order ≤t on this basis such that eα<thαi<te−β for all α,β∈Φ+, 1≤i≤n, and eα<teβ if α,β∈Φ and α>β. This identifies gl(g) with the Lie algebra gldimg(C), and ad(n) with a subalgebra of the Lie algebra u of all upper-triangular matrices from gldimg(C) with zeroes on the diagonal.
Let GL(V) be the group of all invertible linear operators on a vector space V. Since we fixed a basis in g, the group GL(g) is identified with the group GLdimg(C), and expad(n)≅N is identified with a subgroup of the group U of all upper-triangular matrices from GLdimg(C) with 1’s on the diagonal. Furthermore, using the Killing form on g and the trace form on gl(g), one can identify n∗ with the space n−=⟨e−α,\leavevmodeα∈Φ+⟩C and u∗ with the space u−=uT, where the superscript T denote the transposed matrix. Under these identifications, it is enough to check that the coadjoint U-orbits of the linear forms fD,ξ1 and fD,ξ2 are distinct. Here, given ξ:D→C×, we denote by fD,ξ the matrix
[TABLE]
To do this, we will study the matrix f=fD,ξ in more detail. The rows and the columns of matrices from gl(g) are now indexed by the elements of the Chevalley basis fixed above. Given a matrix x from gl(g) and basis elements a,\leavevmodeb, we will denote by xa,b the entry of x lying in the ath row and the bth column. Since
[TABLE]
we obtain fhα0,eβ0=−ξ(β0)(α0,α0)2(α0,β0)=0. One may assume without loss of generality that hα0>thαi for all αi=α0. We claim that
[TABLE]
Indeed, if α∈/D then, evidently, fhα0,eα=0. If α=β∈D and eβ<teβ0 then (α0,\leavevmodeβ)=0, hence
[TABLE]
because (α0,β)=0. On the other hand, if fe−γ,eβ0=0 for some γ∈Φ+ then β0=β−γ. This contradicts the condition β0∈/S(β).
Thus, (fD,ξ1)hα0,eα and (fD,ξ2)hα0,eα are different nonzero scalars, and (6) is satisfied both for f=fD,ξ1 and for f=fD,ξ2. Now it follows immediately from the proof of [An, Proposition 3] that the coadjoint U-orbits of these matrices are distinct, and, consequently, ΩD,ξ1=ΩD,ξ2, as required.□
Now, for exceptional Φ, we will prove an existence of certain subsets D⊂Φ+. To each such subset D from this list we assign its subset D′⊂D. Using Proposition Centrally generated primitive ideals of U(n) for exceptional types00footnotetext: The work was supported by the Foundation for the Advancement of Theoretical Physics and Mathematics ‘‘BASIS’’, grant no. 18–1–7–2–1., we will show that if ξ1 and ξ2 are two maps from D to C× such that ξ1(β0)=ξ2(β0) for some root β0∈D′ then ΩD,ξ1=ΩD,ξ2, see Proposition Centrally generated primitive ideals of U(n) for exceptional types00footnotetext: The work was supported by the Foundation for the Advancement of Theoretical Physics and Mathematics ‘‘BASIS’’, grant no. 18–1–7–2–1. below. We will consider all exceptional root systems subsequently. For brevity, we use the following notation. If β=∑i=1nmiαi∈D then we write m1…mn instead of β (our enumeration of simple roots is as in (1)). Note that in all cases, except 11, 12 and 14 for F4 (see Table Centrally generated primitive ideals of U(n) for exceptional types00footnotetext: The work was supported by the Foundation for the Advancement of Theoretical Physics and Mathematics ‘‘BASIS’’, grant no. 18–1–7–2–1. in the proof of Proposition Centrally generated primitive ideals of U(n) for exceptional types00footnotetext: The work was supported by the Foundation for the Advancement of Theoretical Physics and Mathematics ‘‘BASIS’’, grant no. 18–1–7–2–1. below), D is an orthogonal subset of Φ, while in cases 11, 12, 14 for F4 all inner products of distinct roots from D are non-positive. Note also that all these subsets are linearly independent.
Proposition 4.3. Let Φ be an irreducible root system of exceptional type. Denote by c an m-tuple c=(cβ1,\leavevmode…,\leavevmodecβm), m=∣B∣, and assume that cβi=0 for some βi∈B∖Δ. There exist subsets D,\leavevmodeD′⊂Φ+ such that D is linearly independent, D′⊂D, and the following conditions are satisfied:
[TABLE]
Furthermore, let μβi=∑γ∈Daγ,βiγ,\leavevmode1≤i≤m,\leavevmodecβi=0. Then, for β0∈D, the solution space of the system of linear equations ∑γ∈Daγ,βiyγ=bi,\leavevmode1≤i≤m,\leavevmodecβi=0, is not orthogonal to the axis yβ0 if and only if β0∈D′.
Proof. The proof is case-by-case. Below we present the list of the subsets D, D′ and the correspondence between these subsets and m-tuples c for E6, F4 and G2.□
Table 4. List of the subsets D and D′ for E6
Table 5. List of the subsets D and D′ for F4
Table 6. Correspondence between c and D for E6 and F4
Table 7. List of the subsets D and D′ and correspondence between c and D for G2
The root systems E7, E8 can be considered similarly. We list the subsets D, D′ and prove the correspondence between c and D for E7 and E8 in Appendix A. (In fact, we just checked all orthogonal subsets of Φ+ to find subsets satisfying the required conditions using Python Programming Language [Py]. The listing of the code is presented in Appendix B.)
Proposition 4.4. Let Φ be an irreducible root system of exceptional type, and let D⊂Φ+ be a subset from Proposition Centrally generated primitive ideals of U(n) for exceptional types00footnotetext: The work was supported by the Foundation for the Advancement of Theoretical Physics and Mathematics ‘‘BASIS’’, grant no. 18–1–7–2–1.. Let ξ1, ξ2 be maps from D to C×. There exists a root β0∈D′ such that if ξ1(β0)=ξ2(β0) then ΩD,ξ1=ΩD,ξ2.
Proof. Note that if β1,\leavevmodeβ2∈D then β1∈/S(β2). Indeed, for E6, E7 and E8 this follows from the fact that (β1,\leavevmodeβ2)≤0 for all distinct roots β1, β2∈D and the comment before Proposition Centrally generated primitive ideals of U(n) for exceptional types00footnotetext: The work was supported by the Foundation for the Advancement of Theoretical Physics and Mathematics ‘‘BASIS’’, grant no. 18–1–7–2–1.. For F4 and G2, this can be checked directly. According to Proposition Centrally generated primitive ideals of U(n) for exceptional types00footnotetext: The work was supported by the Foundation for the Advancement of Theoretical Physics and Mathematics ‘‘BASIS’’, grant no. 18–1–7–2–1., it is enough to check that there exist a simple root α0 and a root β0∈D′ such that (α0,β0)=0 and (α0,β)=0 for all β∈D∖D′. (Indeed, one can pick β0 such that eβ0 is minimal with respect to the total order ≤t from Proposition Centrally generated primitive ideals of U(n) for exceptional types00footnotetext: The work was supported by the Foundation for the Advancement of Theoretical Physics and Mathematics ‘‘BASIS’’, grant no. 18–1–7–2–1. among all eβ, β∈D′, for which β is not orthogonal to α0.) The existence of such roots follows from Proposition Centrally generated primitive ideals of U(n) for exceptional types00footnotetext: The work was supported by the Foundation for the Advancement of Theoretical Physics and Mathematics ‘‘BASIS’’, grant no. 18–1–7–2–1. (iv). For example, consider case 10 for Φ=E6. Here
[TABLE]
Then β0=α3+α4 and α0=α4 satisfy all the conditions of Proposition Centrally generated primitive ideals of U(n) for exceptional types00footnotetext: The work was supported by the Foundation for the Advancement of Theoretical Physics and Mathematics ‘‘BASIS’’, grant no. 18–1–7–2–1., hence ΩD,ξ1=ΩD,ξ2.□
5. Proof of the main result
We are now ready to formulate and, using the previous sections, prove our main result, Theorem Centrally generated primitive ideals of U(n) for exceptional types00footnotetext: The work was supported by the Foundation for the Advancement of Theoretical Physics and Mathematics ‘‘BASIS’’, grant no. 18–1–7–2–1. (cf. Theorem Centrally generated primitive ideals of U(n) for exceptional types00footnotetext: The work was supported by the Foundation for the Advancement of Theoretical Physics and Mathematics ‘‘BASIS’’, grant no. 18–1–7–2–1.). Note that each element of S(n) can be considered as a polynomial function on n∗ via the natural isomorphism (n∗)∗≅n.
Theorem 5.1. Suppose Φ is an irreducible root system of exceptional type, i.e., Φ=E6, E7, E8, F4 or G2. The following conditions on a primitive ideal J⊂U(n) are equivalent:
[TABLE]
If these conditions are satisfied, then the map ξ can be reconstructed from J.
Proof. (ii)⟹(iii). Recall that two N-orbits of distinct linear form from
[TABLE]
are disjoint, and the union X of all such orbits is an open dense subset of n∗; in fact, X is a single B-orbit. Given βi∈B and t∈R,
[TABLE]
see Remark Centrally generated primitive ideals of U(n) for exceptional types00footnotetext: The work was supported by the Foundation for the Advancement of Theoretical Physics and Mathematics ‘‘BASIS’’, grant no. 18–1–7–2–1. (iii). Furthermore, from Remark Centrally generated primitive ideals of U(n) for exceptional types00footnotetext: The work was supported by the Foundation for the Advancement of Theoretical Physics and Mathematics ‘‘BASIS’’, grant no. 18–1–7–2–1. (i), (ii) we see that actually
[TABLE]
We claim that there exists a unique map ξ:B→C× such that ξ(β)=0 for β∈B∖Δ and the Kostant form fξ satisfies ξβi(fξ)=cβi for all βi∈B. Indeed, since
[TABLE]
belongs to R, the Zariski closure of R in n∗, we obtain that
[TABLE]
for all i from 1 to m. Since ξβ1=eβ1, we must set ξ(β1)=cβ1. Now, assume that i>1 and that ξβj is already defined for all j<i so that ξβj(fξ)=cβj. Then one can put ξ(βi) to be equal to cβi∏j<iξ(βj)−rβi(βj), so that ξβi(fξ)=cβi, as required. Note that, according to Remark Centrally generated primitive ideals of U(n) for exceptional types00footnotetext: The work was supported by the Foundation for the Advancement of Theoretical Physics and Mathematics ‘‘BASIS’’, grant no. 18–1–7–2–1. (i), if ξ(βj)=0 for some j<i then βj∈B∩Δ, and, consequently, rβi(βj)=0. Thus, βj does not actually occurs in the expression of μβi and we do not divide by zero in the definition of ξ(βi).
Now, let ξ:B→C× be such that ξβi(fξ)=cβi for all i. Then, by [Di4, 6.6.9 (c)], J(fξ) contains Δβi−cβi for all i, hence J(fξ) contains the centrally generated ideal Jc, which is generated by definition by all Δβi−cβi, 1≤i≤m. But, thanks to Proposition Centrally generated primitive ideals of U(n) for exceptional types00footnotetext: The work was supported by the Foundation for the Advancement of Theoretical Physics and Mathematics ‘‘BASIS’’, grant no. 18–1–7–2–1., Jc is primitive. Thus, both J(fξ) and Jc are primitive (and so maximal), hence J(fξ)=Jc.
for all βi∈B, hence cβi=0 for βi∈B∖Δ. The ideal J=J(fξ) contains the centrally generated ideal Jc, and condition (ii) is satisfied, so Jc is primitive and J=J(fξ)=Jc, as required.
(i)⟹(ii). This is the most interesting and complicated part of the proof. Let J be a centrally generated primitive ideal of U(n). Denote by c the m-tuple c=(cβ1,\leavevmode…,\leavevmodecβm) and assume that cβi=0 for some βi∈B∖Δ. To such an m-tuple we assign subsets D′⊂D⊂Φ+ from Proposition Centrally generated primitive ideals of U(n) for exceptional types00footnotetext: The work was supported by the Foundation for the Advancement of Theoretical Physics and Mathematics ‘‘BASIS’’, grant no. 18–1–7–2–1..
Our next claim is that there exists a map η from D to the field of rational functions C(x) satisfying the following conditions (here, given z∈C×, we denote by η(z) the map from D to C× defined by D∋γ↦η(γ)(z)):
[TABLE]
To construct such a map η, we first note that if cβi=0 then μβi can be uniquely expressed as a Z≥0-linear combination of the roots from D, i.e., there exist unique aγ,βi∈Z≥0, γ∈D, satisfying
[TABLE]
Indeed, the uniqueness follows from the linear independence of D (Proposition Centrally generated primitive ideals of U(n) for exceptional types00footnotetext: The work was supported by the Foundation for the Advancement of Theoretical Physics and Mathematics ‘‘BASIS’’, grant no. 18–1–7–2–1. (i)), while the existence is implied by Proposition Centrally generated primitive ideals of U(n) for exceptional types00footnotetext: The work was supported by the Foundation for the Advancement of Theoretical Physics and Mathematics ‘‘BASIS’’, grant no. 18–1–7–2–1. (iii). For instance, if the root system Φ is of type E6 and
[TABLE]
is the 8th subset from Table Centrally generated primitive ideals of U(n) for exceptional types00footnotetext: The work was supported by the Foundation for the Advancement of Theoretical Physics and Mathematics ‘‘BASIS’’, grant no. 18–1–7–2–1. then
[TABLE]
This means that, given a map ξ:D→C×, the value of at most one monomial of ξβi at the linear form fD,ξ is non-zero (precisely, the monomial eD=∏γ∈Deγaγ,βi). Indeed, the value of fD,ξ on a monomial is nonzero if and only if all variables involved in this monomial has the form eγ for γ∈D, but all monomials of ξβi have weight μβi. (We see that if cβj=0 then ξβj(fD,ξ)=0 by Proposition Centrally generated primitive ideals of U(n) for exceptional types00footnotetext: The work was supported by the Foundation for the Advancement of Theoretical Physics and Mathematics ‘‘BASIS’’, grant no. 18–1–7–2–1. (ii).) Note, however, that a priori we do not know that the monomial eD in fact occurs in ξβi.
To check that eD occurs in ξβi, we consider the subset
[TABLE]
(Actually, β1∈D if and only if cβ1=0.) Given a map ξ:D→C×, we consider a map ξ1:D1→C× such that ξ1(γ)=ξ(γ) for γ∈D, and the linear form f1, where
[TABLE]
Clearly, eD(fD,ξ)=eD(f1). On the other hand, one can easily check that the condition f1(eβ1)=0 implies that there exists a linear form λ in the coadjoint N-orbit of f1 such that λ(eβ)=0 for all β∈B. By Remark Centrally generated primitive ideals of U(n) for exceptional types00footnotetext: The work was supported by the Foundation for the Advancement of Theoretical Physics and Mathematics ‘‘BASIS’’, grant no. 18–1–7–2–1. (iii), eB=∏β∈Beβrβi(β) enters ξβi with coefficient 1, and eB(λ)=0. But λ=g.f1 for a certain g∈N, where g.f1 denotes the result of the coadjoint action of N on n∗. The adjoint action of N on the algebra S(n) has the form
[TABLE]
We see that (g−1.eB)(f1)=eB(λ)=0. But ξβi in N-invariant, so the monomial g−1.eB occurs in ξβ (with coefficient 1). Thus, the latter monomial coincides with cDieD for certain cDi∈C×.
Next, we note that the (affine) solution space for the system of linear equations
[TABLE]
is at least one-dimensional for all possible bi∈C. Indeed, k=∣D∣ is in fact not less than the number of non-zero scalars in c plus one, so this system on k variables contains at most (k−1) equations. It follows from Panov’s description of the weights μβi [Pa2, p. 8] that the equations are linearly independent, and the rank of the system is at most (k−1). Hence the solution space is at least one-dimensional, as required. Recall that D′ is exactly the set of roots γ∈D for which the solution space is not orthogonal to the axis yγ.
We are ready to construct a map η satisfying the above conditions. Assume that such a map is already constructed. Then, given z∈C×,
[TABLE]
Let bi=cβi−cDi, and y=(yγ)γ∈D be a solution of system (8). Then, clearly, ∏γ∈Dxγaγ,βi=cβi(cDi)−1 for all i, where xγ=exp(yγ). Let {yγ(t)}γ∈D be a one-dimensional affine subspace of the space of solutions of (8) not orthogonal to the axes yγ for γ∈D′. Note that each yγ(t), γ∈D, is an affine-linear function in t. We set x=exp(t) and η(γ)(x)=exp(yγ(t)) for γ∈D, then η(γ) is a rational function in x. Condition (iii) is satisfied by the definition of η, condition (ii) is obvious. Finally, condition (i) is satisfied because the subspace {yγ(t)}γ∈D is not orthogonal to the axis yγ for γ∈D′.
For example, if Φ=E6 and D={γ1,\leavevmodeγ2,\leavevmodeγ3,\leavevmodeγ4} is, as above, the 8th subset from Table Centrally generated primitive ideals of U(n) for exceptional types00footnotetext: The work was supported by the Foundation for the Advancement of Theoretical Physics and Mathematics ‘‘BASIS’’, grant no. 18–1–7–2–1., then one can put
[TABLE]
(Here, given a∈C, we denote by a1/2 a complex number such that (a1/2)2=a.) Another example: if Φ=E6 and D={γ1=α3+α4+α5+α6,\leavevmodeγ2=α1+2α2+2α3+3α4+2α5+α6,\leavevmodeγ3=α1+α3+α4+α5} is the 11th subset from Table Centrally generated primitive ideals of U(n) for exceptional types00footnotetext: The work was supported by the Foundation for the Advancement of Theoretical Physics and Mathematics ‘‘BASIS’’, grant no. 18–1–7–2–1., then D′={γ1,\leavevmodeγ3} and
[TABLE]
In general, let η:D→C(x) be a map satisfying conditions (i), (ii), (iii). Since ξβi(fD,η(z))=cβi for all i and all z∈C×, one has J⊂J(fD,η(z)) for all z∈C×. But both J and J(fD,η(z)) are maximal, hence J=J(fD,η(z)) for all z∈C×. Pick a root β0∈D′ satisfying Proposition Centrally generated primitive ideals of U(n) for exceptional types00footnotetext: The work was supported by the Foundation for the Advancement of Theoretical Physics and Mathematics ‘‘BASIS’’, grant no. 18–1–7–2–1.. Since η(β0) is non-constant, there exist z1,\leavevmodez2∈C× such that η(β0)(z1)=η(β0)(z2). By Proposition Centrally generated primitive ideals of U(n) for exceptional types00footnotetext: The work was supported by the Foundation for the Advancement of Theoretical Physics and Mathematics ‘‘BASIS’’, grant no. 18–1–7–2–1., the coadjoint orbits of fD,η(z1) and fD,η(z2) do not coincide. Hence J(fD,η(z1))=J(fD,η(z2)), a contradiction.
Finally, if conditions (i)–(iii) are satisfied then formula (7) and the equality Δβ1=eβ1 together imply that the map ξ can be reconstructed from J. The proof is complete.□
As an immediate corollary, we obtain that a similar result is true for all (probably, reducible) root systems.
Theorem 5.2. Let Φ be an arbitrary root system. The following conditions on a primitive ideal J⊂U(n) are equivalent:
[TABLE]
If these conditions are satisfied, then the map ξ can be reconstructed from J.
Proof. Let Φi, 1≤i≤k, be the irreducible components of the root system Φ, and let n=⨁i=1knk be the corresponding division of n into a direct sum of its nilpotent ideals, so U(n)=U(n1)⊗…⊗U(nk) as associative algebras.
(ii)⟹(iii). Denote Δi=Δ∩Φi and Bi=B∩Φi for 1≤i≤k, so Δi is a basis for Φi such that Φi+=Φ+∩Φi, and Bi is the Kostant cascade in Φi+. Put also Ji=J∩U(ni), so Ji is an ideal of U(ni) containing all Δβ−cβ, β∈Bi. Since cβ=0 for β∈Bi∖Δi, Theorem Centrally generated primitive ideals of U(n) for exceptional types00footnotetext: The work was supported by the Foundation for the Advancement of Theoretical Physics and Mathematics ‘‘BASIS’’, grant no. 18–1–7–2–1., [IP, Theorem 3.1] and [Ig1, Theorem 2.4] imply that Ji is a primitive ideal of U(ni). Furthermore, for each i, there exists a map ξi:Bi→C such that fξi is a Kostant form on ni and Ji=J(fξi). Define ξ to be the map from B to C such that ξ(β)=ξi(β) for β∈Bi, so fξ is a Kostant form on n. Now, let Jc be, as above, the ideal of U(n) generated by Δβ−cβ, β∈B. Then Jc is contained both in J and in J(fξ). But the quotient algebra U(ni)/Ji is isomorphic to the Weyl algebra Asi for certain si≥1. Thus,
[TABLE]
where s=s1+…+sk, because Aa⊗Ab≅Aa+b. It follows that Jc is primitive (and so maximal), hence J=Jc=J(fξ).
(iii)⟹(i). Denote by ξi the restriction of ξ to Bi, 1≤i≤k. Again by Theorem Centrally generated primitive ideals of U(n) for exceptional types00footnotetext: The work was supported by the Foundation for the Advancement of Theoretical Physics and Mathematics ‘‘BASIS’’, grant no. 18–1–7–2–1.,[IP, Theorem 3.1] and [Ig1, Theorem 2.4], each J(fξi) is a centrally generated primitive ideal of U(ni), and cβ=0 for all β∈Bi∖Δi (and so for all β∈B∖Δ). And we see again that the centrally generated ideal Jc is primitive and at the same time is contained in J=J(fξ), thus, J=Jc.
(i)⟹(ii). Assume that there exists β∈B∖Δ such that cβ=0. Let A be the set of all indices a between 1 and k such that there exists β∈Ba∖Δa for which cβ=0. It follows from the proofs of Theorem Centrally generated primitive ideals of U(n) for exceptional types00footnotetext: The work was supported by the Foundation for the Advancement of Theoretical Physics and Mathematics ‘‘BASIS’’, grant no. 18–1–7–2–1., [IP, Theorem 3.1] and [Ig1, Theorem 2.4] that, given a∈A, there exist Da⊂Φj+ and distinct maps ξa1, ξa2 from Da to C× such that
[TABLE]
for all β∈Ba, and the coadjoint orbits of fDa,ξa1 and fDa,ξa2 (in na∗) are distinct.
One the other hand, if i∈{1,\leavevmode…,\leavevmodek}∖A then cβ=0 for all β∈Bi∖Δi. Hence, as above, J∩U(ni)=J(fξi) for a certain map ξi:D→C (in other words, fξi is a Kostant form on ni and ξβ(fξi)=cβ for all β∈Bi). Clearly, if f∈n∗ is a linear form on n and fj is its restriction to nj, 1≤j≤k, then
[TABLE]
where Ωf (respectively, Ωfj) is the coadjoint orbit of the linear form f in n∗ (respectively, of the linear form fj in nj∗). Now, put
[TABLE]
and define ξj:D→C, j=1,2, by the rule
[TABLE]
Put fj=fD,ξj for j=1,\leavevmode2, so
[TABLE]
where Ωξi is the coadjoint orbit of the Kostant form fξi in ni∗. Since ΩDa,ξa1=ΩDa,ξa2 for at least one a∈A, one has Ωf1=Ωf2, so J(f1)=J(f2). At the same time, both maximal ideals contain the maximal ideal J, a contradiction.
Finally, if conditions (i)–(iii) are satisfied then the map ξ can be reconstructed from J, because the restriction of ξ to Bi can be reconstructed from Ji for all i. The proof is complete.□
Supplementary material. The online version of this article contains additional supplementary material (analogues of Tables Centrally generated primitive ideals of U(n) for exceptional types00footnotetext: The work was supported by the Foundation for the Advancement of Theoretical Physics and Mathematics ‘‘BASIS’’, grant no. 18–1–7–2–1., Centrally generated primitive ideals of U(n) for exceptional types00footnotetext: The work was supported by the Foundation for the Advancement of Theoretical Physics and Mathematics ‘‘BASIS’’, grant no. 18–1–7–2–1., Centrally generated primitive ideals of U(n) for exceptional types00footnotetext: The work was supported by the Foundation for the Advancement of Theoretical Physics and Mathematics ‘‘BASIS’’, grant no. 18–1–7–2–1., Centrally generated primitive ideals of U(n) for exceptional types00footnotetext: The work was supported by the Foundation for the Advancement of Theoretical Physics and Mathematics ‘‘BASIS’’, grant no. 18–1–7–2–1. for the root systems E7, E8 and the listing of the code generating these analogues). Please visit https://arxiv.org/pdf/1907.04219.pdf.
References
[An]
C.A.M. André. Basic sums of coadjoint orbits of the unitriangular group. J. Algebra 176 (1995), 959–1000.
[BGR]
W. Borho, P. Gabriel, R. Rentschler. Primideale in Einhu¨llenden auflo¨sbarer Lie-Algebren, Lecture Notes in Math. 357. Springer–Verlag, Berlin, 1973.
[Bo]
N. Bourbaki. Lie groups and Lie algebras. Chapters 4–6, Springer, 2002.
[Di1]
J. Dixmier. Représentations irréductibles des algèbres de Lie nilpotentes. An. Acad. Brasil Ci. 35 (1963), 491–519.
[Di2]
J. Dixmier. Représentations irréductibles des algèbres de Lie résolubles. J. Math. Pures Appl. 45 (1966), 1–66.
[Di3]
J. Dixmier. Idéaux primitifs dans les algèbres enveloppantes, preprint, Paris, 1976.
[Di4]
J. Dixmier. Enveloping algebras. Grad. Stud. in Math. 11. AMS, 1996.
[Ig1]
M.V. Ignatyev. Centrally generated primitive ideals of U(n) in types B and D. Transformation Groups 24 (2019), no. 4, 1067–1093; arXiv: math.RT/1709.09543.
[Ig2]
M.V. Ignatyev. Orthogonal subsets of root systems and the orbit method (in Russian). Algebra i Analiz 22 (2010), no. 5, 104–130. English translation: St. Petersburg Math. J. 22 (2011), no. 5, 777–794; arXiv: math.RT/1007.5220.
[IP]
M.V. Ignatyev, I. Penkov. Infinite Kostant cascades and centrally generated primitive ideals of U(n) in types A∞, C∞. J. Algebra 447 (2016), 109–134; arXiv: math.RT/1502.05486.
[Jo1]
A. Joseph. A preparation theorem of the prime spectrum of a semisimple Lie algebra. J. Algebra 48 (1977), 241–289.
[Jo2]
A. Joseph. The minimal orbit in a simple Lie algebra and its associated maximal ideal. Annales scientifiques de l’École Normale Supérieure (Série 4) 9 (1976), no. 1, 1–29.
[Ki2]
A.A. Kirillov. Lectures on the orbit method. Grad. Stud. in Math. 64, AMS, 2004.
[Ko1]
B. Kostant. The cascade of orthogonal roots and the coadjoint structure of the nilradical of a Borel subgroup of a semisimple Lie group. Moscow Math. J. 12 (2012), no. 3, 605–620.
[Ko2]
B. Kostant. Center of U(n), cascade of orthogonal roots and a construction of Lipsman–Wolf. In: A. Huckleberry, I. Penkov, G, Zuckerman, eds. Lie groups: structure, actions and representations, Progr. in Math. 306. Birkha¨user, 2013, 163–174.
[Pa1]
A.N. Panov. Involutions in Sn and associated coadjoint orbits (in Russian). Zapiski nauchn. sem. POMI 349 (2007), 150–173. English transl.: J. Math. Sci. 151 (2008), no. 3, 3018–3031.
[Pa2]
A.N. Panov. Reduction of spherical functions (in Russian). Vestnik SamGU. Estestv. Ser. 2010, no. 6(80). English transl.: arXiv: math.RT/0911.2369.
[Py]
Python Programming Language (Version 3.8.3). Python Software Foundations, 2020, available at https://www.python.org/.
[Ve]
M. Vergne. Construction de sous-algèbres subordonnées à un élément du dual d’une algèbre de Lie résoluble. C. R. Acad. Sci. Paris Ser. A–B 270 (1970), A173–A175.
Mikhail V. Ignatyev: Samara National Research University, Ak. Pavlova 1, 443011,
Below we present the listing of the code generating tables from Appendix A.
Code for E7:
import time
import copy
print(time.ctime())
positive_roots=[’0100000’, ’0101000’, ’0101100’, ’0101110’, ’0101111’,
’0111000’, ’0111100’, ’0111110’, ’0111111’, ’0112100’,
’0112110’, ’0112111’, ’0112210’, ’0112211’, ’0112221’,
’0010000’, ’0011000’, ’0011100’, ’0011110’, ’0011111’,
’0001000’, ’0001100’, ’0001110’, ’0001111’, ’0000100’,
’0000110’, ’0000111’, ’0000010’, ’0000011’, ’0000001’,
’2234321’, ’1223210’, ’1223211’, ’1223221’, ’1111000’,
’1223321’, ’1111100’, ’1111110’, ’1111111’, ’1224321’,
’1112100’, ’1112110’, ’1112111’, ’1112210’, ’1112211’,
’1112221’, ’1000000’, ’1234321’, ’1122100’, ’1122110’,
’1122111’, ’1122210’, ’1122211’, ’1122221’, ’1010000’,
’1123210’, ’1123211’, ’1123221’, ’1011000’, ’1123321’,
’1011100’, ’1011110’, ’1011111’]
dim=7
scalar_product_matrix=[[2, 0, -1, 0, 0, 0, 0], [0, 2, 0, -1, 0, 0, 0],
[-1, 0, 2, -1, 0, 0, 0], [0, -1, -1, 2, -1, 0, 0],
[0, 0, 0, -1, 2, -1, 0], [0, 0, 0, 0, -1, 2, -1],
[0, 0, 0, 0, 0, -1, 2]]
def dot_product(alpha,beta):
sum=0
for i in range(0,len(alpha)):
for j in range(0,len(beta)):
sum=sum+int(alpha[i])int(beta[j])scalar_product_matrix[i][j]
return(sum)
def dot_product_matrix():
list_dot_products=[]
n=len(positive_roots)
for i in range(0,n):
list_dot_products.append([])
for j in range(0,n):
list_dot_products[i].append(dot_product(positive_roots[i],
positive_roots[j]))
return(list_dot_products)
dpm=dot_product_matrix()
print(’matrix calculated’)
print(time.ctime())
def test_orth(list_of_roots):
n=len(list_of_roots)
b=1
for i in range(0,n-1):
for j in range(i+1,n):
if (dpm[list_of_roots[i]][list_of_roots[j]])!=0.0:
b=0
return(b)
def root_to_list(alpha):
result_list=[]
for i in range(0,len(alpha)):
result_list.append(int(alpha[i]))
return(result_list)
def positive_roots_list():
result_list=[]
for i in range(0,len(positive_roots)):
result_list.append(root_to_list(positive_roots[i]))
return(result_list)
prl=positive_roots_list()
def roots_to_list(list_of_roots):
result_list=[]
for i in range(0,len(list_of_roots)):
result_list.append(prl[list_of_roots[i]])
return(result_list)
def all_orth_subset():
result_list=[]
result_list_numbers=[[]]
n=len(positive_roots)
for i in range(0,n):
result_list.append([root_to_list(positive_roots[i])])
result_list_numbers[0].append([i])
for i in range(1,dim):
result_list_numbers.append([])
for j in range(0,len(result_list_numbers[i-1])):
test_list=copy.copy(result_list_numbers[i-1][j])
test_list.append(result_list_numbers[i-1][j][i-1])
while test_list[i]+1<n:
test_list[i]=test_list[i]+1
if test_orth(test_list)==1:
result_list_numbers[i].append(copy.copy(test_list))
result_list.append(roots_to_list(test_list))
return(result_list)
aos=all_orth_subset()
print(len(aos))
print(time.ctime())
def sum_list(list1,list2):
list3=[]
l=len(list1)
for i in range(0,l):
list3.append(list1[i]+list2[i])
return(list3)
def list_sum(list):
s=0
n=len(list)
for i in range(0,n):
s=s+list[i]
return(s)
def list_mult_const(list1,const):
list2=[]
l=len(list1)
for i in range(0,l):
list2.append(constlist1[i])
return(list2)
def list_weight_sum(list1,coef_list):
result_list=list_mult_const(list1[0],coef_list[0])
for i in range(1,len(list1)):
result_list=sum_list(result_list,list_mult_const(list1[i],coef_list[i]))
return(result_list)
cascade=[[2, 2, 3, 4, 3, 2, 1], [0, 1, 1, 2, 2, 2, 1], [0, 1, 1, 2, 1, 0, 0],
[0, 1, 0, 0, 0, 0, 0], [0, 0, 1, 0, 0, 0, 0], [0, 0, 0, 0, 1, 0, 0],
[0, 0, 0, 0, 0, 0, 1]]
weights=[]
list_cascade_weights=[[1, 0, 0, 0, 0, 0, 0],[1, 1, 0, 0, 0, 0, 0],
[2, 1, 1, 0, 0, 0, 0],[2, 1, 1, 1, 0, 0, 0],
[3, 1, 1, 0, 1, 0, 0],[3, 2, 1, 0, 0, 1, 0],
[1, 1, 0, 0, 0, 0, 1]]
for i in range(0,len(list_cascade_weights)):
weights.append(list_weight_sum(cascade,list_cascade_weights[i]))
degree=[]
for i in range(0,len(weights)):
degree.append(list_sum(list_cascade_weights[i]))
print(degree)
def test_orth_subset(orth_subset,weights,degree,test_cons):
n=len(orth_subset)
result_list=[]
for j in range(0,len(weights)):
result_list.append(0)
for j in range(0,len(weights)):
list1=[]
for i in range(0,n):
list1.append(0)
b=0
while (b==0):
list1[n-1]=list1[n-1]+1
for i in range(n-1,0,-1):
if list1[i]>degree[j]:
list1[i]=0
list1[i-1]=list1[i-1]+1
if list_sum(list1)==degree[j]:
list2=list_mult_const(orth_subset[0],list1[0])
for i in range(1,n):
list2=sum_list(list2,list_mult_const(orth_subset[i],list1[i]))
if list2==weights[j]:
result_list[j]=result_list[j]+1
if list1[0]==degree[j]:
b=1
if result_list==test_cons:
res=1
else:
res=0
return(res)
def calculate_test_cons_for_orth_subset(orth_subset,weights,degree):
n=len(orth_subset)
result_list=[]
for j in range(0,len(weights)):
result_list.append(0)
for j in range(0,len(weights)):
list1=[]
for i in range(0,n):
list1.append(0)
b=0
while (b==0):
list1[n-1]=list1[n-1]+1
for i in range(n-1,0,-1):
if list1[i]>degree[j]:
list1[i]=0
list1[i-1]=list1[i-1]+1
if list_sum(list1)==degree[j]:
list2=list_mult_const(orth_subset[0],list1[0])
for i in range(1,n):
list2=sum_list(list2,list_mult_const(orth_subset[i],list1[i]))
if list2==weights[j]:
result_list[j]=result_list[j]+1
if list1[0]==degree[j]:
b=1
return(result_list)
def border_tc(aos):
result_list=[[0,0]]
length=0
for i in range(0,len(aos)):
length1=len(aos[i])-1
if length1>length:
result_list[length][1]=i
result_list.append([i,0])
length=length1
result_list[length][1]=len(aos)
return(result_list)
print(border_tc(aos))
btc=border_tc(aos)
def calculate_all_test_cons_for_all_orth_subset(aos,weights,degree):
atc=[]
percent=0
for i in range(0,len(aos)):
percent1=int(100(i+1)/len(aos))
if percent1>percent:
percent=percent1
print(str(percent)+’%’)
print(time.ctime())
atc.append(calculate_test_cons_for_orth_subset(aos[i],weights,degree))
return atc
atc=calculate_all_test_cons_for_all_orth_subset(aos,weights,degree)
print(weights)
def test_orth_subset_1(orth_subset,weights,degree,test_cons):
n=len(orth_subset)
result_list=[]
for j in range(0,len(weights)):
result_list.append(0)
for j in range(0,len(weights)):
list1=[]
for i in range(0,n):
list1.append(0)
b=0
while (b==0):
list1[n-1]=list1[n-1]+1
for i in range(n-1,0,-1):
if list1[i]>degree[j]:
list1[i]=0
list1[i-1]=list1[i-1]+1
if list_sum(list1)==degree[j]:
list2=list_mult_const(orth_subset[0],list1[0])
for i in range(1,n):
list2=sum_list(list2,list_mult_const(orth_subset[i],list1[i]))
if list2==weights[j]:
result_list[j]=result_list[j]+1
if list1[0]==degree[j]:
b=1
if result_list==test_cons:
res=1
else:
res=0
return(res)
def test_all_orth_subset(aos,weights,degree,test_cons,test_coef):
s=list_sum(test_cons)+test_coef
result_list=[]
for i in range(0,len(aos)):
if len(aos[i])==s:
if test_orth_subset(aos[i],weights,degree,test_cons)==1:
if [2, 2, 3, 4, 3, 2, 1] not in aos[i]:
test_list=copy.copy(aos[i])
test_list.append([2, 2, 3, 4, 3, 2, 1])
tc=copy.copy(test_cons)
tc[0]=1
if test_orth_subset(test_list,weights,degree,tc)==1:
result_list.append(aos[i])
else:
result_list.append(aos[i])
return(result_list)
def test_all_orth_subset_1(aos,weights,degree,test_cons,test_coef):
s=list_sum(test_cons)+test_coef
result_list=[]
for i in range(0,len(aos)):
if len(aos[i])==s:
if test_orth_subset_1(aos[i],weights,degree,test_cons)==1:
if [2, 2, 3, 4, 3, 2, 1] not in aos[i]:
test_list=copy.copy(aos[i])
test_list.append([2, 2, 3, 4, 3, 2, 1])
tc=copy.copy(test_cons)
tc[0]=1
if test_orth_subset_1(test_list,weights,degree,tc)==1:
result_list.append(aos[i])
else:
result_list.append(aos[i])
return(result_list)
def test_all_orth_subset_all_test_cons(aos,weights,degree):
test_cons=[]
counter=1
for i in range(0,len(weights)):
test_cons.append(0)
test_cons=[1, 1, 1, 1, 0, 0, 0]
b=0
print(’CASE ’+str(counter))
print(test_cons)
test_coef=1
case_list=test_all_orth_subset(aos,weights,degree,test_cons,test_coef)
while case_list==[] and list_sum(test_cons)+test_coef<=dim:
test_coef=test_coef+1
case_list=test_all_orth_subset(aos,weights,degree,
test_cons,test_coef)
print(case_list)
while (b==0):
test_cons[len(weights)-1]=test_cons[len(weights)-1]+1
for i in range(len(weights)-1,0,-1):
if test_cons[i]>1:
test_cons[i]=0
test_cons[i-1]=test_cons[i-1]+1
if test_cons[0]>1:
b=1
if b!=1:
counter=counter+1
print(time.ctime())
print(’CASE ’+str(counter))
print(test_cons)
test_coef=1
case_list=test_all_orth_subset(aos,weights,degree,
test_cons,test_coef)
while case_list==[] and list_sum(test_cons)+test_coef<=dim:
test_coef=test_coef+1
case_list=test_all_orth_subset(aos,weights,degree,
test_cons,test_coef)
print(case_list)
def test_all_orth_subset_all_test_cons1(aos,atc):
test_cons=[]
counter=1
for i in range(0,len(weights)):
test_cons.append(0)
b=0
print(’CASE ’+str(counter))
print(test_cons)
case_list=[]
test_coef=1
for i in range(btc[list_sum(test_cons)+test_coef-1][0],
btc[list_sum(test_cons)+test_coef-1][1]):
if atc[i]==test_cons:
case_list.append(aos[i])
print(case_list)
while (b==0):
test_cons[len(weights)-1]=test_cons[len(weights)-1]+1
for i in range(len(weights)-1,0,-1):
if test_cons[i]>1:
test_cons[i]=0
test_cons[i-1]=test_cons[i-1]+1
if test_cons[0]>1:
b=1
if b!=1:
counter=counter+1
print(time.ctime())
print(’CASE ’+str(counter))
print(test_cons)
case_list=[]
test_coef=1
if list_sum(test_cons)+test_coef<=dim:
for i in range(btc[list_sum(test_cons)+test_coef-1][0],
btc[list_sum(test_cons)+test_coef-1][1]):
if atc[i]==test_cons:
case_list.append(aos[i])
else:
case_list=[]
test_coef=test_coef+1
while case_list==[] and list_sum(test_cons)+test_coef<=dim:
for i in range(btc[list_sum(test_cons)+test_coef-1][0],
btc[list_sum(test_cons)+test_coef-1][1]):
if atc[i]==test_cons:
case_list.append(aos[i])
test_coef=test_coef+1
if case_list==[]:
test_coef=0
if list_sum(test_cons)+test_coef<=dim:
for i in range(btc[list_sum(test_cons)+test_coef-1][0],
btc[list_sum(test_cons)+test_coef-1][1]):
if atc[i]==test_cons:
case_list.append(aos[i])
else:
case_list=[]
print(case_list)
case_list=[]
case_list1=[]
for i in range(0,len(case_list)):
if [2, 2, 3, 4, 3, 2, 1] not in case_list[i]:
test_list=copy.copy(case_list[i])
test_list.append([2, 2, 3, 4, 3, 2, 1])
tc=copy.copy(test_cons)
tc[0]=1
if test_orth_subset_1(test_list,weights,degree,tc)==1:
case_list1.append(case_list[i])
else:
case_list1.append(case_list[i])
print(case_list1)
print(time.ctime())
test_all_orth_subset_all_test_cons1(aos,atc)
print(time.ctime())
Code for E8:
import time
import copy
print(time.ctime())
positive_roots=[’01000000’, ’01010000’, ’01011000’, ’01011100’, ’01011110’,
’01011111’, ’23354321’, ’01110000’, ’01111000’, ’01111100’,
’01111110’, ’01111111’, ’23454321’, ’01121000’, ’01121100’,
’01121110’, ’01121111’, ’23464321’, ’01122100’, ’01122110’,
’01122111’, ’23465321’, ’01122210’, ’01122211’, ’23465421’,
’01122221’, ’23465431’, ’23465432’, ’00100000’, ’00110000’,
’00111000’, ’00111100’, ’00111110’, ’00111111’, ’22454321’,
’00010000’, ’00011000’, ’00011100’, ’00011110’, ’00011111’,
’22354321’, ’00001000’, ’00001100’, ’00001110’, ’00001111’,
’22344321’, ’00000100’, ’00000110’, ’00000111’, ’22343321’,
’00000010’, ’00000011’, ’22343221’, ’00000001’, ’22343211’,
’22343210’, ’13354321’, ’12232100’, ’12232110’, ’12232111’,
’12232210’, ’12232211’, ’12232221’, ’11110000’, ’12233210’,
’12233211’, ’12233221’, ’11111000’, ’12233321’, ’11111100’,
’11111110’, ’11111111’, ’12243210’, ’12243211’, ’12243221’,
’11121000’, ’12243321’, ’11121100’, ’11121110’, ’11121111’,
’12244321’, ’11122100’, ’11122110’, ’11122111’, ’11122210’,
’11122211’, ’11122221’, ’10000000’, ’12343210’, ’12343211’,
’12343221’, ’11221000’, ’12343321’, ’11221100’, ’11221110’,
’11221111’, ’12344321’, ’11222100’, ’11222110’, ’11222111’,
’11222210’, ’11222211’, ’11222221’, ’10100000’, ’12354321’,
’11232100’, ’11232110’, ’11232111’, ’11232210’, ’11232211’,
’11232221’, ’10110000’, ’11233210’, ’11233211’, ’11233221’,
’10111000’, ’11233321’, ’10111100’, ’10111110’, ’10111111’]
for i in range(0,len(positive_roots)):
if positive_roots[i]==’23465432’:
print(i)
dim=8
scalar_product_matrix=[[2, 0, -1, 0, 0, 0, 0, 0],[0, 2, 0, -1, 0, 0, 0, 0],
[-1, 0, 2, -1, 0, 0, 0, 0],[0, -1, -1, 2, -1, 0, 0, 0],
[0, 0, 0, -1, 2, -1, 0, 0],[0, 0, 0, 0, -1, 2, -1, 0],
[0, 0, 0, 0, 0, -1, 2, -1],[0, 0, 0, 0, 0, 0, -1, 2]]
def dot_product(alpha,beta):
sum=0
for i in range(0,len(alpha)):
for j in range(0,len(beta)):
sum=sum+int(alpha[i])*int(beta[j])*scalar_product_matrix[i][j]
return(sum)
def dot_product_matrix():
list_dot_products=[]
n=len(positive_roots)
for i in range(0,n):
list_dot_products.append([])
for j in range(0,n):
list_dot_products[i].append(dot_product(positive_roots[i],
positive_roots[j]))
return(list_dot_products)
dpm=dot_product_matrix()
print(’matrix calculated’)
print(time.ctime())
def test_orth(list_of_roots):
n=len(list_of_roots)
b=1
for i in range(0,n-1):
for j in range(i+1,n):
if (dpm[list_of_roots[i]][list_of_roots[j]])!=0.0:
b=0
return(b)
def root_to_list(alpha):
result_list=[]
for i in range(0,len(alpha)):
result_list.append(int(alpha[i]))
return(result_list)
def positive_roots_list(positive_roots):
result_list=[]
for i in range(0,len(positive_roots)):
result_list.append(root_to_list(positive_roots[i]))
return(result_list)
prl=positive_roots_list(positive_roots)
def roots_to_list(list_of_roots):
result_list=[]
for i in range(0,len(list_of_roots)):
result_list.append(prl[list_of_roots[i]])
return(result_list)
def all_orth_subset():
result_list=[]
result_list_numbers=[[]]
n=len(positive_roots)
for i in range(0,n):
result_list.append([root_to_list(positive_roots[i])])
result_list_numbers[0].append([i])
for i in range(1,dim+1):
print(i)
print(time.ctime())
result_list_numbers.append([])
for j in range(0,len(result_list_numbers[i-1])):
test_list=copy.copy(result_list_numbers[i-1][j])
test_list.append(result_list_numbers[i-1][j][i-1])
while test_list[i]+1<n:
test_list[i]=test_list[i]+1
if test_orth(test_list)==1:
result_list_numbers[i].append(copy.copy(test_list))
result_list.append(roots_to_list(test_list))
return(result_list)
aos=all_orth_subset()
print(len(aos))
print(time.ctime())
def sum_list(list1,list2):
list3=[]
l=len(list1)
for i in range(0,l):
list3.append(list1[i]+list2[i])
return(list3)
def list_sum(list):
s=0
n=len(list)
for i in range(0,n):
s=s+list[i]
return(s)
def list_mult_const(list1,const):
list2=[]
l=len(list1)
for i in range(0,l):
list2.append(constlist1[i])
return(list2)
def list_weight_sum(list1,coef_list):
result_list=list_mult_const(list1[0],coef_list[0])
for i in range(1,len(list1)):
result_list=sum_list(result_list,list_mult_const(list1[i],coef_list[i]))
return(result_list)
cascade=[[2, 3, 4, 6, 5, 4, 3, 2], [2, 2, 3, 4, 3, 2, 1, 0],
[0, 1, 1, 2, 2, 2, 1, 0], [0, 1, 1, 2, 1, 0, 0, 0],
[0, 1, 0, 0, 0, 0, 0, 0], [0, 0, 1, 0, 0, 0, 0, 0],
[0, 0, 0, 0, 1, 0, 0, 0], [0, 0, 0, 0, 0, 0, 1, 0]]
weights=[]
list_cascade_weights=[[1, 0, 0, 0, 0, 0, 0, 0], [1, 1, 0, 0, 0, 0, 0, 0],
[2, 1, 1, 0, 0, 0, 0, 0], [3, 2, 1, 1, 0, 0, 0, 0],
[3, 2, 1, 1, 1, 0, 0, 0], [4, 3, 1, 1, 0, 1, 0, 0],
[5, 3, 2, 1, 0, 0, 1, 0], [3, 1, 1, 0, 0, 0, 0, 1]]
for i in range(0,len(list_cascade_weights)):
weights.append(list_weight_sum(cascade,list_cascade_weights[i]))
degree=[]
for i in range(0,len(weights)):
degree.append(list_sum(list_cascade_weights[i]))
print(degree)
def calculate_test_cons_for_orth_subset(orth_subset,weights,degree):
n=len(orth_subset)
result_list=[]
for j in range(0,len(weights)):
result_list.append(0)
for j in range(0,len(weights)):
list1=[]
for i in range(0,n):
list1.append(0)
b=0
while (b==0):
list1[n-1]=list1[n-1]+1
for i in range(n-1,0,-1):
if list1[i]>degree[j]:
list1[i]=0
list1[i-1]=list1[i-1]+1
if list_sum(list1)==degree[j]:
list2=list_mult_const(orth_subset[0],list1[0])
for i in range(1,n):
list2=sum_list(list2,list_mult_const(orth_subset[i],list1[i]))
if list2==weights[j]:
result_list[j]=result_list[j]+1
if list1[0]==degree[j]:
b=1
return(result_list)
def gen_c_wave_n_k(k,n):
result_list=[]
list1=[]
for i in range(0,k):
list1.append(0)
result_list.append(copy.copy(list1))
b=0
while (b==0):
list1[k-1]=list1[k-1]+1
for i in range(k-1,0,-1):
if list1[i]>n-1:
list1[i-1]=list1[i-1]+1
for l in range(i,k):
list1[l]=list1[i-1]
if list1[0]<=n-1:
result_list.append(copy.copy(list1))
if list1[0]>n-1:
b=1
return result_list
keys=[]
for i in range(0,dim+1):
for j in range(0,len(degree)):
keys.append((degree[j],i+1))
print(keys)
dict_of_c_wave=dict()
for i in range(0,len(keys)):
dict_of_c_wave[keys[i]]=copy.copy(gen_c_wave_n_k(keys[i][0],keys[i][1]))
print(’dict_calculated’)
print(time.ctime())
def calculate_test_cons_for_orth_subset(orth_subset,weights,degree):
n=len(orth_subset)
result_list=[]
for j in range(0,len(weights)):
result_list.append(0)
for j in range(0,len(weights)):
list1=copy.copy(dict_of_c_wave[(degree[j],n)])
for i in range(0,len(list1)):
result_list1=[]
for m in range(0,dim):
sum2=0
for l in range(0,degree[j]):
sum2=sum2+orth_subset[list1[i][l]][m]
result_list1.append(sum2)
if result_list1==weights[j]:
#print(list1[i])
result_list[j]=result_list[j]+1
return result_list
def border_tc(aos):
result_list=[[0,0]]
length=0
for i in range(0,len(aos)):
length1=len(aos[i])-1
if length1>length:
result_list[length][1]=i
result_list.append([i,0])
length=length1
result_list[length][1]=len(aos)
return(result_list)
print(border_tc(aos))
btc=border_tc(aos)
print(’start time’)
print(time.ctime())
def calculate_all_test_cons_for_all_orth_subset(aos,weights,degree):
atc=[]
percent=0
f = open(’text.txt’, ’w’)
for i in range(0,len(atc)):
f.write(str(atc[i])+’\n’)
sp=len(atc)
for i in range(sp,352875):
percent1=int(100(i+1)/len(aos))
if percent1>percent:
percent=percent1
print(str(percent)+’%’)
print(time.ctime())
result_list=copy.copy(calculate_test_cons_for_orth_subset(aos[i],
weights,degree))
atc.append(result_list)
f.write(str(result_list)+’\n’)
f.close()
return atc
atc=calculate_all_test_cons_for_all_orth_subset(aos,weights,degree)
print(’finish time’)
print(time.ctime())
def test_all_orth_subset_all_test_cons1(aos,atc):
test_cons=[]
counter=1
for i in range(0,len(weights)):
test_cons.append(0)
b=0
print(’CASE ’+str(counter))
print(test_cons)
case_list=[]
test_coef=1
for i in range(btc[list_sum(test_cons)+test_coef-1][0],
btc[list_sum(test_cons)+test_coef-1][1]):
if atc[i]==test_cons:
case_list.append(aos[i])
print(case_list)
while (b==0):
test_cons[len(weights)-1]=test_cons[len(weights)-1]+1
for i in range(len(weights)-1,0,-1):
if test_cons[i]>1:
test_cons[i]=0
test_cons[i-1]=test_cons[i-1]+1
if test_cons[0]>1:
b=1
if b!=1:
counter=counter+1
print(time.ctime())
print(’CASE ’+str(counter))
print(test_cons)
case_list=[]
test_coef=1
if list_sum(test_cons)+test_coef<=dim:
for i in range(btc[list_sum(test_cons)+test_coef-1][0],
btc[list_sum(test_cons)+test_coef-1][1]):
if atc[i]==test_cons:
case_list.append(aos[i])
else:
case_list=[]
test_coef=test_coef+1
while case_list==[] and list_sum(test_cons)+test_coef<=dim:
for i in range(btc[list_sum(test_cons)+test_coef-1][0],
btc[list_sum(test_cons)+test_coef-1][1]):
if atc[i]==test_cons:
case_list.append(aos[i])
test_coef=test_coef+1
case_list1=[]
for i in range(0,len(case_list)):
if [2, 3, 4, 6, 5, 4, 3, 2] not in case_list[i]:
test_list=copy.copy(case_list[i])
test_list.append([2, 3, 4, 6, 5, 4, 3, 2])
tc=copy.copy(test_cons)
tc[0]=1
if calculate_test_cons_for_orth_subset(test_list,
weights,degree)==tc:
case_list1.append(case_list[i])
else:
case_list1.append(case_list[i])
print(case_list1)
test_all_orth_subset_all_test_cons1(aos,atc)
Bibliography20
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[An] C.A.M. André. Basic sums of coadjoint orbits of the unitriangular group. J. Algebra 176 (1995), 959–1000.
2[BGR] W. Borho, P. Gabriel, R. Rentschler. Primideale in Einh u ¨ ¨ u \ddot{\mathrm{u}} llenden aufl o ¨ ¨ o \ddot{\mathrm{o}} sbarer Lie-Algebren, Lecture Notes in Math. 357 . Springer–Verlag, Berlin, 1973.
3[Bo] N. Bourbaki. Lie groups and Lie algebras. Chapters 4–6, Springer, 2002.
4[Di 1] J. Dixmier. Représentations irréductibles des algèbres de Lie nilpotentes. An. Acad. Brasil Ci. 35 (1963), 491–519.
5[Di 2] J. Dixmier. Représentations irréductibles des algèbres de Lie résolubles. J. Math. Pures Appl. 45 (1966), 1–66.
6[Di 3] J. Dixmier. Idéaux primitifs dans les algèbres enveloppantes, preprint, Paris, 1976.
7[Di 4] J. Dixmier. Enveloping algebras. Grad. Stud. in Math. 11 . AMS, 1996.
8[Ig 1] M.V. Ignatyev. Centrally generated primitive ideals of U ( 𝔫 ) 𝑈 𝔫 U(\mathfrak{n}) in types B 𝐵 B and D 𝐷 D . Transformation Groups 24 (2019), no. 4, 1067–1093; ar Xiv: math.RT/1709.09543 .