diff --git a/.github/workflows/typos.toml b/.github/workflows/typos.toml
new file mode 100644
index 0000000..19ff2b7
--- /dev/null
+++ b/.github/workflows/typos.toml
@@ -0,0 +1,10 @@
+[default.extend-words]
+thm = "thm"
+
+# equations stuff
+ba = "ba"
+nd = "nd"
+
+# names
+Strang = "Strang"
+Bootle = "Bootle"
diff --git a/.github/workflows/typos.yml b/.github/workflows/typos.yml
new file mode 100644
index 0000000..de7bc65
--- /dev/null
+++ b/.github/workflows/typos.yml
@@ -0,0 +1,21 @@
+name: typos
+on:
+  pull_request:
+    branches: [ main ]
+    types: [ready_for_review, opened, synchronize, reopened]
+  push:
+    branches:
+      - main
+
+jobs:
+  typos:
+    if: github.event.pull_request.draft == false
+    name: Spell Check with Typos
+    runs-on: ubuntu-latest
+    steps:
+    - uses: actions/checkout@v4
+    - name: Use typos with config file
+      uses: crate-ci/typos@master
+      with: 
+        config: .github/workflows/typos.toml
+
diff --git a/.gitignore b/.gitignore
index 552c4ca..d45d44d 100644
--- a/.gitignore
+++ b/.gitignore
@@ -12,3 +12,4 @@
 *.snm
 *.vrb
 galois-theory-notes.bib
+commutative-algebra-notes.bib
diff --git a/README.md b/README.md
index bc33bcd..e383c72 100644
--- a/README.md
+++ b/README.md
@@ -7,6 +7,7 @@ Notes, code and documents done while reading books and papers.
 - [Notes on "Abstract Algebra" book, by Charles C. Pinter](abstract-algebra-charles-pinter-notes.pdf)
 - [Notes on Weil pairing](weil-pairing.pdf)
 - [Notes on Galois Theory](galois-theory-notes.pdf)
+- [Notes on Commutative Algebra](commutative-algebra-notes.pdf)
 
 
 In-between math & crypto:
diff --git a/commutative-algebra-notes.pdf b/commutative-algebra-notes.pdf
new file mode 100644
index 0000000..23403c0
Binary files /dev/null and b/commutative-algebra-notes.pdf differ
diff --git a/commutative-algebra-notes.tex b/commutative-algebra-notes.tex
new file mode 100644
index 0000000..846f7de
--- /dev/null
+++ b/commutative-algebra-notes.tex
@@ -0,0 +1,1007 @@
+\documentclass{article}
+\usepackage[utf8]{inputenc}
+\usepackage{amsfonts}
+% \usepackage{yfonts} % WIP
+\usepackage{amsthm}
+\usepackage{amsmath}
+\usepackage{enumerate}
+\usepackage{hyperref}
+\usepackage{amssymb}
+\usepackage{tikz} % diagram
+
+\begin{filecontents}[overwrite]{commutative-algebra-notes.bib}
+@misc{am,
+  author = {M. F. Atiyah and I. G. MacDonald},
+  title = {{Introduction to Commutative Algebra}},
+  year = {1969}
+}
+@misc{reid,
+  author = {Miles Reid},
+  title = {{Undergraduate Commutative Algebra}},
+  year = {1995}
+}
+@misc{mit-course,
+  author = {Steven Kleiman},
+  title = {{Commutative Algebra - MIT OpenCourseWare}},
+  year = {2008},
+  note = {\url{https://ocw.mit.edu/courses/18-705-commutative-algebra-fall-2008/}},
+  url = {https://ocw.mit.edu/courses/18-705-commutative-algebra-fall-2008/}
+}
+\end{filecontents}
+\nocite{*}
+
+
+\theoremstyle{definition}
+
+\newtheorem{innerdefn}{Definition}
+\newenvironment{defn}[1]
+{\renewcommand\theinnerdefn{#1}\innerdefn}
+{\endinnerdefn}
+
+\newtheorem{innerthm}{Theorem}
+\newenvironment{thm}[1]
+{\renewcommand\theinnerthm{#1}\innerthm}
+{\endinnerthm}
+
+\newtheorem{innerlemma}{Lemma}
+\newenvironment{lemma}[1]
+{\renewcommand\theinnerlemma{#1}\innerlemma}
+{\endinnerlemma}
+
+\newtheorem{innerprop}{Proposition}
+\newenvironment{prop}[1]
+{\renewcommand\theinnerprop{#1}\innerprop}
+{\endinnerprop}
+
+\newtheorem{innercor}{Corollary}
+\newenvironment{cor}[1]
+{\renewcommand\theinnercor{#1}\innercor}
+{\endinnercor}
+
+\newtheorem{innereg}{Example}
+\newenvironment{eg}[1]
+{\renewcommand\theinnereg{#1}\innereg}
+{\endinnereg}
+
+\newtheorem{innerex}{Exercise}
+\newenvironment{ex}[1]
+{\renewcommand\theinnerex{#1}\innerex}
+{\endinnerex}
+
+\newcommand{\aA}{\mathfrak{a}} % TODO: use goth font
+\newcommand{\mM}{\mathfrak{m}}
+
+\title{Commutative Algebra notes}
+\author{arnaucube}
+\date{}
+
+\begin{document}
+
+\maketitle
+
+\begin{abstract}
+    Notes taken while studying Commutative Algebra, mostly from Atiyah \& MacDonald book \cite{am} and Reid's book \cite{reid}.
+
+    Usually while reading books and papers I take handwritten notes in a notebook, this document contains some of them re-written to $LaTeX$.
+
+    The proofs may slightly differ from the ones from the books, since I try to extend them for a deeper understanding.
+\end{abstract}
+
+\tableofcontents
+
+\section{Ideals}
+
+\subsection{Definitions}
+
+\begin{defn}{ideal}
+  $I \subset R$ ($R$ ring) such that $0 \in I$ and $\forall x \in I,~ r \in R,~ xr, rx \in I$.\\
+  \hspace*{2em} ie. $I$ absorbs products in $R$.
+\end{defn}
+
+\begin{defn}{prime ideal}
+  if $a, b \in R$ with $ab \in P$ and $P \neq R$ ($P$ a prime ideal), implies $a in P$ or $b \in P$.
+\end{defn}
+
+\begin{defn}{principal ideal}
+  generated by a single element, $(a)$.
+
+  $(a)$: principal ideal, the set of all multiples $xa$ with $x \in R$.
+\end{defn}
+
+\begin{defn}{maximal ideal}
+  $\mM \subset A$ ($A$ ring) with $m \neq A$ and there is no ideal $I$ strictly between $\mM$ and $A$. ie. if $\mM$ maximal and $\mM \subseteq I \subseteq A$, either $\mM=I$ or $I=A$.
+\end{defn}
+
+
+\begin{defn}{unit}
+  $x \in A$ such that $xy=1$ for some $y \in A$. ie. element \emph{which divides 1}.
+\end{defn}
+
+\begin{defn}{zerodivisor}
+  $x \in A$ such that $\exists 0 \neq y \in A$ such that $xy=0 \in A$. ie. $x$ \emph{divides 0}..
+
+
+  If a ring does not have zerodivisors is an integral domain.
+\end{defn}
+
+\begin{defn}{prime spectrum - $Spec(A)$}
+  set of prime ideals of $A$. ie.
+
+  $$Spec(A) = \{ P ~|~ P \subset A~ \text{is a prime ideal} \}$$
+\end{defn}
+
+\begin{defn}{integral domain}
+  Ring in which the product of any two nonzero elements is nonzero.
+
+  ie. no zerodivisors.
+
+  ie. $\forall~ 0 \neq a,~ 0 \neq b \in A,~ ab \neq 0 \in A$.
+
+  Every field is an integral domain, not the converse.
+\end{defn}
+
+\begin{defn}{principal ideal domain - PID}
+  integral domain in which every ideal is principal. ie.
+  ie. $\forall I \subset R,~ \exists~ a \in I$ such that $I = (a) = \{ ra ~|~ r \in R \}$.
+\end{defn}
+
+\begin{defn}{nilpotent}
+  $a \in A$ such that $a^n=0$ for some $n>0$.
+\end{defn}
+\begin{defn}{nilrad A}
+  set of all nilpotent elements of $A$; is an ideal of $A$.
+
+  if $nilrad A = 0 ~\Longrightarrow$ $A$ has no nonzero nilpotents.
+
+
+  $$nilrad A = \bigcap_{P \in Spec(A)} P$$
+\end{defn}
+
+\begin{defn}{idempotent}
+  $e \in A$ such that $e^2=e$.
+\end{defn}
+
+\begin{defn}{radical of an ideal}
+  $$rad I = \{ f \in A | f^n \in I~ \text{for some} n \}$$
+
+  $rad I$ is an ideal.
+
+  $nilrad A = rad 0$
+
+  $rad I = \bigcap_{\substack{P \in \operatorname{Spec}(A)\\ P \supset I}} P$
+\end{defn}
+
+\begin{defn}{local ring}
+  A \emph{local ring} has a unique maximal ideal.
+
+  Notation: local ring $A$, its maximal ideal $\mM$, residue field $K=A/\mM$:
+  $$A \supset \mM ~\text{or}~ (A, \mM) ~\text{or}~ (A, \mM, K)$$
+\end{defn}
+
+\subsection{$\mathbb{Z}$ and $K[X]$, two Principal Ideal Domains}
+
+
+\begin{lemma}{}
+  $\mathbb{Z}$ is a PID.
+\end{lemma}
+\begin{proof}
+  Let $I$ a nonzero ideal of $\mathbb{Z}$.
+
+  Since $I \neq \{0\}$, there is at least one nonzero integer in $I$. Choose the smallest element of $I$, namely $d$.
+
+  Observe that $(d) \subseteq I$, since $d \in I$. Then, every multiple $nd \in I$, since $I$ is an ideal.
+
+  Take $a \in I$. By the Euclidean division algorithm in $\mathbb{Z}$, $a=qd+r$, with $q,r \in \mathbb{Z}$ and $0 \leq r \leq d$.
+
+  Then $r = a - qd \in I$, but $d$ was chosen to be the smallest positive element of $I$, so the only possibility is $r=0$.
+
+  Hence, $a=qd$, so $a \in (d)$, giving $I \subseteq (d)$.
+
+  Since we had $(d) \subseteq I$ and now we got $I \subseteq (d)$, we have $I = (d)$, so every ideal of $\mathbb{Z}$ is principal. Thus $\mathbb{Z}$ is a Principal Ideal Domain(PID).
+\end{proof}
+
+\begin{lemma}{}
+  $K[X]$ is a PID.
+\end{lemma}
+\begin{proof}
+  This proof follows very similarly to the previous proof.\\
+
+  Let $K$ be a field, $K[X]$ a polynomial ring.
+
+  Take $\{0\} \neq I \subseteq K[X]$.
+
+  Since $I \neq \{0\}$, there is at least one non-zero polynomial in $I$.
+
+  Let $p(X) \in I$ be of minimal degree among nonzero elements of $I$.
+
+  Observe that $(p(X)) \subseteq I$, because $p(X) \in I$ and $I$ is an ideal.
+
+  Let $f(X) \in I$. By Euclidean division algorithm in $K[X]$, $\exists q, r \in K[X]$ such that $f(X) = q(X) \cdot p(X) + r(X)$ with eithr $r(X)=0$ or $deg(r) < deg(p)$.
+
+  Since $f,p \in I$, then $r(X) = f(X) - q(X)\cdot p(X) \in I$
+
+  If $r(X) \neq 0$, then $deg(r) < deg(p)$, which contradicts the minimality of $deg(p)$ in $I$.
+
+  Therefore, $r(X)=0$, thus $f(X)=q(X)\cdot p(X)$, hence $f(X) \in (p(X))$.
+  Henceforth, $I \subseteq (p(X))$.
+
+  Then, since $(p(X)) \subseteq I$ and $I \subseteq (p(X))$, we have that $I = (p(X))$.
+
+  So every ideal of $K[X]$ is principal; thus $K[X]$ is a PID.
+
+\end{proof}
+
+
+
+\subsection{Lemmas, propositions and corollaries}
+
+Let $\Sigma$ be a partially orddered set. Given subset $S \subset \Sigma$, an \emph{upper bound} of $S$ is an element $u \in \Sigma$ such that $s<u \forall s \in S$.
+
+A \emph{maximal element} of $\Sigma$, is $m \in \Sigma$ such that $m<s$ does not hold for any $s \in \Sigma$.
+
+A subset $S \subset \Sigma$ is \emph{totally ordered} if for every pair $s_1,s_2 \in S$, either $s_1 \leq s_2$ or $s_2 \leq s_1$.
+
+\begin{lemma}{R.1.7}{Zorn's lemma} \label{zorn}
+  suppose $\Sigma$ a nonempty partially ordered set (ie. we are given a relation $x \leq y$ on $\Sigma$), and that any totally ordered subset $S \subset \Sigma$ has an upper bound in $\Sigma$.
+
+  Then $\Sigma$ has a maximal element.
+\end{lemma}
+
+\begin{thm}{AM.1.3} \label{1.3}
+  Every ring $A \neq 0$ has at least one maximal ideal.
+\end{thm}
+\begin{proof}
+  By Zorn's lemma \ref{zorn}.
+\end{proof}
+
+\begin{cor}{AM.1.4} \label{1.4}
+  if $I \neq (1)$ an ideal of $A$, $\exists$ a maximal ideal of $A$ containing $I$.
+\end{cor}
+
+\begin{cor}{AM.1.5} \label{1.5}
+  Every non-unit of $A$ is contained in a maximal ideal.
+\end{cor}
+
+\begin{defn}{Jacobson radical}
+  The \emph{Jacobson radical} of a ring $A$ is the intersection of all the maximal ideals of $A$.
+
+  Denoted $Jac(A)$.
+  
+  $Jac(A)$ is an ideal of $A$.
+\end{defn}
+
+\begin{prop}{AM.1.9} \label{1.9}
+  $x \in Jac(A)$ iff $(1 - xy)$ is a unit in $A$, $\forall y \in A$.
+\end{prop}
+\begin{proof}
+  Suppose $1-xy$ not a unit.
+
+  By \ref{1.5}, $1-xy \in \mM$ for $\mM$ some maximal ideal.
+
+  But $x \in Jac(A) \subseteq \mM$, since $Jac(A)$ is the intersection of all maximal ideals of $A$.
+
+  Hence $xy \in \mM$, and therefore $1 \in \mM$, which is absurd, thus $1-xy$ is a unit.
+
+  Conversely:\\
+  Suppose $x \not\in \mM$ for some maximal ideal $\mM$.
+
+  Then $\mM$ and $x$ generate the unit ideal $(1)$, so that we have $u + xy = 1$ for some $u \in \mM$ and some $y \in A$.
+
+  Hence $1 -xy \in \mM$, and is therefore not a unit.
+\end{proof}
+
+\section{Modules}
+
+\subsection{Modules concepts}
+
+Let $A$ be a ring. An $A$-module is an Abelian group $M$ with a multiplication
+map
+\begin{align*}
+  A \times M &\longrightarrow M\\
+  (f, m) &\longmapsto fm
+\end{align*}
+satisfying $\forall~ f,g \in A,~~ m, n \in M$.
+\begin{enumerate}[i.]
+  \item $f(m \pm n)=fm \pm fn$
+  \item $(f \pm g) m = fm \pm gm$
+  \item $(fg) m = f(gm)$
+  \item $1_A m = m$
+\end{enumerate}
+
+Let $\psi: M \longrightarrow M$ an $A$-linear endomorphism of $M$.\\
+$A[\psi] \subset End M$ is the subring geneerated by $A$ and the action of $\psi$.
+\begin{itemize}
+\item since $\psi$ is $A$-linear, $A[\psi]$ is a commutative ring.
+\item $M$ is a module over $A[\psi]$, so $\psi$ beomes multiplication by a ring element.
+\end{itemize}
+
+\subsection{Cayley-Hamilton theorem, Nakayama lemma, and corollaries}
+
+\begin{prop}{AM.2.4}(Cayley-Hamilton Theorem) \label{2.4}
+  Let $M$ a fingen $A$-module. Let $\aA$ an ideal of $A$, let $\psi$ an
+  $A$-module endomorphism of $M$ such that $\psi(M) \subseteq \aA M$.
+
+  Then $\psi$ satisfies
+  
+  $$\psi^n + a_1 \psi^{n-1} + \ldots + a_{n-1} \psi + a_n = 0$$
+
+  with $a_i \in \aA$.
+\end{prop}
+\begin{proof}
+  Since $M$ fingen, let $\{ x_1, \ldots, x_n \}$ be generators of $M$.\\
+  By hypothesis, $\psi(M) \subseteq \aA M$; so for any generator $x_i$, it's image $\psi(x_i) \in \aA M$.
+
+  Any element in $\aA M$ is a linear combination of the generators with coefficients in the ideal $\aA$, thus
+  $$\psi(x_i)= \sum_{j=1}^n a_{ij} x_j$$
+  with $a_{ij} \in \aA$.
+  
+  Thus, for a module with $n$ generators, we have $n$ different $\psi(x_i)$ equations:
+
+  $$
+  \left.
+  \begin{aligned}
+    \psi(x_1) &= a_{1,1} x_1 + a_{1,2} x_2 + \ldots + a_{1,n} x_n\\
+    \psi(x_2) &= a_{2,1} x_1 + a_{2,2} x_2 + \ldots + a_{2,n} x_n\\
+    \ldots\\
+    \psi(x_n) &= a_{n,1} x_1 + a_{n,2} x_2 + \ldots + a_{n,n} x_n
+  \end{aligned}
+  \right\}
+  \begin{aligned}
+      &\text{n elements $\psi(x_i) \in \aA M$ which}\\
+      &\text{are linear combinations of the}\\
+      &\text{$n$ generators of $M$}
+  \end{aligned}
+  $$
+  
+  Next step: rearrange in order to use matrix algebra.
+
+  Observe that each row equals $0$, and rearranging the elements at each row we get
+
+  $$
+  \left.
+  \begin{aligned}
+    &\psi(x_1) - (a_{1,1} x_1 + a_{1,2} x_2 + \ldots + a_{1,n} x_n) = 0\\
+    &\psi(x_2) - (a_{2,1} x_1 + a_{2,2} x_2 + \ldots + a_{2,n} x_n) = 0\\
+    &\ldots\\
+    &\psi(x_n) - (a_{n,1} x_1 + a_{n,2} x_2 + \ldots + a_{n,n} x_n) = 0
+  \end{aligned}
+  \right\}
+  $$
+
+  Then, group the $x_i$ terms together; as example, take the row $i=1$:
+    $$(\psi - a_{1,1})x_1 - a_{1,2} x_2 - \ldots - a_{1,n} x_n = 0$$
+
+  $$
+  \left.
+  \begin{aligned}
+    &~~~~(\psi - a_{1,1})x_1 - a_{1,2} x_2 - \ldots - a_{1,n} x_n = 0\\
+    &-a_{2,1} x_1 + (\psi - a_{2,2}) x_2 - \ldots - a_{2,n} x_n = 0\\
+    &\ldots\\
+    &-a_{1,1} x_1 - a_{1,2} x_2 - \ldots + (\psi - a_{1,n}) x_n = 0\\
+  \end{aligned}
+  \right\}
+  $$
+    
+  So, $\forall i \in [n]$, as a matrix:
+  
+  $$
+  \begin{pmatrix}
+    \psi - a_{1,1} & -a_{1,2} & \ldots & -a_{1,n}\\
+    -a_{2,1} & \psi-a_{2,2} & \ldots & -a_{2,n}\\
+    \vdots\\
+    -a_{n,1} & -a_{n,2} & \ldots & \psi-a_{n,n}\\
+  \end{pmatrix}
+  \begin{pmatrix}
+    x_1\\ x_2\\ \vdots\\ x_n
+  \end{pmatrix}
+  =
+  \begin{pmatrix}
+    0\\ 0\\ \vdots\\ 0
+  \end{pmatrix}
+  $$
+
+
+  
+  Denote the previous matrix by $\Phi$. Let $m$ denote the vector $(x_1, x_2, \ldots, x_n)^T$ (ie. the vector of generators of the $A$-module $M$).\\
+  \hspace*{4em}Then we can write the previous equality as
+  \begin{equation}
+    \Phi \cdot m = 0
+    \label{eq:2.4.1}
+  \end{equation}
+
+  We know that
+  \begin{equation}
+    adj(\Phi) \Phi = det(\Phi) I
+    \label{eq:2.4.2}
+  \end{equation}
+  (aka. \emph{fundamental identity for the adjugate matrix}).
+
+  So if at \eqref{eq:2.4.1} we multiply both sides by $adj(\Phi)$,
+  \begin{align*}
+    adj(\Phi) \cdot \Phi \cdot &m = 0\\
+    (\text{recall from \eqref{eq:2.4.2}:}~ &adj(\Phi)\Phi=det(\Phi)\cdot I ~)\\
+    =det(\Phi) \cdot I \cdot &m = 0
+  \end{align*}
+
+  Thus,
+  \begin{align*}
+    det(\Phi) \cdot I \cdot &m = 0:\\
+  \begin{pmatrix}
+    det(\Phi) & 0 & \ldots & 0\\
+    0 & det(\Phi) & \ldots & 0\\
+    \vdots\\
+    0 & 0 & \ldots & det(\Phi)
+  \end{pmatrix}
+  \cdot
+  &\begin{pmatrix}
+    x_1\\ x_2\\ \vdots\\ x_n
+  \end{pmatrix}
+                              =
+  \begin{pmatrix}
+    0\\ 0\\ \vdots\\ 0
+  \end{pmatrix}
+  \end{align*}
+
+  $\Longrightarrow$
+  \begin{equation}
+    det(\Phi) \cdot x_i = 0 ~~\forall i \in [n]
+    \label{eq:2.4.3}
+  \end{equation}
+
+  ie. $det(\Phi)$ is an \emph{annihilator} of the generators $x_i$ of $M$, thus
+  is an annihilator of the entire module $M$.
+
+
+  So, we're interested into calculating the $det(\Phi)$.
+
+  By the Leibniz formula,
+  $$\det(A) = \sum_{\sigma \in S_n} sgn(\sigma) \prod_{i=1}^n a_{i, \sigma(i)}$$
+
+  thus,
+  $$det(\Phi) = \underbrace{(\psi - a_{11}) (\psi - a_{22}) \ldots (\psi - a_{nn})}_{\text{diagonal of $\Phi$, leading term of the determinant}} - \ldots$$
+
+  The \emph{determinant trick} is that the terms that go after the "leading term of the determinant", will belong to $\aA$ and their combinations with $\psi$ will not be bigger than $\psi^n$. Furthermore, when expanding it
+  \begin{itemize}
+    \item highest power is $1 \cdot \psi^n$
+    \item coefficient of $\psi^{n-1}$ is $-( \underbrace{ a_{11} + a_{22} + \ldots + a_{nn} }_{a_1})$,\\
+      where, since each $a_{ii} \in \aA,~~ a_1 \in \aA$
+    \item the rest of coefficients of $\psi^k$ are also elements in $\aA$
+  \end{itemize}
+
+  Therefore we have
+  $$det(\Phi) = \psi^n + a_1 \psi^{n-1} + a_2 \psi^{n-2} + \ldots + a_{n-1} \psi + a_n$$
+  with $a_i \in \aA$.
+
+  \vspace{0.5cm}
+
+  Now, notice that we had $det(\Phi) \cdot x_i = 0 ~\forall~ i\in [n]$.
+
+  The matrix $\Phi$ is the \emph{characteristic matrix}, $xI-A$, viewed as an operator. Then,
+  $$det(\Phi) = det(xI-A) = p(x)$$
+  where $p(x)$ is the \emph{characteristic polynomial}.
+
+  If a linear transformation turns every basis vector ($x_i$) into zero, then that transformation is the zero transformation. So in our case, $det(\Phi)$ is the zero transformation, thus $det(\Phi)=0$.
+  Therefore,
+  $$\psi^n + a_1 \psi^{n-1} + a_2 \psi^{n-2} + \ldots + a_{n-1} \psi + a_n = 0$$
+
+
+  %%%%%% OLD START
+
+  % \vspace{3cm}
+  % 
+  % Kronecker delta:
+  % $\delta_{ij} =
+  % \begin{cases}
+  %   1 & \text{if } i = j,\\
+  %   0 & \text{otherwise}
+  % \end{cases}$
+  % 
+  % With the Kronecker delta, $\psi(x_i)$ can be expressed as
+  % $$\psi(x_i) = \sum_{j=1}^n \delta_{ij} \psi(x_j)$$
+  % so the previous matrix can be characterized as
+  % $$\sum_{j=1}^n (\delta_{ij} \psi - a_{ij}) x_j = 0$$
+  % 
+  % The entries of the matrix are \emph{endomorphisms} (elements of the ring $A[\psi]$)
+  % \begin{itemize}
+  %   \item the term $(\psi - a_{11})$ is an operator that acts on $x_1$; as $(\psi(x_1)-a_{11}\cdot x_1)$
+  %   \item the term $(-a_{12})$ is an operator that acts on $x_2$; as multiplication by it, ie. $(-a_{12} \cdot x_2)$
+  % \end{itemize}
+  % 
+  % We need a single element $x \in A$ that \emph{annihilates} every $m \in M$ simultaneously, ie. $xM=0$. We're going to use the determinant for getting $x$.
+  % 
+  % Since $A$ is a commutative ring, and $\psi$ commutes with any $a \in A$,
+  % the ring of operators $A[\psi]$ is a commutative ring.
+  % 
+  % $\Longrightarrow~$ so we can treat the matrix as a matrix of real numbers and calculate its determinant.
+  % 
+  % 
+  % \vspace{0.75cm}
+  % This is called \emph{"the determinant trick"}.\\
+  % We're interested in the determinant because it is the only way to turn a system of multiple equations in a single scalar-like equation that describes the endomorphism $\psi$.\\
+  % $\rightarrow$ Because in module theory, we lack of "division", so can not "solve for $\psi$" the system of equations.\\
+  % $\rightarrow$ The determinant provides a way to find a polynomial that \emph{annihilates} the module; the \emph{characteristic polynomial}, which related $\psi$ to the ideal $\aA$
+  % 
+  % $$det(M) \cdot x_i = 0~~ \forall i$$
+  % where $x_i$ are the generators of $M$.
+  % 
+  % Use $\Phi$ to denote the previous matrix. The determinant is the only function that can take that matrix $\Phi$ and produce a single scalar $x=det(\Phi)$ such that the following identity holds: $adj(\Phi)\cdot \Phi=det(\Phi) \cdot \aA$.
+  % \vspace{0.5cm}
+  % 
+  % Since $det(M)$ kills every generator, it must kill every element in $M$\\
+  % $\Longrightarrow~~ det(M)$ is the zero map.
+  % 
+  % Leibniz formula of the determinant of an $n \times n$ matrix:
+  % $$
+  % det(M) = \sum_{\sigma \in S_n} sign(\sigma) \prod_{i=1}^n M_{i, \sigma(i)}
+  % $$
+  % 
+  % so,
+  % $$(\psi - a_{11}) (\psi - a_{22}) \ldots (\psi - a_{nn})$$
+  % expanding it,
+  % \begin{itemize}
+  %   \item highest power is $1 \cdot \psi^n$
+  %   \item coefficient of $\psi^{n-1}$ is $-( \underbrace{ a_{11} + a_{22} + \ldots + a_{nn} }_{a_1})$,\\
+  %     where, since each $a_{ii} \in \aA,~~ a_1 \in \aA$
+  %   \item the rest of coefficients of $\psi^k$ are also elements in $\aA$
+  % \end{itemize}
+  % 
+  % So we have
+  % $$p(\psi) = \psi^n + a_1 \psi^{n-1} + a_2 \psi^{n-2} + \ldots + a_{n-1} \psi + a_n$$
+  % with $a_i \in \aA$.
+  % 
+  % Since this determinant annihilates the generators (ie. $det(M)x_i=0$), the resulting enddomorphism $p(\psi)$ is the zero map on the entire module $M$, so:
+  % $$\psi^n + a_1 \psi^{n-1} + a_2 \psi^{n-2} + \ldots + a_{n-1} \psi + a_n = 0$$
+  % with $a_i \in \aA$, as stated in the Cayley-Hamilton theorem.
+  
+  %%%%% OLD END
+\end{proof}
+
+
+\vspace{0.5cm}
+
+\begin{cor}{AM.2.5} \label{2.5}
+  Let $M$ a fingen $A$-module, let $\aA$ an ideal of $A$ such that $\aA M = M$.
+
+  Then, $\exists~ x \equiv 1 \pmod \aA$ such that $xM = 0$.
+\end{cor}
+\begin{proof}
+  take $\psi = \text{identity}$. Then in Cayley-Hamilton (\ref{2.4}):
+  \begin{align*}
+    &\psi^n + a_1 \psi^{n-1} + a_2 \psi^{n-2} + \ldots + a_{n-1} \psi + a_n = 0\\
+    \Longrightarrow~ &id_M + a_1 id_M + a_2 id_M + \ldots + a_{n-1} id_M + a_n = 0\\
+    \Longrightarrow~ &(1 + a_1 + \ldots + a_n) id_M = 0
+  \end{align*}
+  apply it to $m \in M$, where since $id_M(m)=m$ (by definition of the identity), we then have
+  $$(1 + a_1 + \ldots + a_n) \cdot m = 0$$
+  with $a_i \in \aA$.
+
+  \begin{enumerate}[\text{part} i.]
+    \item $xM=0$:\\
+      Thus the scalar $x = (1 + a_1 + \ldots + a_n)$ annihilates every $m \in M$, ie. the entire module $M$.
+
+    \item $x \equiv 1 \pmod \aA$:\\
+      $x \equiv 1 \pmod \aA ~~ \Longleftrightarrow (x-1) \in \aA$\\
+      then from $x = (1 + \underbrace{a_1 + \ldots + a_n}_b) \in \aA$, set $b=a_1 + \ldots + a_n$,\\
+      so that $x=(1+b) \in \aA$.\\
+
+      Then $x-1 = (1+b)-1 = b \in \aA$\\
+      so $x-1 \in \aA$, thus $x \equiv 1 \pmod \aA$ as stated.
+  \end{enumerate}
+\end{proof}
+
+
+
+\begin{prop}{AM.2.6}{Nakayama's lemma} \label{2.6}
+  Let $M$ a fingen $A$-module, let $\aA$ an ideal of $A$ such that $\aA \subseteq Jac(A)$.
+
+  Then $\aA M = M$ implies $M=0$.
+\end{prop}
+\begin{proof}
+  By \ref{2.5}: since $\aA M = M$, we have $x M =0$ for some $x \equiv 1 \pmod {Jac(A)}$. (notice that at \ref{2.5} is $\pmod \aA$ but here we use $\pmod {Jac(A)}$, since we have $\aA \subseteq Jac(A)$).
+
+  (recall \ref{1.9}: $x \in Jac(A)$ iff $(1 - xy)$ is a unit in $A$, $\forall y \in A$).\\
+  By \ref{1.9}, $x$ is a unit in $A$ (thus $x^{-1}\cdot x=1$).
+
+  Hence $M = x^{-1} \cdot \underbrace{x~ \cdot M}_{=0~ \text{(by \ref{2.5})}} = 0$.
+
+  Thus, if $\aA M = M$ then $M=0$.
+\end{proof}
+
+
+
+\begin{cor}{AM.2.7} \label{2.7}
+  Let $M$ a fingen $A$-module, let $N \subseteq M$ a submodule of $M$, let $\aA \subseteq Jac(A)$ an ideal.
+
+  Then $M = \aA M + N \stackrel{\text{implies}}{\Longrightarrow} M=N$.
+\end{cor}
+\begin{proof}
+  The idea is to apply Nakayama (\ref{2.6}) to $M/N$.
+
+  Since $M$ fingen $\Longrightarrow~~ M/N$ is fingen and an $A$-module.
+
+  Since $\aA \subseteq Jac(A) ~\Longrightarrow~$ Nakayama applies to $M/N$ too.
+
+  By definition,
+  $$\aA M = \left\{ \sum a_i \cdot m_i ~~|~~ a_i \in \aA, m_i \in M \right\}$$
+  where $m_i$ are the generators of $M$.
+
+  Then, for $M/N$,
+  $$\aA (\frac{M}{N}) = \left\{ \sum a_i \cdot (m_i + N) ~~|~~ a_i \in \aA, m_i \in M \right\}$$
+
+  observe that $a_i(m_i+N)= a_i m_i +N$, thus
+  $$\sum_i a_i \cdot (m_i + N) = \underbrace{(\sum_i a_i \cdot m_i)}_{\in \aA M} + N \in \aA M + N$$
+
+  Hence,
+
+  \begin{equation}
+    \aA (\frac{M}{N}) = \left\{ x + N ~~|~~ x \in \aA M \right\} = \aA M + N
+    \label{eq:2.7.1}
+  \end{equation}
+
+  By definition, if we take $\frac{\aA M + N}{N}$, then
+  $$\frac{\aA M + N}{N} = \left\{ y + N ~~|~~ y \in \aA M +N \right\} = \aA M + N$$
+
+  thus every $y \in \aA M +N$ can be written as
+  $$y=x+n,~~ \text{with}~ x \in \aA M,~ n\in N$$
+  which comes from \eqref{eq:2.7.1}.
+
+  Thus, $y + N = (x+n)+N = x+N$, since $n \in N$ is zero in the quotient.
+  
+  Hence, every element of $\frac{\aA M +N}{N}$ has the form
+  $$\frac{\aA M + N}{N} = \left\{ x + N ~~|~~ x \in \aA M \right\}$$
+  as in \eqref{eq:2.7.1}.
+
+  Thus
+  \begin{equation}
+    \aA (\frac{M}{N}) = \aA M + N = \frac{\aA M +N}{N}
+    \label{eq:2.7.2}
+  \end{equation}
+
+  By the Collorary assumption, $M = \aA M + N$; quotient it by $N$:
+  \begin{equation}
+    \frac{M}{N} = \frac{\aA M +N}{N}
+  \label{eq:2.7.3}
+  \end{equation}
+
+  So, from \eqref{eq:2.7.2} and \eqref{eq:2.7.3}:
+  $$\aA (\frac{M}{N}) = \aA M +N = \frac{\aA M +N}{N} = \frac{M}{N}$$
+  thus, $\aA (\frac{M}{N}) = \frac{M}{N}$.
+
+  By Nakayama's lemma \ref{2.6}, if $\aA (\frac{M}{N}) = \frac{M}{N} ~\stackrel{implies}{\Longrightarrow}~ \frac{M}{N}=0$
+
+  Note that
+  $$\frac{M}{N} = \{ m + N ~|~ m \in M \}$$
+  (the zero element in $\frac{M}{N}$ is the coset $N=0+N$)
+
+  Then, $\frac{M}{N}=0$ means that the quotient has exactly one element, the zero coset $N$.
+
+  Thus, every coset $m + N$ equals the zero coset $N$, so $m-0 \in N ~\Longrightarrow~ m \in N$.
+
+  Hence every $m \in M$ lies in $N$, ie. $\forall m \in M,~ m \in N$.
+
+  So $M \subseteq N$. But notice that by the Corollary, we had $N \subseteq M$, therefore $M = N$.
+
+  Thus, if $M = \aA M + N \stackrel{implies}{\Longrightarrow} M = N$.
+\end{proof}
+
+
+
+\begin{prop}{AM.2.8} \label{2.8}
+  Let $x_i \forall i \in [n]$ be elements of $M$ whose images $\frac{M}{m M}$ from a basis of this vector space. Then the $x_i$ generate $M$.
+\end{prop}
+\begin{proof}
+  Let $N$ submodule $M$, generated by the $x_i$.
+
+  Then the composite map $N \longrightarrow M \longrightarrow \frac{M}{m M}$ maps $N$ onto $\frac{M}{m M}$, hence $N + \aA M = M$, which by \ref{2.7} implies $N = M$.
+\end{proof}
+
+
+\begin{prop}{AM.2.10} \label{2.10}
+  Split exact sequence. TODO
+\end{prop}
+
+\section{Noetherian rings}
+
+\begin{defn}{}{Ascending Chain Condition}
+  A partially orddered set $\Sigma$ has the \emph{ascending chain condition} (a.c.c.) if every chain
+  $$s_1 \leq s_2 \leq \ldots \leq s_k \leq \ldots$$
+  eventually breaks off, that is, $s_k = s_{k+1} = \ldots$ for some $k$.
+\end{defn}
+
+$\Longrightarrow~ \Sigma$ has the a.c.c. iff every non-empty subset $S \subset \Sigma$ has a maximal element.\\
+\hspace*{2em} if $\empty \neq S \subset \Sigma$ does not have a maximal element, choose $s_1 \in S$, and for each $s_k$, an element $s_{k+1}$ with $s_k < s_{k+1}$, thus contradicting the a.c.c.
+
+\begin{defn}{R.3.2}{Noetherian ring}
+  Let $A$ a ring; 3 equivalent conditions:
+  \begin{enumerate}[i.]
+    \item the set $\Sigma$ of ideals of $A$ has the a.c.c.; in other words, every increasing chain of ideals
+      $$I_1 \subset I_2 \subset \ldots \subset I_k \subset \ldots$$
+      eventually stops, that is $I_k = I_{k+1}=\ldots$ for some $k$.
+    \item every nonempty set $S$ of iddeals has a maximal element
+    \item every iddeal $I \subset A$ is finitely generated
+  \end{enumerate}
+  If these conditions hold, then $A$ is \emph{Noetherian}.
+\end{defn}
+\begin{proof}
+  TODO
+\end{proof}
+
+\begin{defn}{R.3.4.D}{Noetherian modules}
+  An $A$-module $M$ is Noetherian if the submoles of $M$ have the a.c.c.,\\
+  that is, ay increasing chain
+  $$M_1 \subset M_2 \subset \ldots \subset M_k \subset \ldots$$
+  of submodules eventually stops.
+\end{defn}
+
+As in with rings, it is equivalent to say that
+\begin{enumerate}[i.]
+  \item any nonempty set of modulesof $M$ has a maximal element
+  \item every submodule of $M$ is finite
+\end{enumerate}
+
+
+
+\begin{prop}{R.3.4.P}
+  Let $0 \longrightarrow L \xrightarrow{\ \alpha \ } M \xrightarrow{\ \beta \ } N \longrightarrow 0$ be a s.e.s. (split exact sequence, \ref{2.10}).
+
+  Then, $M$ is Noetherian $\Longleftrightarrow~ L$ and $N$ are Noetherian.
+\end{prop}
+\begin{proof}
+  $\Longrightarrow$: trivial, since ascending chains of submodules in $L$ and $N$ correspond one-to-one to certain chains in $M$.
+
+  $\Longleftarrow$: suppose $M_1 \subset M_2 \subset \ldots \subset M_k \subset \ldots$ is an increasing chain of submodules of $M$.
+
+  Then identifying $\alpha(L)$ with $L$ and taking intersection gives a chain
+  $$L \cap M_1 \subset L \cap M_2 \subset \ldots \subset L \cap M_k \subset \ldots$$
+  of submodules of $L$, and applying $\beta$ gives a chain
+  $$\beta(M_1) \subset \beta(M_2) \subset \ldots \beta(M_k) \subset \ldots$$
+  of submodules of $N$.
+
+  Each of these two chains eventually stop, by the assumption on $L$ and $N$, so that we only need to prove the following lemma which completes the proof.
+\end{proof}
+
+\begin{lemma}{R.3.4.L}
+  for submodules $M_1 \subset M_2 \subset M$,
+  $$L \cap M_1 = L \cap M_2 ~\text{and}~ \beta(M_1) = \beta(M_2) ~\Longrightarrow~ M_1 = M_2$$
+\end{lemma}
+\begin{proof}
+  if $m\in M_2$, then $\beta(m) \in \beta(M_1) = \beta(M_2)$, so that there is an $n \in M_1$ such that $\beta(m)=\beta(m)$.
+
+  Then $\beta(m-n)=0$, so that
+  $$m - n \in M_2 \cap ker(\beta)=M_1 \cap ker(\beta)$$
+
+  Hence $m \in M_1$, thus $M_1 = M_2$.
+\end{proof}
+
+\newpage
+
+\section{Exercises}
+
+For the exercises, I follow the assignments listed at \cite{mit-course}.
+
+The exercises that start with \textbf{R} are the ones from the book \cite{reid}, and the ones starting with \textbf{AM} are the ones from the book \cite{am}.
+
+\subsection{Exercises Chapter 1}
+
+\begin{ex}{R.1.1}
+  Ring $A$ and ideals $I, J$ such that $I \cup J$ is not an ideal. What's the smallest ideal containing $I$ and $J$?
+\end{ex}
+\begin{proof}
+  Take ring $A= \mathbb{Z}$. Set $I = 2 \mathbb{Z},~ J=3 \mathbb{Z}$.
+
+  $I,~J$ are ideals of $A$ ($=\mathbb{Z}$). And $I \cup J = 2 \mathbb{Z} \cup 3 \mathbb{Z}$.\\
+  Observe that for $2 \in I,~ 3 \in J ~\Longrightarrow~ 2,3 \in I \cup J$, but $2+3 = 5 \not\in I \cup J$.
+
+  Thus $I \cup J$ is not closed under addition; thus is not an ideal.
+
+
+  Smallest ideal of $\mathbb{Z}$ ($=A$) containing $I$ and $J$ is their sum:
+
+  $$I+J = \{ a+b | a \in I, b \in J \}$$
+
+  $gcd(2,3)=1$, so $I+J = \mathbb{Z}$.
+
+  Therefore, smallest ideal containing $I$ and $J$ is the whole ring $\mathbb{Z}$.
+\end{proof}
+
+\begin{ex}{R.1.5}
+  let $\psi: A \longrightarrow B$ a ring homomorphism. Prove that $\psi^{-1}$ takes prime ideals of $B$ to prime ideals of $A$.\\
+  In particular if $A \subset B$ and $P$ a prime ideal of $B$, then $A \cap P$ is a prime ideal of $A$.
+\end{ex}
+\begin{proof}
+  (Recall: prime ideal is if $a,b \in R$ and $a \cdot b \in P$ (with $R \neq P$), implies $a \in P$ or $b \in P$).
+
+  Let
+  $$\psi^{-1}(P) = \{ a \in A | \psi(a) \in P \} = A \cap P$$
+  The claim is that $\psi^{-1}(P)$ is prime iddeal of $A$.
+
+  \begin{enumerate}[i.]
+    \item show that $\psi^{-1}(P)$ is an ideal of $A$:\\
+      $0_A \in \psi^{-1}(P)$, since $\psi(0_A)=0_B \in P$ (since every ideal contains $0$).
+
+      If $a,b \in \psi^{-1}(P)$, then $\psi(a), \psi(b) \in P$, so
+      $$\psi(a-b)= \psi(a) - \psi(b) \in P$$
+      hence $a-b \in \psi^{-1}(P)$.
+
+      If $a \in \psi^{-1}(P)$ and $r \in A$, then $\psi(ra) = \psi(r) \psi(a) \in P$, since $P$ is an ideal.\\
+      Thus $ra \in \psi^{-1}(P)$.
+
+      $\Longrightarrow$ so $\psi^{-1}$ is an ideal of $A$.
+
+    \item show that $\psi^{-1}(P)$ is prime:\\
+      $\psi^{-1}(P) \neq A$, since if $\psi^{-1}(P)=A$, then $1_A \in \psi^{-1}(P)$, so $\psi(1_A)=1_B \in P$, which would mean that $P=B$, a contradiction since $P$ is prime ideal of $B$.
+
+      Take $a,b \in A$ with $ab \in \psi^{-1}(P)$; then $\psi(ab) \in P$, and since $\psi$ is a ring homomorphism, $\psi(ab) = \psi(a)\psi(b)$.
+
+      Since $P$ prime ideal, then $\psi(a)\psi(b) \in P$ implies either $\psi(a) \in P$ or $\psi(b) \in P$.\\
+      Thus $a \in \psi^{-1}(P)$ or $b \in \psi^{-1}(P)$.
+
+      Hence $\psi^{-1}(P)$ ($=A \cap P$) is a prime ideal of $A$.
+  \end{enumerate}
+\end{proof}
+
+
+\begin{ex}{R.1.6}
+  prove or give a counter example:
+  \begin{enumerate}[a.]
+    \item the intersection of two prime ideals is prime
+    \item the ideal $P_1+P_2$ generated by $2$ prime ideals $P_1,P_2$ is prime
+    \item if $\psi: A \longrightarrow B$ ring homomorphism, then $\psi^{-1}$ takes maximal ideals of $B$ to maximal ideals of $A$
+    \item the map $\psi^{-1}$ of Proposition 1.2 takes maximal ideals of $A/I$
+      to maximal ideals of $A$
+  \end{enumerate}
+\end{ex}
+\begin{proof}
+  \begin{enumerate}[a.]
+    \item let $I = 2 \mathbb{Z} = (2)$, $J = 3 \mathbb{Z} = (3)$ be ideals of $\mathbb{Z}$, both prime.
+
+      Then $I \cap J = (2) \cap (3) = (6)$.
+
+      The ideal $(6)$ is not prime in $\mathbb{Z}$, since $2 \cdot 3 \in (6)$, but $2 \neq (6)$ and $3 \neq (6)$.
+
+      Thus the intersection of two primes can not be prime.
+
+    \item $P_1=(2),~ P_2=(3)$, both prime.
+
+      Then,
+      $$P_1 + P_2 = (2)+(3)=\{ a+b | a \in P_1, b \in P_2 \}$$
+
+      $\longrightarrow~$ in a principal ideal domain (like $\mathbb{Z}$), the sum of two principal ideals is again principal, and given by $(m)+(n)=(gcd(m,n))$.
+
+      (recall: principal= generated by a single element)
+
+      So, $P_1+P_2= (2)+(3) = (gcd(2,3))=(1)=\mathbb{Z}$.
+
+      The whole ring is not a prime ideal (by the definition of the prime ideal), so $P_1+P_2$ is not a prime ideal.
+
+      Henceforth, the sum of two prime ideals is not necessarily prime.
+
+    \item let $A=\mathbb{Z},~ B=\mathbb{Q},~ \psi: A \longrightarrow B$.
+
+      Since $\mathbb{Q}$ is a field, its only maximal ideal is $(0)$.
+
+      Then
+      \begin{align*}
+        \psi^{-1}( (0) ) &= (0) \subset \mathbb{Z}\\
+        \text{ie.}~ \psi^{-1}( m_B ) &= (m_B) \subset A
+      \end{align*}
+
+      But $(0)$ is not maximal in $\mathbb{Z}$, because $\mathbb{Z}/(0) \cong \mathbb{Z}$ is not a field.
+
+      Thus the preimages of maximal ideals under arbitrary ring homomorphisms need not be maximal.
+
+    \item $\psi: A \longrightarrow A/I$ quotient homomorphism, $I \subseteq A$ an ideal.
+
+      Let $M$ a maximal ideal of $A/I$, then $\frac{(A/I)}{M}$ is a field (Proposition 1.3).
+
+      By the isomorphism theorems,
+      $$\frac{(A/I)}{M} \cong \frac{A}{\psi^{-1}(M)}$$
+
+
+      Since $\frac{(A/I)}{M}$ is a field, the quotient $\frac{A}{\psi^{-1}(M)}$ is a field, so $\psi^{-1}(M)$ is a maximal ideal of $A$.
+
+      $\Longrightarrow~$ under $\psi$, preimages of maximal ideals are maximal.
+  \end{enumerate}
+\end{proof}
+
+\begin{ex}{R.1.12.a}
+  if $I,J$ ideals and $P$ prime ideal, prove that
+  $$IJ \subset P ~\Longleftrightarrow~ I \cap J \subset P ~\Longleftrightarrow~ I ~\text{or}~ J \subset P$$
+\end{ex}
+\begin{proof}
+  assume $I \subseteq P$ (for $J \subseteq P$ will be the same, symmetric), take $x \in IJ$,
+
+  then
+  $$x = \sum_{k=1}^n a_k b_k$$
+  with $a_k \in I,~ b_k \in J$.
+
+  Each $a_k \in I \subseteq P$. Since $P$ an ideal,
+  $$\sum_{k=1}^n a_k b_k \in P$$
+
+  thus $x \in P$, hence $IJ \subseteq P$.
+
+  So $I \subseteq P$ or $J \subseteq P$ $~\Longrightarrow IJ \subseteq P$.
+
+  \vspace{0.5cm}
+  Conversely,\\
+  assume $P$ prime and $IJ \subseteq P$.
+
+  Suppose by contradiction that $I \not\subseteq P$ and $J \not\subseteq P$.
+  \begin{itemize}
+    \item[-] since $I \not\subseteq P,~ \exists a \in I$ with $a \not\in P$
+    \item[-] since $J \not\subseteq P,~ \exists b \in J$ with $b \not\in P$
+  \end{itemize}
+  Since $a \in I,~ b \in J,~~ ab \in IJ \subseteq P$, but $P$ is prime, so $ab \in P$ implies that $a \in P$ or $b \in P$. This contradicts $a,b$ being taken outside of $P$.
+
+  Thus $I \not\subseteq P$ and $J \not\subseteq P$ are false.
+
+  \vspace{0.3cm}
+  So both directions are proven, hence
+  $$IJ \subseteq P ~\Longrightarrow~ I \subseteq P ~\text{or}~ J \subseteq P$$
+
+\end{proof}
+
+\begin{ex}{R.1.18}
+  Use Zorn's lemma to prove that any prime ideal $P$ contains a minimal prime ideal.
+\end{ex}
+\begin{proof}
+  Let $P$ prime ideal of $R$.
+
+  $$S = \{ Q \subseteq R ~|~ Q ~\text{a prime ideal AND}~ Q \subseteq P \}$$
+
+  Goal: show that $S$ has a minimal element, the minimal ideal contained in $P$.
+
+  $P \subset S$, so $S$ is nonempty.
+
+  Let $C \subseteq S$ be a chain (= totally ordered subset) with respect to inclusion.
+
+  Define
+  $$Q_C = \bigcap_{Q \in C} Q$$
+
+  Clearly $Q_C \subseteq P$, since each $Q \in C$ is $Q \subseteq P$.
+
+  Since $C$ is ordered by inclusion, it is a decreasing chain of prime ideals.
+
+  Intersection of a decreasing chain of prime ideals is again a prime ideal:
+  \begin{itemize}
+    \item[-] if $ab \in Q_C$, then $ab \in Q ~\forall Q \in C$
+    \item[-] since $Q$ prime, $\forall Q \in C$ either $a \in Q$ or $b \in Q$
+  \end{itemize}
+
+  If there were some $Q_1,~ Q_2 \in C$ with $a \in Q_1$ and $b \not\in Q_2$, then by total ordering, either $Q_1 \subseteq Q_2$ or $Q_2 \subseteq Q_1$.
+
+  In either case: contradiction, since the smaller one would have to contain the element that was assumed to be excluded.
+
+  Thus $\forall Q \in C$ the same element $a, b$ must lie in all $Q$. $\Longrightarrow~$ lies in the intersection of them, $Q_C$.
+
+  Henceforth, $Q_C$ is a prime ideal and lies in $S$, and its a lower bound of $C$ in $S$.
+
+  Now, $S$ is nonempty, and every chain in $S$ has a lower bound in $S$ (its intersection).\\
+  Therefore, $S$ has a minimal element $P_{min}$.
+
+  By construction, $P_{min}$ is a prime ideal $P_{min} \subseteq P$, and by minimality there are no strictly smaller prime ideals inside $P$.
+
+  So $P_{min}$ is a minimal prime ideal, contained in $P$.
+\end{proof}
+
+\begin{ex}{R.1.10}
+\end{ex}
+\begin{proof}
+\end{proof}
+
+\begin{ex}{R.1.11}
+\end{ex}
+\begin{proof}
+\end{proof}
+
+\begin{ex}{R.1.4}
+\end{ex}
+\begin{proof}
+\end{proof}
+
+\subsection{Exercises Chapter 2}
+
+\bibliographystyle{unsrt}
+\bibliography{commutative-algebra-notes.bib}
+
+\end{document}
diff --git a/galois-theory-notes.pdf b/galois-theory-notes.pdf
index 69bf452..dbb2932 100644
Binary files a/galois-theory-notes.pdf and b/galois-theory-notes.pdf differ
diff --git a/galois-theory-notes.tex b/galois-theory-notes.tex
index 40155ae..e989811 100644
--- a/galois-theory-notes.tex
+++ b/galois-theory-notes.tex
@@ -277,7 +277,7 @@
 \end{thm}
 
 \begin{thm}{9.10}
-  An irreducible polynomial $f \in K[t]$ ($K \subseteq \mathbb{C}$) is \emph{separable over} $K$ if it has simple zeros in $\mathbb{C}$, or equivelently, simple zeros in its splitting field.
+  An irreducible polynomial $f \in K[t]$ ($K \subseteq \mathbb{C}$) is \emph{separable over} $K$ if it has simple zeros in $\mathbb{C}$, or equivalently, simple zeros in its splitting field.
 \end{thm}
 
 \begin{lemma}{9.13}
@@ -809,7 +809,7 @@
 
   Let $f_i$ be the minimal polynimal of $\alpha_i$ over $K$.
 
-  Then, $M \supseteq L$ is spliting field of $\Prod_{i=1}^r f_i$, since $M$ is normal enclosure of $L:K$.
+  Then, $M \supseteq L$ is splitting field of $\Prod_{i=1}^r f_i$, since $M$ is normal enclosure of $L:K$.
 
   For every zero $\beta_{ij}$ of $f_i$ in $M$,\\
   $\exists$ an isomorphism $\sigma: K(\alpha_i) \longrightarrow K(\beta_{ij})$ by Corollary \ref{5.13}.
@@ -1065,7 +1065,7 @@ For $n \geq 3, ~~\mathbb{D}_n \subseteq \mathbb{S}_n$ (subgroup of the Symmetry
   then, $\exists$ at least one $c$ in $(a,b)$ such that $Df(c)=0$.
 \end{thm}
 \begin{proof} (proof source: cue math website)
-  Notice that when $Df(x_i)=0$ occours, is a maximum or minimum (extrema) value of $f$.
+  Notice that when $Df(x_i)=0$ occurs, is a maximum or minimum (extrema) value of $f$.
   $\Longrightarrow$ if a function is continuous, it is guaranteed to have both a maximum and a minimum point in the interval.\\
 
   Two possibilities:
@@ -1076,9 +1076,9 @@ For $n \geq 3, ~~\mathbb{D}_n \subseteq \mathbb{S}_n$ (subgroup of the Symmetry
     since $f$ not constant, must change directions in ordder to start and end at the same $y$-value ($f(a)=f(b)$).\\
     Thus at some point between $a$ and $b$ it will either have a minimum, maximum or both.
     \begin{enumerate}[a.]
-      \item does the maximum occour at a point where $Df > 0$?\\
+      \item does the maximum occur at a point where $Df > 0$?\\
 	No, because if $Df > 0$, then $f$ is increasing, but it can not increase since we're at its maximum point.
-      \item does the maximum occour at a point where $Df < 0$?\\
+      \item does the maximum occur at a point where $Df < 0$?\\
 	No, because if $Df < 0$, then $f$ is deccreasing, which means that at our left it was larger, but we're at a maximum point, so a contradiction.
     \end{enumerate}
     Same with minimus.\\
diff --git a/notes_fri_stir.pdf b/notes_fri_stir.pdf
index 4f16693..4eb5c83 100644
Binary files a/notes_fri_stir.pdf and b/notes_fri_stir.pdf differ
diff --git a/notes_fri_stir.tex b/notes_fri_stir.tex
index 6baf16c..e729985 100644
--- a/notes_fri_stir.tex
+++ b/notes_fri_stir.tex
@@ -76,7 +76,7 @@ Consider the following protocol:
 \end{enumerate}
 
 %/// TODO tabulate this next lines
-With high probablility, $\alpha$ will not cancel the coeffs with $deg \geq d+1$. % TODO check which is the name of this theorem or why this is true
+With high probability, $\alpha$ will not cancel the coeffs with $deg \geq d+1$. % TODO check which is the name of this theorem or why this is true
 
 Let $g(x)=a \cdot x^{d+1}, ~~ h(x)=b \cdot x^{d+1}$, and set $f(x) = g(x) + \alpha h(x)$.
 Imagine that P can chose $\alpha$ such that $a x^{d+1} + \alpha \cdot b x^{d+1} = 0$, then, in $f(x)$ the coefficients of degree $d+1$ would cancel.
@@ -314,14 +314,15 @@ $$g(z) = (f(z)-f(r))\cdot (z-r)^{-1}$$
 
 
 \section{STIR (main idea)}
-\emph{Update from 2024-03-22, notes from Héctor Masip Ardevol (\href{https://hecmas.github.io/}{https://hecmas.github.io}) explanations.}
+\emph{Update from 2024-03-22, notes from Héctor Masip Ardevol\\
+(\href{https://hecmas.github.io/}{https://hecmas.github.io}) explanations.}
 
 \vspace{0.3cm}
 Let $p \in \mathbb{F}[x]^{<n}$.
 
 In FRI we decompose $p(x)$ as
 $$p(x) = p_e(x^2) + x \cdot p_o(x^2)$$
-with $p_e, p_o \in \mahtbb{F}[x]^{<n}$ containing the even and odd powers respectively.
+with $p_e, p_o \in \mathbb{F}[x]^{<n}$ containing the even and odd powers respectively.
 
 The next FRI polynomial is
 $$p_1(x) = p_e(x) + \alpha p_o(x)$$
@@ -329,7 +330,7 @@ for $\alpha \in^R \mathbb{F}$.
 
 In STIR, this would be $q(x)=x^2$,
 $$Q(z,y) = p_e(y) + z \cdot p_o(y)$$
-and then, $p(x) = Q(x, q(x))$. And $Q$ fullfills the degree from Fact 4.6 from the STIR paper.
+and then, $p(x) = Q(x, q(x))$. And $Q$ fulfills the degree from Fact 4.6 from the STIR paper.
 
 We can generalize to a $q$ with bigger degree, or with another shape, and adapting $Q$ on the choice of $q$.