latex \lex

sagemath · Apr 20, 2020 · 573dbfc · 573dbfc
1 parent f4689d3
commit 573dbfc
Show file tree

Hide file tree

Showing 2 changed files with 2 additions and 2 deletions.
diff --git a/src/sage/geometry/polyhedron/base.py b/src/sage/geometry/polyhedron/base.py
@@ -3086,7 +3086,7 @@ def simplicity(self):
         Return the largest integer `k` such that the polytope is `k`-simple.
 
         A polytope `P` is `k`-simple, if every `(d-1-k)`-face
-        is contained in exactly `k+1` facets of `P` for `1 <= k <= d-1`.
+        is contained in exactly `k+1` facets of `P` for `1 \leq k \leq d-1`.
         Equivalently it is `k`-simple if the polar/dual polytope is `k`-simplicial.
         If `self` is a simplex, it returns its dimension.
 

diff --git a/src/sage/geometry/polyhedron/combinatorial_polyhedron/base.pyx b/src/sage/geometry/polyhedron/combinatorial_polyhedron/base.pyx
@@ -1739,7 +1739,7 @@ cdef class CombinatorialPolyhedron(SageObject):
         Return the dimension in case of a simplex.
 
         A polytope `P` is `k`-simple, if every `(d-1-k)`-face
-        is contained in exactly `k+1` facets of `P` for `1 <= k <= d-1`.
+        is contained in exactly `k+1` facets of `P` for `1 \leq k \leq d-1`.
 
         Equivalently it is `k`-simple if the polar/dual polytope is `k`-simplicial.