How Does Rudin Prove the Existence of h in the Uniqueness of n-roots?

Click For Summary

Discussion Overview

The discussion revolves around the proof of the uniqueness of n-roots in Rudin's "Principles of Mathematical Analysis." Participants are examining the conditions under which a value \( h \) can be chosen to satisfy specific inequalities in the proof, particularly focusing on the existence of \( h \) that is both positive and less than 1.

Discussion Character

  • Technical explanation
  • Debate/contested

Main Points Raised

  • One participant questions how Rudin knows a value \( h \) exists that satisfies \( 0 < h < 1 \) and \( h < \frac{x - y^n}{n(y + 1)^{n-1}} \).
  • Another participant suggests that even if \( h \) is not less than 1, it can still be chosen to satisfy the inequality.
  • A participant expresses confusion about the apparent contradiction of \( h \) being both less than and not less than 1.
  • One participant proposes that proving the existence of \( h \) may not be necessary and references the supremum of a set related to \( y \).
  • Another participant clarifies that for any positive fraction \( F \), \( h \) can be chosen such that it meets the required inequalities depending on whether \( F \) is greater than or less than 1.
  • There is a correction regarding the naming of the fraction, which is clarified to be \( F = \frac{x - y^n}{n(y + 1)^{n-1}} \) and confirmed to be greater than zero.

Areas of Agreement / Disagreement

Participants express differing views on the necessity of proving the existence of \( h \) and the conditions under which it can be chosen. The discussion reflects uncertainty and multiple interpretations regarding the inequalities and the role of \( h \).

Contextual Notes

The discussion includes assumptions about the values of \( x \), \( y \), and \( n \), and the implications of these assumptions on the existence of \( h \). There is also a focus on the clarity of notation and the definitions used in the discussion.

help with rudin 1.21 PoMA

  • help! rudin 1.21

    Votes: 0 0.0%
  • help! rudin 1.21

    Votes: 0 0.0%

  • Total voters
    0
josueortega
Messages
8
Reaction score
0
Hi!

I need some help here, please.

In Principles of Mathematical Analysis, Rudin prove the uniqueness of the n-root on the real numbers. For doing so, he prove that both $y^n < 0$ and that $y^n > 0$ lead to a contradiction.

In the first part of the proof, he chooses a value $h$ such that
1. $0<h<1$
2 $h<\frac{x-y^n}{n(y+1)^(n-1)}$

My question is: how does he know such a value $h$ exists?

I know this value is positive, but I am not sure how to prove is less than 1.

To add some context:
x is a real positive number
n is a integer positive number
y is a real positive number

If someone can help me with this, I will be very grateful!

Thanks
 
Physics news on Phys.org


Even if it is not less than 1 , you still can choose h less than this fraction and in the same time 0<h<1.
 


Don't get it. How can it be not less than 1, and at the same time, less than one?

I think the more likely answers are that:

1) No need to prove the existence of h
2) There is something I'm missing about y=sup E, where E is the set all positive real numbers t, such that t^n<x

By the way, perhaps I am not writing correctly the equations so that they show clearly in latex style.
 


I have Rudin at my hand now, so no source of confusion. My understanding is the following:
Given any F>0 (which is the fraction you wrote above), it is possible to choose h such that :
0 < h < 1 < F (in case 1<F)
or
0 < h < F <1 (in case F<1)

In other words all what you need is to make sure that the fraction is greater than zero which is actually the case here.
 


Thanks. I am trying to get it now. But the fraction I wrote above is h, NOT x.
 


The fraction is NEITHER x NOR h. I edited my post and renamed it F as I realized calling it x is a bad idea.

F= (x-yn)/n(y+1)n-1
and F>0
 


Thank you.
 

Similar threads

  • · Replies 7 ·
Replies
7
Views
3K
  • · Replies 12 ·
Replies
12
Views
3K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 17 ·
Replies
17
Views
2K
  • · Replies 8 ·
Replies
8
Views
3K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 15 ·
Replies
15
Views
4K
  • · Replies 2 ·
Replies
2
Views
3K