Convex and discrete geometry Theorem
Cauchy's rigidity theorem
Builds on PolyhedronConvex setIsometry
Statement
Let and be convex polyhedra in . Suppose there is a bijection between their faces that preserves the incidences of faces, edges and vertices. Suppose also that each face of is congruent to the corresponding face of . Then there is an isometry of that maps onto .
Remarks
The proof compares the dihedral angles at corresponding edges and marks each edge , or according to the change. Cauchy's arm lemma shows that around each vertex with a marked edge, the signs change at least four times. A count of sign changes with Euler's formula then shows that no edge can be marked, so all dihedral angles agree. Cauchy's original proof of the arm lemma had a gap, which was later repaired.
Convexity is needed. Take a convex polyhedron with a vertex whose neighbours all lie in one plane. Reflect the small pyramid at that vertex inward through that plane. The new nonconvex polyhedron has the same combinatorics and congruent faces, but it is not congruent to the old one. Flexible polyhedra show that even a single nonconvex polyhedron can deform continuously with rigid faces.
Going deeper
For a student
The theorem is a statement of global rigidity for convex polyhedral surfaces among all convex realizations. It implies that a convex polyhedron cannot be deformed continuously with rigid faces. Dehn later proved the stronger infinitesimal rigidity of convex polyhedra. For nonconvex polyhedra rigidity can fail, as Connelly's flexible polyhedron shows, but the bellows conjecture says the volume is still preserved.
Reading path
To understand this page from the ground up, read these 4 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Convex set concept
- Isometry concept
- Polyhedron concept
- Cauchy's rigidity theorem statement
Further reading
About this page
| Tag | CJ7KCDDF31 |
|---|---|
| URI | m2://CJ7KCDDF31 |
| Kind | statement, theorem |
| Writing | W0 stub |
| MSC | 52B10, 52C25, 51M20 |
| Status | This copy of the site has no build data. Run m2 status CJ7KCDDF31. |
| About | Polyhedron, Rigidity of frameworks |
| Uses | Polyhedron, Convex set, Isometry |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.