Polished A-A and added new lines for broken enumerates.

src/measure/vector/complex.tex

@@ -7,7 +7,8 @@
     \begin{enumerate}
         \item[(M1)] $\mu(\emptyset) = 0$.
         \item[(M2)] For any $\seq{E_n} \subset \cm$ pairwise disjoint, $\mu\paren{\bigsqcup_{n \in \natp}E_n} = \sum_{n \in \natp} \mu(E_n)$ where the sum converges absolutely. 
-    \end{enumerate}
+    \end\{enumerate\}
+
     By \hyperref[Riemann's Rearrangement Theorem]{theorem:riemann-rearrangement}, (M2) implies that $\mu$ can only take at most one value in $\bracs{-\infty, \infty}$. 
 \end{definition}
 
@@ -101,7 +102,8 @@
     \begin{enumerate}
         \item[(i)] For each $1 \le k \le n$, $M_k = m(A_k) - \mu(A_k) > 0$.
         \item[(ii)] For each $1 \le k \le n - 1$, $A_{k+1} \subset A_k$ with $\mu(A_{k+1}) - \mu(A_k) > M_{k}/2$.
-    \end{enumerate}
+    \end\{enumerate\}
+
     
     Let $A_n \in \cm$ with $A_{n+1} \subset A_n$ such that $\mu(A_{n+1}) - \mu(A_n) > M_n/2$. Since $A_{n+1} \cap P = \emptyset$ and $\mu(P) = M$, $A_{n+1}$ cannot be positive, so
     \[
@@ -157,7 +159,8 @@
         \item $\mu^+ \perp \mu^-$.
         \item $\mu = \mu^+ - \mu^-$.
         \item[(U)] For any other pair $(\nu^+, \nu^-)$ satisfying (1) and (2), $\mu^+ = \nu^+$ and $\mu^- = \nu^-$.
-    \end{enumerate}
+    \end\{enumerate\}
+
     
 \end{theorem}
 \begin{proof}