Link (simplicial complex)

The tetrahedron is a 2-complex.

The link in a simplicial complex is a generalization of the neighborhood of a vertex in a graph. The link of a vertex encodes information about the local structure of the complex at the vertex.

Given an abstract simplicial complex X and v a vertex in V(X), its link Lk⁡(v,X) is a set containing every face τ∈X such that v∉τ and τ∪{v} is a face of X.

Given a geometric simplicial complex X and v∈V(X), its link Lk⁡(v,X) is a set containing every face τ∈X such that v∉τ and there is a simplex in X that has v as a vertex and τ as a face.: 3  Equivalently, the join v⋆τ is a face in X.: 20 

An alternative definition is: the link of a vertex v∈V(X) is the graph Lk(v, X) constructed as follows. The vertices of Lk(v, X) are the edges of X incident to v. Two such edges are adjacent in Lk(v, X) iff they are incident to a common 2-cell at v.

The definition of a link can be extended from a single vertex to any face.

Given an abstract simplicial complex X and any face σ of X, its link Lk⁡(σ,X) is a set containing every face τ∈X such that σ,τ are disjoint and τ∪σ is a face of X: Lk⁡(σ,X):={τ∈X: τ∩σ=∅︀, τ∪σ∈X}.

Given a geometric simplicial complex X and any face σ∈X, its link Lk⁡(σ,X) is a set containing every face τ∈X such that σ,τ are disjoint and there is a simplex in X that has both σ and τ as faces.: 3 

Examples

The link of a vertex of a tetrahedron is a triangle – the three vertices of the link corresponds to the three edges incident to the vertex, and the three edges of the link correspond to the faces incident to the vertex. In this example, the link can be visualized by cutting off the vertex with a plane; formally, intersecting the tetrahedron with a plane near the vertex – the resulting cross-section is the link.

Another example is illustrated below. There is a two-dimensional simplicial complex. At the left, a vertex is marked in yellow. At the right, the link of that vertex is marked in green.

Properties

A concept closely related to the link is the star.

Given an abstract simplicial complex X and any face σ∈X,V(X), its star St⁡(σ,X) is a set containing every face τ∈X such that τ∪σ is a face of X. In the special case in which X is a 1-dimensional complex (that is: a graph), St⁡(v,X) contains all edges {u,v} for all vertices u that are neighbors of v. That is, it is a graph-theoretic star centered at u.

Given a geometric simplicial complex X and any face σ∈X, its star St⁡(σ,X) is a set containing every face τ∈X such that there is a simplex in X having both σ and τ as faces: St⁡(σ,X):={τ∈X:∃ρ∈X:τ,σ are faces of ρ}. In other words, it is the closure of the set {ρ∈X:σ is a face of ρ}—the set of simplices having σ as a face.

So the link is a subset of the star. The star and link are related as follows:

An example is illustrated below. There is a two-dimensional simplicial complex. At the left, a vertex is marked in yellow. At the right, the star of that vertex is marked in green.

See also