eja: drop custom gram_schmidt() routine that isn't noticeably faster.

[sage.d.git] / mjo / cone / permutation_invariant.py

diff --git a/mjo/cone/permutation_invariant.py b/mjo/cone/permutation_invariant.py
index d87ace2be9a034264b497586130bc6a3492e9be2..1c72565fb6532e7692904dc70db7907dab4c3ff1 100644 (file)
--- a/mjo/cone/permutation_invariant.py
+++ b/mjo/cone/permutation_invariant.py
@@ -50,14 +50,24 @@ def is_permutation_invariant(K):
 
     SETUP::
 
-        sage: from mjo.cone.rearrangement import rearrangement_cone
+        sage: from mjo.cone.nonnegative_orthant import nonnegative_orthant
         sage: from mjo.cone.permutation_invariant import is_permutation_invariant
+        sage: from mjo.cone.rearrangement import rearrangement_cone
+
+    EXAMPLES:
 
-    EXAMPLES::
+    The rearrangement cone is permutation-invariant::
 
         sage: all( is_permutation_invariant(rearrangement_cone(p,n))
-        ....:               for n in range(3, 6)
-        ....:               for p in range(1, n) )
+        ....:               for n in xrange(3, 6)
+        ....:               for p in xrange(1, n) )
+        True
+
+    As is the nonnegative orthant::
+
+        sage: set_random_seed()
+        sage: K = nonnegative_orthant(ZZ.random_element(5))
+        sage: is_permutation_invariant(K)
         True
 
     """