Simplex¶
The convex hull of n+1 affinely independent points in n-dimensional space, generalizing a point, segment, triangle and tetrahedron as the simplest full-dimensional polytope.
Core Idea¶
An n-simplex is the set of convex combinations of n+1 affinely independent vertices. Barycentric coordinates assign nonnegative weights summing to one; setting coordinates to zero selects faces and makes the face lattice uniform across dimensions. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.
The load-bearing residual is not the broad topic of geometry. It is the minimal-vertex full-dimensional convex polytope and basic cell of simplicial constructions. That residual remains recognizable when examples, notation, scale, or implementation change, but it disappears if the carrier is mistyped, the condition that the vertices are affinely independent and every point has a unique barycentric-coordinate representation relative to them fails, a neighboring object is substituted, or notation and topical resemblance replace the constitutive test.
Scope of Application¶
Simplex belongs to geometry and is useful where the analyst can specify an affine space, n+1 affinely independent vertices, their convex hull, barycentric coordinates, faces, dimension, and orientation, then evaluate the vertices are affinely independent and every point has a unique barycentric-coordinate representation relative to them. The scope is broad within that domain but bounded by the need for the vertices are affinely independent and every point has a unique barycentric-coordinate representation relative to them. The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.
Clarity¶
The abstraction clarifies a crowded vocabulary by making the vertices are affinely independent and every point has a unique barycentric-coordinate representation relative to them the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test. A bare label is insufficient because the name Simplex can be used for a formal identity, an implementation, or a neighboring result unless carrier and convention are stated.
Manages Complexity¶
Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Simplex. Simplex compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.
Abstract Reasoning¶
- Identify the carrier. State what the elements, states, objects, or observations are: an affine space, n+1 affinely independent vertices, their convex hull, barycentric coordinates, faces, dimension, and orientation. Reject examples whose alleged carrier belongs to a different problem. 2. Lock the constitutive rule. Express the vertices are affinely independent and every point has a unique barycentric-coordinate representation relative to them independently of one notation or implementation.
Knowledge Transfer¶
Knowledge transfers strongly among subfields of geometry because they reuse an affine space, n+1 affinely independent vertices, their convex hull, barycentric coordinates, faces, dimension, and orientation, Barycentric coordinates assign nonnegative weights summing to one; setting coordinates to zero selects faces and makes the face lattice uniform across dimensions., and type the carrier, state every parameter and convention in the definition, test that the vertices are affinely independent and every point has a unique barycentric-coordinate representation relative to them, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.
Relationships to Other Abstractions¶
Current abstraction Simplex Domain-specific
Parents (1) — more general patterns this builds on
-
Simplex is a kind of Convexity Prime
The proposed strict upward parent is
prime:convexity.
Hierarchy path (1) — routes to 1 parentless root
- Simplex → Convexity → Optimization
Neighborhood in Abstraction Space¶
Simplex sits in a crowded region of the domain-specific corpus (34th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.
Family — Convex Geometry & Spatial Partition (35 abstractions)
Nearest neighbors
- Polyhedral space — 0.91
- Uniform polyhedron — 0.91
- Convex hull — 0.90
- Three-dimensional space — 0.90
- Relative convex hull — 0.90
Computed from structural-signature embeddings · 2026-09-08