Skip to content

Commit 2ed4bc3

Browse files
fragandifragandi
authored
Merge pull request #6 from fragandi/branchsam
This is an updated M2 with the theory notes
2 parents a88a3e9 + 49acf01 commit 2ed4bc3

1 file changed

Lines changed: 253 additions & 61 deletions

File tree

‎source/ch-M2.ptx‎

Lines changed: 253 additions & 61 deletions
Original file line numberDiff line numberDiff line change
@@ -1,70 +1,262 @@
11
<?xml version='1.0' encoding='utf-8'?>
22
<chapter xml:id="ch-M2">
3-
<title>Macaulay 2</title>
4-
<introduction>
5-
<p>
6-
This chapter is co-authored by Francesca Gandini, Sumner Strom, Al Ashir Intisar
7-
</p>
8-
</introduction>
9-
<section xml:id="sec-template">
10-
<title>Template </title>
11-
<p>
12-
This is the introduction to the template.
13-
</p>
14-
<subsection xml:id="subsec-template">
15-
<title>Template Subsection</title>
16-
<p>
17-
This is the template subsection.
18-
</p>
19-
20-
</subsection>
21-
<subsection xml:id="subsec-notes">
22-
<title>Notes Subsection</title>
23-
<p>
24-
To build in pretext use the template subsection and pretext environment features.
25-
Make sure that you are building and compiling from main using preview code chat.
26-
Additionally, when running if the compilation fails run the command "pretext build web" in terminal.
27-
Make sure that all of the xml have unique ids so that you dont run into compilation errors.
28-
Follow the other chapters to find out how things are used.
29-
Make sure that the sections are properly linked within the main.ptx. Additionally, use the subsections and sections for organization.
30-
If something doesnt display there is a paragraph line missing.
3+
<title>Macaulay 2</title>
4+
<introduction>
5+
<p>
6+
This chapter is co-authored by Francesca Gandini, Sumner Strom,
7+
</p>
8+
</introduction>
9+
<section xml:id="sec-template">
10+
<title>Template </title>
11+
<p>
12+
This is the introduction to the template.
13+
</p>
14+
<subsection xml:id="subsec-template">
15+
<title>Template Subsection</title>
16+
<p>
17+
This is the template subsection.
18+
</p>
19+
20+
</subsection>
21+
<subsection xml:id="subsec-notes">
22+
<title>Notes Subsection</title>
23+
<p>
24+
To build in pretext use the template subsection and pretext environment features.
25+
Make sure that you are building and compiling from main using preview code chat.
26+
Additionally, when running if the compilation fails run the command "pretext build web" in terminal.
27+
Make sure that all of the xml have unique ids so that you dont run into compilation errors.
28+
Follow the other chapters to find out how things are used.
29+
Make sure that the sections are properly linked within the main.ptx. Additionally, use the subsections and sections for organization.
30+
If something doesnt display there is a paragraph line missing.
3131

32-
</p>
33-
34-
</subsection>
35-
</section>
32+
33+
</p>
34+
35+
</subsection>
36+
</section>
3637
<section xml:id="sec-m2-codespace">
37-
<title>Creating a M2 Codespace</title>
38-
39-
<p>
40-
A turn-key repository for creating a Codespace
41-
(<xref ref="sec-codespaces"/>) for Macaulay 2 is available at
42-
<url href="https://github.com/fragandi/M2-codespace">
43-
fragandi/M2-codespace
44-
</url>. Below we provide detailed instructions. If you have some experience with codespaces,
38+
<title>Creating a M2 Codespace</title>
39+
40+
<p>
41+
A turn-key repository for creating a Codespace
42+
(<xref ref="sec-codespaces"/>) for Macaulay 2 is available at
43+
<url href="https://github.com/fragandi/M2-codespace">
44+
fragandi/M2-codespace
45+
</url>. Below we provide detailed instructions. If you have some experience with codespaces,
4546
you might be able to follow directly the README in the repo. Otherwise, keep reading!
46-
47-
</p>
48-
<p>
49-
(WRITE DOWN NOTES HOW TO START A CODESPACE AND USE THE M2 CODESPACE IN THE ABOVE PARAGRAPH.)
50-
</p>
51-
</section>
47+
48+
</p>
49+
<p>
50+
(WRITE DOWN NOTES HOW TO START A CODESPACE AND USE THE M2 CODESPACE IN THE ABOVE PARAGRAPH.)
51+
</p>
52+
</section>
5253
<section xml:id="sec-m2-commands">
53-
<title>Basic M2 commands </title>
54-
</section>
54+
<title>Basic M2 commands </title>
55+
</section>
5556
<section xml:id="sec-invariantrings-package">
56-
<title>InvariantRings package </title>
57-
</section>
57+
<title>InvariantRings package </title>
58+
<p>
59+
60+
61+
</p>
62+
</section>
5863
<section xml:id="sec-theory-invariant-rings">
59-
<title>Theory for invariant rings </title>
60-
<p>
61-
hello <m>4 \in \mathbb{Z}</m> this is true.
62-
<theorem> <p>Nöether:
63-
<me>
64-
R^G = \mathbb{K} [ R_G(\bar x^{\bar \beta}) | \; |\bar \beta| \leq |G|]
65-
</me>
66-
NDB: The ring of invariants is generated in degrees <m>\leq |G|</m> </p>
67-
</theorem>
68-
</p>
69-
</section>
64+
<title>Theory for invariant rings </title>
65+
<subsection xml:id="subsec-finite-matrix-groups">
66+
<title>Finite Matrix Groups</title>
67+
<p>Example:
68+
Consider <me>M = \begin{pmatrix}
69+
1 & 0 \\
70+
0 & -1 \\
71+
\end{pmatrix} </me> and the vector <m>\bar x = \begin{pmatrix} x\\ y\\ \end{pmatrix}</m>
72+
This gives <m>M \bar x = \begin{bmatrix}
73+
x \\
74+
-y \\
75+
\end{bmatrix}</m>. Thus for the polynomial <m> f(\bar x) = f(\begin{bmatrix}
76+
x \\
77+
y \\
78+
\end{bmatrix}) = x+y</m> we have <m>f(M\bar x) = f(\begin{bmatrix}
79+
x \\
80+
-y \\
81+
\end{bmatrix})= x-y</m>.
82+
83+
84+
</p>
85+
<p>
86+
<definition><p> <m>G \leq GLm(\kk), |G|< \infty</m>, then <m>G</m> is a finite matrix group.
87+
(In other words if <m>G</m> is a group of actions under which <m>\kk</m> remains invariant
88+
under then it is smaller or equal to the total amount of group actions <m>GLm(\kk)</m> that
89+
would keep the polynomial invariant. AND the <m>|G|</m> is finite then <m>G</m> is a finite matrix
90+
group?)
91+
</p></definition>
92+
</p>
93+
<p>
94+
NOTE: An action of a finite group <m>G \curvearrowright \kk^n</m> given a realization of <m>G</m> as a finite matrix group.\\
95+
Example: <m>\langle \begin{bmatrix}
96+
1 & 0 \\
97+
0 & -1 \\
98+
\end{bmatrix} \rangle = \{ \begin{bmatrix}
99+
1 & 0 \\
100+
0 & -1 \\
101+
\end{bmatrix},\begin{bmatrix}
102+
1 & 0 \\
103+
0 & 1 \\
104+
\end{bmatrix}\} \cong C_2</m>
105+
</p>
106+
</subsection>
107+
<subsection xml:id="subsec-invariant-rings">
108+
<title>Invariant Rings</title>
109+
<p>
110+
\textbf{Notation <m>\bar x = (x_1, x_2,..., x_n)</m>, with <m>R = \kk[x_1,x_2,...,x_n]</m>}
111+
<definition> <p> <m>G</m> is a finite matrix group within <m>GLm(\kk)</m> when?
112+
<m>f\in \kk[x_1,x_2,...,x_n]</m> is invariant under the action of <m>G</m> if and only if
113+
<m>f(A\bar x) = f(\bar x)</m>, <m>\forall A \in G</m>.
114+
</p><definition>
115+
Ex. <m>f(\bar x)=x</m> and <m>f(\bar x) = x +y^2</m> in <m>\kk[x_1,x_2,...,x_n]</m> is invariant under <m>C_2 = \langle\begin{bmatrix}
116+
1 & 0 \\
117+
0 & -1 \\
118+
\end{bmatrix} \rangle</m>\\
119+
However <m>f(\bar x)=x+y</m> is not. What are others?
120+
</p>
121+
<p>
122+
<definition><p> <m>R^G : = \{f \in R \, | f(A\bar x) = f(\bar x), \forall A \in G\} \subseteq R</m>
123+
is the invariant ring for the action of <m>G</m>
124+
</p></definition>
125+
</p>
126+
<p>
127+
{\color{red} \textbf{Exercises:}
128+
\begin{enumerate}
129+
\item Show this is a subring.
130+
\item How does on find generators for <m>R^G</m>?
131+
\item Is <m>R^G</m> even finitely generated?
132+
\item Work through Hilbert's proof.
133+
\end{enumerate} }
134+
</p>
135+
</subsection>
136+
<subsection xml:id="subsec-reynolds-operator">
137+
<title>Reynolds Operator</title>
138+
<p>
139+
Idea: "Averaging" over the action of <m>G</m> we get an invariant
140+
</p>
141+
<p>
142+
<definition> <p> <m>R_G: R \xrightarrow{} R^G</m> <me>R_G(f) = \frac{1}{|G|} \sum_{A\in G} f(A \bar x) </me>
143+
{\color{red} Exercise: <m>R_G</m> has many nice properties? \textbf{WHAT MORE TO SAY HERE}}</p></definition>
144+
</p>
145+
<p>Example: <m>C_2 = \langle\begin{bmatrix}
146+
1 & 0 \\
147+
0 & -1 \\
148+
\end{bmatrix}\rangle</m> <me>R_G(x+y) = \frac{1}{2} ((x+y) + (x-y)) = x\in R^G</me>
149+
\end{enumerate}
150+
</p>
151+
</subsection>
152+
<subsection xml:id="subsec-noether-degree-bound">
153+
<title>Nöether Degree Bound(NDB)</title>
154+
<p>
155+
<theorem><p> (Noether): <me>R^G = \kk [ R_G(\bar x^{\bar \beta}) | \; |\bar \beta| \leq |G|]</me>
156+
<m>\implies</m> NDB : The ring of invariants is generated in degrees <m>\leq |G|</m>
157+
</p></theorem>
158+
</p>
159+
<p>
160+
Note: This is a computational tool! We can apply <m>R_G</m> to all the finitely many monomials in degrees <m>\leq |G|</m> to get generators for <m>R^G</m>.
161+
{\color{red} Exercise: Try this for <m>C_4</m> ... show!}
162+
</p>
163+
</subsection>
164+
<subsection xml:id="subsec-hilbert-ideal">
165+
<title>Hildbert Ideal</title>
166+
<p>
167+
Note: In general for <m>\{ f_1,..., f_s\} \subseteq \R</m>,\\ <m>\{f_1,...f_s\}</m> and <m>\R</m> can be quite different objects
168+
{\color{red} Exercise?}
169+
</p>
170+
<p>
171+
<theorem><p> Let <m>J_G = R(R^G)_t</m>, ideal generated by all positive degree invariants.\\
172+
If <m>J_G = (f_1,...,f_s)</m> and <m>f_i\in R^G, \,\, \forall i</m>
173+
(apply <m>R^G</m> if it is not), then <m>R^G = \kk[f_1,...f_s]</m>
174+
</p></theorem>
175+
</p>
176+
</subsection>
177+
<subsection xml:id="subsec-presentations">
178+
<title>Presentations</title>
179+
<p>
180+
<definition></p>Definition: Let <m>S = \kk[f_1,...f_s] \subset R</m>.
181+
A presentation of <m>S</m> is a map, <me>T=: \kk[u_1,...u_s] \xrightarrow{\phi}S</me>
182+
such that <m>\frac{T}{ker(\phi)} \cong S</m> With the syzygies of <m>f_i</m>'s
183+
giving the presentation ideal.
184+
</p></definition>
185+
</p>
186+
<p>
187+
<proposition><p>(Elimination Theory): In <m>S \bigotimes \kk[u_1,...,u_s = \kk[x_1,...,x_n,u_1,...u_s]</m> consider the ideal,
188+
<me>I = (u_i - f_x(\bar x) | \, \langle f_i\rangle = S</me>
189+
Then,
190+
<me>ker \phi = I \cap \kk[u_1,...,u_s]</me>
191+
</p></proposition>
192+
</p>
193+
<p>
194+
<algorithm><p> compute a Groebner Basis <m>G</m> for <m>I</m> with elimination order for the <m>x</m>'s.\\
195+
Then, <m>G \cap \kk[y_1,...y_s]</m> is the Groebner Basis for <m>ker \phi</m>
196+
</p></algorithm>
197+
</p>
198+
</subsection>
199+
<subsection xml:id="subsec-graph-of-linear-actions">
200+
<title>Graph of Linear Actions</title>
201+
<p>
202+
<definition> <p>let <m>G \leq GL_n(\kk), \,\, G\curvearrowright \kk^n =:V, \,\, |G|<\infty</m>.\\
203+
For <m>A\in G</m> consider,
204+
<me>V_A = \{(\bar v, A\bar v)|\,\,v\in V\} \subseteq V\bigotimes V</me>
205+
Then <m>A_G = \cup_{A\in G}V_A</m> is the subspace arrangement associated to the action of G.
206+
</p></definition>
207+
</p>
208+
<p>
209+
Note: <m>V_A</m> is a linear subspace, <m>\mathbb{I}(V_A):=</m> set of polynomials vanishing on <m>\mathbb{V}_A</m> is a linear ideal.
210+
\item Example: <me>V_{\begin{bmatrix}
211+
1 & 0 \\
212+
0 & -1 \\
213+
\end{bmatrix}} = \{(x_1,x_2,x_1,-x_2)\} = V(y_1,-x_1, y_2+x_2)</me>
214+
</p>
215+
</subsection>
216+
<subsection xml:id="subsec-subspace-arrangement-approach">
217+
<title>Subspace Arrangement Approach</title>
218+
<p>
219+
<theorem><p>
220+
(Dekseu): Let <m>I_G = \mathbb{I}(A_G) = \cap_{A\in G}\mathbb{I}(V_A) \subseteq \kk[x_1,...x_n,y_1,...y_n].</m>
221+
\textbf{(ARE n and n or m and n THESE DIFFERENT?)}\\
222+
Then <me>(I_G +(y_1,...,y_n)) \cap \R = J_G</me> This uses elimination theory and the Hilbert ideal.
223+
</p> </theorem>
224+
</p>
225+
<p>
226+
Note: The same approach works in the exterior algebra!
227+
</p>
228+
<p>
229+
<theorem><p>Let <m>I_G^{'} = \cap_{A\in G} \mathbb{I}(V_A) \subseteq \Lambda(\bar x, \bar y)</m>.\\
230+
Then <me>(I_G^{'} +(y_1,...y_n)) \cap \Lambda(x_1,...,x_n) = J_G^{'} : = \Lambda(\bar x)(\Lambda(\bar x)^G)_+</me>
231+
</p></theorem>
232+
</p>
233+
<p>
234+
Note: This approach is slow for polynomials, but might be fast for skew polynomials.
235+
</p>
236+
</subsection>
237+
<subsection xml:id="subsec-AGWM">
238+
<title>Abelian GPS and Weight Matrices</title>
239+
<p>
240+
Let <m>G \cong \mathbb{Z}_d, \bigoplus....\bigoplus \mathbb{Z}_{dr}, \,\,\,\,\, d_i|d_{i+1}</m> for <m>1 \leq i \leq r-1</m>\\
241+
<me>\langle g_1\rangle \bigoplus...\bigoplus\langle g_r \rangle, \,\,\,\,\, |g_i| =d_i</me>
242+
A diagonal action of <m>G</m> on <m>R</m> is given by
243+
<me>g_i \cdot x_j = \mu_i^{\omega ij}x_j</me>
244+
for <m> \mu_i : d_i^{th}</m> primitive root of unity and <m>i \in [x]</m>,<m>j \in [n]</m>.
245+
And encoded in the weight matrix <m>W = (\omega_{ij})_{ij} = ?????????????</m>
246+
</p>
247+
<p>
248+
<theorem><p> <m>\bar x^{\bar \beta} \in R^G \iff W_{\bar \beta}\cong (0,...,0)</m> for
249+
zeros being the weight of <m>g_1</m> acting on <m>\bar x^{\bar \beta}</m> and being modulo <m>d_i</m>.
250+
</p></theorem>
251+
</p>
252+
<p>
253+
Note: We can examine all monomials <m>|\bar \beta| \leq |G|</m> and sort them by their weight <m>W\bar \beta</m>.
254+
The ones with weight <m>\bar 0</m> will be invariant!
255+
</p>
256+
<p>
257+
{\color{red} Question: Does this work for monomials in the exterior algebra?}
258+
</p>
259+
</subsection>
260+
</section>
70261
</chapter>
262+

0 commit comments

Comments
 (0)