Math 2.0

definition

Convex hull

Definition

Let XX be a subset of Rn\mathbb{R}^n. The convex hull of XX is the intersection of all convex sets of Rn\mathbb{R}^n that contain XX: conv⁡(X)=⋂{ S⊆Rn  :  S⊇X and S is convex }.\operatorname{conv}(X) = \bigcap \{\, S \subseteq \mathbb{R}^n \;:\; S \supseteq X \text{ and } S \text{ is convex} \,\}.

Remarks

conv⁡(X)\operatorname{conv}(X) is convex, and it is the smallest convex set that contains XX. It is also the set of all convex combinations ∑i=1kwixi\sum_{i=1}^{k} w_i x_i, with k≥1k \geq 1, xi∈Xx_i \in X, wi≥0w_i \geq 0 and ∑iwi=1\sum_i w_i = 1. These are the affine combinations with nonnegative weights. The convex hull of a compact set is compact, and the convex hull of an open set is open. The convex hull of a finite set is a convex polytope. For three points not on a line, it is the triangle with its inside.

Explanations

L1 human

For a finite set of points in the plane, put a rubber band round all the points and let it go. The band takes the shape of the boundary of the convex hull. The convex hull of the four corners of a square is the full square.

What this node needs for W2
  • edge instance_of in: one example (0 of 1)
  • edge not_instance_of in: one non-example that fails one clause (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

What this needs

To read this node, read these 3 nodes in this order. The foundations come first, and the list ends with this node.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • no evidence level
  1. Affine combination concept
  2. Convex set concept
  3. Convex hull definition

Sources

  1. Web https://en.wikipedia.org/wiki/Convex_hull, Definitions
  2. Web https://en.wikipedia.org/wiki/Convex_hull, Equivalence of definitions
  3. Web https://en.wikipedia.org/wiki/Convex_hull, Topological properties