This question is inspired by a talk of June Huh from the recent "Current Developments in Mathematics" conference: http://www.math.harvard.edu/cdm/.
Here are two examples of the kind of combinatorial abstractions of geometric objects referred to in the title of this question:
- Coxeter groups. These are abstractions of Weyl groups. Weyl groups have geometry coming from Lie theory: they are finite reflection groups associated to a crystallographic root system. Weyl groups (or perhaps finite reflection groups, or including Weyl groups associated to affine lie algebras, etc.) are then the "realizable" Coxeter groups.
- Matroids. These are abstractions of collections of vectors in some vector space. The matroids coming from collections of vectors in some vector space (over some field, say) are again the "realizable" matroids.
Here is what I mean by "behave so well":
Often it happens that we can associate some interesting polynomial invariant to the combinatorial object in question. Some examples are:
- The Kazhdan-Lusztig (KL) polynomial associated to a Coxeter system.
- The characteristic polynomial associated to a matroid.
- The recent KL polynomial associated to a matroid (see https://arxiv.org/abs/1412.7408).
And these polynomials have surprising and deep properties (positivity or unimodality/log-concavity of coefficients) that are not at all obvious from their definitions. A recurring theme is that these properties can be established in the "realizable" cases by appealing to algebraic geometry, specifically, to some suitable cohomology theory. However, the properties continue to hold for the general, nonrealizable objects for which there is no underlying geometry. The proofs of the general result are usually more "elementary" in so far as they avoid any algebraic geometry; but chronologically they come after the realizable results.
For instance, the coefficients of KL polynomials associated to a Coxeter system are positive. This was a famous conjecture of Kazhdan-Lusztig, proved a few years ago by Elias and Williamson (https://arxiv.org/abs/1212.0791). However, positivity was known for realizable Coxeter groups much earlier by interpreting the polynomials as Poincaré polynomials for the intersection cohomology of certain Schubert varieties.
Similarly, it is conjectured that the KL polynomial of a matroid has positive coefficients (see https://arxiv.org/abs/1611.07474); and this conjecture is known to be true when the matroid is realizable, again by interpreting the coefficients as dimensions of intersection cohomology spaces on certain varieties.
Or for the characteristic polynomial of a matroid: we know that the coefficients of this polynomial are log-concave, as was recently proved in the remarkable work of Adiprasito-Huh-Katz (https://arxiv.org/abs/1511.02888). Again, this result was preceded by the same result for the realizable case, due to Huh-Katz (https://arxiv.org/abs/1104.2519), interpreting the coefficients as intersection numbers for some toric variety.
So we come to my question:
Why do combinatorial abstractions of geometric objects behave so well, even in the absence of any underlying geometry?
EDIT: At around the 50 minute mark of his plenary talk at ICM 2018 (on Youtube here: https://www.youtube.com/watch?v=-3q6C558yog), Geordie Williamson asks a roughly similar question, and suggests that it may be a "mystery for the 21st century."
EDIT 2: As mentioned in the answers of Gil Kalai and Karim Adiprasito, another good example of "combinatorial abstraction of geometric object" is the notion of simplicial sphere, where the realizable case is a boundary of a polytope. Here the realizable case is connected to algebraic geometry via the theory of toric varieties, and as always this connection enables one to prove deep positivity results (e.g. the g-theorem of Stanley); whereas again the same results for the nonrealizable case are apparently much harder and the subject of intense, current research.