Minkowski–Weyl theorem

GPTKB entity

Statements (14)
Predicate Object
gptkbp:instanceOf gptkb:mathematical_concept
gptkbp:appliesTo convex polyhedra
gptkbp:equivalentTo finite generation of polyhedral cones
gptkbp:field convex geometry
polyhedral theory
https://www.w3.org/2000/01/rdf-schema#label Minkowski–Weyl theorem
gptkbp:implies polyhedra can be described both as intersection of finitely many half-spaces and as sum of convex hull and conical hull
gptkbp:namedAfter gptkb:Hermann_Minkowski
gptkb:Hermann_Weyl
gptkbp:publishedIn gptkb:Mathematische_Annalen
gptkbp:state Every convex polyhedron is the sum of a convex hull of finitely many points and a conical hull of finitely many rays
gptkbp:yearProved 1896
gptkbp:bfsParent gptkb:Convex_polytope
gptkbp:bfsLayer 6