simplex
A geometric object generalizing the triangle: an N-simplex is the set of all probability distributions on N+1 points, appearing as a point (0-simplex), line (1-simplex), triangle (2-simplex), tetrahedron (3-simplex), and so on.
As defined in 174 | Tai-Danae Bradley on Algebra, Topology, Language, and Entropy
Where it comes up · 1
Most important claims · 3 of 3Search all claims for “simplex” →
- A probability distribution on N+1 elements is precisely an N-simplex: the set of all such distributions forms geometric shapes (a point, line, triangle, tetrahedron, and higher), so probabilities are inherently geometric and topological objects, making entropy's connection to topology unsurprising.174 | Tai-Danae Bradley on Algebra, Topology, Language, and Entropy
- The familiar Leibniz-like equation entropy satisfies is just a special case or 'shadow' of a more general framework developed in Bradley's paper, in which seemingly heavy machinery (considering all lower-dimensional simplices, maps between them, and D squared equals zero) rewards the effort by making many results fall out nicely from a higher vantage point.174 | Tai-Danae Bradley on Algebra, Topology, Language, and Entropy
- Topological spaces require infinite information to specify, but by triangulating (tessellating) them into a finite number of simplices, mathematicians reduce them to a finite, combinatorial description of how pieces connect, enabling them to count fundamental holes and analyze abstract spaces in arbitrary dimensions that cannot be visualized.174 | Tai-Danae Bradley on Algebra, Topology, Language, and Entropy