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
A set with two distinct extreme points is a simplex
Let be a real vector space and be a set. Suppose are distinct points (). If is the convex hull of and the set of extreme points of is , then is a simplex.
A simplex has at most extreme points
Let be a finite-dimensional real vector space and be a simplex. Let be a finite set and be an injective function such that for every , the point is an extreme point of . Then the cardinality of is at most the dimension of plus one:
Let be a finite set of indices and be real-valued weights for . If the sum of the weights is zero, , then the sum of the magnitudes of the negative weights is equal to the sum of the positive weights, expressed as .
for vanishing linear combinations
Let be a finite set of indices. Let be weights and be points in a real vector space for . If the linear combination of these points vanishes, i.e., , 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:
Unique Convex Combinations Implies Affine Independence
Let be a family of points in a real vector space . Suppose that for every finite subset and any weight functions , if the weights are non-negative ( and ), sum to unity ( and ), and satisfy , then the weights must be identical ( for all ). Under these conditions, the family is affinely independent.
Standard simplex in
The standard simplex in the space of functions is the set of vectors such that every coordinate is non-negative, for all , and the sum of the coordinates is equal to , .
The standard simplex is convex
The standard simplex in the space of functions , defined as the set of vectors such that each coordinate is non-negative ( for all ) and the coordinates sum to one (), is a convex set.
for any element of the standard simplex
Let be an index set. For any vector in the standard simplex (the set of functions such that for all and ), every component satisfies the inequality .
Standard basis vectors are elements of the standard simplex
For any index , the standard basis vector (the vector whose -th coordinate is and all other coordinates are ) is an element of the standard simplex in .
The Convex Hull of Standard Basis Vectors is the Standard Simplex
In the space of functions , the convex hull of the range of the standard basis vectors (where if and otherwise) is equal to the standard simplex. The standard simplex is the set of all vectors such that each coordinate is non-negative and the sum of all coordinates is equal to .
The extreme points of the standard simplex are the standard basis vectors
Let be an index set. Let be the standard simplex, defined as the set of vectors such that for all and . The set of extreme points of is the set of standard basis vectors , where if and otherwise.
Standard Basis Vectors are Affinely Independent
For any index set , the family of standard basis vectors in the space , defined such that if and otherwise, is affinely independent over the real numbers .
The standard simplex is a simplex
The standard simplex in , defined as the set of vectors such that for all and , 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.
Affine Equivalences Preserve Extreme Points:
Let and be real vector spaces and be an affine equivalence. For any subset , let denote the set of extreme points of . Then the image of the extreme points of under is equal to the set of extreme points of the image of under : This signifies that an affine equivalence maps extreme points to extreme points.
Affine Equivalences Map Simplices to Simplices
Let and be real vector spaces. If is a simplex and is an affine equivalence, then the image is also a simplex in .
A set affinely equivalent to a standard simplex is a simplex
Let be a real vector space and be a subset. Suppose there exists an affine equivalence such that the image of under is the standard simplex in , denoted by . Then is a simplex.
The unit interval is a simplex
The unit interval is a simplex.
