Structure R^k and midpoints of vectors (rudin's PMA chapter 1 problem 16)

  • Thread starter Thread starter SiddharthM
  • Start date Start date
  • Tags Tags
    Structure Vectors
Click For Summary
SUMMARY

The discussion centers on problem 16 from Rudin's "Principles of Mathematical Analysis," which involves proving properties of midpoints in R^k space. The problem states that for vectors x, y in R^k (where k ≥ 3) and a distance d = ||x - y|| > 0, the following must be proven: (a) if 2r > d, there are infinitely many z such that ||z - y|| = ||z - x|| = r; (b) if 2r = d, there is exactly one such z; (c) if 2r < d, there are no such z. The Euclidean norm is defined as the square root of the sum of the squares of the components. The discussion highlights the geometric interpretation of the problem and the challenges in constructing a general proof using the definitions and theorems provided in the chapter.

PREREQUISITES
  • Understanding of Euclidean norms in R^k space
  • Familiarity with geometric interpretations of vector relationships
  • Knowledge of the triangle inequality in mathematical analysis
  • Experience with proof construction in analysis
NEXT STEPS
  • Study the geometric properties of circles in higher-dimensional spaces
  • Explore the implications of the triangle inequality in vector spaces
  • Review proof techniques for uniqueness in mathematical analysis
  • Examine examples of midpoint theorems in Euclidean geometry
USEFUL FOR

Mathematics students, particularly those studying analysis or geometry, as well as educators looking for insights into teaching concepts related to vector spaces and proofs in higher dimensions.

SiddharthM
Messages
176
Reaction score
0
First this is NOT a homework problem. I am undertaking a self-study of mathematical analysis by following Rudin's Principles of Mathematical analysis. I have done a course in analysis before but this is a high-powered review of sorts.

So I'm currently on the first chapter's problem set and I've gotten stuck on problem 16, which asks:

Let x,y in R^k, k>/=3 (at least 3-space), norm[x-y] = d>0 prove:

a)If 2r>d There are infinitely many z in R^k s.t. norm[z-y]=norm[z-x]=r
b)If 2r=d there is exactly one such z.
c)If 2r<d there are no such z.

That is the question as stated, to clarify the norm I speak of is the tradition euclidean k-space norm (i.e. root of sum of squares of components).

Part a) is the one I've made the least progress on, b) I'm half done and c) is a simple proof by contradiction using the triangle inequality.

Geometrically (for part a)) consider the line between x and y, there is a perpindicular plane at the midpoint (x+y)/2 (perpendicular to the line connecting x and y) and the set of infinite z that a) asks for is the circle of radius (r^2 - (d/2)^2)^(1/2) which is nonzero b/c of the hypothesis lying on the tangent plane centered at the midpoint (x+y)/2. The thing is, I presume rudin wants me to construct a general z that admits infinitely vectors, but I've found this very difficult to do using the definitions and theorems given in the chapter. Any ideas?

Part b) the only such z is x+y=2 but I can't for the life of me prove that it is the ONLY solution with rigour.

Help would be much appreciated.

Cheers,
Siddharth M.

PS: obviously the problem I'm having is providing a clean and neat proof strictly using definitions and theorems as is required of an analyst but such a solution has thus far escaped me.
 
Physics news on Phys.org
$|x-z|+|z-y| =2r \Rightarrow |x-y| \leq 2r \forall z$ by the triangle equality, the rest pretty much falls in your lap.
 

Similar threads

  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 30 ·
2
Replies
30
Views
4K
  • · Replies 43 ·
2
Replies
43
Views
5K
  • · Replies 4 ·
Replies
4
Views
2K
Replies
1
Views
1K
Replies
9
Views
2K
Replies
9
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
Replies
3
Views
2K