Prove (4) by breaking the proof into cases akin to the proof of Theorem 1.1.
x·y ≤ |x·y| = |x|·|y| for all x,y∈R. (4)
(for reference)
Theorem 1.1 (Triangle inequality).
|x+y|≤|x|+|y| forallx,y∈R. (3)
Proof. To prove (3), we consider each possible case so to be
able to exploit the definition (1).Case 1: x ≥ 0, y ≥ 0. We then
have by (1) that |x| = x, |y| = y, and |x + y| = x + y, and so (3)
holds as an equality.
Case 2: x < 0, y < 0. We then have by (1) that |x| = −x, |y|
= −y, and |x + y| = −x − y, and so again (3) holds as an
equality.
Case3: x<0,y≥0,x+y≤0.
Wethenhaveby(1)that|x|=−x,|y|=y,and|x+y|=−x−y. We see now
|x + y| = −x − y ≤ −x + y = |x| + |y|since −y ≤ 0 ≤ y and so (3) holds.
Case 4: x < 0, y ≥ 0, x + y ≥ 0. We now have |x| = −x, |y| = y, and |x + y| = x + y, and deduce|x + y| = x + y ≤ −x + y = |x| + |y|
2
since x < 0 < −x.
Case 5: The only other cases are where the roles of x and y in
cases 3 and 4 are switched, and so (3) holds then as well.
x·y |x·y| = |x|·|y| for all x,y R. (4)
To prove (4), we consider each possible case.
Case 1: x 0, y 0 , then |x| = x, |y| = y => |x| . |y| = x . y
Also, x 0, y 0 => x . y 0. Thus, |x·y| = x . y
So, |x·y| = x . y = |x| . |y| , and so (4) holds as an equality.
Case 2: x < 0, y < 0. then |x| = -x, |y| = -y => |x| . |y|
= (-x) . (-y) = x . y
Also, x < 0, y < 0 => x . y 0. Thus, |x·y| = x . y
So, |x·y| = x . y = |x| . |y| , and so (4) holds as an equality.
Case3: x<0, y 0, then |x| = -x,
|y| = y => |x| . |y| = (-x) . (y) = - x . y
Also, |x . y| = (-x) .y = -x . y
Thus, |x . y| = |x| . |y|
Also, x<0, y 0, => x . y < 0
As, |x| > 0, |y| > 0 => |x| . |y| > 0
=> x . y < 0 < |x| . |y|
Thus,
x . y < |x . y| = |x| . |y|
and so (4) holds.
Case 4: x 0, y < 0,
then |x| = x, |y| = -y => |x| . |y| = (x) . (-y) = - x . y
Also, |x . y| = x . (-y) = - x. y
Thus, |x . y| = |x| . |y|
Also, x 0, y < 0, => x . y < 0
As, |x| > 0, |y| > 0 => |x| . |y| > 0
=> x . y < 0 < |x| . |y|
Thus,
x . y < |x . y| = |x| . |y|
and so (4) holds.
Prove (4) by breaking the proof into cases akin to the proof of Theorem 1.1. x·y...
In the following problem, we will work through a proof of an important theorem of arithmetic. Your job will be to read the proof carefully and answer some questions about the argument. Theorem (The Division Algorithm). For any integer n ≥ 0, and for any positive integer m, there exist integers d and r such that n = dm + r and 0 ≤ r < m. Proof: (By strong induction on the variable n.) Let m be an arbitrary...
3-2. Prove Theorem 3.2. Theorem 3.2 Let I S R be an open interval, xe I, and let f. 8:1\{x} → R be functions. If there is a number 8 > 0 so that f and g are equal on the subset 12 € 7\(x): 13-X1 < 8 of I\(x), then f converges at x iff g converges at x and in this case the equality lim f(x) = lim g(z) holds.
Prove Theorem 4.2.21. The Singular Value Decomposition. PROVE THAT IF MATRIX A element of R^n*n Theorem 4.2.21. Let A e Rnxn. Then ||A| Definition 4.2.2. On R" we will use the standard inner product (7.7) = .2.2015 j=1 | 7 ||2=1 Theorem 4.2.20. Let A € R"X". Then ||A||2 = 01. Proof: Let AE Rnxn and let Let A=USVT be an SVD of A. We have || A||2 = max || 17 || 2 = max, ||UEV17 || 2 =...
Prob. 12.8 Criticize the following 'proof that r = 0. (a) Apply Green's theorem in a plane to the functions P(x, y) = tan-(y/x) and Q(x, y) = tan-'(x/y), taking the region R to be the unit circle centered on the origin. (b) The RHS of the equality so produced is S SR dxdy, which, either from symmetry considerations or by changing to plane polar coordinates, can be shown to have zero value. (c) In the LHS of the equality,...
And Heres theorem 10.1 Prove that the relation VR of Theorem 10,1 is an equivalence relation. ① show that a group with at least two elements but with no proper nontrivite subgroups must be finite and of prime order. 10.1 Theorem Let H be a subgroup of G. Let the relation ~1 be defined on G by a~lb if and only if albe H. Let ~R be defined by a~rb if and only if ab- € H. Then ~1 and...
Please do exercise 129: Exercise 128: Define r:N + N by r(n) = next(next(n)). Let f:N → N be the unique function that satisfies f(0) = 2 and f(next(n)) =r(f(n)) for all n E N. 102 1. Prove that f(3) = 8. 2. Prove that 2 <f(n) for all n E N. Exercise 129: Define r and f as in Exercise 128. Assume that x + y. Define r' = {(x,y),(y,x)}. Let g:N + {x,y} be the unique function that...
prove properties 2,4,6,8 of theorem 1.1 3. Theorem 1.1 R” as defined above has the following properties: 0. For all u, v eR” and a € R, we have u + v, au € R”. 1. For all u, v ER", u +v=v+u. 2. For all u, v, w ER", (u + v) + w = u + (v + w). There exists 0 ER", such that for all u ER", u+0=u. For each u € R” there is a...
Problem 3. Prove Theorem 1 as tollows [Assume all conditions of the Theorem are met. In many parts, it will be useful to consider the sign of the right side of the formula-positive or negative- ad to write the appropriate inequality] (a) Since f"(x) exists on [a, brx) is continuous on [a, b) and differentiable on (a,b), soMean Value Thorem applies to f,on this interval. Apply MVTtof"m[x,y], wherc α zcysb. to show that ry)2 f,(x), İ.e. that f, is increasing...
Question 1 We prove 0x = 0 as below. Which method of proof did we use? X=X X-x = 0 (1-1)x =0 0x =0 direct proof proof by cases proof by contrapositive Question 2 If direct proof is used to prove the following statement: If x is a real number and x s 3, then 12 - 7x + x*x > 0. What is the hypothesis? 12- 7x+x*x>0 If x is a real number and xs 3 12-7x+x*x<0 If x is not a real number or x > 3 Question 3 If proof by contrapositive is used...
I need to solve q3. Please write clean and readable. Thanks. 1. PRELIMINARY DISCUSSION 1.1. Goal. The goal of this assignment is to use Green's Theorem and line integrals to prove the following theorem. Theorem 1. Let S denote the closed unit ball in R2, that is, S := {x E R2 : 1-1 Assume that F : S → R2 is a function of class C2 such that F(x) = x for all x E as. Then it cannot...