From 573dbfc89f7b67015c6779e986159dcddf894c87 Mon Sep 17 00:00:00 2001 From: Jonathan Kliem Date: Mon, 20 Apr 2020 12:38:06 +0200 Subject: [PATCH] latex \lex --- src/sage/geometry/polyhedron/base.py | 2 +- src/sage/geometry/polyhedron/combinatorial_polyhedron/base.pyx | 2 +- 2 files changed, 2 insertions(+), 2 deletions(-) diff --git a/src/sage/geometry/polyhedron/base.py b/src/sage/geometry/polyhedron/base.py index 0c1bee1f98b..85ec3c5c3a5 100644 --- 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 index 969c9f86db1..76e843d0f5c 100644 --- 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.