[Polyhedral Combinatorics] Euler's Formula for Convex Polyhedra using Inductive Proof

If we imagine a light source placed near one of the faces of the polyhedron above a plane, the shadows of the polyhedron edges form a planar graph embedded in the plane. This resulting figure in the plane has VV vertices, EE edges, but F1F-1 faces, because the face that was closest to the light source becomes the outside face of this figure. In this way, every convex polyhedron can be projected onto the plane without the edges crossing, hence can be represented as a planar graph.

Therefore, by showing that a connected planar graph with V vertices, E edges, and F faces satisfy the equation VE+F=1V-E+F =1, we will have shown that Euler's formula VE+f=2V-E+f=2 holds for a convex polyhedron.

Let statement P(n)P(n): All connected planar graphs with E edges satisfies VE+F=1V-E+F =1.

(1)(1) Base case: n=1=En=1=E

There exist only one planar graph that has one edge. This graph has two vertices, one edge, and no face. Since 21+0=12-1+0 = 1, it satisfies the formula. So P(1)P(1) is true.

(2)(2) Assume P(k)P(k) is true. This means that every connected planar graph with kk edges satisfies the formula. Now we want to show that P(k+1)P(k+1) is also true. Consider a connected planar graph Γ\Gamma with k+1k+1 edges, and say Γ\Gamma has vv vertices and ff faces. We want to show that Γ\Gamma satisfies the formula v(k+1)+f=1v-(k+1)+f =1. We can do this by removing a carefully chosen edge from Γ\Gamma to leave a connected planar graph with kk edges, then use P(k)P(k) to show P(k+1)P(k+1). In the case that Γ\Gamma has at least one face, that is, f1f\geq 1, we can remove one edge of this face, and the remaining graph will still be connected with kk edges, vv vertices, and f1f-1 faces. Since we assumed P(k)P(k) to be true, this remaining graph will satisfy vk+(f1)=1v-k+(f-1) = 1, and this gives v(k+1)+f=1v-(k+1)+f=1 as we required. The other case is when Γ\Gamma has no faces at all, so f=0f=0. This means that there exists at least one vertex that is joined by an edge that connects to only one other vertex. If we remove this edge, our vertex will also be removed. So the resulting graph will have v1v-1 vertices, kk edges, and no faces. This graph also satisfies the formula by P(n)P(n), which mans that (v1)k+0=1(v-1) -k+0 =1, hence v(k+1)+0=1v-(k+1)+0 =1. However, in this case the resulting graph is not a connected planar graph anymore, but rather, a disjoint union of two graphs. Therefore, we do not need to include this case.

Therefore, we have shown that P(n+1)P(n+1) is true whenever P(n)P(n) is true.

Since P(n)P(n) is true for n=1n=1, and P(n)P(n+1)P(n) \Rightarrow P(n+1), by Principle of Mathematical Induction we conclude that every connected planar graph with V vertices, E edges and F faces satisfies VE+F=1V-E+F=1. Since every convex polyhedron can be represented as a planar graph with one less face, we conclude that Euler's formula VE+f=2V-E+f=2 holds for any convex polyhedron.

Note by Tasha Kim
1 year, 5 months ago

No vote yet
1 vote

  Easy Math Editor

This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.

When posting on Brilliant:

  • Use the emojis to react to an explanation, whether you're congratulating a job well done , or just really confused .
  • Ask specific questions about the challenge or the steps in somebody's explanation. Well-posed questions can add a lot to the discussion, but posting "I don't understand!" doesn't help anyone.
  • Try to contribute something new to the discussion, whether it is an extension, generalization or other idea related to the challenge.
  • Stay on topic — we're all here to learn more about math and science, not to hear about your favorite get-rich-quick scheme or current world events.

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold

- bulleted
- list

  • bulleted
  • list

1. numbered
2. list

  1. numbered
  2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1

paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
    # 4 spaces, and now they show
    # up as a code block.

    print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.
2 \times 3 2×3 2 \times 3
2^{34} 234 2^{34}
a_{i-1} ai1 a_{i-1}
\frac{2}{3} 23 \frac{2}{3}
\sqrt{2} 2 \sqrt{2}
\sum_{i=1}^3 i=13 \sum_{i=1}^3
\sin \theta sinθ \sin \theta
\boxed{123} 123 \boxed{123}

Comments

There are no comments in this discussion.

×

Problem Loading...

Note Loading...

Set Loading...