diff --git a/main.tex b/main.tex
index ff0e3fd..fd187ab 100644
--- a/main.tex
+++ b/main.tex
@@ -90,6 +90,27 @@ Then the lemma follows by induction.
 \end{enumerate}
 \end{proof}
 
+\begin{lemma}
+If we decrease the capacity of an edge, no ideal edge utilization decreases.
+\end{lemma}
+\begin{proof}
+Let $c'$ be the decreased capacity. Suppose for a contradiction that there is a element $f$ with decreased utilization $u'(f)< u(f)$. Among all such edges, let $f$ maximize $u(f)$. Consider edges with $u(e)>u$. We have $u'(e)\geq u(e)$ for such edges since $f$ is the counterexample with largest $u(f)$.
+Let $M|E_{\leq u(f)}$ be the matroid restricted to the edge set with $u(e)\leq u(f)$. For simplicity, in this proof we write $A$ for $E_{\leq u(f)}$ and $A'$ for $E_{\leq u'(f)}$. Note that $f$ is in $A-F^*$ where $F^*$ is the smallest optimal flat and the strength of $M|A$ is $1/u(f)$.
+
+Similarly, let $M|A'$ be the corresponding matroid under capacity $c'$. Note that if $e\notin A$, then $u'(e)\geq u(e)> u(f)> u'(f)$, so $e\notin A'$. It follows that $A'\subseteq A$.
+
+Now consider the optimal cocycle $C=A-F^*$. We divide $C$ into 2 parts, $C_2=(A-F^*)\cap A'$ and $C_1=(A-F^*)- A'$. Note that by submodularity of rank function, we have
+\[
+\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
+\[
+\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}
+
 \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.