11 - Existence proofs and counterexamples

Focusing on proving there exists statements.

Constructive existence proofs

Find an element in the set. When working with existence qualifiers, use "fix", "put", or "set" instead of "let" - which is used for an arbitrary value.

!Screenshot 2023-10-01 at 7.25.06 PM.png

Intermediate value theorem

If f:[a,b]R is continuous, then for any y satisfying f(a)<y<f(b) or f(b)<y<f(a), there exists c(a,b) such that f(c)=y.

Nonconstructive existence proofs

Uniqueness

It's common to write !xS,R(x).

In class practice

Proposition. Every odd integer is the sum of two consecutive integers.

Proof. Let aODD. Thus a=2k+1 for some kZ. That is a=k+(k+1), and so a is the sum of two consecutive integers k and k+1.

Proposition. The equation 2x3+2x3=0 has a solution in the interval (0, 1).

Proof. The function f(x)=2x3+2x3 is a polynomial, and thus continuous everywhere. We find that f(0)=3 and f(1)=1. By the intermediate value theorem, we know that f must take the intermediate value 0 for some x(0,1).



HW 11

Ben Finch

E 11.1
a) Fix a=1,b=2. Then a,bQ. We have 12=1Q.

b) Fix a=2, b=12. Then a,bQ. We have 2(12)=2RQ.

c) HW_11_1c 1.jpg

d) Fix a=0,b=2. Then aQ and bRQ. We have 02=0Q.

e) Fix a=2,b=2. Then aQ and bRQ. We have ab=22.

f) Fix a=2,b=2. Then aRQ and bQ. We have 22=2Q.

g) Fix a=2,b=1. Then aRQ and bQ. We have 21=2RQ.

E 11.2
Disproof. Fix x=0 and y=2. We have xy=0RQ.

E 11.3
Disproof. Fix 6s3=3. Thus s=0ODD.

E 11.4
Disproof. Let xZ. We work directly. There are two cases:

Case 1: Suppose x is odd. Thus x=2k+1 for some kZ. We find

x2+x=(2k+1)1+2k+1=4k2+4k+1+2k+1=2(2k2+3k+1)

is even.

Case 2: Suppose x is even. Thus x=2k for some kZ. We find

x2+x=(2k)2+2k=4k2+2k=2(2k2+k)

is even.

Hence we have for all cases that xZ, if x is odd, then x2+x is even.

E 11.5

Lemma. We are trying to prove that a non-zero rational number times an irrational number is irrational. Let xQ and yRQ where x0. Thus x=mn for some nonzero m,nZ. Assume by way of contradiction that xyQ. Thus xy=jk for some j,kZ. We find

xy=jkmn(y)=jky=jnmk

Since m,n,j,kZ, jnmkQ which contradicts our original assumption that yQ. Thus a nonzero rational number times and irrational number is irrational.

Proof. We work directly. Assume a is a positive rational number. We can break this into two cases:

Case 1: a>2. Thus a possible x=2 which is irrational.

Case 2: a<2. Let x=a2=a(12). Per the lemma, a(12) is irrational. Also, a2 is less than 2.

Thus in all cases, we have xRQ.

E 11.6

Proposition. Given any two real numbers x and y such that x<y, we want to show that there exists a rational number in the interval (x,y).

Proof.

Let x,yR. Let yx>0. We can express yx in decimal form as dkdk1...d1d0.d1d2d3.... Since yx>0, there exists at least one decimal digit that is non-zero; let the first one be dl. Thus the value contributed by dl to yx is at least dl10l1. Since dl is non-zero, we have dl1.

So yx>10l1.

Multiplying the inequality by 10(l1) gives us 10(l1)(yx)>1.

Denoting 10(l1)y as Y and 10(l1)x as X, we obtain YX>1.

Since X and Y are more than 1 apart, there exists an integer n such that X<n<Y.

Given that X=10(l1)x and Y=10(l1)y, we have 10(l1)x<n<10(l1)y.

Rewriting this as x<10l1n<y and denoting 10l1n as q, we find that x<q<y, where q is rational since 10l1n is a product of an integer and a rational number.

Hence, for all real numbers x and y such that x<y, there exists a rational number q in the interval (x,y).