Skip to content

Commit 29521e9

Browse files
SumnerStSumnerSt
authored
Update ch-M2.ptx
Added nSam's section on Invariant ring theory
1 parent 44afa91 commit 29521e9

1 file changed

Lines changed: 197 additions & 11 deletions

File tree

‎source/ch-M2.ptx‎

Lines changed: 197 additions & 11 deletions
Original file line numberDiff line numberDiff line change
@@ -514,16 +514,202 @@ This chapter is co-authored by Francesca Gandini, Sumner Strom, Al Ashir Intisar
514514
</section>
515515

516516
</section>
517-
<section xml:id="sec-theory-invariant-rings">
518-
<title>Theory for invariant rings </title>
517+
<section xml:id="sec-invariantrings-package">
518+
<title>InvariantRings package</title>
519+
<subsection xml:id="subsec-finite-matrix-groups">
520+
<title>Finite Matrix Groups</title>
521+
<p>Example:
522+
Consider <me>M = \begin{pmatrix}
523+
1 \amp 0 \\
524+
0 \amp -1 \\
525+
\end{pmatrix} </me> and the vector <m>\bar x = \begin{pmatrix} x\\ y\\ \end{pmatrix}</m>
526+
This gives <m>M \bar x = \begin{bmatrix}
527+
x \\
528+
-y \\
529+
\end{bmatrix}</m>. Thus for the polynomial <m> f(\bar x) = f(\begin{bmatrix}
530+
x \\
531+
y \\
532+
\end{bmatrix}) = x+y</m> we have <m>f(M\bar x) = f(\begin{bmatrix}
533+
x \\
534+
-y \\
535+
\end{bmatrix})= x-y</m>.
536+
537+
538+
</p>
539+
<p>
540+
<definition><p> <m>G \leq GLm(\mathbb{K}), |G| &lt; \infty</m>, then <m>G</m> is a finite matrix group.
541+
(In other words if <m>G</m> is a group of actions under which <m>\mathbb{K}</m> remains invariant
542+
under then it is smaller or equal to the total amount of group actions <m>GLm(\mathbb{K})</m> that
543+
would keep the polynomial invariant. AND the <m>|G|</m> is finite then <m>G</m> is a finite matrix
544+
group?)
545+
</p></definition>
546+
</p>
547+
<p>
548+
NOTE: An action of a finite group <m>G \curvearrowright \mathbb{K}^n</m> given a realization of <m>G</m> as a finite matrix group. </p><p>
549+
Example: <m>\langle \begin{bmatrix}
550+
1 \amp 0 \\
551+
0 \amp -1 \\
552+
\end{bmatrix} \rangle = \{ \begin{bmatrix}
553+
1 \amp 0 \\
554+
0 \amp -1 \\
555+
\end{bmatrix},\begin{bmatrix}
556+
1 \amp 0 \\
557+
0 \amp 1 \\
558+
\end{bmatrix}\} \cong C_2</m>
559+
</p>
560+
</subsection>
561+
<subsection xml:id="subsec-invariant-rings">
562+
<title>Invariant Rings</title>
519563
<p>
520-
hello <m>4 \in \mathbb{Z}</m> this is true.
521-
<theorem> <p>Nöether:
522-
<me>
523-
R^G = \mathbb{K} [ R_G(\bar x^{\bar \beta}) | \; |\bar \beta| \leq |G|]
524-
</me>
525-
NDB: The ring of invariants is generated in degrees <m>\leq |G|</m> </p>
526-
</theorem>
564+
\textbf{Notation <m>\bar x = (x_1, x_2,..., x_n)</m>, with <m>R = \mathbb{K}[x_1,x_2,...,x_n]</m>}
565+
<definition> <p> <m>G</m> is a finite matrix group within <m>GLm(\mathbb{K})</m> when?
566+
<m>f\in \mathbb{K}[x_1,x_2,...,x_n]</m> is invariant under the action of <m>G</m> if and only if
567+
<m>f(A\bar x) = f(\bar x)</m>, <m>\forall A \in G</m>.
568+
</p></definition>
569+
</p><p>
570+
Ex. <m>f(\bar x)=x</m> and <m>f(\bar x) = x +y^2</m> in <m>\mathbb{K}[x_1,x_2,...,x_n]</m> is invariant under <m>C_2 = \langle\begin{bmatrix}
571+
1 \amp 0 \\
572+
0 \amp -1 \\
573+
\end{bmatrix} \rangle</m>\\
574+
However <m>f(\bar x)=x+y</m> is not. What are others?
527575
</p>
528-
</section>
529-
</chapter>
576+
<p>
577+
<definition><p> <m>R^G : = \{f \in R \, | f(A\bar x) = f(\bar x), \forall A \in G\} \subseteq R</m>
578+
is the invariant ring for the action of <m>G</m>
579+
</p></definition>
580+
</p>
581+
<p>
582+
Show this is a subring.</p>
583+
<p> How does on find generators for <m>R^G</m>?</p>
584+
<p> Is <m>R^G</m> even finitely generated?</p>
585+
<p> Work through Hilbert's proof.
586+
</p>}
587+
</subsection>
588+
<subsection xml:id="subsec-reynolds-operator">
589+
<title>Reynolds Operator</title>
590+
<p>
591+
Idea: "Averaging" over the action of <m>G</m> we get an invariant
592+
</p>
593+
<p>
594+
<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>
595+
Exercise: <m>R_G</m> has many nice properties? \textbf{WHAT MORE TO SAY HERE}</p></definition>
596+
</p>
597+
<p>Example: <m>C_2 = \langle\begin{bmatrix}
598+
1 \amp 0 \\
599+
0 \amp -1 \\
600+
\end{bmatrix}\rangle</m> <me>R_G(x+y) = \frac{1}{2} ((x+y) + (x-y)) = x\in R^G</me>
601+
602+
</p>
603+
</subsection>
604+
<subsection xml:id="subsec-noether-degree-bound">
605+
<title>Nöether Degree Bound(NDB)</title>
606+
<p>
607+
<theorem><p> (Noether): <me>R^G = \mathbb{K} [ R_G(\bar x^{\bar \beta}) | \; |\bar \beta| \leq |G|]</me>
608+
<m>\implies</m> NDB : The ring of invariants is generated in degrees <m>\leq |G|</m>
609+
</p></theorem>
610+
</p>
611+
<p>
612+
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>.
613+
Exercise: Try this for <m>C_4</m> ... show!
614+
</p>
615+
</subsection>
616+
<subsection xml:id="subsec-hilbert-ideal">
617+
<title>Hildbert Ideal</title>
618+
<p>
619+
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
620+
Exercise?
621+
</p>
622+
<p>
623+
<theorem><p> Let <m>J_G = R(R^G)_t</m>, ideal generated by all positive degree invariants.\\
624+
If <m>J_G = (f_1,...,f_s)</m> and <m>f_i\in R^G, \,\, \forall i</m>
625+
(apply <m>R^G</m> if it is not), then <m>R^G = \mathbb{K}[f_1,...f_s]</m>
626+
</p></theorem>
627+
</p>
628+
</subsection>
629+
<subsection xml:id="subsec-presentations">
630+
<title>Presentations</title>
631+
<p>
632+
<definition><p>Definition: Let <m>S = \mathbb{K}[f_1,...f_s] \subset R</m>.
633+
A presentation of <m>S</m> is a map, <me>T=: \mathbb{K}[u_1,...u_s] \xrightarrow{\phi}S</me>
634+
such that <m>\frac{T}{ker(\phi)} \cong S</m> With the syzygies of <m>f_i</m>'s
635+
giving the presentation ideal.
636+
</p></definition>
637+
</p>
638+
<p>
639+
<proposition><p>(Elimination Theory): In <m>S \bigotimes \mathbb{K}[u_1,...,u_s = \mathbb{K}[x_1,...,x_n,u_1,...u_s]</m> consider the ideal,
640+
<me>I = (u_i - f_x(\bar x) | \, \langle f_i\rangle = S</me>
641+
Then,
642+
<me>ker \phi = I \cap \mathbb{K}[u_1,...,u_s]</me>
643+
</p></proposition>
644+
</p>
645+
<p>
646+
<algorithm><p> compute a Groebner Basis <m>G</m> for <m>I</m> with elimination order for the <m>x</m>'s.\\
647+
Then, <m>G \cap \mathbb{K}[y_1,...y_s]</m> is the Groebner Basis for <m>ker \phi</m>
648+
</p></algorithm>
649+
</p>
650+
</subsection>
651+
<subsection xml:id="subsec-graph-of-linear-actions">
652+
<title>Graph of Linear Actions</title>
653+
<p>
654+
<definition> <p>let <m>G \leq GL_n(\mathbb{K}), \,\, G\curvearrowright \mathbb{K}^n =:V, \,\, |G|\infty</m>.
655+
For <m>A\in G</m> consider,
656+
<me>V_A = \{(\bar v, A\bar v)|\,\,v\in V\} \subseteq V\bigotimes V</me>
657+
Then <m>A_G = \cup_{A\in G}V_A</m> is the subspace arrangement associated to the action of G.
658+
</p></definition>
659+
</p>
660+
<p>
661+
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.
662+
Example: <me>V_{\begin{bmatrix}
663+
1 \amp 0 \\
664+
0 \amp -1 \\
665+
\end{bmatrix}} = \{(x_1,x_2,x_1,-x_2)\} = V(y_1,-x_1, y_2+x_2)</me>
666+
</p>
667+
</subsection>
668+
<subsection xml:id="subsec-subspace-arrangement-approach">
669+
<title>Subspace Arrangement Approach</title>
670+
<p>
671+
<theorem><p>
672+
(Dekseu): Let <m>I_G = \mathbb{I}(A_G) = \cap_{A\in G}\mathbb{I}(V_A) \subseteq \mathbb{K}[x_1,...x_n,y_1,...y_n].</m>
673+
\textbf{(ARE n and n or m and n THESE DIFFERENT?)}\\
674+
Then <me>(I_G +(y_1,...,y_n)) \cap \R = J_G</me> This uses elimination theory and the Hilbert ideal.
675+
</p> </theorem>
676+
</p>
677+
<p>
678+
Note: The same approach works in the exterior algebra!
679+
</p>
680+
<p>
681+
<theorem><p>Let <m>I_G^{'} = \cap_{A\in G} \mathbb{I}(V_A) \subseteq \Lambda(\bar x, \bar y)</m>.\\
682+
Then <me>(I_G^{'} +(y_1,...y_n)) \cap \Lambda(x_1,...,x_n) = J_G^{'} : = \Lambda(\bar x)(\Lambda(\bar x)^G)_+</me>
683+
</p></theorem>
684+
</p>
685+
<p>
686+
Note: This approach is slow for polynomials, but might be fast for skew polynomials.
687+
</p>
688+
</subsection>
689+
<subsection xml:id="subsec-AGWM">
690+
<title>Abelian GPS and Weight Matrices</title>
691+
<p>
692+
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>\\
693+
<me>\langle g_1\rangle \bigoplus...\bigoplus\langle g_r \rangle, \,\,\,\,\, |g_i| =d_i</me>
694+
A diagonal action of <m>G</m> on <m>R</m> is given by
695+
<me>g_i \cdot x_j = \mu_i^{\omega ij}x_j</me>
696+
for <m> \mu_i : d_i^{th}</m> primitive root of unity and <m>i \in [x]</m>,<m>j \in [n]</m>.
697+
And encoded in the weight matrix <m>W = (\omega_{ij})_{ij} = ?????????????</m>
698+
</p>
699+
<p>
700+
<theorem><p> <m>\bar x^{\bar \beta} \in R^G \iff W_{\bar \beta}\cong (0,...,0)</m> for
701+
zeros being the weight of <m>g_1</m> acting on <m>\bar x^{\bar \beta}</m> and being modulo <m>d_i</m>.
702+
</p></theorem>
703+
</p>
704+
<p>
705+
Note: We can examine all monomials <m>|\bar \beta| \leq |G|</m> and sort them by their weight <m>W\bar \beta</m>.
706+
The ones with weight <m>\bar 0</m> will be invariant!
707+
</p>
708+
<p>
709+
Question: Does this work for monomials in the exterior algebra?
710+
</p>
711+
</subsection>
712+
713+
714+
</section>
715+
</chapter>

0 commit comments

Comments
 (0)