Interior angle sum of a quadrilateral and an n-gon
Statement
In any convex quadrilateral , the four interior angles satisfy . More generally, in any convex polygon with sides (), the sum of the interior angles is .
Why is it true?
You do not need a new geometric axiom to measure polygons with four or more sides: slicing the figure along diagonals from a single vertex reduces every polygon to a collection of triangles whose angle sums are already known to be each.
Proof sketch
Step 1 (split the quadrilateral along a diagonal). In convex quadrilateral , draw the diagonal . Because the figure is convex, this segment lies entirely inside the quadrilateral and partitions it into two triangles and .
Step 2 (apply the triangle angle sum to each piece). In we have , and in we have .
Step 3 (add the two equations and generalize). Adding both equations together gives . Since the adjacent angles at the two ends of the diagonal recombine into the full vertex angles and , this simplifies directly to . For a convex polygon with vertices, drawing all diagonals from one vertex cuts the interior into triangles whose angles add up to .
Topics that use this theorem
Step-by-step proofs
No step-by-step proof yet for this theorem.
References
- Euclid (trans. Thomas L. Heath) (1956). Euclid's Elements (Books I–XIII)
- H. S. M. Coxeter, S. L. Greitzer (1967). Geometry Revisited