Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

Use the well-ordering principle to show that if x and y are real numbers with x<y, then there is a rational number r with x<r<y. [Hint: Use the Archimedean property, given in Appendix 1, to find a positive integer A with .A>1/(y-x) Then show that there is a rational number with denominator A between x and y by looking at the numbers x+j/A, where is a positive integer.]

Short Answer

Expert verified

The statement “there exists a rational number r with x<r<y” is true by assuming it is false with the help of well-ordering principle and the counterexamples.

Step by step solution

01

Identification of the given data

The given data can be listed below as:

  • The value of the first real number is x.
  • The value of the second real number is y.
  • The value of the rational number isr .
  • The value of the first positive integer is A .
  • The value of the second positive integer isj .
02

Significance of the principle of well ordering

The principle of well ordering mainly works with the division algorithm. The principle states that a particular set should contain a minimum of one element.

03

Proving the problem statement with the help of well ordering principle

Let the statement “there exists a rational number r with x<r<y” is not true because of the contradiction. Let the values set be XNfor which n>0and also x<r<ythat has A=1/(y-x)and r=x+nA. As the statement is not true X, then is a non-empty set.

Using the principle of well ordering X, has a minimum of one element. Let the least element be . It is to be noted that exists inside . X As a0, thena>0 anda-1N .

As is the counterexample being the smallest element, then the counterexample if nota-1 asa-1<x which satisfiesx<x+aA<y .

Then x+aAalso satisfies the particular statement, that is clear contradiction which is “there exists a rational number r with x<r<y” is not true. Hence, by proving “the statement is false”, the statement becomes true.

Thus, the statement “there exists a rational number r with x<r<y” is true by assuming it is false with the help of well-ordering principle and the counterexamples.

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with Vaia!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

In the proof of Lemma 1 we mentioned that many incorrect methods for finding a vertex such that the line segment is an interior diagonal of have been published. This exercise presents some of the incorrect ways has been chosen in these proofs. Show, by considering one of the polygons drawn here, that for each of these choices of , the line segment is not necessarily an interior diagonal of .

a) p is the vertex of P such that the angleabpis smallest.

b) p is the vertex of P with the least -coordinate (other than ).

c) p is the vertex of P that is closest to .

Use strong induction to show that all dominoes fall in an infinite arrangement of dominoes if you know that the first three dominoes fall, and that when a domino falls, the domino three farther down in the arrangement also falls.

Give a recursive algorithm for finding the maximum of a finite set of integers, making use of the fact that the maximum of n integers is the larger of the last integer in the list and the maximum of the first n - 1 integers in the list.

A stable assignment, defined in the preamble to Exercise 60 in Section 3.1, is called optimal for suitors if no stable assignment exists in which a suitor is paired with a suitee whom this suitor prefers to the person to whom this suitor is paired in this stable assignment. Use strong induction to show that the deferred acceptance algorithm produces a stable assignment that is optimal for suitors.

Prove that 3+35+352++35n=3(5n+11)/4whenever nis a nonnegative integer.

See all solutions

Recommended explanations on Math Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free