
Euler's Formula,
Proof 18: Hyperplane Arrangements
This proof comes from a 1997 paper by Jim Lawrence. It applies to convex polytopes in ,
and resembles in some ways the valuation proof.
If is a finite
arrangement of hyperplanes in
, it partitions into
faces, sets of points that are all contained within the same
set of hyperplanes, and that are on the same side of all hyperplanes
that do not contain them. Lawrence defines an -polyhedron to be any
union of faces, and he defines a function from -polyhedra to integers,
where if is a face then , and if
is an -polyhedron composed of
faces then .
It is not difficult to see that has the same value for
in all arrangements for which is an -polyhedron; for,
adding any superfluous hyperplane to the arrangement merely splits some
faces into two same-dimension faces and one face of one lesser
dimension, which does not change the total value of for those
faces, and removing any hyerplane merely reverses this process.
Consequentially, if is any nonempty intersection of finitely many
open halfspaces then , for
can be assumed to be the arrangement of boundary
hyperplanes of the halfspaces defining , for which is a face. In
particular, from the intersection of zero halfspaces we obtain . Also,
it is obvious from the construction that the value of on a
disjoint union of polyhedra is simply the sums of its values on the
individual polyhedra making up the union.
We can now calculate the Euler characteristic of a closed -dimensional convex polyhedron
, by embedding on a
hyperplane missing the origin in , forming the
infinite cone of positive scalar multiples of points in , and computing . This valuation (when
viewed in terms of the arrangement of hyperplanes through the facets of
this cone) includes a term of the form for every
-dimensional face of ,
including for the empty face (corresponding to the apex of the
cone), for the vertices (rays forming edges of the cone, which
are -dimensional faces of
the arrangement), etc.
By additivity,
where is the open halfspace bounded by the th hyperplane on the side of that
hyperplane away from . We
already know the value of the first of these two terms, and the second
can be calculated by inclusion-exclusion as
summed over all nonempty subsets of the halfspaces . But all such subsets have
nonempty intersection (they contain the cone complementary to ) and are open convex
polyhedra, so we can simplify the sum above to
which exactly cancels the term leaving .
Proofs of Euler's Formula.
From the Geometry Junkyard,
computational
and recreational geometry pointers.
David Eppstein,
Theory Group,
ICS,
UC Irvine.