euclidean polygon theorem If a(1),..,a(n) is a list of positive numbers, with a(n) ≥ a(i) for all i, then there is a unique convex cyclic polygon with sides of length a(1),..,a(n) in order.
proof
In the first case, for C = C*, we have θ(1)+..+θ(n) ≥ 2π.
In the second case, for C = C*, θ(1)+..+θ(n-1) < θ(n) = π.
|
|
As we move C to the right, all the θ(i) decrease, so we cannot immediately assert that there is a (unique) solution. We can argue that, as R tends to infinity, the circle K approaches the line AB. As a(1)+..+a(n-1) > a(n) = |AB|, the point A(n) eventually passes B. There must be at least one value of R for which A(n) = B. Thus there is a suitable polygon.
The problem with this geometrical approach is that it does not
Observe that, by elementary trigonometry,
As R tends to infinity, each θ(i) decreases towards 0, and so
|
For any α(1),..,α(m), sin(α(1)+..+α(m)) = ΣrP(m,r)S(r)sin(α(r)), where P(m,m) = 1, P(m,r) = cos(α(r+1))..cos(α(m)) for r < m, and S(1) = 1, S(r) = cos(α(1)+..+α(r-1)) for r > 1. |
There is, of course, a hyperbolic analogue.