FACTOID # 57: Two-thirds of the world's kidnappings occur in Colombia.
 
 Home   Encyclopedia   Statistics   Countries A-Z   Flags   Maps   Education   Forum   FAQ   About 
 
WHAT'S NEW
RELATED ARTICLES
People who viewed "Simplex" also viewed:
RECENT ARTICLES
More Recent Articles »
 

SEARCH ALL

FACTS & STATISTICS   

Search encyclopedia, statistics and forums:

 

 

(* = Graphable)

 

 


Encyclopedia > Simplex

A 3-simplex or tetrahedron
A 3-simplex or tetrahedron

In geometry, a simplex (plural simplexes or simplices) or n-simplex is an n-dimensional analogue of a triangle. Specifically, a simplex is the convex hull of a set of (n + 1) affinely independent points in some Euclidean space of dimension n or higher (i.e., a set of points such that no m-plane contains more than (m + 1) of them; such points are said to be in general position). Image File history File links Download high-resolution version (1000x1000, 187 KB)See: Stella (software) File history Legend: (cur) = this is the current file, (del) = delete this old version, (rev) = revert to this old version. ... Image File history File links Download high-resolution version (1000x1000, 187 KB)See: Stella (software) File history Legend: (cur) = this is the current file, (del) = delete this old version, (rev) = revert to this old version. ... A tetrahedron (plural: tetrahedra) is a polyhedron composed of four triangular faces, three of which meet at each vertex. ... Calabi-Yau manifold Geometry (Greek γεωμετρία; geo = earth, metria = measure) is a part of mathematics concerned with questions of size, shape, and relative position of figures and with properties of space. ... Convex hull: elastic band analogy In mathematics, the convex hull or convex envelope for a set of points X in a real vector space V is the minimal convex set containing X. // For planar objects, i. ... In geometry, an affine transformation or affine map (from the Latin, affinis, connected with) between two vector spaces (strictly speaking, two affine spaces) consists of a linear transformation followed by a translation: In the finite-dimensional case each affine transformation is given by a matrix A and a vector b... A spatial point is an entity with a location in space but no extent (volume, area or length). ... Around 300 BC, the Greek mathematician Euclid laid down the rules of what has now come to be called Euclidean geometry, which is the study of the relationships between angles and distances in space. ... Two intersecting planes in three-dimensional space In mathematics, a plane is a two-dimensional manifold or surface that is perfectly flat. ... In geometry, general position for a set of points, or other configuration, means the general case situation, as opposed to some more special or coincidental cases that are possible. ...


For example, a 0-simplex is a point, a 1-simplex is a line segment, a 2-simplex is a triangle, a 3-simplex is a tetrahedron, and a 4-simplex is a pentachoron (in each case with interior). A spatial point is an entity with a location in space but no extent (volume, area or length). ... The geometric definition of a line segment In geometry, a line segment is a part of a line that is bounded by two end points, and contains every point on the line between its end points. ... A triangle is one of the basic shapes of geometry: a polygon with three vertices and three sides which are straight line segments. ... A tetrahedron (plural: tetrahedra) is a polyhedron composed of four triangular faces, three of which meet at each vertex. ... The pentachoron, also called a pentatope or 4-simplex, is the simplest convex regular polychoron (a type of four-dimensional geometric figure). ...


A regular simplex is a simplex that is also a regular polytope. A regular n-simplex may be constructed from a regular (n − 1)-simplex by connecting a new vertex to all original vertices by the common edge length. A dodecahedron, one of the five Platonic solids. ...

Contents

Elements

The convex hull of any nonempty subset of the n+1 points that define an n-simplex is called a face of the simplex. Faces are simplices themselves. In particular, the convex hull of a subset of size m+1 (of the n+1 defining points) is an m-simplex, called an m-face of the n-simplex. The 0-faces (i.e., the defining points themselves as sets of size 1) are called the vertices (singular: vertex), the 1-faces are called the edges, the (n − 1)-faces are called the facets, and the sole n-face is the whole n-simplex itself. In general, the number of m-faces is equal to the binomial coefficient C(n + 1, m + 1). Consequently, the number of m-faces of an n-simplex may be found in column (m + 1) of row (n + 1) of Pascal's triangle. In mathematics, particularly in combinatorics, the binomial coefficient of the natural number n and the integer k is the number of combinations that exist. ... 1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 The first six rows of Pascals triangle In mathematics, Pascals triangle is a geometric arrangement of the binomial coefficients in a triangle. ...


The regular simplex family is the first of three regular polytope families, labeled by Coxeter as αn, the other two being the cross-polytope family, labeled as βn, and the hypercubes, labeled as γn. A fourth family, the infinite tessellation of hypercubes he labeled as δn. A dodecahedron, one of the five Platonic solids. ... H.S.M. Coxeter. ... In geometry, a cross-polytope, or orthoplex, is a regular, convex polytope that exists in any number of dimensions. ... A square A projection of a cube (into a two-dimensional image) A projection of a hypercube (into a two-dimensional image) In geometry, a hypercube is an n-dimensional analogue of a square (n = 2) and a cube (n = 3). ... In geometry, a hypercubic honeycomb is a family of regular honeycombs (tessellations) in n-dimensions with the Schläfli symbols {4,3. ...

n-Simplex elements (by Pascal's triangle)
Δn αn n-polytope Graph Name Schläfli symbol
Coxeter-Dynkin		 Vertices
(0-faces)		 Edges
(1-faces)		 Faces
(2-faces)		 Cells
(3-faces)		 (4-faces) (5-faces) (6-faces) (7-faces) (8-faces) (9-faces)
Δ0 α0 0-polytope Point
(0-simplex)		 - 1                  
Δ1 α1 1-polytope Line segment
(1-simplex)		 {}
Image:CDW_ring.png		 2 1                
Δ2 α2 2-polytope Triangle
(2-simplex)		 {3}
Image:CDW_ring.png Image:CDW_3b.png Image:CDW_dot.png		 3 3 1              
Δ3 α3 3-polytope Tetrahedron
(3-simplex)		 {3,3}
Image:CDW_ring.png Image:CDW_3b.png Image:CDW_dot.png Image:CDW_3b.png Image:CDW_dot.png		 4 6 4 1            
Δ4 α4 4-polytope Pentachoron
(4-simplex)		 {3,3,3}
Image:CDW_ring.png Image:CDW_3b.png Image:CDW_dot.png Image:CDW_3b.png Image:CDW_dot.png Image:CDW_3b.png Image:CDW_dot.png		 5 10 10 5 1          
Δ5 α5 5-polytope Hexateron
Hexa-5-tope
(5-simplex)		 {3,3,3,3}
Image:CDW_ring.png Image:CDW_3b.png Image:CDW_dot.png Image:CDW_3b.png Image:CDW_dot.png Image:CDW_3b.png Image:CDW_dot.png Image:CDW_3b.png Image:CDW_dot.png		 6 15 20 15 6 1        
Δ6 α6 6-polytope Heptapeton
Hepta-6-tope
(6-simplex)		 {3,3,3,3,3}
Image:CDW_ring.png Image:CDW_3b.png Image:CDW_dot.png Image:CDW_3b.png Image:CDW_dot.png Image:CDW_3b.png Image:CDW_dot.png Image:CDW_3b.png Image:CDW_dot.png Image:CDW_3b.png Image:CDW_dot.png		 7 21 35 35 21 7 1      
Δ7 α7 7-polytope Octaexon
Octa-7-tope
(7-simplex)		 {3,3,3,3,3,3}
Image:CDW_ring.png Image:CDW_3b.png Image:CDW_dot.png Image:CDW_3b.png Image:CDW_dot.png Image:CDW_3b.png Image:CDW_dot.png Image:CDW_3b.png Image:CDW_dot.png Image:CDW_3b.png Image:CDW_dot.png Image:CDW_3b.png Image:CDW_dot.png		 8 28 56 70 56 28 8 1    
Δ8 α8 8-polytope Enneazetton
Ennea-8-tope
(8-simplex)		 {3,3,3,3,3,3,3}
Image:CDW_ring.png Image:CDW_3b.png Image:CDW_dot.png Image:CDW_3b.png Image:CDW_dot.png Image:CDW_3b.png Image:CDW_dot.png Image:CDW_3b.png Image:CDW_dot.png Image:CDW_3b.png Image:CDW_dot.png Image:CDW_3b.png Image:CDW_dot.png Image:CDW_3b.png Image:CDW_dot.png		 9 36 84 126 126 84 36 9 1  
Δ9 α9 9-polytope   Decayotton
Deca-9-tope
(9-simplex)		 {3,3,3,3,3,3,3,3}
Image:CDW_ring.png Image:CDW_3b.png Image:CDW_dot.png Image:CDW_3b.png Image:CDW_dot.png Image:CDW_3b.png Image:CDW_dot.png Image:CDW_3b.png Image:CDW_dot.png Image:CDW_3b.png Image:CDW_dot.png Image:CDW_3b.png Image:CDW_dot.png Image:CDW_3b.png Image:CDW_dot.png Image:CDW_3b.png Image:CDW_dot.png		 10 45 120 210 252 210 120 45 10 1
Δ10 α10 10-polytope   Hendeca-10-tope
(10-simplex)		 {3,3,3,3,3,3,3,3,3}
Image:CDW_ring.png Image:CDW_3b.png Image:CDW_dot.png Image:CDW_3b.png Image:CDW_dot.png Image:CDW_3b.png Image:CDW_dot.png Image:CDW_3b.png Image:CDW_dot.png Image:CDW_3b.png Image:CDW_dot.png Image:CDW_3b.png Image:CDW_dot.png Image:CDW_3b.png Image:CDW_dot.png Image:CDW_3b.png Image:CDW_dot.png Image:CDW_3b.png Image:CDW_dot.png		 11 55 165 330 462 462 330 165 55 11

In geometry polytope means, first, the generalization to any dimension of polygon in two dimensions, and polyhedron in three dimensions. ... In mathematics, the Schläfli symbol is a simple notation that gives a summary of some important properties of a particular regular polytope. ... Coxeter groups in the plane with equivalent diagrams. ... In geometry polytope means, first, the generalization to any dimension of polygon in two dimensions, polyhedron in three dimensions, and polychoron in four dimensions. ... Image File history File links Complete_graph_K1. ... In geometry, a vertex (plural vertices) is a special kind of point, usually a corner of a polygon, polyhedron, or higher dimensional polytope. ... In geometry polytope means, first, the generalization to any dimension of polygon in two dimensions, polyhedron in three dimensions, and polychoron in four dimensions. ... Image File history File links Complete_graph_K2. ... The geometric definition of a line segment In geometry, a line segment is a part of a line that is bounded by two end points, and contains every point on the line between its end points. ... Image File history File links CDW_ring. ... Look up polygon in Wiktionary, the free dictionary. ... Image File history File links This is a lossless scalable vector image. ... A triangle is one of the basic shapes of geometry: a polygon with three vertices and three sides which are straight line segments. ... Image File history File links CDW_ring. ... Image File history File links CDW_3b. ... Image File history File links CDW_dot. ... A polyhedron (plural polyhedra or polyhedrons) is a geometric object with flat faces and straight edges. ... Image File history File links Complete_graph_K4. ... A tetrahedron (plural: tetrahedra) is a polyhedron composed of four triangular faces, three of which meet at each vertex. ... Image File history File links CDW_ring. ... Image File history File links CDW_3b. ... Image File history File links CDW_dot. ... Image File history File links CDW_3b. ... Image File history File links CDW_dot. ... In geometry, a four-dimensional polytope is sometimes called a polychoron (plural: polychora), from the Greek root poly, meaning many, and choros meaning room or space. It is also called a 4-polytope or polyhedroid. ... Image File history File links Complete_graph_K5. ... The pentachoron, also called a pentatope or 4-simplex, is the simplest convex regular polychoron (a type of four-dimensional geometric figure). ... Image File history File links CDW_ring. ... Image File history File links CDW_3b. ... Image File history File links CDW_dot. ... Image File history File links CDW_3b. ... Image File history File links CDW_dot. ... Image File history File links CDW_3b. ... Image File history File links CDW_dot. ... In geometry, a five-dimensional polytope, or 5-polytope, is a polytope in 5-dimensional space. ... Image File history File links Complete_graph_K6. ... Stereographic projection 4D to 3D of Schlegel diagram 5D to 4D of hexateron. ... Image File history File links CDW_ring. ... Image File history File links CDW_3b. ... Image File history File links CDW_dot. ... Image File history File links CDW_3b. ... Image File history File links CDW_dot. ... Image File history File links CDW_3b. ... Image File history File links CDW_dot. ... Image File history File links CDW_3b. ... Image File history File links CDW_dot. ... In geometry, a six-dimensional polytope, or 6-polytope, is a polytope in 6-dimensional space. ... Image File history File links This is a lossless scalable vector image. ... A heptateron, or hepta-6-tope is a 6-simplex, a self-dual regular 6-polytope with 7 vertices, 21 edges, 35 triangle faces, 35 tetrahedral cells, 21 5-cell 5-faces, and 7 6-simplex 6-faces. ... Image File history File links CDW_ring. ... Image File history File links CDW_3b. ... Image File history File links CDW_dot. ... Image File history File links CDW_3b. ... Image File history File links CDW_dot. ... Image File history File links CDW_3b. ... Image File history File links CDW_dot. ... Image File history File links CDW_3b. ... Image File history File links CDW_dot. ... Image File history File links CDW_3b. ... Image File history File links CDW_dot. ... In geometry, a seven-dimensional polytope, or 7-polytope, is a polytope in 7-dimensional space. ... Image File history File links This is a lossless scalable vector image. ... An octexon, or octa-7-tope is a 7-simplex, a self-dual regular 7-polytope with 8 vertices, 28 edges, 56 triangle faces, 70 tetrahedral cells, 56 5-cell 5-faces, 28 5-simplex 6-faces, and 8 6-simplex 7-faces. ... Image File history File links CDW_ring. ... Image File history File links CDW_3b. ... Image File history File links CDW_dot. ... Image File history File links CDW_3b. ... Image File history File links CDW_dot. ... Image File history File links CDW_3b. ... Image File history File links CDW_dot. ... Image File history File links CDW_3b. ... Image File history File links CDW_dot. ... Image File history File links CDW_3b. ... Image File history File links CDW_dot. ... Image File history File links CDW_3b. ... Image File history File links CDW_dot. ... In geometry, an eight-dimensional polytope, or 8-polytope, is a polytope in 8-dimensional space. ... Image File history File links This is a lossless scalable vector image. ... An enneazetton, or ennea-8-tope is an 8-simplex, a self-dual regular 8-polytope with 9 vertices, 36 edges, 84 triangle faces, 126 tetrahedral cells, 126 5-cell 4-faces, 84 5-simplex 5-faces, 36 6-simplex 6-faces, and 9 7-simplex 7-faces. ... Image File history File links CDW_ring. ... Image File history File links CDW_3b. ... Image File history File links CDW_dot. ... Image File history File links CDW_3b. ... Image File history File links CDW_dot. ... Image File history File links CDW_3b. ... Image File history File links CDW_dot. ... Image File history File links CDW_3b. ... Image File history File links CDW_dot. ... Image File history File links CDW_3b. ... Image File history File links CDW_dot. ... Image File history File links CDW_3b. ... Image File history File links CDW_dot. ... Image File history File links CDW_3b. ... Image File history File links CDW_dot. ... In geometry polytope means, first, the generalization to any dimension of polygon in two dimensions, polyhedron in three dimensions, and polychoron in four dimensions. ... A decayotton, or deca-9-tope is a 9-simplex, a self-dual regular 9-polytope with 10 vertices, 45 edges, 120 triangle faces, 210 tetrahedral cells, 252 5-cell 4-faces, 210 5-simplex 5-faces, 120 6-simplex 6-faces, 45 7-simplex 7-faces, and 10 8... Image File history File links CDW_ring. ... Image File history File links CDW_3b. ... Image File history File links CDW_dot. ... Image File history File links CDW_3b. ... Image File history File links CDW_dot. ... Image File history File links CDW_3b. ... Image File history File links CDW_dot. ... Image File history File links CDW_3b. ... Image File history File links CDW_dot. ... Image File history File links CDW_3b. ... Image File history File links CDW_dot. ... Image File history File links CDW_3b. ... Image File history File links CDW_dot. ... Image File history File links CDW_3b. ... Image File history File links CDW_dot. ... Image File history File links CDW_3b. ... Image File history File links CDW_dot. ... A hendeca-10-tope is a 10-simplex, a self-dual regular 10-polytope with 11 vertices, 55 edges, 165 triangle faces, 330 tetrahedral cells, 462 5-cell 4-faces, 462 5-simplex 5-faces, 330 6-simplex 6-faces, 165 7-simplex 7-faces, 55 8-simplex 8-faces... Image File history File links CDW_ring. ... Image File history File links CDW_3b. ... Image File history File links CDW_dot. ... Image File history File links CDW_3b. ... Image File history File links CDW_dot. ... Image File history File links CDW_3b. ... Image File history File links CDW_dot. ... Image File history File links CDW_3b. ... Image File history File links CDW_dot. ... Image File history File links CDW_3b. ... Image File history File links CDW_dot. ... Image File history File links CDW_3b. ... Image File history File links CDW_dot. ... Image File history File links CDW_3b. ... Image File history File links CDW_dot. ... Image File history File links CDW_3b. ... Image File history File links CDW_dot. ... Image File history File links CDW_3b. ... Image File history File links CDW_dot. ...

The standard simplex

The standard 2-simplex in R3
The standard 2-simplex in R3

The standard n-simplex is the subset of Rn+1 given by Image File history File links This is a lossless scalable vector image. ... Image File history File links This is a lossless scalable vector image. ...

Delta^n = left{(t_0,cdots,t_n)inmathbb{R}^{n+1}midSigma_{i}{t_i} = 1 mbox{ and } t_i ge 0 mbox{ for all } iright}

The simplex Δn live in the affine hyperplane obtained by removing the restriction ti ≥ 0 in the above definition. The standard simplex is clearly regular. A hyperplane is a concept in geometry. ...


The vertices of the standard n-simplex are the points

e0 = (1, 0, 0, …, 0),
e1 = (0, 1, 0, …, 0),
vdots
en = (0, 0, 0, …, 1).

There is a canonical map from the standard n-simplex to an arbitrary n-simplex with vertices (v0, …, vn) given by

(t_0,cdots,t_n) mapsto Sigma_i t_i v_i

The coefficients ti are called the barycentric coordinates of a point in the n-simplex. Such a general simplex is often called an affine n-simplex, to emphasize that the canonical map is an affine transformation. It is also sometimes called an oriented affine n-simplex to emphasize that the canonical map may be orientation preserving or reversing. In mathematics, barycentric coordinates are coordinates defined by the vertices of a simplex. ... In geometry, an affine transformation or affine map (from the Latin, affinis, connected with) between two vector spaces (strictly speaking, two affine spaces) consists of a linear transformation followed by a translation: In the finite-dimensional case each affine transformation is given by a matrix A and a vector b... In mathematics, an orientation on a real vector space is a choice of which ordered bases are positively oriented (or right-handed) and which are negatively oriented (or left-handed). ...


Geometric properties

The oriented volume of an n-simplex in n-dimensional space with vertices (v0, ..., vn) is The volume of a solid object is the three-dimensional concept of how much space it occupies, often quantified numerically. ...

{1over n!}det begin{pmatrix} v_0-v_1 & v_1-v_2& dots & v_{n-1}-v_{n} end{pmatrix}

where each column of the n × n determinant is the difference between two vertices. Any determinant which involves taking the difference between pairs of vertices, where the pairs connect the vertices as a simply connected graph will also give the (same) volume. Without the 1/n! it is the formula for the volume of an n-parallelepiped. One way to understand the 1/n! factor is as follows. If the coordinates of a point in a unit n-box are sorted, together with 0 and 1, and successive differences are taken, then since the results add to one, the result is a point in an n simplex spanned by the origin and the closest n vertices of the box. The taking of differences was an orthogonal (volume-preserving) transformation, but sorting compressed the space by a factor of n!. In algebra, a determinant is a function depending on n that associates a scalar, det(A), to every n×n square matrix A. The fundamental geometric meaning of a determinant is as the scale factor for volume when A is regarded as a linear transformation. ... In geometry, a parallelepiped (now usually pronounced , traditionally[1] in accordance with its etymology in Greek παραλληλ-επίπεδον, a body having parallel planes) is a three-dimensional figure like a cube, except that its faces are not squares but parallelograms. ...


The volume under a standard n-simplex (i.e. between the origin and the simplex) is The volume of a solid object is the three-dimensional concept of how much space it occupies, often quantified numerically. ...

{1 over (n+1)!}

The volume of a regular n-simplex with unit side length is The volume of a solid object is the three-dimensional concept of how much space it occupies, often quantified numerically. ...

{frac{sqrt{n+1}}{n!sqrt{2^n}}}

as can be seen by multiplying the previous formula by xn+1, to get the volume under the n-simplex as a function of its vertex distance x from the origin, differentiating with respect to x, at x=1/sqrt{2}   (where the n-simplex side length is 1), and normalizing by the length dx/sqrt{n+1}, of the increment, (dx/(n+1),dots, dx/(n+1)), along the normal vector.


Simplexes with an "orthogonal corner"

Orthogonal corner means here, that there is a vertex at which all adjacent hyperfaces are pairwise orthogonal. Such simplexes are generalizations of right angle triangles and for them there exists an n-dimensional version of the Pythagorean theorem: In mathematics, the Pythagorean theorem or Pythagoras theorem is a relation in Euclidean geometry among the three sides of a right triangle. ...


The sum of the squared n-dimensional volumes of the hyperfaces adjacent to the orthogonal corner equals the squared n-dimensional volume of the hyperface opposite of the orthogonal corner.

sum_{k=1}^{n} |A_{k}|^2 = |A_{0}|^2

where A_{1} ldots A_{n} are hyperfaces being pairwise orthogonal to each other but not orthogonal to A0, which is the hyperface opposite of the orthogonal corner.


For a 2-Simplex the theorem is the the Pythagorean theorem for triangles with a right angle and for a 3-simplex it is de Gua's theorem for a tetrahedron with a cube corner. In mathematics, the Pythagorean theorem or Pythagoras theorem is a relation in Euclidean geometry among the three sides of a right triangle. ... De Guas theorem is a generalization of the Pythagorean theorem to three dimensions and named for Jean Paul de Gua de Malves. ...


Topology

Topologically, an n-simplex is equivalent to an n-ball. Every n-simplex is therefore an n-dimensional manifold with boundary. A Möbius strip, an object with only one surface and one edge; such shapes are an object of study in topology. ... This word should not be confused with homomorphism. ... In mathematics, a ball is the inside of a sphere; both concepts apply not only in the three-dimensional space but also for lower and higher dimensions, and for metric spaces in general. ... On a sphere, the sum of the angles of a triangle is not equal to 180°. A sphere is not a Euclidean space, but locally the laws of the Euclidean geometry are good approximations. ...


In algebraic topology, simplices are used as building blocks to construct an interesting class of topological spaces called simplicial complexes. These spaces are built from simplices glued together in a combinatorial fashion. Simplicial complexes are used to define a certain kind of homology called simplicial homology. Algebraic topology is a branch of mathematics in which tools from abstract algebra are used to study topological spaces. ... Topological spaces are structures that allow one to formalize concepts such as convergence, connectedness and continuity. ... In mathematics, a simplicial complex is a topological space of a particular kind, built up of points, line segments, triangles, and their n-dimensional counterparts. ... Combinatorics is a branch of pure mathematics concerning the study of discrete (and usually finite) objects. ... In mathematics (especially algebraic topology and abstract algebra), homology (in Greek homos = identical) is a certain general procedure to associate a sequence of abelian groups or modules to a given mathematical object (such as a topological space or a group). ... In mathematics, in the area of algebraic topology, simplicial homology is a theory with a finitary definition, and is probably the most tangible variant of homology theory. ...


A finite set of k-simplexes embedded in an open subset of Rn is called an affine k-chain. The simplexes in a chain need not be unique; they may occur with multiplicity. Rather than using standard set notation to denote an affine chain, it is instead the standard practice to use plus signs to separate each member in the set. If some of the simplexes have the opposite orientation, these are prefixed by a minus sign. If some of the simplexes occur in the set more than once, these are prefixed with an integer count. Thus, an affine chain takes the symbolic form of a sum with integer coefficients. In topology and related fields of mathematics, a set U is called open if, intuitively speaking, you can wiggle or change any point x in U by a small amount in any direction and still be inside U. In other words, if x is surrounded only by elements of U... In mathematics, the multiplicity of a member of a multiset is how many memberships in the multiset it has. ... In mathematics, an orientation on a real vector space is a choice of which ordered bases are positively oriented (or right-handed) and which are negatively oriented (or left-handed). ...


Note that each face of an n-simplex is an affine n-1-simplex, and thus the boundary of an n-simplex is an affine n-1-chain. Thus, if we denote one positively-oriented affine simplex as In topology, the boundary of a subset S of a topological space X is the set of points which can be approached both from S and from the outside of S. More formally, it is the set of points in the closure of S, not belonging to the interior of...

σ = [v0,v1,v2,...,vn]

with the vj denoting the vertices, then the boundary partialsigma of σ is the chain

partialsigma = sum_{j=0}^n (-1)^j [v_0,...,v_{j-1},v_{j+1},...,v_n].

More generally, a simplex (and a chain) can be embedded into a manifold by means of smooth, differentiable map fcolonmathbb{R}^nrightarrow M. In this case, both the summation convention for denoting the set, and the boundary operation commute with the embedding. That is, On a sphere, the sum of the angles of a triangle is not equal to 180°. A sphere is not a Euclidean space, but locally the laws of the Euclidean geometry are good approximations. ...

f(sumnolimits_i a_i sigma_i) = sumnolimits_i a_i f(sigma_i)

where the ai are the integers denoting orientation and multiplicity. For the boundary operator partial, one has:

partial f(phi) = f (partial phi)

where φ is a chain. The boundary operation commutes with the mapping because, in the end, the chain is defined as a set and little more, and the set operation always commutes with the map operation (by definition of a map). Graph of example function, The mathematical concept of a function expresses the intuitive idea of deterministic dependence between two quantities, one of which is viewed as primary (the independent variable, argument of the function, or its input) and the other as secondary (the value of the function, or output). A...


A continuous map f:sigmarightarrow X to a topological space X is frequently referred to as a singular n-simplex. Topological spaces are structures that allow one to formalize concepts such as convergence, connectedness and continuity. ...


Random sampling

(Also called Simplex Point Picking) There are at least two efficient ways to generate uniform random samples from the unit simplex.


The first method is based on the fact that sampling from the K-dimensional unit simplex is equivalent to sampling from a Dirichlet distribution with parameters α = (α1, ..., αK) all equal to one. The exact procedure would be as follows: Several images of the probability density of the Dirichlet distribution when K=3 for various parameter vectors α. Clockwise from top left: α=(6, 2, 2), (3, 7, 5), (6, 2, 6), (2, 3, 4). ...

  • Generate K unit-exponential distributed random draws x1, ..., xK.
    • This can be done by generating K uniform random draws yi from the open interval (0,1] and setting xi=-ln(yi).
  • Set S to be the sum of all the xi.
  • The K coordinates t1, ..., tK of the final point on the unit simplex are given by ti=xi/S.

The second method to generate a random point on the unit simplex is based on the order statistics of the uniform distribution on the unit interval, and was popularized by Horst Kraemer. The algorithm is as follows: In probability theory and statistics, the exponential distributions are a class of continuous probability distribution. ... In probability theory and statistics, the continuous uniform distribution is a family of probability distributions such that for each member of the family, all intervals of the same length on the distributions support are equally probable. ... In elementary algebra, an interval is a set that contains every real number between two indicated numbers, and possibly the two numbers themselves. ... Probability distributions for the n = 5 order statistics of an exponential distribution with θ = 3. ...

  • Set p0 = 0 and pK=1.
  • Generate K-1 uniform random draws pi from the open interval (0,1).
  • Sort into ascending order the K+1 points p0, ..., pK.
  • The K coordinates t1, ..., tK of the final point on the unit simplex are given by ti=pi-pi-1.

It has been pointed out by Smith and Tromble that the second method is technically only valid if none of the differences pi-pi-1 are equal to zero. In practice, it is sufficient to merely re-run the algorithm to generate a new set of points if this happens. In probability theory and statistics, the continuous uniform distribution is a family of probability distributions such that for each member of the family, all intervals of the same length on the distributions support are equally probable. ... In elementary algebra, an interval is a set that contains every real number between two indicated numbers, and possibly the two numbers themselves. ...


Random walk

Sometimes, rather than picking a point on the simplex at random we need to perform a uniform random walk on the simplex. Such random walks are freqently required for Monte Carlo method computations such as Markov chain Monte Carlo over the simplex domain. In mathematics, computer science, and physics, a random walk, sometimes called a drunkards walk, is a formalisation of the intuitive idea of taking successive steps, each in a random direction. ... Monte Carlo methods are a widely used class of computational algorithms for simulating the behavior of various physical and mathematical systems, and for other computations. ... Markov chain Monte Carlo (MCMC) methods (which include random walk Monte Carlo methods) are a class of algorithms for sampling from probability distributions based on constructing a Markov chain that has the desired distribution as its stationary distribution. ...


An efficient algorithm to do the walk can be derived from the fact that the normalized sum of K unit-exponential random variables is distributed uniformly over the simplex. We begin by defining a univariate function that "walks" a given sample over over the positive real line such that the stationary distribution of its samples is the unit-exponential distribubtion. The function makes use of the Metropolis-Hastings algorithm to sample the new point given the old point. Such a function can be written as the following, where h is the relative step-size: In probability theory and statistics, the exponential distributions are a class of continuous probability distribution. ... The Proposal distribution Q proposes the next point that the random walk might move to. ... 

 next_point <- function(x_old) { repeat { x_new <- x_old * exp( Random_Normal(0,h) ) metropolis_ratio <- exp(-x_new) / exp(-x_old) hastings_ratio <- ( x_new / x_old ) acceptance_probability <- min( 1 , metropolis_ratio * hastings_ratio ) if ( acceptance_probability > Random_Uniform(0,1) ) break } return(x_new) }

Then to perform a random walk over the simplex:

  • Begin by drawing each element xi, i= 1, 2, ..., K, from a unit-exponential distribution.
  • For each i= 1, 2, ..., K
    • xi ← next_point(xi)
  • Set S to the sum of all the xi
  • Set ti = xi/S for all i= 1, 2, ..., K

The set of ti will be restricted to the simplex, and will walk ergodically over over the domain with a uniform stationary density. Note that it is important not to re-normalize the xi at each step; doing so will result in a non-uniform stationary distribution. Instead, think of the xi as "hidden" parameters, with the simplex coordinates given by the set of ti.


See also

Distance Geometry is the characterization and study of sets based only on given values of the distance between member pairs. ... In mathematics, and computational geometry, a Delaunay triangulation or Delone triangularization for a set P of points in the plane is a triangulation DT(P) such that no point in P is inside the circumcircle of any triangle in DT(P). ... In geometry polytope means, first, the generalization to any dimension of polygon in two dimensions, and polyhedron in three dimensions. ... A square A projection of a cube (into a two-dimensional image) A projection of a hypercube (into a two-dimensional image) In geometry, a hypercube is an n-dimensional analogue of a square (n = 2) and a cube (n = 3). ... In geometry, a cross-polytope, or orthoplex, is a regular, convex polytope that exists in any number of dimensions. ... In mathematics, a 3-sphere is a higher-dimensional analogue of a sphere. ... In geometry, the tesseract, also called 8-cell or octachoron, is the four-dimensional analog of the (three-dimensional) cube, where motion along the fourth dimension is often a representation for bounded transformations of the cube through time. ... In geometry, a four-dimensional polytope is sometimes called a polychoron (plural: polychora) (from Greek poly meaning many and choros meaning room or space), 4-polytope, or polyhedroid. ... In geometry polytope means, first, the generalization to any dimension of polygon in two dimensions, and polyhedron in three dimensions. ... This page lists the regular polytopes in Euclidean space. ... In mathematical optimization theory, the simplex algorithm, created by the North American mathematician George Dantzig in 1947, is a popular technique for numerical solution of the linear programming problem. ... In mathematics, a simplicial complex is a topological space of a particular kind, built up of points, line segments, triangles, and their n-dimensional counterparts. ... In mathematics, in the area of algebraic topology, simplicial homology is a theory with a finitary definition, and is probably the most tangible variant of homology theory. ... In mathematics, a simplicial set is a sequence of sets together with face maps and degeneracy maps for each and every . ...

External links

George Olshevsky is a freelance editor, writer, publisher, paleontologist, and mathematician living in San Diego, California. ...

References


  Results from FactBites:
 
Simplex - Wikipedia, the free encyclopedia (960 words)
In geometry, a simplex (plural: simplices) or n-simplex is an n-dimensional analogue of a triangle.
For example, a 0-simplex is a point, a 1-simplex is a line segment, a 2-simplex is a triangle, a 3-simplex is a tetrahedron, and a 4-simplex is a pentachoron (in each case with interior).
Simplex is also a term used to describe the transmission of signals along a wire.
Simplex algorithm - Wikipedia, the free encyclopedia (1183 words)
In both cases, the method uses the concept of a simplex, which is a polytope of N + 1 vertices in N dimensions: a