TheoremBase

Convex Functions on Rn\mathbb{R}^n: Standing Notation

Standing notation for convex functions on subsets of RnR^n: the separation notation, and points of Rn+1R^{n+1} written as pairs (x, mu) by concatenation.

Statement

Base. This setting extends Separation in Rn\mathbb{R}^n: Standing Notation: its conventions and notation are in force.

Points of Rn+1\mathbb{R}^{n+1} as pairs. For x∈Rnx\in\mathbb{R}^{n} and μ∈R\mu\in\mathbb{R}, (x,μ)(x,\mu) denotes the point ι(x,(μ))\iota\bigl(x,(\mu)\bigr) of Rn+1\mathbb{R}^{n+1}, where (μ)∈R1(\mu)\in\mathbb{R}^{1} is the point whose single component is μ\mu and ι:Rn×R1→Rn+1\iota:\mathbb{R}^{n}\times\mathbb{R}^{1}\to\mathbb{R}^{n+1} is the concatenation map, with Rn×R1\mathbb{R}^{n}\times\mathbb{R}^{1} in place of Rm×Rn\mathbb{R}^{m}\times\mathbb{R}^{n} there; thus (x,μ)k=xk(x,\mu)_{k}=x_{k} for k∈[n]k\in[n] and (x,μ)n+1=μ(x,\mu)_{n+1}=\mu. Background: every point of Rn+1\mathbb{R}^{n+1} is (x,μ)(x,\mu) for exactly one x∈Rnx\in\mathbb{R}^{n} and one μ∈R\mu\in\mathbb{R}, by Concatenation Identifies a Product of Euclidean Spaces with a Euclidean Space (iii), a point of R1\mathbb{R}^{1} being determined by its single component (Euclidean Space Rn\mathbb{R}^n: n-Tuples of Real Numbers with Their Componentwise Operations (iii)); for x,x′∈Rnx,x'\in\mathbb{R}^{n} and μ,μ′,t∈R\mu,\mu',t\in\mathbb{R},

(x,μ)+(x′,μ′)=(x+x′,μ+μ′),t(x,μ)=(tx,tμ),(x,μ)−(x′,μ′)=(x−x′,μ−μ′),(x,\mu)+(x',\mu')=(x+x',\mu+\mu'),\qquad t(x,\mu)=(tx,t\mu),\qquad (x,\mu)-(x',\mu')=(x-x',\mu-\mu'),

by Concatenation Identifies a Product of Euclidean Spaces with a Euclidean Space (iv); and

(x,μ)⋅(x′,μ′)=x⋅x′+μμ′,∥(x,μ)∥2=∥x∥2+μ2,(x,\mu)\cdot(x',\mu')=x\cdot x'+\mu\mu',\qquad \lVert(x,\mu)\rVert^{2}=\lVert x\rVert^{2}+\mu^{2},

by Concatenation Identifies a Product of Euclidean Spaces with a Euclidean Space (v), the dot product of (μ)(\mu) and (μ′)(\mu') in R1\mathbb{R}^{1} being the one-term sum μμ′\mu\mu' (The Dot Product on Rn\mathbb{R}^n (i), Iterated Operations: Finite Sums and Finite Products (i), Iterating a Binary Operation along a Finite List (i)), so that ∥(μ)∥2=(μ)⋅(μ)=μ2\lVert(\mu)\rVert^{2}=(\mu)\cdot(\mu)=\mu^{2} by Properties of the Euclidean Norm on Rn\mathbb{R}^n: Square, Distance, Vanishing, Coordinate Bounds, Homogeneity, Triangle Inequalities and Expansion of a Square (i).

Citations

Loading…

Dependencies

Loading…

Related

0 relations

Curated associations between results. These are editable and subjective — they do not replace the dependency graph, which is derived from the references in the text.

No relations recorded yet.

Comments

Log in to comment.

Loading…