n-skeleton

From Wikipedia, the free encyclopedia
(Redirected from D-skeleton)
Jump to navigation Jump to search

Template:Short description

File:Hypercubestar.svg
This hypercube graph is the 1-skeleton of the tesseract.

Script error: No such module "about".

In mathematics, particularly in algebraic topology, the Template:Mvar-skeleton of a topological space Template:Mvar presented as a simplicial complex (resp. CW complex) refers to the subspace Template:Mvar that is the union of the simplices of Template:Mvar (resp. cells of Template:Mvar) of dimensions mn.Script error: No such module "Check for unknown parameters". In other words, given an inductive definition of a complex, the Template:Mvar-skeleton is obtained by stopping at the Template:Mvar-th step.

These subspaces increase with Template:Mvar. 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 Template:Mvar has infinite dimension, in the sense that the Template:Mvar do not become constant as n → ∞.Script error: No such module "Check for unknown parameters".

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.[1]

For example:

skel0(cube) = 8 vertices
skel1(cube) = 8 vertices, 12 edges
skel2(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 Ki, i0, together with face and degeneracy maps between them satisfying a number of equations. The idea of the n-skeleton skn(K*) is to first discard the sets Ki with i>n and then to complete the collection of the Ki with in 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*:ΔopSetsΔnopSets

has a left adjoint, denoted i*.[2] (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

skn(K):=i*i*K.

Coskeleton

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

coskn(K):=i!i*K.

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

K0×K0K0.

(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.[3]

References

<templatestyles src="Reflist/styles.css" />

  1. Peter McMullen, Egon Schulte, Abstract Regular Polytopes, Cambridge University Press, 2002. Template:ISBN (Page 29)
  2. Script error: No such module "citation/CS1"., section IV.3.2
  3. Script error: No such module "citation/CS1".

Script error: No such module "Check for unknown parameters".

External links

  • Script error: No such module "Template wrapper".