Math Help Forum

Math Help Forum Feed Site Feed

Go Back   Math Help Forum > College/University Maths Help > Advanced Geometry
Reply
 
Thread Tools Display Modes
  #1  
Old 08-01-2008, 03:03 PM
Member
 
Join Date: Mar 2008
Posts: 33
Country:
Thanks: 2
Thanked 1 Time in 1 Post
Ultros88 is on a distinguished road
Cool Spherical Geometry Proof Help Wanted

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).

Last edited by Ultros88; 08-01-2008 at 06:50 PM. Reason: Clarification
Reply With Quote
Advertisement
 
  #2  
Old 08-06-2008, 10:54 PM
Senior Member
 
Join Date: Dec 2007
Posts: 182
Country:
Thanks: 16
Thanked 90 Times in 83 Posts
TwistedOne151 will become famous soon enoughTwistedOne151 will become famous soon enough
Default

Well, \pi(n-2) is the sum of the interior angles of an n-sided polygon in a plane (see limit of your formula as R\to\infty), 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.
Reply With Quote
  #3  
Old 08-11-2008, 11:15 AM
Member
 
Join Date: Mar 2008
Posts: 33
Country:
Thanks: 2
Thanked 1 Time in 1 Post
Ultros88 is on a distinguished road
Smile I got it.

Let the angles of a polygon be a_1, a_2, ... a_n. Then the polygon may be divided into (n-2) triangles. Let the sum of the angles of each triangle be denoted by T_1, T_2, ... T_{n-2}. Let the area of each triangle be denoted by A_1, A_2, ... A_{n-2}. Then\sum_{i=1}^{n-2} T_i = sum of angles of polygon, and \sum_{i=1}^{n-2} A_i = area of polygon. Since T_i = \pi + \frac{1}{R^2} A_i, summing over all the (n-2) triangles gives \sum_{i=1}^{n} a_i = (n-2)\pi + \frac{1}{R^2} Area(polygon).
Reply With Quote
The following users thank Ultros88 for this useful post:
Donate to MHF
Reply

Thread Tools
Display Modes

Posting Rules
You may not post new threads
You may not post replies
You may not post attachments
You may not edit your posts

BB code is On
Smilies are On
[IMG] code is On
HTML code is Off
Trackbacks are Off
Pingbacks are Off
Refbacks are Off
Forum Jump


All times are GMT -7. The time now is 06:05 PM.


Powered by vBulletin® Version 3.7.3
Copyright ©2000 - 2008, Jelsoft Enterprises Ltd.
SEO by vBSEO 3.2.0 ©2008, Crawlability, Inc.
©2005 - 2008 Math Help Forum


Math Help Forum is a community of maths forums with an emphasis on maths help in all levels of mathematics.
Register to post your math questions or just hang out and try some of our math games or visit the arcade.