Random Manifold Theorem

Random Manifold Theorem

Define the curvature K(G) of a simplicial complex as K(G) = 1-f_0(G)/2+f_1(G)/3-f_2(G)/4+.... We prove

Theorem: Given a (2d+1)-manifold G, then the expectation of the Euler characteristic of a (2d) manifold in G is 2-2K(G).

The key is the choice of probability space. Let V denote the set of vertices in G, the set of zero dimensional simplices in G and let n be its number. A configuration in g \in \Omega=\{ -1,1\}^n defines simplicial complex G_g that is either a (2d-1) manifold if it is not empty! I did not see the above theorem earlier because I had looked at the wrong probability space. The most obvious probability measure on \Omega is to take a Bernoulli distribution P_p for 0 \leq p \leq 1. But what we have to take is the Bayes distribution \int_0^1 P_p \; dp. Bayes looked at this in a work which appeared in 1763, after his death. He proved there that this measure has the property that every event where k of the spins are 1, have probability 1/(n+1). It is somehow a very natural distribution as what happens with any Binomial distribution that taking few or large number of k has less probability. The distribution of the random variable counting the number of 1 becomes if rescaled the Gaussian distribution as the de Moivre Laplace central limit theorem shows. The Bayes distribution make this uniform. This is exactly the distribution which comes from a uniform random coloring if G is a unit sphere in a larger dimensional space. But that is exactly what renders the Poincare-Hopf indices to curvature. We have K(G) as an expectation of symmetric indices of random colorings. Now comes the index formula which I proved in 2012: we have j_g(v) = 1-\chi(S(v))/2 - \chi(S_g(v))/2. If S(v)=G then G_g= S_g(v). So, the random manifold theorem works by just combining a few results from my “Elements of Geometry” text put together this summer. There is also a collection of shorts (1 minutes each) for each of the sections here.

There are various generalizations or versions. We can take an arbitrary finite abstract simplicial complex and get the expectation 2-X(G)-2K(G). We can also take manifolds with boundaries G for which G_g are always manifolds with boundary. We can also take Dehn-Sommerville manifolds for which G_g are always Dehn-Sommerville manifolds again.

The result works out numerically very well. I will post code soon. Monte Carlo runs with a few thousand manifolds already gets close to the actual value.

Also remarkable is that the expectation G \to E[\chi(G_g)] of Euler characteristics of sub-manifolds is a valuation. This makes sense already for manifolds with boundary. Take two balls A,B for example that intersect. Then the expectation of Euler characteristic of sub-manifolds in A \cup B is known if we know it for A and B and A \cap B.

Let us illustrate the theorem in the simplest possible case, where we look at a 1-manifold G=C_n with n vertices. Submanifolds are now zero dimensional manifolds, meaning a finite collection of points. The expectation of Euler characteristic is nothing else than the number of sign changes in the sequence g \in \Omega = \{ -1,1\}^n. While for the binomial measure Binomial(n,1/2) the expected number of roots is n/2, for the Bayes distribution, we have the expected number of roots n/3. Therefore our theorem tells that (n/3) = 2 -2K, but that is nothing else than K=1-n/6, which is the curvature of a point in a complex which has C_n=G as a unit sphere.