X-Git-Url: http://gitweb.michael.orlitzky.com/?a=blobdiff_plain;f=doc%2Fsource%2Fbackground.rst;h=48766633fb5e9d637134d65ec3e7f9b41871516b;hb=38ed6ff99d1bb2e96d78927f5d1857a327fbccfa;hp=1a1605997b977824439c8db6c4d90316452b5eac;hpb=fa8fa4d690c5f30f7d5fee1818a9b4c15f52c5ff;p=dunshire.git

diff --git a/doc/source/background.rst b/doc/source/background.rst
index 1a16059..4876663 100644
--- a/doc/source/background.rst
+++ b/doc/source/background.rst
@@ -224,7 +224,7 @@ the two players in terms of this theorem. Player one would like to,
     &\text{ maximize }  &\nu                &\\
     &\text{ subject to }& p                 &\in K&\\
     &                   & \nu               &\in \mathbb{R}&\\
-    &                   & \left\langle p,e_{1} \right\rangle &= 1&\\
+    &                   & \left\langle p,e_{2} \right\rangle &= 1&\\
     &                   & L\left(p\right)   &\succcurlyeq \nu e_{1}.&
   \end{aligned}
 
@@ -236,11 +236,11 @@ Player two, on the other hand, would like to,
     &\text{ minimize }  &\omega                &\\
     &\text{ subject to }& q                    &\in K&\\
     &                   & \omega               &\in \mathbb{R}&\\
-    &                   & \left\langle q,e_{2} \right\rangle &= 1&\\
+    &                   & \left\langle q,e_{1} \right\rangle &= 1&\\
     &                   & L^{*}\left(q\right)  &\preccurlyeq \omega e_{2}.&
   \end{aligned}
 
-The `CVXOPT <http://cvxopt.org/>`_ library can solve symmetric cone
+The `CVXOPT <https://cvxopt.org/>`_ library can solve symmetric cone
 programs in the following primal/dual format:
 
 .. math::