{
  "id": "enwiki-001362370265",
  "slug": "convex-set",
  "title": "Convex set",
  "qid": "",
  "lead": "In geometry, a set of points is convex if it contains every line segment between two points in the set. For example, a solid cube is a convex set, but anything that is hollow or has an indent, such as a crescent shape, is not convex. The boundary of a convex set in the plane is always a convex curve. The intersection of all the convex sets that contain a given subset of Euclidean space is called the convex hull of . It is the smallest convex set containing . A convex function is a real-valued function defined on an interval with the property that its epigraph (the set of points on or above the graph of the function) is a convex set. Convex minimization is a subfield of optimization that studies the problem of minimizing convex functions over convex sets. The branch of mathematics devoted to the study of properties of convex sets and convex functions is called convex analysis. Spaces in which convex sets are defined include the Euclidean spaces, the affine spaces over the real numbers, and certain non-Euclidean geometries.",
  "body": "In geometry, a set of points is convex if it contains every line segment between two points in the set. For example, a solid cube is a convex set, but anything that is hollow or has an indent, such as a crescent shape, is not convex. The boundary of a convex set in the plane is always a convex curve. The intersection of all the convex sets that contain a given subset of Euclidean space is called the convex hull of . It is the smallest convex set containing . A convex function is a real-valued function defined on an interval with the property that its epigraph (the set of points on or above the graph of the function) is a convex set. Convex minimization is a subfield of optimization that studies the problem of minimizing convex functions over convex sets. The branch of mathematics devoted to the study of properties of convex sets and convex functions is called convex analysis. Spaces in which convex sets are defined include the Euclidean spaces, the affine spaces over the real numbers, and certain non-Euclidean geometries. ===Examples=== The convex subsets of (the set of real numbers) are the intervals and the points of . Some examples of convex subsets of the Euclidean plane are solid regular polygons, solid triangles, and intersections of solid triangles. Some examples of convex subsets of a Euclidean 3-dimensional space are the Archimedean solids and the Platonic solids. The Kepler–Poinsot polyhedra are examples of non-convex sets. \\sum_{k=1}^r\\lambda_k u_k belongs to . As the definition of a convex set is the case , this property characterizes convex sets. Such an affine combination is called a convex combination of . The convex hull of a subset of a real vector space is defined as the intersection of all convex sets that contain . More concretely, the convex hull is the set of all convex combinations of points in . In particular, this is a convex set. A (bounded) convex polytope is the convex hull of a finite subset of some Euclidean space . The only nontrivial faces of the closed unit disk \\{ (x,y) \\in \\R^2: x^2+y^2 \\leq 1 \\} are its extreme points, namely the points on the unit circle S^1 = \\{ (x,y) \\in \\R^2: x^2+y^2=1 \\} . \\tfrac{1}{2} \\cdot\\operatorname{Area}(R) \\leq \\operatorname{Area}(C) \\leq 2\\cdot \\operatorname{Area}(r) 2r \\le D \\le 2R R \\le \\frac{\\sqrt{3}}{3} D r + R \\le D D^2 \\sqrt{4R^2-D^2} \\le 2R (2R + \\sqrt{4R^2 -D^2}) and can be visualized as the image of the function g that maps a convex body to the point given by (r/R, D/2R). The image of this function is known a (r, D, R) Blachke-Santaló diagram. and \\mathbb{B}_2 the unit circle. Alternatively, the set \\mathcal{K}^2 can also be parametrized by its width (the smallest distance between any two different parallel support hyperplanes), perimeter and area. If a \\in \\operatorname{Int} C and b \\in \\operatorname{Cl} C then [a, b[ \\, \\subseteq \\operatorname{Int} C (where [a, b[ \\, := \\left\\{ (1 - r) a + r b : 0 \\leq r ). If \\operatorname{Int} C \\neq \\emptyset then: \\operatorname{cl} \\left( \\operatorname{Int} C \\right) = \\operatorname{Cl} C , and \\operatorname{Int} C = \\operatorname{Int} \\left( \\operatorname{Cl} C \\right) = C^i , where C^{i} is the algebraic interior of C. \\operatorname{Conv}(S)\\vee\\operatorname{Conv}(T) = \\operatorname{Conv}(S\\cup T) = \\operatorname{Conv}\\bigl(\\operatorname{Conv}(S)\\cup\\operatorname{Conv}(T)\\bigr). The intersection of any collection of convex sets is itself convex, so the convex subsets of a (real or complex) vector space form a complete lattice. of sets. The sum of the squares&nbsp;Q 1 =[0,1] 2 and&nbsp;Q 2 =[1,2] 2 is the square&nbsp;Q 1 +Q 2 =[1,3] 2 . In a real vector-space, the Minkowski sum of two (non-empty) sets, and , is defined to be the set formed by the addition of vectors element-wise from the summand-sets S_1+S_2=\\{x_1+x_2: x_1\\in S_1, x_2\\in S_2\\}. More generally, the Minkowski sum of a finite family of (non-empty) sets is the set formed by element-wise addition of vectors \\sum_n S_n = \\left \\{ \\sum_n x_n : x_n \\in S_n \\right \\}. For Minkowski&nbsp;addition, the zero set&nbsp; containing only the zero&nbsp;vector&nbsp; has special importance: For every non-empty subset&nbsp;S of a vector space S+\\{0\\}=S; in algebraic terminology, is the identity element of Minkowski addition (on the collection of non-empty sets). \\operatorname{Conv}(S_1+S_2)=\\operatorname{Conv}(S_1)+\\operatorname{Conv}(S_2). This result holds more generally for each finite collection of non-empty sets: \\text{Conv}\\left ( \\sum_n S_n \\right ) = \\sum_n \\text{Conv} \\left (S_n \\right). In mathematical terminology, the operations of Minkowski summation and of forming convex hulls are commuting operations. \\operatorname{rec} S = \\left\\{ x \\in X \\, : \\, x + S \\subseteq S \\right\\}, where this set is a convex cone containing 0 \\in X and satisfying S + \\operatorname{rec} S = S . Note that if S is closed and convex then \\operatorname{rec} S is closed and for all s_0 \\in S , \\operatorname{rec} S = \\bigcap_{t > 0} t (S - s_0). Theorem (Dieudonné). Let A and B be non-empty, closed, and convex subsets of a locally convex topological vector space such that \\operatorname{rec} A \\cap \\operatorname{rec} B is a linear subspace. If A or B is locally compact then A&nbsp;−&nbsp;B is closed. ==External links== Lectures on Convex Sets, notes by Niels Lauritzen, at Aarhus University, March 2010.",
  "categories": [
    "20476826",
    "23118434",
    "23603337",
    "25544422"
  ],
  "license": "CC BY-SA 4.0",
  "source_uri": "https://en.wikipedia.org/w/index.php?oldid=1362370265",
  "content_hash": "",
  "created_at": null,
  "updated_at": 1783080842.0,
  "claims": [],
  "contradictions": [],
  "confidence": 0.6,
  "csl": {
    "id": "enwiki-001362370265",
    "type": "webpage",
    "title": "Convex set",
    "author": [
      {
        "family": "Anticloud FZ LLE",
        "literal": "Anticloud FZ LLE"
      }
    ],
    "container-title": "encyclopegia.org",
    "publisher": "Anticloud FZ LLE",
    "publisher-place": "Dubai, United Arab Emirates",
    "URL": "https://encyclopegia.org/a/convex-set",
    "issued": {
      "date-parts": [
        [
          2026,
          11,
          22
        ]
      ]
    },
    "accessed": {
      "date-parts": [
        [
          2026,
          11,
          22
        ]
      ]
    },
    "license": "CC BY-SA 4.0",
    "DOI": "eo1:enwiki-001362370265",
    "isBasedOn": "https://en.wikipedia.org/w/index.php?oldid=1362370265",
    "note": "Immutable snapshot enwiki-001362370265"
  }
}