Delta set
In mathematics, a delta set (or Δ-set) S is a combinatorial object that is useful in the construction and triangulation of topological spaces, and also in the computation of related algebraic invariants of such spaces. A delta set is somewhat more general than a simplicial complex, yet not quite as general as a simplicial set.
Formally, a Δ-set is a sequence of sets together with maps
with i = 0,1,...,n + 1 for n ≥ 1 that satisfy
whenever i < j.
This definition generalizes the notion of a simplicial complex, where the are the sets of n-simplices, and the di are the face maps. It is not as general as a simplicial set, since it lacks "degeneracies."
Given -sets S and T, a map of
-sets is a collection
such that
whenever both sides of the equation are defined. With this notion, we can define the category of Δ-sets, whose objects are -sets and whose morphisms are maps of
-sets.
Each -set has a corresponding geometric realization, defined as
where we declare that
- Failed to parse (Missing <code>texvc</code> executable. Please see math/README to configure.): (\sigma,d^i t) \sim (d_i \sigma, t) \quad \text{ for all} \quad \sigma \in S_n, t \in \Delta^{n-1}.
Here, denotes the standard n-simplex, and
is the inclusion of the i-th face. The geometric realization is a topological space with the quotient topology.
The geometric realization of a -set S has a natural filtration
where
is a "restricted" geometric realization.
Related functors
The geometric realization of a Δ-set described above defines a covariant functor from the category of Δ-sets to the category of topological spaces. Geometric realization takes a Δ-set to a topological space, and carries maps of Δ-sets to induced continuous maps between geometric realizations (which are topological spaces).
If S is a Δ-set, there is an associated free abelian chain complex, denoted , whose n-th group is the free abelian group
generated by the set , and whose n-th differential is defined by
This defines a covariant functor from the category of Δ-sets to the category of chain complexes of abelian groups. A Δ-set is carried to the chain complex just described, and a map of Δ-sets is carried to a map of chain complexes, which is defined by extending the map of Δ-sets in the standard way using the universal property of free Abelian groups.
Given any topological space X, one can construct a Δ-set as follows. A singular n-simplex in X is a continuous map
Define
to be the collection of all singular n-simplicies in X, and define
by
where again di is the i-th face map. One can check that this is in fact a Δ-set. This defines a covariant functor from the category of topological spaces to the category of Δ-sets. A topological space is carried to the Δ-set just described, and a continuous map of spaces is carried to a map of Δ-sets, which is given by composing the map with the singular n-simplices.
An example
This example illustrates the constructions described above. We can create a -set S whose geometric realization is the unit circle
, and use it to compute the homology of this space. Thinking of
as an interval with the endpoints identified, define
with for all n ≥ 2. The only possible maps
are
It is simple to check that this is a -set, and that
. Now, the associated chain complex
is
- Failed to parse (Missing <code>texvc</code> executable. Please see math/README to configure.): 0 \longrightarrow \mathbb{Z} \langle e \rangle \stackrel{\partial_1}{\longrightarrow} \mathbb{Z} \langle v \rangle \longrightarrow 0,
where
In fact, for all n. The homology of this chain complex is also simple to compute:
All other homology groups are clearly trivial.
One advantage of using -sets in this way is that the resulting chain complex is generally much simpler than the singular chain complex. For reasonably simple spaces, all of the groups will be finitely generated, whereas the singular chain groups are, in general, not even countably generated.
One drawback of this method is that one must prove that the geometric realization of the -set is actually homeomorphic to the topological space in question. This can become a computational challenge as the
-set increases in complexity.
See also
References
- Lua error in package.lua at line 80: module 'strict' not found.
- Lua error in package.lua at line 80: module 'strict' not found.
- Lua error in package.lua at line 80: module 'strict' not found.
- Lua error in package.lua at line 80: module 'strict' not found.