| Polyhedral Subdivisions
and Projections of Polytopes Jörg Rambau Dissertation (Advisor: Günter M. Ziegler, TU Berlin) |
|
When dealing with topological problems, it is often useful to work with special combinatorial objects related to the topological spaces under consideration, rather than with the topological spaces themselves. For example, triangulations of topological spaces lead to simplicial complexes that carry the complete topological information about the original space within their combinatorial structure. There are two quite different links between the Generalized Baues Conjecture and the theory of combinatorial models of topological spaces: loop spaces and finite-dimensional Grassmannians.
Combinatorial models of the finite-dimensional Grassmannians
are closely related to oriented matroids. The
real Grassmann manifold
,
or
Grassmannian for short, is the space of all
-dimensional
subspaces of
with the usual quotient topology,
where
if and only
if
for
and
in
.
The oriented matroids
and
of equivalent
representatives
coincide. Thus, the set of all
realizable oriented matroids on
points of rank
with
the topology inherited by the weak map relation can be regarded as a
model of
.
But the realizability assumption disturbs the
combinatorial shape of the model; there is no combinatorial
criterion known to check realizability efficiently.
(For additional problems occurring
in this stratification see STURMFELS [69].)
So a natural idea is to bring all oriented matroids on
points of
rank
-- realizable or not -- into the game, forming
the
MacPhersonian
.
This was actually done by
GELFAND & MACPHERSON [30]
who conjectured that
is homotopy equivalent to
,
which is in fact true if
(see BABSON [3] and
MNËV & ZIEGLER [54]).
A generalization of this concept is the OM-Grassmannian (we refer to BABSON [3], MNËV & ZIEGLER [54], and RICHTER-GEBERT [63, Introduction, Section 4]).
The unifying conjecture is the following.
For
there are affirmative results.
For
we get the MacPhersonian
.
In the case
we are again concerned with
the extension space conjecture, inheriting the corresponding
partial results.
Further affirmative partial answers to the extension space conjecture
would support inductive approaches to this problem.
The
model theory of loop spaces deals with the construction of
combinatorial models for the loop space
of
,
which is
the space of all closed paths in a topological space
,
endowed
with a certain topology.
The source of the Generalized Baues Conjecture actually lies in this field. The
original Baues Conjecture belongs to the purely combinatorial part of a
whole theory developed by -- among others --
ADAMS [1], MILGRAM [51],
and BAUES [5].
The exact setting of this framework requires
much more insight into category theory than we can present here. Thus, we
restrict ourselves to a sketch of the situation.
In the book
The Geometry of Loop Spaces by BAUES [5]
a general model theorem is presented, which roughly states the following:
If
is a space glued together from standard building blocks, then, under
certain conditions, its loop space
is glued together from certain
path spaces of the standard building blocks. The following version of the
model theorem is still a rough sketch of the exact setting.
Let
be a topological space that is the topological
realization
of a complex
consisting of building blocks
from
.
Then there is a construction that builds up a complex
from the building blocks
in
such that the
topological realization
of
is (weakly) homotopy equivalent to the loop space
of
.
In other words, the following formula holds:
Because a closer inspection of this construction is outside the scope of this thesis, we restrict ourselves to the problem of guaranteeing the assumptions of the theorem.
We briefly sketch how one gets
for building blocks
that are
abstract contractible cell complexes containing at least two
vertices. Let
be the
space of all paths in
starting at
and terminating
at
,
where
and
correspond to vertices
and
in
.
This
path space is (via certain topological constructions) related to the
loop space of
.
We construct a model
for
.
To any element
of
we assign
vertices
and
of
with the following properties:

The pair
is called a
double stippling on
.
A
cellular string in
with respect to the
double stippling
is a sequence
of faces
of
such that
for all
.
The set
of all cellular strings in
is partially ordered
by refinement, i. e.,

The
(cellular) string complex
(see Figure 1.10) is a certain
abstract cell complex that induces this partial order via its facial relations.
We may interpret this model as follows:
for any path
from
to
in
consider the string of
those faces of
that are visited by
.
This string gives rise
to a cellular string in
,
thus to a cell in
.
The crucial part in applications of the Model Theorem,
as far as our framework is concerned, is the construction of the
spherical desuspensions
.
These are the standard realizations
satisfying v
and vi of
Theorem 1.2.17.
Constructing a spherical desuspension
roughly means
finding a topological cell complex with spherical boundary
that carries the combinatorial structure
of
within its incidences and is ``consistent'' for all
.
One straightforward attempt is to consider
a topological realization of the
order complex of
,
which is the first barycentric subdivision of
.
Its boundary is just a topological realization of the order complex
of
.
If this boundary is always homotopy eqivalent to a sphere, then we are done.
For the special case of double-stipplings on a polytope coming from a generic
linear functional this is exactly the problem that is addressed by the
Generalized Baues Conjecture for
.
The following considerations lead to the original Baues Conjecture.
If we are concerned with a triangulated topological space
,
so that
is the set of all abstract simplices with standard realizations,
then the string complex for the
-simplex
is
combinatorially equivalent to an
-cube
(see Figure 1.10).
Hence, by the Model Theorem, the loop space
of
is (weakly)
homotopy equivalent to a certain space glued together from cubes.
Continuing this process with
instead of
leads to the
string complex of the
-cube, which turns out to be the
-permutahedron, the convex hull of all permutations of
,
viewed as vectors in
.
![]() |
The next step, however, yields string complexes that cannot be realized as polytopes. They even fail to be homeomorphic to balls. To apply the Model Theorem, however, it would be sufficient to come up with realizations whose boundary is homotopy equivalent to a sphere. The Baues Conjecture is roughly as follows.
Here is our connection:
assume that
is a permutahedron with face lattice
,
and the double
stippling on
is given by a generic linear functional
on
.
Then the first barycentric subdivision of the
string complex
coincides with the order complex of the poset
of all
-induced subdivisions. The minimal and the maximal vertex
of
with respect to
correspond to the fixed base points
in
.
Thus, the proof of the case
of the Generalized Baues Conjecture
by BILLERA, KAPRANOV &
STURMFELS [9]
implies the Baues Conjecture.
Our negative result in Chapter 2 can be regarded as an obstruction for modelling iterated loop spaces in one step, even if there were a similar model theorem around (which -- to the knowledge of the author -- is not the case).