Computational Science Stack Exchange is a question and answer site for scientists using computers to solve scientific problems. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I have the intuition that the minimal point (in the sense of having the lowest value in one of the Euclidean space dimensions) of a intersection of $n$ convex sets is always the minimal point of the intersection of two convex sets in the family. Has this been proven before?

share|improve this question

In $d$ dimensions, you need at least $d$ convex sets, not two. For example, in a suitably rotated polytope in $d$ dimensions, the minimal point will be a vertex, which is defined by the intersection of $d$ planes.

share|improve this answer
Many thanks Geoffrey, my problem is in two dimensions. Is there a known result that states that in $d$ dimensions you need at least $d$ convex sets to define a minimal point? – Adrian TC Oct 31 '12 at 17:32

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.