Formal Definition of a Simplex
A simplex is the most basic type of convex polytope in any given dimension. It is the
generalization of a triangle (2D) or tetrahedron (3D) to arbitrary dimensions.
Definition:
Let v₀, v₁, ..., v_k ∈ ℝⁿ be k+1 affinely independent points (i.e., the vectors v₁ − v₀, v₂ − v₀, ...,
v_k − v₀ are linearly independent).
Then the k-simplex defined by these points is the set:
Δᵏ = { ∑(λᵢ vᵢ) | λᵢ ≥ 0, ∑λᵢ = 1 }
This is the convex hull of the k+1 points.
Key Concepts:
- Δᵏ is a k-dimensional simplex.
- The vᵢ are called vertices of the simplex.
- The coefficients λᵢ are barycentric coordinates.
- The condition ∑λᵢ = 1 and λᵢ ≥ 0 ensures all points lie in the convex combination of the
vertices.
Examples:
| Dimension k | Name | Geometric Object |
|-------------|----------------|--------------------------|
|0 | 0-simplex | A single point |
|1 | 1-simplex | A line segment |
|2 | 2-simplex | A triangle |
|3 | 3-simplex | A tetrahedron |
|n | n-simplex | Generalization in ℝⁿ |