Has this theorem a specific name; and I need some references for general form.
Suppose ${\gamma}$ is a convex polygon contained in the interior of the unit circle. then the length of $\gamma$ is not more than the length of the unit circle.
Has this theorem a specific name; and I need some references for general form. Suppose ${\gamma}$ is a convex polygon contained in the interior of the unit circle. then the length of $\gamma$ is not more than the length of the unit circle. 


This follows easily from the fact that the perimeter of a convex curve is in direct proportion with the mean width, and the width of the curve is in every direction smaller than the width of the circle. 


The drawing below illustrates a proof for the theorem as stated in your question; almost no words of explanation are necessary. To make things easy, I write a few lines. The whole proof is based on the fact that the shortest path connecting a pair of parallel lines is the (straight) line segment perpendicular to them. From the two vertices of each side of the polygon (green) draw a pair of rays perpendicular to the side, outward of the polygon, till they meet the boundary of the circle. Together with each side, the corresponding two rays bound a strip (yellow). Since the polygon is convex, no strip overlaps another. The arc of the circle corresponding to a side of the polygon is longer than the side. The inequality follows. The arcs in the grey sectors only make the inequality deeper. The same proof works for a more general convex shape instead of the circle, and a nonconvex shape can be replaced with its convex hull, whereby perimeter decreases. If the polygon inside is replaced with an arbitrary convex shape (not necessarily polygonal), use an arbitrarily close approximation from inside by a convex polygon. The same idea works in every dimension $n\ge3$ as well, the perimeter being replaced with the $(n1)$dimensional (hyper)surface area. However, the case of the outside shape being nonconvex requires a more essential modification, since passing to the convex hull may increase the surface area. 


This seems obvious if you make the circle out of a rubber band, and let it relax. I think one could make this model mathematically rigorous: take a supporting line to the inner convex body, and use it to cut a chord off of the circle (or any convex body containing it), which is length decreasing. Iterate this operation, getting shorter and shorter outer convex curves, which should limit to the inner convex curve as one varies the support lines densely around the inner curve. 


This is "Archimedes' axiom" (Archimedes could not prove it, so introduced it as an axiom while computing the length of the circle). As pointed out by @Yoav Kallus, Crofton's formula is a good way to prove it, but there are plenty of other ways. 


This has nothing to do with circles (or polygons). If one convex curve is inside another, then the length of the inner curve is smaller. 


In general (say in $\mathbb R^n$) the perimeter of a set $E$ containing a convex set $C$ is not smaller than the perimeter of $C$. This is a consequence of the following facts about the projection $\pi$ on the convex set $C$:


