N skeleton

In geometry

In geometry, a k-skeleton of n-polytope P (functionally represented as skel_k(P)) consists of all i-polytope elements of dimension up to k.

For example:

skel₀(cube) = 8 verticesskel₁(cube) = 8 vertices, 12 edgesskel₂(cube) = 8 vertices, 12 edges, 6 square faces

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 ∗ can be described by a collection of sets K i ,   i ≥ 0 , together with face and degeneracy maps between them satisfying a number of equations. The idea of the n-skeleton s k n ( K ∗ ) is to first discard the sets K i with i > n and then to complete the collection of the K i with i ≤ n to the "smallest possible" simplicial set so that the resulting simplicial set contains no non-degenerate simplices in degrees i > n .

More precisely, the restriction functor

i ∗ : Δ o p S e t s → Δ ≤ n o p S e t s

has a left adjoint, denoted i ∗ . (The notations i ∗ , i ∗ are comparable with the one of image functors for sheaves.) The n-skeleton of some simplicial set K ∗ is defined as

s k n ( K ) := i ∗ i ∗ K .

Coskeleton

Moreover, i ∗ has a right adjoint i ! . The n-coskeleton is defined as

c o s k n ( K ) := i ! i ∗ K .

For example, the 0-skeleton of K is the constant simplicial set defined by K 0 . The 0-coskeleton is given by the Cech nerve

⋯ → K 0 × K 0 → 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.