## Occurrences of (co)homology in other disciplines and/or nature

### Remember to vote up questions/answers you find interesting or helpful (requires 15 reputation points)

I am curious if the setup for (co)homology theory appears outside the realm of pure mathematics. The idea of a family of groups linked by a series of arrows such that the composition of consecutive arrows is zero seems like a fairly general notion, but I have not come across it in fields like biology, economics, etc. Are there examples of non-trivial (co)homology appearing outside of pure mathematics?

I think Hatcher has a couple illustrations of homology in his textbook involving electric circuits. This is the type of thing I'm looking for, but it still feels like topology since it is about closed loops. Since the relation $d^2=0$ seems so simple to state, I would imagine this setup to be ubiquitous. Is it? And if not, why is it so special to topology and related fields?

-

3
Ghrist has written a number of papers applying homology to different applied fields. See for example his paper on Sensor Networks. – Jim Conant Mar 30 2011 at 19:30

3
This question should be Community Wiki, since it's looking for a list of examples rather than an answer to a specific question. I also feel like the question isn't very clear, since any answer has to be homological in nature so fundamentally mathematical. So the question seems somewhat conflicted. – Ryan Budney Mar 30 2011 at 19:35

1
Do you count string theory as "outside the realm of pure mathematics"? – Qfwfq Mar 30 2011 at 20:04

4
The first paragraph seems to suggest that the question is not so much about homology/topology in the large, but more about the idea of chain complexes. Is my reading correct? – Yemon Choi Mar 30 2011 at 20:27

3
Applied topology at Stanford: comptop.stanford.edu – Igor Belegradek Mar 30 2011 at 20:48
show 1 more comment

## 20 Answers

Robert Ghrist is all about applied topology: Sensor Network, Signal Processing, and Fluid Dynamics. (homepage: http://www.math.upenn.edu/~ghrist/index.html ). For instance, we want to use the least number of sensors to cover a certain area, such that when we remove one sensor, a part of that area is undetectable. We can form a complex of these sensors and hence its nerve, and use homology to determine whether there are any gaps in the sensor-collection. I've met with him in person and he expressed confidence that this is going to be a big thing of the future.

There are also applications of cohomology to Crystallography (see Howard Hiller) and Quasicrystals in physics (see Benji Fisher and David Rabson). In particular, it uses cohomology in connection with Fourier space to reformulate the language of quasicrystals/physics in terms of cohomology... Extinctions in x-ray diffraction patterns and degeneracy of electronic levels are interpreted as physical manifestations of nonzero homology classes.

Another application is on fermion lattices (http://arxiv.org/abs/0804.0174v2), using homology combinatorially. We want to see how fermions can align themselves in a lattice, noting that by the Pauli Exclusion principle we cannot put a bunch of fermions next to each other. Homology is defined on the patterns of fermion-distributions.

-

3
Robert Ghrist is coming to Edinburgh for the Science Festival this year to talk about the Mathematics of holes. (Alas I will be away.) If anyone is around, it will be worth your while to attend! – José Figueroa-O'Farrill Mar 30 2011 at 20:59

10
In general, I think that homology will play a role in the mathematics of information. We had a talk by Gunnar Carlsson recently in Edinburgh about "persistent homology" and it was quite an eye opener. See comptop.stanford.edu for instance. – José Figueroa-O'Farrill Mar 30 2011 at 21:00
Very interesting, thanks! – Noah Giansiracusa Mar 31 2011 at 14:33

### You can accept an answer to one of your own questions by clicking the check mark next to it. This awards 15 reputation points to the person who answered and 2 reputation points to you.

Actually even schoolchildren calculate group co-cycle. (Without knowing that it is called like this). Cohomology occurs in everyday life as soon as one learns to count.

5+7 = 1 2

4 + 5 = 0 9

2 + 8 = 1 0

What is the function on which sends a pair (a,b) to the $0$ or $1$ depending result is greater than 9 or not ? ( e.g. f(5,7)= 1, f(4,5) = 0, f(2,8)= 1).

This is actually a 2-cocycle for group $Z/nZ$ with values in $Z$.

It can be checked directly or...

Let us look on it more conceptually. Consider the standard short exact sequence of abelian groups $0->Z->Z->Z/n->0$. (First map is multiplication by $n$, the second is factorization and will be denoted by $p$).

Choose section $s: Z/nZ -> Z$ (i.e. any map such $ps=Id$, where $p: Z->Z/nZ$, it is like connection in differential geometry (can be made precise)).

Define $f(a,b)= s(a)+s(b) - s(a+b)$

Note that: a) this function $f(a,b)$ is exactly we talked above

b) from general theory this is 2-cocyle, (it corresponds to this extension, (it it is like "curvature" of connection is differential geomety (can be made precise)).

That is all: we explained why it is group cocycle and what its role.

I would like to learn this 20 years ago when I learned group cohomology as undergraduate, but I learned this 1 ago, doing some engineering work in wireless communication... I am still surprised that it is not written on the first page of any textbook which deals with group cohomology, when I am explaining this to my friends most did not know this also and after knowing share my feeling of surprise.

-

12
While not on the first page of a textbook, this is written up in an article in the American Mathematical Monthly (Daniel C. Isaksen, A cohomological viewpoint on elementary school arithmetic, Amer. Math. Monthly (109), no. 9 (2002), p. 796--805) – Christopher Drupieski Jun 11 at 20:44
Thank you for reference. I di not know it. – Alexander Chervov Jun 12 at 8:02

1
is it easy to generalize to larger digits? how about for multiplication? – unknown (google) Jun 18 at 16:34
@unknown good questions sorry to say I cannot say much. About higher digets we can think about N=10^2 10^3 and so on.... arguments will be the same. – Alexander Chervov Jun 18 at 17:54
Can you explain the things you claim "can be made precise"? I'm really curious. – 36min Nov 21 at 5:23
show 8 more comments

Quantum field theory is outside the realm of pure mathematics, makes contact with the real world and features chain complexes and cohomology.

The current paradigm for gauge theories such as the standard model is based on Yang-Mills theories coupled to matter. The quantisation of nonabelian (and, depending on your choice of gauge fixing function, also abelian) Yang-Mills theories features a cohomology theory known by the moniker of BRST, after the inventors: Becchi, Rouet, Stora and, independently, Tyutin. The cleanest proofs of the renormalizability of Yang-Mills theories are cohomological in nature.

-

Nice examples, thanks! – Noah Giansiracusa Mar 31 2011 at 14:33

My understanding, from conversations with Raoul Bott, is that his early work on electrical circuits and the Bott-Duffin theorem can be intepreted as exhibiting close connections between de Rham cohomology and the laws of electrical circuits, and that this is part of what led him into pure mathematics early in his career.

-

4
He talked about this connection to electrical circuits in teaching graduate algebraic topology, to help motivate cohomology and give intuition for it. – Patricia Hersh May 20 2012 at 14:25
Bott gave a very nice talk (c. 1960) to electrical engineers on the subject, but I cannot find a reference right now. – Robert Bruner Jun 11 at 21:55

The mass of a classical mechanical system is an element in the (one-dimensional) second cohomology group of the Lie algebra of the Galilei group. See J. M. Souriau, Stucture des Systèmes Dynamiques, Chap. III, section (12.136). Or in english translation, search inside here for "total mass".

-
1. Something resembling de Rham complex with differential-algebraic flavor appears in (variant of) control theory, see, for example, G. Conte, C.H. Moog, A.M. Perdon, Algebraic Methods for Nonlinear Control Systems, 2nd ed., Springer, 2006. But, as far as I can tell, they do not use the world "cohomology" explicitly.

2. Spencer cohomology (which is, essentially, a Lie algebra cohomology) appears as obstructions to integrability of some differential-geometric structures (G-structures) and, through it, of (some) differential equations. Potentially this opens a wide possibilities for applications, and indeed, Dimitry Leites advocates this approach in (some of) his writings. An emblematic publication which is available, unfortunately, only in Russian, is: "Application of cohomology of Lie algebras in national economy", Seminar "Globus", Independent Univ. of Moscow, Vol. 2, 2005, 82-102. The Russian original for "national economy" in the title is (a somewhat pejorative and untranslatable term) "narodnoe khozyai'stvo".

-

Anders Björner and László Lovász used bounds on the Betti numbers for the complement of a real subspace arrangement called the $k$-equal arrangement to give a complexity theory lower bound that agreed, up to a scalar multiple, with the previously known upper bound in:

A. Björner and L. Lovász, Linear decision trees, subspace arrangements, and Mobius functions, Journal of the American Mathematical Society, Vol. 7, No. 3 (1994), 677--706.

The basic question addressed in their paper (along with other questions of a similar flavor) is how many pairwise comparisons of coordinates are needed to decide if a vector in ${\bf R}^n$ has $k$ coordinates all equal to each other for fixed $k$ and $n$. They observed that this is equivalent to deciding whether the vector lies on the so-called $k$-equal arrangement or in its complement, where the $k$-equal arrangement is the subspace arrangement comprised of the ${n\choose k}$ subspaces where $k$ coordinates are set equal to each other.

To this end, they gave a lower bound on the number of leaves in a linear decision tree -- a tree where one starts at the root, and each time one does a comparison of two coordinates $a_i$ and $a_j$, then one proceeds down to either the $a_i < a_j$ child or the $a_i = a_j$ child or the $a_i > a_j$ child. One reaches a leaf when no further queries are necessary to make a decision as to containment in the arrangement or its complement. The log base 3 of the number of leaves is a lower bound on the depth of the tree, i.e. on the number of queries needed in the worst case.

To get some intuition for why this bound depended fundamentally on the Betti numbers of the complement, consider the $k=2$ case -- where the number of connected components of the complement of the subspace arrangement (which in this case is a hyperplane arrangement) is an obvious lower bound on the number of leaves in any linear decision tree.

-

Recently, it is realized that quantum many-body states can be divided into short-range entangled states and long-range entangled states.

The quantum phases with long-range entanglements correspond to topologically ordered phases, which, in two spatial dimensions, can be described by tensor category theory (see cond-mat/0404617). Topological order in higher dimensions may need higher category to describe them.

One can also show that the quantum phases with short-range entanglements and symmetry $G$ in any dimensions can be "classified" by Borel group cohomology theory of the symmetry group. (Those phases are called symmetry protected trivial (SPT) phases.)

The quantum phases with short-range entanglements that break the symmetry are the familar Landau symmetry breaking states, which can be described by group theory.

So, to understand the symmetry breaking states, physicists have already been forced to learn group theory. It looks like to understand patterns of many-body entanglements that correspond to topological order and SPT order, physicists will be forced to learn tensor category theory and group cohomology theory. In modern quantum many-body physics and in modern condensed matter physics, tensor category theory and group cohomology theory will be as useful as group theory. The days when physics students need to learn tensor category theory and group cohomology theory are coming, may be soon.

-

The finite element method- a numerical method for solving PDE's- has a homological interpretation:

MR2269741 (2007j:58002) Arnold, Douglas N.(1-MN-MA); Falk, Richard S.(1-RTG); Winther, Ragnar(N-OSLO-CMA) Finite element exterior calculus, homological techniques, and applications. (English summary) Acta Numer. 15 (2006), 1–155

-

The Aharonov–Bohm effect. Classically, you can't distinguish two electromagnetic potentials which are in the same cohomology class. From quantum viewpoint, they can be distinguished, because an electron changes its phase under parallel transport defined by the connection associated to a potential.

-

A classical and elegant application is to the solution of Kirchhoff's theorem on electrical cricuits. See:

Nerode, A.; Shank, H.: An algebraic proof of Kirchhoff's network theorem. Amer. Math. Monthly, 68 (1961) 244–247

-

It's my understanding that Carina Curto and Vladmir Itskov at the University of Nebraska - Lincoln apply algebraic topology (among other things) to study theoretical and applied neuroscience.

-

Their work is very similar in spirit to Ghrist's work alluded to in one of the other answers. – Igor Rivin May 20 2012 at 15:38

Maurice Herlihy and Nir Shavit won the 2004 Gödel Prize for topological analysis of asynchronous computation. Homology was involved.

-
• There's a CST.SE thread of possible interest here: http://cstheory.stackexchange.com/questions/7958/papers-on-relation-between-computational-complexity-and-algebraic-geometry-topol

It mentions stuff like Geometric Complexity Theory, a far-out program for proving P!=NP with algebraic geometry.

Mentions the thing I actually first websearched for, Herlihy's work on concurrent and distributed computing using cohomology.

-

I am surprised no-one has mentioned Persistent Homology.

-

en.wikipedia.org/wiki/… – Alexander Chervov Jun 20 at 12:40
See also José Figueroa-O'Farrill's comment on the accepted answer, in which he mentions a talk by Gunnar Carlsson about persistent homology. – J W Jun 20 at 15:59

An application of cohomology to provide a geometric/topological description charged particles in General Relativity can be found in

GRAVITATION: An Introduction to Current Research, ed. Louis Witten

and references therein.

Wheeler's geometrodynamics program contained a subprogram named "charge without charge", which aimed to express the electric charge in terms of geometric and/or topological properties. A wormhole allows the existence of an electromagnetic field without source - hence the name "charge without charge". The two ends of the wormholes behave as particles of opposite electric charge. And all this can be obtained as a solution to Einstein-Maxwell equations. Roots of the approach of Misner and Wheeler can be found in the paper of Einstein and Rosen, and a series of papers of G. Y. Rainich from 1924-1925.

-

There are some applications of topology/cohomology to combinatorics and combinatoric geometry. One of the earliest examples is surely Lovasz's proof of a bound for the chromatic number of the Kneser graph; he uses the Borsuk-Ulam theorem, which is usually proved by homological methods. A modern exposition can be found here.

Another example is Tveberg's theorem with all its variants on the configuration of points in space (the best results can be found in a recent paper of Blagojevic, Matschke and Ziegler. There are many other results in convex geometry/polytope theory which use topological methods and, in particular, cohomology.

-

While this isn't so clear from the title of the question, the first sentence in the text of the question mentions wanting things outside of pure mathematics.   – tweetie-bird Oct 25 at 14:27

Cohomology is basically a way to get information from linear maps that are neither injective nor surjective. So in any place such linear map occurs, one can find the use of cohomology. But whether cohomology plays a significant role will depend on what kind of questions asked.

-

3
I don't really see how this answers the original question "I am curious if the setup for (co)homology theory appears outside the realm of pure mathematics". – Yemon Choi Jun 11 at 22:55

At a first glance the characterization of the structures you mention - "(co)homologies", appear to be easily interpreted as modal structures (i.e. as in modal logics), or labelled transition systems, widely used in computer science.

-

Every cohomology group has its meaning but the meaning of higher cohomologies is still to be explored. Physics and applications in other discipline of science might provide motivation and inspiration for the study of such meanings. In algebra, the first cohomology usually corresponds to some kind of homomorphism type property, for example, derivations and so on. The second cohomology corresponds what people call square-zero extensions of the algebra and also infitesimal deformations of the algebra. The thrid cohomology of associative algebras is the obstruction to the existence of finite formal deformations. If one sees such extensions of algebras or deformations of algebras in problems in other sciences, then it is the cohomology that plays the fundamental role here.

-

2
I don't really see how this answers the original question "I am curious if the setup for (co)homology theory appears outside the realm of pure mathematics". – Yemon Choi Jun 11 at 22:55
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 29, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9178416132926941, "perplexity_flag": "middle"}