Access the full text.
Sign up today, get DeepDyve free for 14 days.
References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.
AN ELEMENTARY PROOF OF EULER'S THEOREM FOR POLYTOPES GEORGE MAXWELL Suppose that P is a d-dimensional convex polytope in W and let f be the number of /c-faces of P. We count the empty face as a ( —l)-face and P itself as a d-face. Euler's theorem asserts that, if P ± 0, an alternating sum of the f is equal to zero. This is of course equivalent to the more familiar equation The purpose of this note is to give a brief elementary proof of Euler's theorem by induction on the number of vertices of P. However, we shall first make some preliminary remarks. If F is a j-face of P, let f {F) denote the number of /c-faces of P containing F. There exists a "quotient" polytope P/F whose (/c-/-l)-faces correspond to the /c-faces of P containing F. Euler's theorem applied to P/F would state that an alternating sum of the numbers f {F) is also equal to zero. To define quotients, it is n+1 +1 simpler to use the corresponding cones in U . Namely, if C is a cone in U" and D is a face of C which spans a subspace U, the quotient
Bulletin of the London Mathematical Society – Wiley
Published: Nov 1, 1984
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.