Misplaced Pages

Homological connectivity

Article snapshot taken from Wikipedia with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.
Algebra concept

In algebraic topology, homological connectivity is a property describing a topological space based on its homology groups.

Definitions

Background

X is homologically-connected if its 0-th homology group equals Z, i.e. H 0 ( X ) ≅ Z {\displaystyle H_{0}(X)\cong \mathbb {Z} } , or equivalently, its 0-th reduced homology group is trivial: H 0 ~ ( X ) ≅ 0 {\displaystyle {\tilde {H_{0}}}(X)\cong 0} .

  • For example, when X is a graph and its set of connected components is C, H 0 ( X ) ≅ Z | C | {\displaystyle H_{0}(X)\cong \mathbb {Z} ^{|C|}} and H 0 ~ ( X ) ≅ Z | C | − 1 {\displaystyle {\tilde {H_{0}}}(X)\cong \mathbb {Z} ^{|C|-1}} (see graph homology). Therefore, homological connectivity is equivalent to the graph having a single connected component, which is equivalent to graph connectivity. It is similar to the notion of a connected space.

X is homologically 1-connected if it is homologically-connected, and additionally, its 1-th homology group is trivial, i.e. H 1 ( X ) ≅ 0 {\displaystyle H_{1}(X)\cong 0} .

  • For example, when X is a connected graph with vertex-set V and edge-set E, H 1 ( X ) ≅ Z | E | − | V | + 1 {\displaystyle H_{1}(X)\cong \mathbb {Z} ^{|E|-|V|+1}} . Therefore, homological 1-connectivity is equivalent to the graph being a tree. Informally, it corresponds to X having no "holes" with a 1-dimensional boundary, which is similar to the notion of a simply connected space.

In general, for any integer k, X is homologically k-connected if its reduced homology groups of order 0, 1, ..., k are all trivial. Note that the reduced homology group equals the homology group for 1,..., k (only the 0-th reduced homology group is different).

Connectivity

The homological connectivity of X, denoted connH(X), is the largest k ≥ 0 for which X is homologically k-connected. Examples:

  • If all reduced homology groups of X are trivial, then connH(X) = infinity. This holds, for example, for any ball.
  • If the 0th group is trivial but the 1th group is not, then connH(X) = 0. This holds, for example, for a connected graph with a cycle.
  • If all reduced homology groups are non-trivial, then connH(X) = -1. This holds for any disconnected space.
  • The connectivity of the empty space is, by convention, connH(X) = -2.

Some computations become simpler if the connectivity is defined with an offset of 2, that is, η H ( X ) := conn H ( X ) + 2 {\displaystyle \eta _{H}(X):={\text{conn}}_{H}(X)+2} . The eta of the empty space is 0, which is its smallest possible value. The eta of any disconnected space is 1.

Dependence on the field of coefficients

The basic definition considers homology groups with integer coefficients. Considering homology groups with other coefficients leads to other definitions of connectivity. For example, X is F2-homologically 1-connected if its 1st homology group with coefficients from F2 (the cyclic field of size 2) is trivial, i.e.: H 1 ( X ; F 2 ) ≅ 0 {\displaystyle H_{1}(X;\mathbb {F} _{2})\cong 0} .

Homological connectivity in specific spaces

For homological connectivity of simplicial complexes, see simplicial homology. Homological connectivity was calculated for various spaces, including:

Relation with homotopical connectivity

Hurewicz theorem relates the homological connectivity conn H ( X ) {\displaystyle {\text{conn}}_{H}(X)} to the homotopical connectivity, denoted by conn π ( X ) {\displaystyle {\text{conn}}_{\pi }(X)} .

For any X that is simply-connected, that is, conn π ( X ) ≥ 1 {\displaystyle {\text{conn}}_{\pi }(X)\geq 1} , the connectivities are the same: conn H ( X ) = conn π ( X ) {\displaystyle {\text{conn}}_{H}(X)={\text{conn}}_{\pi }(X)} If X is not simply-connected ( conn π ( X ) ≤ 0 {\displaystyle {\text{conn}}_{\pi }(X)\leq 0} ), then inequality holds: conn H ( X ) ≥ conn π ( X ) {\displaystyle {\text{conn}}_{H}(X)\geq {\text{conn}}_{\pi }(X)} but it may be strict. See Homotopical connectivity.

See also

Meshulam's game is a game played on a graph G, that can be used to calculate a lower bound on the homological connectivity of the independence complex of G.

References

  1. ^ Linial*, Nathan; Meshulam*, Roy (2006-08-01). "Homological Connectivity Of Random 2-Complexes". Combinatorica. 26 (4): 475–487. doi:10.1007/s00493-006-0027-9. ISSN 1439-6912. S2CID 10826092.
  2. Aharoni, Ron; Berger, Eli; Kotlar, Dani; Ziv, Ran (2017-10-01). "On a conjecture of Stein". Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg. 87 (2): 203–211. doi:10.1007/s12188-016-0160-3. ISSN 1865-8784. S2CID 119139740.
  3. Meshulam, Roy (2003-05-01). "Domination numbers and homology". Journal of Combinatorial Theory, Series A. 102 (2): 321–330. doi:10.1016/s0097-3165(03)00045-1. ISSN 0097-3165.
  4. Adamaszek, Michał; Barmak, Jonathan Ariel (2011-11-06). "On a lower bound for the connectivity of the independence complex of a graph". Discrete Mathematics. 311 (21): 2566–2569. doi:10.1016/j.disc.2011.06.010. ISSN 0012-365X.
  5. Meshulam, R.; Wallach, N. (2009). "Homological connectivity of random k-dimensional complexes". Random Structures & Algorithms. 34 (3): 408–417. arXiv:math/0609773. doi:10.1002/rsa.20238. ISSN 1098-2418. S2CID 8065082.
  6. Cooley, Oliver; Haxell, Penny; Kang, Mihyun; Sprüssel, Philipp (2016-04-04). "Homological connectivity of random hypergraphs". arXiv:1604.00842 .
  7. Bobrowski, Omer (2019-06-12). "Homological Connectivity in Random Čech Complexes". arXiv:1906.04861 .
Categories: