diff --git a/main.tex b/main.tex
index fd187ab..79f425f 100644
--- a/main.tex
+++ b/main.tex
@@ -104,13 +104,29 @@ Now consider the optimal cocycle $C=A-F^*$. We divide $C$ into 2 parts, $C_2=(A-
 \frac{1}{u(f)}=\frac{c(C)}{r(A)-r(A\setminus C)}
 \geq \frac{c(C_1)+c(C_2)}{(r(A)-r(A\setminus C_1))+(r(A')-r(A'\setminus C_2))}.
 \]
-We also know that $\frac{1}{u(f)}\leq \frac{C_1}{r(A)-r(A\setminus C_1)}$. Then it follows that $\frac{c(C_2)}{r(A')-r(A'\setminus C_2)}\leq \frac{1}{u(f)}$. Hence, we get a contradiction
+We also know that $\frac{1}{u(f)}\leq \frac{c(C_1)}{r(A)-r(A\setminus C_1)}$. Then it follows that $\frac{c(C_2)}{r(A')-r(A'\setminus C_2)}\leq \frac{1}{u(f)}$. Hence, we get a contradiction
 \[
 \frac{1}{u'(f)}\leq\frac{c'(A'-C_2)}{r(A')-r(A'\setminus C_2)}
 \leq \frac{c(C_2)}{r(A')-r(A'\setminus C_2)}\leq \frac{1}{u(f)}.
 \]
 \end{proof}
 
+\begin{remark}
+If we increase the capacity, no ideal edge utilization increases. The proof is similar.
+Removing (contracting) edges has the same effect on ideal utilization as setting the capacity to $0$ ($\infty$).
+\end{remark}
+
+\subsection{Rigidity matroids}
+\begin{conjecture}
+Let $M$ be a connected 2D rigidity matroid on graph $G=(V,E)$. Let $F^*$ be the optimal flat for strength $F^*=\argmin_{F\subset E}\frac{c(E\setminus F)}{r(E)-r(F)}$.
+Let $X\subset E\setminus F^*$ be a independent set with rank $r(E)-r(F^*)$. Then for any maximal independent set $B_{F^*}\subset F^*$, $X\cup B_{F^*}$ is a base of $M$.
+\end{conjecture}
+\begin{remark}
+The intuition is that rigidity of $F^*\cup X$ only depends on the 1-thin cover of $F^*$ but not the base $B_{F^*}$.
+\end{remark}
+
+\newpage
+
 \section{Principal sequence of partition on graphs}
 For a graph $G=(V,E)$ with edge capacity $c:V\to \Z_+$, the strength $\sigma(G)$ is defined as $\sigma(G)=\min_{\Pi}\frac{c(\delta(\Pi))}{|\Pi|-1}$, where $\Pi$ is any partition of $V$, $|\Pi|$ is the number of parts in the partition and $\delta(\Pi)$ is the set of edges between parts. Note that an alternative formulation of strength (using graphic matroid rank function) is $\sigma(G)=\min_{F\subset E} \frac{c(E-F)}{r(E)-r(F)}$, which in general is the fractional optimum of matroid base packing.