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 X_n 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 X_n do not become constant as n → ∞. 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 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 can be described by a collection of sets , together with face and degeneracy maps between them satisfying a number of equations. The idea of the n-skeleton is to first discard the sets with and then to complete the collection of the with to the "smallest possible" simplicial set so that the resulting simplicial set contains no non-degenerate simplices in degrees . More precisely, the restriction functor has a left adjoint, denoted . (The notations are comparable with the one of .) The n-skeleton of some simplicial set is defined as Moreover, has a right adjoint . The n-coskeleton is defined as For example, the 0-skeleton of K is the constant simplicial set defined by . The 0-coskeleton is given by the Cech (The boundary and degeneracy morphisms are given by various projections and diagonal embeddings, respectively.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.