Ever wonder why the sum of interior angles in a hexagon is always 720°?
It’s not magic—it’s a direct off‑shoot of a little‑known corollary to the polygon interior angles theorem. Most textbooks mention the theorem, then skip the corollary entirely, leaving a gap that trips up students, hobbyists, and even some teachers.
In practice, that corollary is the shortcut that lets you instantly tell how many triangles you can “fit” inside any polygon, how many diagonals it has, and why regular polygons behave the way they do. Below is the deep‑dive you’ve been hunting for.
What Is the Corollary to the Polygon Interior Angles Theorem
The classic interior‑angles theorem says: For any simple n‑gon, the sum of its interior angles equals (n – 2)·180°.
The corollary builds on that by answering a more specific question: How many triangles can be formed by drawing non‑overlapping diagonals from a single vertex?
In plain English: pick any corner of a polygon, connect it to every other non‑adjacent corner, and you’ll slice the shape into exactly n – 2 triangles. Those triangles are the reason the angle sum works out to (n – 2)·180°.
Why the corollary matters
- It gives a quick way to compute interior‑angle sums without memorizing the (n – 2)·180° formula.
- It reveals the hidden triangular structure of every polygon, which is the key to many other formulas (area, diagonal count, etc.).
- It’s the bridge between geometry and combinatorics—once you see the triangles, counting diagonals becomes a breeze.
Why It Matters / Why People Care
Imagine you’re designing a floor plan, a game board, or a piece of graphic art. Worth adding: you need to know how many tiles will fit, how many cuts you’ll make, or how many lines you’ll have to draw. The corollary tells you, at a glance, how many “building blocks” (triangles) you’re dealing with.
When students first learn the interior‑angles theorem, they often ask, “Why subtract 2?” The answer is the corollary: you’re essentially removing two vertices to turn the polygon into a chain of triangles. Without that insight, the formula feels arbitrary.
In real‑world engineering, the corollary shows up in finite‑element analysis. In real terms, engineers break complex shapes into triangular elements because triangles are rigid and easy to compute. Knowing you can always do it with n – 2 triangles (from a single vertex) guarantees a predictable element count.
How It Works
Below is the step‑by‑step logic that turns a vague statement into a rock‑solid proof and a handy tool Not complicated — just consistent..
1. Pick a vertex
Take any convex polygon with n sides. Choose one corner—call it V₁.
2. Draw all possible diagonals from V₁
A diagonal connects V₁ to any non‑adjacent vertex. There are (n – 3) such vertices because you can’t connect V₁ to itself or its two immediate neighbors (those are edges, not diagonals) No workaround needed..
3. Observe the resulting pieces
Each diagonal you draw creates a new triangle that shares V₁ as a common corner. After you’ve drawn all (n – 3) diagonals, the polygon is split into (n – 2) triangles Simple as that..
Why (n – 2) and not (n – 3)? The first diagonal already gives you one triangle. Every additional diagonal adds exactly one more triangle, so you start with 1 and add (n – 3) more:
1 + (n – 3) = n – 2
4. Relate triangles to angle sum
Each triangle’s interior angles add up to 180°. Multiply that by the number of triangles:
(n – 2) × 180° = sum of interior angles of the original polygon
That’s the interior‑angles theorem, derived directly from the corollary.
5. Extend to concave polygons (caveat)
The corollary holds cleanly for convex shapes. This leads to for a concave polygon, some diagonals from V₁ will fall outside the figure, breaking the “non‑overlapping” rule. In practice, you can still triangulate the shape, but you may need to pick a different starting vertex or use a more general ear‑clipping algorithm. The takeaway: the simple “n – 2 triangles from one vertex” works best when every interior angle is less than 180°.
6. Connect to diagonal count
Once you know you can make (n – 2) triangles, you can also derive the total number of diagonals d in any polygon:
Each triangle contributes three sides, but each interior side is shared by two triangles. Counting carefully leads to
d = n(n – 3)/2
That formula is another corollary, but it leans on the same triangular decomposition Took long enough..
Common Mistakes / What Most People Get Wrong
-
Counting edges as diagonals – New learners often include the two edges adjacent to the chosen vertex when tallying diagonals. Remember: a diagonal must skip at least one vertex And it works..
-
Assuming the corollary works for any vertex in a concave polygon – If the chosen vertex lies in a “re-entrant” corner, some drawn diagonals will exit the shape, leaving gaps. The fix? Start from a vertex that sees the whole interior (a convex corner) or use a systematic triangulation method.
-
Mixing up “triangulation” with “division into quadrilaterals” – The corollary is about triangles only. Splitting a polygon into quadrilaterals changes the count and the angle‑sum reasoning.
-
Forgetting the “non‑overlapping” condition – Overlapping diagonals create extra interior lines that don’t correspond to separate triangles, throwing off the (n – 2) count.
-
Applying the formula to star polygons – Star‑shaped (self‑intersecting) polygons have interior angles defined differently, so the classic theorem and its corollary don’t apply directly Took long enough..
Practical Tips / What Actually Works
-
Start with the biggest angle when you’re unsure which vertex to pick in a concave shape. The largest interior angle is usually convex, guaranteeing clean diagonals.
-
Use a ruler or a digital sketchpad to draw the diagonals physically. Seeing the triangles appear makes the (n – 2) count undeniable.
-
Check your work with the angle sum: After triangulating, add up the three angles of each triangle. If the total matches (n – 2)·180°, you’ve likely drawn all necessary diagonals.
-
put to work the corollary for area calculations. If you know the coordinates of each vertex, compute the area of each triangle (via the shoelace formula) and sum them. This is often simpler than trying to find a single polygon area formula.
-
Remember the ear‑clipping method for programming. If you’re writing a script to triangulate polygons (common in computer graphics), the ear‑clipping algorithm essentially repeats the corollary: it repeatedly removes “ears” (triangles) until only a single triangle remains.
-
Teach it with real objects. Grab a piece of cardboard, cut out a pentagon, and actually cut along the diagonals. The tactile experience cements the (n – 2) relationship for visual learners It's one of those things that adds up..
FAQ
Q1: Does the corollary work for polygons with more than 10 sides?
Absolutely. The math doesn’t care about the size; it only cares that the shape is simple (no crossing edges) and convex. For a 12‑gon you’ll get 10 triangles, and the interior‑angle sum will be 10 × 180° = 1800° That's the whole idea..
Q2: How can I use the corollary to find the number of diagonals quickly?
First, note that each triangle you create adds exactly one new diagonal from the chosen vertex. Since you end up with (n – 2) triangles, you’ll have drawn (n – 3) diagonals from that vertex. Multiply by n and divide by 2 (to avoid double‑counting) to get n(n – 3)/2.
Q3: What if the polygon is irregular?
Irregularity doesn’t matter. The corollary only cares about the number of sides, not side lengths or angle measures. As long as the polygon is simple and convex, you’ll still get (n – 2) triangles Practical, not theoretical..
Q4: Can I apply the corollary to 3‑D polyhedra?
Not directly. The interior‑angles theorem is a planar concept. In three dimensions you’d look at the face angles and use Euler’s formula instead Worth knowing..
Q5: Is there a name for the process of drawing those diagonals?
Yes—triangulation. In computational geometry, “polygon triangulation” is a well‑studied problem, and the corollary is the theoretical backbone behind many algorithms Still holds up..
That’s it. In practice, the next time you stare at a weird‑shaped tabletop or a hexagonal game board, just pick a corner, draw a few lines, and watch the polygon fall apart into (n – 2) tidy triangles. In practice, the corollary isn’t just a footnote; it’s the hidden engine that makes the interior‑angles theorem click, and it’s a tool you can actually use every day. Happy triangulating!
