
Euler's Formula,
Proof 12: Shelling
Ziegler interprets a polyhedron or polytope
as a complex of polyhedral faces of varying dimensions. He lets
denote the number of faces of dimension
, so ,
, and , but he also adds faces of
dimension (the whole polytope) and (the empty face); . These two extra
faces are the top and bottom elements of the face lattice of
the polyhedron:

Ziegler defines a shelling of a complex of polyhedral faces
to be a linear ordering on the maximal-dimension faces (facets)
such that, if the facets are of dimension at least one, the ordering
satisfies the following properties:
- The boundary of the first facet has a shelling.
- The intersection of each facet () with the union of previous
facets is nonempty and forms the prefix of a shelling of .
Every convex polytope has a shelling found by traveling in a straight
line from some point near one face of the polyhedron, and ordering the
faces by the sequence of points at which the line crosses the plane of a
face and the face becomes visible. (The line must be imagined to pass
"to infinity and beyond" through to the other side of the polyhedron.)
The intersection of a facet with previous facets can be found
geometrically as the portion of the boundary of the facet visible from
the intersection point of the viewing line with the plane of the facet;
this shows that the lower-dimensional shelling required by property 2 is
of the same geometric type.
Ziegler then proves that any polytope has Euler characteristic
by an induction on dimension and
shelling length:
The base case, in which , is clear. Now if
is a -polytope with shelling order then we
have more precisely that is
for and for , which follows by
induction on , since the
facets we add in are -polytopes, the Euler
characteristic is additive, and the intersection of with
previous facets is a shellable part of, but (for ) not the whole
boundary of (Ziegler shows that this last observation is true in
general, but it is evident geometrically for the shelling defined
above).
Removing the two "extra" faces and from this sum
gives us the usual Euler formula.
Proofs of Euler's Formula.
From the Geometry Junkyard,
computational
and recreational geometry pointers.
David Eppstein,
Theory Group,
ICS,
UC Irvine.