# mathlibdocumentation

analysis.convex.extreme

# Extreme sets #

This file defines extreme sets and extreme points for sets in a real vector space.

An extreme set of A is a subset of A that is as far as it can get in any outward direction: If point x is in it and point y ∈ A, then the line passing through x and y leaves A at x. This is an analytic notion of "being on the side of". It is weaker than being exposed (see is_exposed.is_extreme).

## Main declarations #

• is_extreme A B: States that B is an extreme set of A (in the literature, A is often implicit).
• set.extreme_points A: Set of extreme points of A (corresponding to extreme singletons).
• convex.mem_extreme_points_iff_convex_remove: A useful equivalent condition to being an extreme point: x is an extreme point iff A \ {x} is convex.

## Implementation notes #

The exact definition of extremeness has been carefully chosen so as to make as many lemmas unconditional. In practice, A is often assumed to be a convex set.

## References #

See chapter 8 of Barry Simon, Convexity

## TODO #

• define convex independence, intrinsic frontier and prove lemmas related to extreme sets and points.
• generalise to Locally Convex Topological Vector Spaces™

More not-yet-PRed stuff is available on the branch sperner_again.

def is_extreme {E : Type u_1} [ E] (A B : set E) :
Prop

A set B is an extreme subset of A if B ⊆ A and all points of B only belong to open segments whose ends are in B.

Equations
theorem is_extreme.refl {E : Type u_1} [ E] (A : set E) :
A
theorem is_extreme.trans {E : Type u_1} [ E] {A B C : set E} (hAB : B) (hBC : C) :
C
theorem is_extreme.antisymm {E : Type u_1} [ E] :
@[instance]
def is_extreme.is_partial_order {E : Type u_1} [ E] :
theorem is_extreme.convex_diff {E : Type u_1} [ E] {A B : set E} (hA : A) (hAB : B) :
(A \ B)
theorem is_extreme.inter {E : Type u_1} [ E] {A B C : set E} (hAB : B) (hAC : C) :
(B C)
theorem is_extreme.Inter {E : Type u_1} [ E] {A : set E} {ι : Type u_2} [nonempty ι] {F : ι → set E} (hAF : ∀ (i : ι), (F i)) :
(⋂ (i : ι), F i)
theorem is_extreme.bInter {E : Type u_1} [ E] {A : set E} {F : set (set E)} (hF : F.nonempty) (hAF : ∀ (B : set E), B F B) :
(⋂ (B : set E) (H : B F), B)
theorem is_extreme.sInter {E : Type u_1} [ E] {A : set E} {F : set (set E)} (hF : F.nonempty) (hAF : ∀ (B : set E), B F B) :
(⋂₀F)
theorem is_extreme.mono {E : Type u_1} [ E] {A B C : set E} (hAC : C) (hBA : B A) (hCB : C B) :
C
def set.extreme_points {E : Type u_1} [ E] (A : set E) :
set E

A point x is an extreme point of a set A if x belongs to no open segment with ends in A, except for the obvious open_segment x x.

Equations
theorem extreme_points_def {E : Type u_1} [ E] {x : E} {A : set E} :
x A ∀ (x₁ x₂ : E), x₁ Ax₂ Ax x₂x₁ = x x₂ = x
theorem mem_extreme_points_iff_forall_segment {E : Type u_1} [ E] {x : E} {A : set E} :
x A ∀ (x₁ x₂ : E), x₁ Ax₂ Ax [x₁ -[] x₂]x₁ = x x₂ = x

A useful restatement using segment: x is an extreme point iff the only (closed) segments that contain it are those with x as one of their endpoints.

theorem mem_extreme_points_iff_extreme_singleton {E : Type u_1} [ E] {x : E} {A : set E} :
{x}

x is an extreme point to A iff {x} is an extreme set of A.

theorem extreme_points_subset {E : Type u_1} [ E] {A : set E} :
@[simp]
theorem extreme_points_empty {E : Type u_1} [ E] :
@[simp]
theorem extreme_points_singleton {E : Type u_1} [ E] {x : E} :
theorem convex.mem_extreme_points_iff_convex_remove {E : Type u_1} [ E] {x : E} {A : set E} (hA : A) :
x A (A \ {x})
theorem convex.mem_extreme_points_iff_mem_diff_convex_hull_remove {E : Type u_1} [ E] {x : E} {A : set E} (hA : A) :
x A \ (A \ {x})
theorem inter_extreme_points_subset_extreme_points_of_subset {E : Type u_1} [ E] {A B : set E} (hBA : B A) :
theorem is_extreme.extreme_points_subset_extreme_points {E : Type u_1} [ E] {A B : set E} (hAB : B) :
theorem is_extreme.extreme_points_eq {E : Type u_1} [ E] {A B : set E} (hAB : B) :
theorem extreme_points_convex_hull_subset {E : Type u_1} [ E] {A : set E} :