In mathematics, particularly in algebraic topology, the n-skeleton of a topological space X presented as a simplicial complex (resp. CW complex) refers to the subspace Xn that is the union of the simplices of X (resp. cells of X) of dimensions m ≤ n. In other words, given an inductive definition of a complex, the n-skeleton is obtained by stopping at the n-th step. These subspaces increase with n. The 0-skeleton is a discrete space, and the 1-skeleton a topological graph. The skeletons of a space are used in obstruction theory, to construct spectral sequences by means of filtrations, and generally to make inductive arguments. They are particularly important when X has infinite dimension, in the sense that the Xn do not become constant as n → ∞.
In geometry In geometry, a k-skeleton of n-polytope P (functionally represented as skelk(P)) consists of all i-polytope elements of dimension up to k. For example:
skel0(cube) = 8 vertices skel1(cube) = 8 vertices, 12 edges skel2(cube) = 8 vertices, 12 edges, 6 square faces The 1-skeleton is also known as the vertex-edge graph of the polytope.
For simplicial sets The above definition of the skeleton of a simplicial complex is a particular case of the notion of skeleton of a simplicial set. Briefly speaking, a simplicial set K ∗ {\displaystyle K_{*}} can be described by a collection of sets K i , i ≥ 0 {\displaystyle K_{i},\ i\geq 0} , together with face and degeneracy maps between them satisfying a number of equations. The idea of the n-skeleton s k n ( K ∗ ) {\displaystyle sk_{n}(K_{*})} is to first discard the sets K i {\displaystyle K_{i}} with i > n {\displaystyle i>n} and then to complete the collection of the K i {\displaystyle K_{i}} with i ≤ n {\displaystyle i\leq n} to the "smallest possible" simplicial set so that the resulting simplicial set contains no non-degenerate simplices in degrees i > n {\displaystyle i>n} . More precisely, the restriction functor
i ∗ : Δ o p S e t s → Δ ≤ n o p S e t s {\displaystyle i_{*}:\Delta ^{op}Sets\rightarrow \Delta _{\leq n}^{op}Sets}
has a left adjoint, denoted i ∗ {\displaystyle i^{*}} . (The notations i ∗ , i ∗ {\displaystyle i^{*},i_{*}} are comparable with the one of image functors for sheaves.) The n-skeleton of some simplicial set K ∗ {\displaystyle K_{*}} is defined as
s k n ( K ) := i ∗ i ∗ K . {\displaystyle sk_{n}(K):=i^{*}i_{*}K.}
Coskeleton Moreover, i ∗ {\displaystyle i_{*}} has a right adjoint i ! {\displaystyle i^{!}} . The n-coskeleton is defined as
c o s k n ( K ) := i ! i ∗ K . {\displaystyle cosk_{n}(K):=i^{!}i_{*}K.}
For example, the 0-skeleton of K is the constant simplicial set defined by K 0 {\displaystyle K_{0}} . The 0-coskeleton is given by the Čech nerve
⋯ → K 0 × K 0 → K 0 . {\displaystyle \dots \rightarrow K_{0}\times K_{0}\rightarrow K_{0}.}
(The boundary and degeneracy morphisms are given by various projections and diagonal embeddings, respectively.) The above constructions work for more general categories (instead of sets) as well, provided that the category has fiber products. The coskeleton is needed to define the concept of hypercovering in homotopical algebra and algebraic geometry.
References
External links Weisstein, Eric W. "Skeleton". MathWorld.
