|
|
|
|
barycentric subdivision
|
(Definition)
|
|
|
Recall that an abstract $n$ -simplex is an abstract simplicial complex $K$ such that $\bigcup K\in K$ and the cardinality of $\bigcup K$ is $n+1$ . It can be identified as the powerset (minus the empty set element) of a set $V_K$ of elements $v_1,\ldots, v_n$ , called the vertices of $K$ .
The barycentric subdivision of an abstract simplex $K$ is the construction of a certain abstract simplicial complex $K'$ from $K$ . $K'$ itself is called the barycentric subdivision of $K$ . Before giving the general construction, let us describe some simple cases, specifically, when $n=1,2,$ and $3$ and when $V_K$ is embedded in some ambient Euclidean space $\mathbb{R}^m$ where $m\ge n$ :
In the last example, one can abstract the construction one step further. Since each labelled point is the barycenter of at least one of the initial vertices $v_i$ , we can uniquely identify any non-empty subset $V$ of $V_K$ with the labelled point that is the barycenter of the point(s) in $V$ . Then each $W(ab)$ above can be identified as a maximal chain (ordered by inclusion) in $K$ with $\varnothing$ deleted.
This suggests the general construction of the barycentric subdivision of an abstract $n$ -simplex.
Definition. Let $K$ be an abstract $n$ -simplex. Order $K$ by inclusion $\subseteq$ . Let $$\mathcal{C}_K:=\big\lbrace P(C) \mid C\mbox{ is a maximal chain in }K\big\rbrace.$$ The barycentric subdivision $K'$ of $K$ is: $$K'=\bigcup \mathcal{C}_K - \lbrace \varnothing\rbrace.$$
It is easy to see that every maximal chain in $K$ is an $(n-1)$ -simplex whose powerset is an $n$ -simplex (so isomorphic to $K$ ). In addition, the barycentric subdivision $K'$ of $K$ is a simplicial complex with $n!$ maximal simplices, each of which is isomorphic to $K$ .
Remark. This definition can be generalized to include the barycentric subdivision of an abstract simplicial complex. If $K$ is an abstract simplicial complex, then the barycentric subdivision $K'$ of $K$ is the union of the barycentric subdivisions of the individual maximal simplicies in $K$ . Below are two examples:
- In this example (pictured above), the maximal simplices of $K$ consist of a triangle, and two line segments.
- Here (pictured below), the maximal simplices are two triangles meeting at a common edge.
In both examples, the vertex sets of the original simplicial complexes are the same.
It can be shown that the barycentric subdivision $K'$ of an abstract simplicial complex $K$ can be constructed as follows: $V_{K'}:=\lbrace S\mid S\in K\rbrace$ is the set of vertices of $K'$ , and $T\in K'$ iff $T$ is a chain of simplexes in $K$ : $T=\lbrace S_1,\ldots,S_{n(T)}\rbrace$ , $S_i\subset S_j$ for $i<j$ .
|
"barycentric subdivision" is owned by CWoo.
|
|
(view preamble | get metadata)
Cross-references: iff, edge, line segments, simplicial complex, addition, isomorphic, easy to see, order, inclusion, chain, subset, logic, labeling, occur ins, contain, label, barycenter, side, intersect, opposite side, line, triangle, vertex, union, midpoint, points, Euclidean space, simple, vertices, element, empty set, powerset, cardinality, abstract simplicial complex
There are 3 references to this entry.
This is version 17 of barycentric subdivision, born on 2007-03-15, modified 2007-05-29.
Object id is 9080, canonical name is BarycentricSubdivision.
Accessed 2152 times total.
Classification:
| AMS MSC: | 55U10 (Algebraic topology :: Applied homological algebra and category theory :: Simplicial sets and complexes) | | | 55U05 (Algebraic topology :: Applied homological algebra and category theory :: Abstract complexes) |
|
|
|
|
|
|
Pending Errata and Addenda
|
|
|
|
|
|
|
|
|
|
|