Math 2.0

Convex and discrete geometry Definition

Minkowski addition

Builds on Vector space

Definition

Let VV be a real vector space and let A,B⊆VA, B \subseteq V. The Minkowski sum of AA and BB is the set A+B={a+b:a∈A, b∈B}.A + B = \set{a + b : a \in A, \ b \in B}. For a real number λ\lambda, the dilate of AA is λA={λa:a∈A}\lambda A = \set{\lambda a : a \in A}. The operation (A,B)↦A+B(A, B) \mapsto A + B is Minkowski addition.

Remarks

Example: in ℝ2\R^2, let A=[0,1]×{0}A = [0,1] \times \set{0} and B={0}×[0,1]B = \set{0} \times [0, 1]. A point (s,0)+(0,t)(s, 0) + (0, t) with s,t∈[0,1]s, t \in [0, 1] is (s,t)(s, t), so A+BA + B is the unit square [0,1]2[0,1]^2.

Minkowski addition is associative and commutative, with neutral element {0}\set{0}, and A+∅=∅A + \emptyset = \emptyset. If AA and BB are convex, then A+BA + B is convex; if they are compact, then A+BA + B is compact.

Non-example of a familiar rule: A+A=2AA + A = 2A can fail. For A={0,1}⊆ℝA = \set{0, 1} \subseteq \R one has A+A={0,1,2}A + A = \set{0, 1, 2} but 2A={0,2}2A = \set{0, 2}. For convex AA and λ,μ≥0\lambda, \mu \ge 0 one has λA+μA=(λ+μ)A\lambda A + \mu A = (\lambda + \mu) A. In terms of support functions, hA+B=hA+hBh_{A + B} = h_A + h_B for nonempty compact convex A,B⊆ℝnA, B \subseteq \R^n. For polytopes, see the Minkowski sum of polytopes.

Reading path

To understand this page from the ground up, read these 2 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Vector space concept
  2. Minkowski addition definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Minkowski_addition
About this page
TagF4J5BZ4HWD
URIm2://F4J5BZ4HWD
Kinddefinition
WritingW0 stub
MSC52A20, 52A05
DefinesMinkowski addition
UsesVector space

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • a source with a locator (0 of 1)

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

What links here

No page links to this page yet.