\(\DeclarePairedDelimiterX{\Set}[2]{\{}{\}}{#1 \nonscript\;\delimsize\vert\nonscript\; #2}\) \( \DeclarePairedDelimiter{\set}{\{}{\}}\) \( \DeclarePairedDelimiter{\parens}{\left(}{\right)}\) \(\DeclarePairedDelimiterX{\innerproduct}[1]{\langle}{\rangle}{#1}\) \(\newcommand{\ip}[1]{\innerproduct{#1}}\) \(\newcommand{\bmat}[1]{\left[\hspace{2.0pt}\begin{matrix}#1\end{matrix}\hspace{2.0pt}\right]}\) \(\newcommand{\barray}[1]{\left[\hspace{2.0pt}\begin{matrix}#1\end{matrix}\hspace{2.0pt}\right]}\) \(\newcommand{\mat}[1]{\begin{matrix}#1\end{matrix}}\) \(\newcommand{\pmat}[1]{\begin{pmatrix}#1\end{pmatrix}}\) \(\newcommand{\mathword}[1]{\mathop{\textup{#1}}}\)
Needs:
N-Dimensional Space
Needed by:
Real Affine Sets and Subspaces
Translate Sets
Links:
Sheet PDF
Graph PDF

Real Translates

Definition

The translate of $S \subset \R ^n$ by the vector $a \in \R ^n$ is the set

\[ \Set*{z \in \R ^n}{\exists x \in S \text{ such that } z = x + a}. \]

Notation

We often use the abbreviated notation $S + a$ for the translate of $S$ by $a$. It is sometimes also convenient to extend set-builder notation and write

\[ S + a = \Set{x + a}{x \in M}. \]

The right hand side is slick notation for the definition given above.

Sums and differences

The sum (or Minkowski sum) of two sets $S, T \subset \R ^n$ is the set

\[ \Set{z \in \R ^n}{(\exists x \in S)(\exists y \in T)(z = x + y)}. \]

Likewise, the difference (or Minkowski difference) of two sets $S, T \subset \R ^n$ is the set

\[ \Set{z \in \R ^n}{(\exists x \in S)(\exists y \in T)(z = x - y)}. \]

Notation

We denote the sum of $S$ and $T$ by $S + T$, and the difference by $S - T$.1 We often use the slick notation

\[ \Set{x + y}{x \in S, y \in T} \text{ and } \Set{x - y}{x \in S, y \in T}, \]

for these two sets. Notice that in this notation

\[ \set{a} + B = a + B \]

Scaled sets

Given a set $A \subset \R ^n$ and a $\lambda \in \R $, the set which is $A$ scaled by (or scaled set, scaling) is

\[ \Set{z \in \R ^n}{(\exists x \in A)(z = \lambda x)} \]

We often denote this set by $\lambda A$. As before, we often use the slick notation

\[ \lambda A = \Set{\lambda a}{a \in A} \]

The set $(-1)A$ is denoted $-A$

Homothetic sets

A set $A$ is homothetic to a set $B$ if there is $x \in \R ^n$ and $\lambda \neq 0$ so taht

\[ A = x + \lambda B \]

If $\lambda > 0$, $A$ is positively homothetic to $B$.


  1. This second notation unfortunately conflicts with our notation for set differences. Future editions will correct. ↩︎
Copyright © 2023 The Bourbaki Authors — All rights reserved — Version 13a6779cc About Show the old page view