Well, is the sum of the interior angles of an n-sided polygon in a plane (see limit of your formula as ), so that might have something to do with it. I'm not sure if that helps, but does that give you any ideas?
--Kevin C.
How would one go about proving that each point on a sphere not within an n-sided convex spherical polygon nor its antipode is contained in (n-2) lunes defined by the angles of said polygon?
I think it has something do with the fact that the two great circles that intersect in a vertex include two of the other points of the polygon and thus the lunes described by the angles at those other two points are disjoint with those of the vertex under consideration. I can't seem to seal the deal though and I could use some help.
Thanks,
Ultros
What I'm trying to do at the end of it all is to prove that the sum of the angles of the polygon = pi*(n-2) + Area(polygon)/R^2. I can get everything except the crucial step of why there is this factor of pi*(n-2).
Let the angles of a polygon be . Then the polygon may be divided into triangles. Let the sum of the angles of each triangle be denoted by . Let the area of each triangle be denoted by . Then sum of angles of polygon, and area of polygon. Since , summing over all the triangles gives .