World Library  
Flag as Inappropriate
Email this Article

Angular defect

Article Id: WHEBN0000673575
Reproduction Date:

Title: Angular defect  
Author: World Heritage Encyclopedia
Language: English
Subject: Hyperbolic geometry, Defect, Alexandrov's uniqueness theorem, Polyhedra, WikiProject Mathematics/List of mathematics articles (A)
Collection: Hyperbolic Geometry, Polyhedra
Publisher: World Heritage Encyclopedia

Angular defect

In geometry, the (angular) defect (or deficit or deficiency) means the failure of some angles to add up to the expected amount of 360° or 180°, when such angles in the plane would. The opposite notion is the excess.

Classically the defect arises in two ways:

and the excess also arises in two ways:

In the plane, angles about a point add up to 360°, while interior angles in a triangle add up to 180° (equivalently, exterior angles add up to 360°). However, on a convex polyhedron the angles at a vertex on average add up to less than 360°, on a spherical triangle the interior angles always add up to more than 180° (the exterior angles add up to less than 360°), and the angles in a hyperbolic triangle always add up to less than 180° (the exterior angles add up to more than 360°).

In modern terms, the defect at a vertex or over a triangle (with a minus) is precisely the curvature at that point or the total (integrated) over the triangle, as established by the Gauss–Bonnet theorem.


  • Defect of a vertex 1
  • Examples 2
  • Descartes' theorem 3
  • Positive defects on non-convex figures 4
  • References 5
    • Notes 5.1
    • Bibliography 5.2
  • External links 6

Defect of a vertex

For a polyhedron, the defect at a vertex equals 2π minus the sum of all the angles at the vertex (all the faces at the vertex are included). If a polyhedron is convex, then the defect of each vertex is always positive. If the sum of the angles exceeds a full turn, as occurs in some vertices of many non-convex polyhedra, then the defect is negative.

The concept of defect extends to higher dimensions as the amount by which the sum of the dihedral angles of the cells at a peak falls short of a full circle.


The defect of any of the vertices of a regular dodecahedron (in which three regular pentagons meet at each vertex) is 36°, or π/5 radians, or 1/10 of a circle. Each of the angles is 108°; three of these meet at each vertex, so the defect is 360° − (108° + 108° + 108°) = 36°.

The same procedure can be followed for the other Platonic solids:

Shape Number of vertices Polygons meeting at each vertex Defect at each vertex Total defect
tetrahedron 4 Three equilateral triangles \pi \ \ (180^\circ ) 4\pi\,
octahedron 6 Four equilateral triangles {2 \pi\over 3} \ (120^\circ ) 4\pi
cube 8 Three squares {\pi\over 2}\ \ (90^\circ ) 4\pi\,
icosahedron 12 Five equilateral triangles {\pi\over 3}\ \ (60^\circ ) 4\pi\,
dodecahedron 20 Three regular pentagons {\pi\over 5}\ \ (36^\circ ) 4\pi\,

Descartes' theorem

Descartes' theorem on the "total defect" of a polyhedron states that if the polyhedron is homeomorphic to a sphere (i.e. topologically equivalent to a sphere, so that it may be deformed into a sphere by stretching without tearing), the "total defect", i.e. the sum of the defects of all of the vertices, is two full circles (or 720° or 4π radians). The polyhedron need not be convex.[1]

A generalization says the number of circles in the total defect equals the Euler characteristic of the polyhedron. This is a special case of the Gauss–Bonnet theorem which relates the integral of the Gaussian curvature to the Euler characteristic. Here the Gaussian curvature is concentrated at the vertices: on the faces and edges the Gaussian curvature is zero and the integral of Gaussian curvature at a vertex is equal to the defect there.

This can be used to calculate the number V of vertices of a polyhedron by totaling the angles of all the faces, and adding the total defect. This total will have one complete circle for every vertex in the polyhedron. Care has to be taken to use the correct Euler characteristic for the polyhedron.

A converse to this theorem is given by Alexandrov's uniqueness theorem, according to which a metric space that is locally Euclidean except for a finite number of points of positive angular defect, adding to 4π, can be realized in a unique way as the surface of a convex polyhedron.

Positive defects on non-convex figures

It is tempting to think that every non-convex polyhedron must have some vertices whose defect is negative, but this need not be the case. Two counterexamples to this are the small stellated dodecahedron and the great stellated dodecahedron, which have twelve convex points each with positive defects.

Polyhedra with positive defects

A counterexample which does not intersect itself is provided by a cube where one face is replaced by a square pyramid: this elongated square pyramid is convex and the defects at each vertex are each positive. Now consider the same cube where the square pyramid goes into the cube: this is concave, but the defects remain the same and so are all positive.

Negative defect indicates that the vertex resembles a saddle point, whereas positive defect indicates that the vertex resembles a local maximum or minimum.



  1. ^ Descartes, René, Progymnasmata de solidorum elementis, in Oeuvres de Descartes, vol. X, pp. 265–276


  • Richeson, D.; Euler's Gem: The Polyhedron Formula and the Birth of Topology, Princeton (2008), Pages 220-225.

External links

This article was sourced from Creative Commons Attribution-ShareAlike License; additional terms may apply. World Heritage Encyclopedia content is assembled from numerous content providers, Open Access Publishing, and in compliance with The Fair Access to Science and Technology Research Act (FASTR), Wikimedia Foundation, Inc., Public Library of Science, The Encyclopedia of Life, Open Book Publishers (OBP), PubMed, U.S. National Library of Medicine, National Center for Biotechnology Information, U.S. National Library of Medicine, National Institutes of Health (NIH), U.S. Department of Health & Human Services, and, which sources content from all federal, state, local, tribal, and territorial government publication portals (.gov, .mil, .edu). Funding for and content contributors is made possible from the U.S. Congress, E-Government Act of 2002.
Crowd sourced content that is contributed to World Heritage Encyclopedia is peer reviewed and edited by our editorial staff to ensure quality scholarly research articles.
By using this site, you agree to the Terms of Use and Privacy Policy. World Heritage Encyclopedia™ is a registered trademark of the World Public Library Association, a non-profit organization.

Copyright © World Library Foundation. All rights reserved. eBooks from Project Gutenberg are sponsored by the World Library Foundation,
a 501c(4) Member's Support Non-Profit Organization, and is NOT affiliated with any governmental agency or department.