Polyhedron_base.is_full_dimensional: Merge into ConvexSet_base.is_ful…

…l_dimensional

src/sage/geometry/convex_set.py

@@ -63,6 +63,17 @@ def is_full_dimensional(self):
 
         Boolean. Whether the polyhedron is not contained in any strict
         affine subspace.
+
+        EXAMPLES::
+
+            sage: c = Cone([(1,0)])
+            sage: c.is_full_dimensional()
+            False
+
+            sage: polytopes.hypercube(3).is_full_dimensional()
+            True
+            sage: Polyhedron(vertices=[(1,2,3)], rays=[(1,0,0)]).is_full_dimensional()
+            False
         """
         return self.dim() == self.ambient_dim()
 

src/sage/geometry/polyhedron/base.py

@@ -9814,24 +9814,6 @@ def edge_label(i, j, c_ij):
         else:
             return MatrixGroup(matrices)
 
-    def is_full_dimensional(self):
-        """
-        Return whether the polyhedron is full dimensional.
-
-        OUTPUT:
-
-        Boolean. Whether the polyhedron is not contained in any strict
-        affine subspace.
-
-        EXAMPLES::
-
-            sage: polytopes.hypercube(3).is_full_dimensional()
-            True
-            sage: Polyhedron(vertices=[(1,2,3)], rays=[(1,0,0)]).is_full_dimensional()
-            False
-        """
-        return self.dim() == self.ambient_dim()
-
     def is_combinatorially_isomorphic(self, other, algorithm='bipartite_graph'):
         r"""
         Return whether the polyhedron is combinatorially isomorphic to another polyhedron.