Physlib

PhyslibAlpha.Mathematics.Geometry.Simplex

Simplices

i. Overview

A simplex is the convex hull of finitely many affinely independent points, its extreme points. Every point of a simplex is a mixture of the extreme points with unique weights, its barycentric coordinates. The model is the standard simplex of probability vectors in `ι → ℝ`, whose extreme points are the standard basis vectors. Being a simplex is invariant under affine equivalences.

ii. Key results

- `IsSimplex` states that a convex set is generated by finitely many affinely independent extreme points. - `IsSimplex.eq_of_affineCombination_eq` proves that the weights are unique. - `affineIndependent_of_convexCombination_eq` proves that unique weights give affine independence. - `stdSimplexSet` is the standard simplex in `ι → ℝ`. - `extremePoints_stdSimplexSet` proves that its extreme points are the standard basis vectors. - `isSimplex_of_affineEquiv_stdSimplexSet` proves that a set affinely equivalent to a standard simplex is a simplex.

iii. Table of contents

  • A. Simplices
  • B. The standard simplex
  • C. Affine equivalences

A. Simplices

B. The standard simplex

C. Affine equivalences

17 declarations

theorem

A set with two distinct extreme points is a simplex

Let EE be a real vector space and K⊆EK \subseteq E be a set. Suppose p,q∈Ep, q \in E are distinct points (p≠qp \neq q). If KK is the convex hull of {p,q}\{p, q\} and the set of extreme points of KK is {p,q}\{p, q\}, then KK is a simplex.

theorem

A simplex has at most dim⁡E+1\dim E + 1 extreme points

Let EE be a finite-dimensional real vector space and K⊆EK \subseteq E be a simplex. Let ι\iota be a finite set and p:ι→Ep : \iota \to E be an injective function such that for every i∈ιi \in \iota, the point p(i)p(i) is an extreme point of KK. Then the cardinality of ι\iota is at most the dimension of EE plus one: ∣ι∣≤dim⁡RE+1|\iota| \le \dim_{\mathbb{R}} E + 1

theorem

∑wi=0  ⟹  ∑max⁡(−wi,0)=∑max⁡(wi,0)\sum w_i = 0 \implies \sum \max(-w_i, 0) = \sum \max(w_i, 0)

Let ss be a finite set of indices and wiw_i be real-valued weights for i∈si \in s. If the sum of the weights is zero, ∑i∈swi=0\sum_{i \in s} w_i = 0, then the sum of the magnitudes of the negative weights is equal to the sum of the positive weights, expressed as ∑i∈smax⁡(−wi,0)=∑i∈smax⁡(wi,0)\sum_{i \in s} \max(-w_i, 0) = \sum_{i \in s} \max(w_i, 0).

theorem

∑max⁡(wi,0)pi=∑max⁡(−wi,0)pi\sum \max(w_i, 0) p_i = \sum \max(-w_i, 0) p_i for vanishing linear combinations ∑wipi=0\sum w_i p_i = 0

Let ss be a finite set of indices. Let wi∈Rw_i \in \mathbb{R} be weights and pip_i be points in a real vector space EE for i∈si \in s. If the linear combination of these points vanishes, i.e., ∑i∈swipi=0\sum_{i \in s} w_i p_i = 0, then the sum of the points scaled by the positive parts of the weights equals the sum of the points scaled by the absolute values of the negative parts of the weights: ∑i∈smax⁡(wi,0)pi=∑i∈smax⁡(−wi,0)pi\sum_{i \in s} \max(w_i, 0) p_i = \sum_{i \in s} \max(-w_i, 0) p_i

theorem

Unique Convex Combinations Implies Affine Independence

Let {pi}i∈ι\{p_i\}_{i \in \iota} be a family of points in a real vector space EE. Suppose that for every finite subset s⊆ιs \subseteq \iota and any weight functions w1,w2:ι→Rw_1, w_2: \iota \to \mathbb{R}, if the weights are non-negative (∀i∈s,w1,i≥0\forall i \in s, w_{1,i} \ge 0 and w2,i≥0w_{2,i} \ge 0), sum to unity (∑i∈sw1,i=1\sum_{i \in s} w_{1,i} = 1 and ∑i∈sw2,i=1\sum_{i \in s} w_{2,i} = 1), and satisfy ∑i∈sw1,ipi=∑i∈sw2,ipi\sum_{i \in s} w_{1,i} p_i = \sum_{i \in s} w_{2,i} p_i, then the weights must be identical (w1,i=w2,iw_{1,i} = w_{2,i} for all i∈si \in s). Under these conditions, the family {pi}i∈ι\{p_i\}_{i \in \iota} is affinely independent.

definition

Standard simplex in Rι\mathbb{R}^\iota

The standard simplex in the space of functions ι→R\iota \to \mathbb{R} is the set of vectors ff such that every coordinate is non-negative, f(i)≥0f(i) \ge 0 for all i∈ιi \in \iota, and the sum of the coordinates is equal to 11, ∑i∈ιf(i)=1\sum_{i \in \iota} f(i) = 1.

theorem

The standard simplex is convex

The standard simplex in the space of functions ι→R\iota \to \mathbb{R}, defined as the set of vectors ff such that each coordinate is non-negative (f(i)≥0f(i) \ge 0 for all i∈ιi \in \iota) and the coordinates sum to one (∑i∈ιf(i)=1\sum_{i \in \iota} f(i) = 1), is a convex set.

theorem

f(i)≤1f(i) \le 1 for any element ff of the standard simplex

Let ι\iota be an index set. For any vector f:ι→Rf: \iota \to \mathbb{R} in the standard simplex (the set of functions such that f(i)≥0f(i) \ge 0 for all i∈ιi \in \iota and ∑i∈ιf(i)=1\sum_{i \in \iota} f(i) = 1), every component f(i)f(i) satisfies the inequality f(i)≤1f(i) \le 1.

theorem

Standard basis vectors are elements of the standard simplex

For any index i∈ιi \in \iota, the standard basis vector ei∈Rιe_i \in \mathbb{R}^\iota (the vector whose ii-th coordinate is 11 and all other coordinates are 00) is an element of the standard simplex in Rι\mathbb{R}^\iota.

theorem

The Convex Hull of Standard Basis Vectors is the Standard Simplex

In the space of functions Rι\mathbb{R}^\iota, the convex hull of the range of the standard basis vectors {ei}i∈ι\{e_i\}_{i \in \iota} (where ei(j)=1e_i(j) = 1 if i=ji = j and 00 otherwise) is equal to the standard simplex. The standard simplex is the set of all vectors x∈Rιx \in \mathbb{R}^\iota such that each coordinate xix_i is non-negative and the sum of all coordinates ∑i∈ιxi\sum_{i \in \iota} x_i is equal to 11.

theorem

The extreme points of the standard simplex are the standard basis vectors

Let ι\iota be an index set. Let Δι⊂Rι\Delta^\iota \subset \mathbb{R}^\iota be the standard simplex, defined as the set of vectors f:ι→Rf: \iota \to \mathbb{R} such that f(i)≥0f(i) \ge 0 for all i∈ιi \in \iota and ∑i∈ιf(i)=1\sum_{i \in \iota} f(i) = 1. The set of extreme points of Δι\Delta^\iota is the set of standard basis vectors {ei}i∈ι\{e_i\}_{i \in \iota}, where ei(j)=1e_i(j) = 1 if i=ji = j and ei(j)=0e_i(j) = 0 otherwise.

theorem

Standard Basis Vectors are Affinely Independent

For any index set ι\iota, the family of standard basis vectors {ei}i∈ι\{e_i\}_{i \in \iota} in the space Rι\mathbb{R}^\iota, defined such that ei(j)=1e_i(j) = 1 if i=ji = j and ei(j)=0e_i(j) = 0 otherwise, is affinely independent over the real numbers R\mathbb{R}.

theorem

The standard simplex is a simplex

The standard simplex in Rι\mathbb{R}^\iota, defined as the set of vectors ff such that f(i)≥0f(i) \ge 0 for all i∈ιi \in \iota and ∑i∈ιf(i)=1\sum_{i \in \iota} f(i) = 1, is a simplex. In this context, a simplex is a convex set that is the convex hull of a finite set of affinely independent points.

theorem

Affine Equivalences Preserve Extreme Points: e(ext⁡(s))=ext⁡(e(s))e(\operatorname{ext}(s)) = \operatorname{ext}(e(s))

Let EE and FF be real vector spaces and e:E≃a[R]Fe : E \simeqᵃ[\mathbb{R}] F be an affine equivalence. For any subset s⊆Es \subseteq E, let ext⁡(s)\operatorname{ext}(s) denote the set of extreme points of ss. Then the image of the extreme points of ss under ee is equal to the set of extreme points of the image of ss under ee: e(ext⁡(s))=ext⁡(e(s))e(\operatorname{ext}(s)) = \operatorname{ext}(e(s)) This signifies that an affine equivalence maps extreme points to extreme points.

theorem

Affine Equivalences Map Simplices to Simplices

Let EE and FF be real vector spaces. If K⊆EK \subseteq E is a simplex and e:E≃RaFe : E \simeqᵃ_{\mathbb{R}} F is an affine equivalence, then the image e(K)e(K) is also a simplex in FF.

theorem

A set affinely equivalent to a standard simplex is a simplex

Let EE be a real vector space and K⊆EK \subseteq E be a subset. Suppose there exists an affine equivalence e:E≃a[R](ι→R)e : E \simeqᵃ[\mathbb{R}] (\iota \to \mathbb{R}) such that the image of KK under ee is the standard simplex in Rι\mathbb{R}^\iota, denoted by Δι={f:ι→R∣∀i,f(i)≥0 and ∑i∈ιf(i)=1}\Delta^\iota = \{ f : \iota \to \mathbb{R} \mid \forall i, f(i) \ge 0 \text{ and } \sum_{i \in \iota} f(i) = 1 \}. Then KK is a simplex.

theorem

The unit interval is a simplex

The unit interval [0,1]⊂R[0, 1] \subset \mathbb{R} is a simplex.