Corrections from review

sagemath · Apr 4, 2018 · eee533a · eee533a
1 parent 597b802
commit eee533a
Show file tree

Hide file tree

Showing 3 changed files with 15 additions and 17 deletions.
diff --git a/src/doc/en/thematic_tutorials/geometry/polyhedra_quickref.rst b/src/doc/en/thematic_tutorials/geometry/polyhedra_quickref.rst
@@ -42,9 +42,9 @@ List of Polyhedron methods
 
     :meth:`~sage.geometry.polyhedron.base.Polyhedron_base.is_empty` | tests emptyness
     :meth:`~sage.geometry.polyhedron.base.Polyhedron_base.is_universe` | tests whether a polyhedra is the whole ambient space
-    :meth:`~sage.geometry.polyhedron.base.Polyhedron_base.is_full_dimensional` | tests if the polyhedron has the same dimension has the ambient space
+    :meth:`~sage.geometry.polyhedron.base.Polyhedron_base.is_full_dimensional` | tests if the polyhedron has the same dimension as the ambient space
     :meth:`~sage.geometry.polyhedron.base.Polyhedron_base.is_combinatorially_isomorphic` | tests whether two polyhedra are combinatorially isomorphic
-    :meth:`~sage.geometry.polyhedron.base.Polyhedron_base.is_compact` | tests compactness of a polyhedron
+    :meth:`~sage.geometry.polyhedron.base.Polyhedron_base.is_compact` | tests compactness, or boundedness of a polyhedron
     :meth:`~sage.geometry.polyhedron.base.Polyhedron_base.is_lattice_polytope` | tests whether a polyhedron is a lattice polytope
     :meth:`~sage.geometry.polyhedron.base.Polyhedron_base.is_inscribed` | tests whether the polyhedron is inscribed in a sphere
     :meth:`~sage.geometry.polyhedron.base.Polyhedron_base.is_minkowski_summand` | tests if the polyhedron can be used to produce another given polyhedron using a Minkowski sum.

diff --git a/src/doc/en/thematic_tutorials/geometry/polyhedra_tutorial.rst b/src/doc/en/thematic_tutorials/geometry/polyhedra_tutorial.rst
@@ -207,7 +207,7 @@ There is another way to create a polyhedron over algebraic numbers:
 
 .. end of output
 
-If the base ring is known it may be a good option to use the proper :code:`composite_field`:
+If the base ring is known it may be a good option to use the proper :meth:`sage.rings.number_field.number_field.number_field.composite_fields`:
 
 ::
 
@@ -219,8 +219,8 @@ If the base ring is known it may be a good option to use the proper :code:`compo
 
 .. end of output
 
-Since the :code:`Symbolic Ring` is not exact, it is not possible to define a
-polyhedron over it:
+Polyhedral computations with the :code:`Symbolic Ring` is not implemented.
+It is not possible to define a polyhedron over it:
 
 ::
 
@@ -418,7 +418,7 @@ as follows.
 `V`-representation
 ------------------
 
-Similarly, you can access to vertices, rays and lines of the polyhedron.
+Similarly, you can access vertices, rays and lines of the polyhedron.
 
 ::
 
@@ -539,7 +539,7 @@ backend :code:`cdd`. We can also check the backend and the parent using
 
 .. end of output
 
-We *clearly* (!) see
+We see
 
   - the backend used (ex: :code:`backend_cdd`)
   - followed by a dot '.'

diff --git a/src/doc/en/thematic_tutorials/geometry/tips.rst b/src/doc/en/thematic_tutorials/geometry/tips.rst
@@ -41,17 +41,15 @@ object, you can!
 ::
 
     sage: Cube = polytopes.cube()
-    sage: TCube = Cube.truncation()
+    sage: TCube = Cube.truncation().dilation(1/2)
     sage: sage_input(TCube)
-    Polyhedron(backend='ppl', base_ring=QQ, vertices=[(-QQ(1), -QQ(1), -1/3),
-    (-QQ(1), -QQ(1), 1/3), (-QQ(1), -1/3, -QQ(1)), (-QQ(1), -1/3, QQ(1)),
-    (-QQ(1), 1/3, -QQ(1)), (-QQ(1), 1/3, QQ(1)), (-QQ(1), QQ(1), -1/3),
-    (-QQ(1), QQ(1), 1/3), (-1/3, -QQ(1), -QQ(1)), (-1/3, -QQ(1), QQ(1)), (-1/3,
-    QQ(1), -QQ(1)), (-1/3, QQ(1), QQ(1)), (1/3, -QQ(1), -QQ(1)), (1/3, -QQ(1),
-    QQ(1)), (1/3, QQ(1), -QQ(1)), (1/3, QQ(1), QQ(1)), (QQ(1), -QQ(1), -1/3),
-    (QQ(1), -QQ(1), 1/3), (QQ(1), -1/3, -QQ(1)), (QQ(1), -1/3, QQ(1)), (QQ(1),
-    1/3, -QQ(1)), (QQ(1), 1/3, QQ(1)), (QQ(1), QQ(1), -1/3), (QQ(1), QQ(1),
-    1/3)])
+    Polyhedron(backend='ppl', base_ring=QQ, vertices=[(-1/2, -1/2, -1/6),
+    (-1/2, -1/2, 1/6), (-1/2, -1/6, -1/2), (-1/2, -1/6, 1/2), (-1/2, 1/6,
+    -1/2), (-1/2, 1/6, 1/2), (-1/2, 1/2, -1/6), (-1/2, 1/2, 1/6), (-1/6, -1/2,
+    -1/2), (-1/6, -1/2, 1/2), (-1/6, 1/2, -1/2), (-1/6, 1/2, 1/2), (1/6, -1/2,
+    -1/2), (1/6, -1/2, 1/2), (1/6, 1/2, -1/2), (1/6, 1/2, 1/2), (1/2, -1/2,
+    -1/6), (1/2, -1/2, 1/6), (1/2, -1/6, -1/2), (1/2, -1/6, 1/2), (1/2, 1/6,
+    -1/2), (1/2, 1/6, 1/2), (1/2, 1/2, -1/6), (1/2, 1/2, 1/6)])
 
 .. end of output