Wikipedia:Reference desk/Archives/Mathematics/2007 June 23

Mathematics desk
< June 22 << May | June | Jul >> June 24 >
Welcome to the Wikipedia Mathematics Reference Desk Archives
The page you are currently viewing is an archive page. While you can leave answers for any questions shown below, please ask new questions on one of the current reference desk pages.


June 23

edit

Euclidean spaces

edit

Hello. Suppose  , x,y are in Rk, |x-y| = d > 0 and r > 0. Prove that if 2r > d, there are infinitely many z in Rk such that |z-x| = |z-y| =r. If 2r = d, there is exactly one such z and if 2r < d there is no such z.

All I can think of is to take a sphere centered at x with radius r and then somehow taking a cone with vertex y and base containing that circle on the sphere for which |z-y| = r. But I have no idea how to prove anything analytically. Any help will be appreciated. --Shahab 10:18, 23 June 2007 (UTC)[reply]

For the "no such" part, think triangle inequality, which for Rk is a consequence of the Cauchy–Schwarz inequality. The case of strict equality can be used to handle "exactly one such", although it is not hard to do that from first principles. For 2r > d, visualize two equally large spheres with radius r centred at, respectively, x and y. One sphere is the locus of ||z−x|| = r, the other of ||z−y|| = r. Where do you have that ||z−x|| = ||z−y|| = r? It should not be hard to come up with a formula or construction for some vector zc parametrized by a value c such that ||zc-x|| = ||zc-y|| = r for all c, where different choices of c give you infinitely many different vectors zc.  --LambiamTalk 10:53, 23 June 2007 (UTC)[reply]
Thankx for the reply. However I still have trouble in constructing zc. In the case k = 3 actual spheres intersect and so I can use the result that their intersection is a circle. But I don't know how to do that in general. I think I can handle the other cases. Can you explain the construction of zc?--Shahab 16:47, 23 June 2007 (UTC)[reply]
A fact that may be helpful is that the set of points equidistant from two given points, the perpendicular bisector, is flat. In 2D it's a line; in 3D, a plane; and so on. The set of points at a fixed distance from one given point is a "sphere", in a generalized sense. In 2D it's a circle; in 3D, a spherical surface; and so on. Now intersect. --KSmrqT 19:23, 23 June 2007 (UTC)[reply]
WLOG we can assume that   lies at the origin and  . Let  ,  . These form a circle around  , with the axis along   and with radius  . We verify
 
and
 .
Did I just do someone's homework? ;-) You could complete it by proving that the number of  ,  , are infinite. You could also do better than me and find all   that satisfies the criterion. I only give one circle of solutions, no matter how high the dimension   is. (And find my mistakes. No intentional ones, I promise!) Bonne chance. —Bromskloss 20:31, 23 June 2007 (UTC)[reply]