14.02.2013 Views

Gruber P. Convex and Discrete Geometry

Gruber P. Convex and Discrete Geometry

Gruber P. Convex and Discrete Geometry

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

4 Support <strong>and</strong> Separation 63<br />

Here H(u) is the support hyperplane of cl conv R(A) with exterior normal vector<br />

u. The absolute continuity of ν with respect to |µ| is obvious. Clearly, H(u) is the<br />

hyperplane<br />

u · y = sup � u · z : z ∈ cl conv R(A) � = sup � u · z : z ∈ R(A) �<br />

= sup � ν(C) : C ∈ M, C ⊆ A �<br />

= sup � ν(A + ∩ C) + ν(A 0 ∩ C) + ν(A − ∩ C) : C ∈ M, C ⊆ A � = ν(A + ).<br />

For the proof of the inclusion H(u) ∩ cl conv R(A) ⊇ µ(A + ) + cl conv R(A 0 ),it<br />

is sufficient to show the following: Let B ∈ M, B ⊆ A 0 . Then µ(A + ) + µ(B) ∈<br />

H(u) ∩ cl conv R(A). Clearly, A + ∪ B ∈ M <strong>and</strong> A + ∪ B ⊆ A. Hence<br />

µ(A + ) + µ(B) = µ(A + ∪ B) ∈ R(A) ⊆ cl conv R(A),<br />

u · � µ(A + ) + µ(B) � = ν(A + ) + ν(B) = ν(A + ).<br />

Thus µ(A + ) + µ(B) ∈ H(u) ∩ cl conv R(A), concluding the proof of the first<br />

inclusion. Next, the reverse inclusion H(u)∩cl conv R(A) ⊆ µ(A + )+cl conv R(A 0 )<br />

will be shown. Since µ is a finite vector-valued measure, R(A) is bounded. Thus<br />

cl conv R(A) = conv cl R(A) by Proposition 3.2. For the proof of the reverse<br />

inclusion, it is thus sufficient to show the following: let y ∈ H(u) ∩ cl R(A). Then<br />

y ∈ µ(A + ) + cl conv R(A 0 ). Clearly, yi → y � ∈ H(u) � as i →∞for suitable<br />

yi = µ(Ai) ∈ R(A). Thus u · yi = u · µ(Ai) = ν(Ai) → u · y <strong>and</strong> thus<br />

ν(Ai) = ν(A + ∩ Ai) + ν(A 0 ∩ Ai) + ν(A − ∩ Ai)<br />

= ν(A + ∩ Ai) + ν(A − ∩ Ai) → u · y = ν(A + ).<br />

Hence ν(A + ∩ Ai) → ν(A + ) <strong>and</strong> ν(A − ∩ Ai) → 0orν(A + \Ai) → 0 <strong>and</strong><br />

ν(A − ∩ Ai) → 0. Since |µ| is absolutely continuous with respect to |ν| on A +<br />

<strong>and</strong> also on A − , it thus follows that |µ|(A + \Ai) → 0 <strong>and</strong> |µ|(A − ∩ Ai) → 0. Hence<br />

µ(A + \Ai), µ(A − ∩ Ai) → o <strong>and</strong> therefore<br />

y = lim µ(Ai) = lim � µ(A + ∩ Ai) + µ(A 0 ∩ Ai) + µ(A − ∩ Ai) �<br />

= lim � µ(A + ) − µ(A + \Ai) + µ(A 0 ∩ Ai) + µ(A − ∩ Ai) �<br />

= µ(A + ) + lim µ(A 0 ∩ Ai) ∈ µ(A + ) + cl R(A 0 )<br />

⊆ µ(A + ) + cl conv R(A 0 ).<br />

This concludes the proof of the reverse inclusion. The proof of (5) is complete.<br />

Third, we shall prove the following:<br />

(6) Let A ∈ M be minimal such that x ∈ cl conv R(A). Then x ∈ R(A).<br />

Note that x �= o <strong>and</strong> o, x ∈ cl conv R(A). We distinguish two cases. First case:<br />

x ∈ relint cl conv R(A). By Lemma 3.1 the point x is in the relative interior of a convex<br />

polytope with vertices µ(A1),...,µ(Ak) ∈ R(A), say.IfB ∈ M, B ⊆ A,<br />

is such that |µ|(B) is sufficiently small (such B exist since the measure |µ| is<br />

non-atomic), then �µ(A1\B) − µ(A1)�,...,�µ(Ak\B) − µ(Ak)� ≤|µ|(B) are<br />

so small that x is still in the relative interior of the convex polytope with vertices<br />

µ(A1\B),...,µ(Ak\B) ∈ R(A\B) ⊆ R(A). Hence x ∈ cl conv R(A\B),

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!