Slightly simplify LL() code.

diff --git a/mjo/cone/cone.py b/mjo/cone/cone.py
index 02d525859b90aa0eb5c80acdcbeebd867c3cd628..821b95958e81f1e9a93dcf176f774a4c82e9317f 100644 (file)
--- a/mjo/cone/cone.py
+++ b/mjo/cone/cone.py
@@ -673,8 +673,8 @@ def lyapunov_rank(K):
         # K is not solid, restrict to its span.
         K = _rho(K)
 
-        # Lemma 2
-        beta += m*(n - m) + (n - m)**2
+        # Non-solid reduction lemma.
+        beta += (n - m)*n
 
     if l > 0:
         # K is not pointed, restrict to the span of its dual. Uses a
@@ -682,8 +682,8 @@ def lyapunov_rank(K):
         # _rho(K.dual()).dual().
         K = _rho(K, K.dual())
 
-        # Lemma 3
-        beta += m * l
+        # Non-pointed reduction lemma.
+        beta += l * m
 
     beta += len(LL(K))
     return beta