Convex set: Difference between revisions

Revision as of 19:45, 15 April 2023

Revision as of 03:30, 15 May 2023

Line 141:

Let {{math|''Y'' ⊆ ''X''}}. The subspace {{mvar|Y}} is a convex set if for each pair of points {{math|''a'', ''b''}} in {{mvar|Y}} such that {{math|''a'' ≤ ''b''}}, the interval {{math|[''a'', ''b''] {{=}} {''x'' ∈ ''X'' {{!}} ''a'' ≤ ''x'' ≤ ''b''} }} is contained in {{mvar|Y}}. That is, {{mvar|Y}} is convex if and only if for all {{math|''a'', ''b''}} in {{mvar|Y}}, {{math|''a'' ≤ ''b''}} implies {{math|[''a'', ''b''] ⊆ ''Y''}}.

A convex set is '''{{em|not'''}} connected in general: a counter-example is given by the subspace {1,2,3} in {{math|'''Z'''}}, which is both convex and not connected.

=== Convexity spaces ===