Math 217 Fall 2013 Homework 2 Solutions

Similar documents
Lectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix

APPENDIX A Some Linear Algebra

Some basic inequalities. Definition. Let V be a vector space over the complex numbers. An inner product is given by a function, V V C

First day August 1, Problems and Solutions

n α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0

Homework Notes Week 7

8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS

Beyond Zudilin s Conjectured q-analog of Schmidt s problem

U.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017

Lecture 10 Support Vector Machines II

763622S ADVANCED QUANTUM MECHANICS Solution Set 1 Spring c n a n. c n 2 = 1.

DISCRIMINANTS AND RAMIFIED PRIMES. 1. Introduction A prime number p is said to be ramified in a number field K if the prime ideal factorization

1 Matrix representations of canonical matrices

princeton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg

SL n (F ) Equals its Own Derived Group

Salmon: Lectures on partial differential equations. Consider the general linear, second-order PDE in the form. ,x 2

CSCE 790S Background Results

Section 3.6 Complex Zeros

Perron Vectors of an Irreducible Nonnegative Interval Matrix

Problem Solving in Math (Math 43900) Fall 2013

Problem Do any of the following determine homomorphisms from GL n (C) to GL n (C)?

COMPLEX NUMBERS AND QUADRATIC EQUATIONS

Affine transformations and convexity

= = = (a) Use the MATLAB command rref to solve the system. (b) Let A be the coefficient matrix and B be the right-hand side of the system.

Lecture 20: Lift and Project, SDP Duality. Today we will study the Lift and Project method. Then we will prove the SDP duality theorem.

MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS

18.781: Solution to Practice Questions for Final Exam

THE CHINESE REMAINDER THEOREM. We should thank the Chinese for their wonderful remainder theorem. Glenn Stevens

STEINHAUS PROPERTY IN BANACH LATTICES

For all questions, answer choice E) NOTA" means none of the above answers is correct.

More metrics on cartesian products

REAL ANALYSIS I HOMEWORK 1

332600_08_1.qxp 4/17/08 11:29 AM Page 481

Bernoulli Numbers and Polynomials

Math1110 (Spring 2009) Prelim 3 - Solutions

2.3 Nilpotent endomorphisms

Min Cut, Fast Cut, Polynomial Identities

Causal Diamonds. M. Aghili, L. Bombelli, B. Pilgrim

Important Instructions to the Examiners:

Math 426: Probability MWF 1pm, Gasson 310 Homework 4 Selected Solutions

Problem Set 9 Solutions

A FORMULA FOR COMPUTING INTEGER POWERS FOR ONE TYPE OF TRIDIAGONAL MATRIX

Yong Joon Ryang. 1. Introduction Consider the multicommodity transportation problem with convex quadratic cost function. 1 2 (x x0 ) T Q(x x 0 )

Randić Energy and Randić Estrada Index of a Graph

Math 594. Solutions 1

Georgia Tech PHYS 6124 Mathematical Methods of Physics I

Errors for Linear Systems

Foundations of Arithmetic

A New Refinement of Jacobi Method for Solution of Linear System Equations AX=b

Lecture 10 Support Vector Machines. Oct

MATH Homework #2

Lecture 3. Ax x i a i. i i

Lecture 5 Decoding Binary BCH Codes

CALCULUS CLASSROOM CAPSULES

STAT 309: MATHEMATICAL COMPUTATIONS I FALL 2018 LECTURE 16

and problem sheet 2

Solutions to exam in SF1811 Optimization, Jan 14, 2015

Lecture Notes on Linear Regression

6.854J / J Advanced Algorithms Fall 2008

Linear, affine, and convex sets and hulls In the sequel, unless otherwise specified, X will denote a real vector space.

A CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS

Complex Numbers Alpha, Round 1 Test #123

General viscosity iterative method for a sequence of quasi-nonexpansive mappings

International Mathematical Olympiad. Preliminary Selection Contest 2012 Hong Kong. Outline of Solutions

Additional Codes using Finite Difference Method. 1 HJB Equation for Consumption-Saving Problem Without Uncertainty

Modelli Clamfim Equazione del Calore Lezione ottobre 2014

Report on Image warping

Section 8.3 Polar Form of Complex Numbers

Lecture 4: Universal Hash Functions/Streaming Cont d

PRIMES 2015 reading project: Problem set #3

ISSN: ISO 9001:2008 Certified International Journal of Engineering and Innovative Technology (IJEIT) Volume 3, Issue 1, July 2013

(2mn, m 2 n 2, m 2 + n 2 )

(c) (cos θ + i sin θ) 5 = cos 5 θ + 5 cos 4 θ (i sin θ) + 10 cos 3 θ(i sin θ) cos 2 θ(i sin θ) 3 + 5cos θ (i sin θ) 4 + (i sin θ) 5 (A1)

HMMT February 2016 February 20, 2016

On cyclic of Steiner system (v); V=2,3,5,7,11,13

On quasiperfect numbers

Stanford University CS359G: Graph Partitioning and Expanders Handout 4 Luca Trevisan January 13, 2011

The Order Relation and Trace Inequalities for. Hermitian Operators

Christian Aebi Collège Calvin, Geneva, Switzerland

On Finite Rank Perturbation of Diagonalizable Operators

p 1 c 2 + p 2 c 2 + p 3 c p m c 2

COS 521: Advanced Algorithms Game Theory and Linear Programming

MAT 578 Functional Analysis

Lecture 21: Numerical methods for pricing American type derivatives

First Year Examination Department of Statistics, University of Florida

Composite Hypotheses testing

THE CHVÁTAL-ERDŐS CONDITION AND 2-FACTORS WITH A SPECIFIED NUMBER OF COMPONENTS

Solutions to the 71st William Lowell Putnam Mathematical Competition Saturday, December 4, 2010

Ph 219a/CS 219a. Exercises Due: Wednesday 23 October 2013

FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP

Determinants Containing Powers of Generalized Fibonacci Numbers

Math 261 Exercise sheet 2

COS 511: Theoretical Machine Learning. Lecturer: Rob Schapire Lecture # 15 Scribe: Jieming Mao April 1, 2013

C/CS/Phy191 Problem Set 3 Solutions Out: Oct 1, 2008., where ( 00. ), so the overall state of the system is ) ( ( ( ( 00 ± 11 ), Φ ± = 1

MTH 819 Algebra I S13. Homework 1/ Solutions. 1 if p n b and p n+1 b 0 otherwise ) = 0 if p q or n m. W i = rw i

( ) 2 ( ) ( ) Problem Set 4 Suggested Solutions. Problem 1

However, since P is a symmetric idempotent matrix, of P are either 0 or 1 [Eigen-values

10-801: Advanced Optimization and Randomized Methods Lecture 2: Convex functions (Jan 15, 2014)

LECTURE V. 1. More on the Chinese Remainder Theorem We begin by recalling this theorem, proven in the preceeding lecture.

Difference Equations

Transcription:

Math 17 Fall 013 Homework Solutons Due Thursday Sept. 6, 013 5pm Ths homework conssts of 6 problems of 5 ponts each. The total s 30. You need to fully justfy your answer prove that your functon ndeed has the specfed property for each problem. Please read ths week s lecture notes before workng on the problems. Queston 1. The followng are several possble strateges to prove Cauchy-Schwarz: x y x 1 y 1 + + x N y N (x 1 + +x N ) 1/ (y 1 + + y N ) 1/ x y. (1) Pck any one (or come up wth your own) dea and wrte down a detaled proof. Approach 1. Mathematcal nducton. Approach. Let t R. Then (x ty) (x ty) 0 for all t. Wrte the left hand sde as a quadratc polynomal of t. Approach 3. Use x y ( x ) (y k) 1 k (x k + y k ). Choose approprate k. Soluton. Approach 1. Though the case N 1 s trval. For reasons that wll be clear n a few lnes, we have to prove N. Ths s done n Sept. 16 s lecture and s omtted here. Now we try to prove the case N k + 1 assumng We have x 1 y 1 + +x k y k (x 1 + +x k ) 1/ (y 1 + + y k ) 1/ () x 1 y 1 + +x k y k + x k+1 y k+1 x 1 y 1 + + x k y k + x k+1 y k+1 Note that n the last nequalty we have used the N case. (x 1 + +x k ) 1/ (y 1 + + y k ) 1/ + x k+1 y k+1 ((x 1 + + x k )+ x k+1 ) 1/ ((y 1 + + y k ) + y k+1 ) 1/ (x 1 + +x k+1 ) 1/ (y 1 + + y k+1 ) 1/. (3) Approach. Snce (x ty) (x ty) (y y) t (x y) t+(x x), the fact that t s non-negatve mples whch gves Cauchy-Schwarz. [ (x y)] 4 (y y)(x x) 0 (4) Approach 3. Let k R to be determned later. We have x 1 y 1 + + x N y N 1 [ ] x1 + +x N k +k (y 1 + + y N ). (5) 1

Math 17 Fall 013 Homework Solutons Now take The proof ends. k (x 1 + + x N ) 1/ (y 1 + + y N ) 1/. (6) Queston. Let E R N. Defne ts dstance functon d: R N R as d(x) 6 Prove that x, y R N, d(x) d(y) x y. nf dst(x, y) nf x y. (7) y E y E Proof. Frst we prove d(x) d(y) x y. We have, for any z E, d(x) dst(y, z) nf dst(x, w) dst(y,z) w E dst(x, z) dst(y,z) x z y z x y. (8) Here we appled trangle s nequalty n the last nequalty. Note that x y s ndependent of z. Therefore we can take nfmum and obtan d(x) d(y) d(x) nf dst(y, z) x y. (9) z E Fnally notcng the symmetry between x and y, we have d(y) d(x) y x x y. (10) Summarzang the above, we have d(x) d(y) x y. Queston 3. a) Prove that the followng are both norms on R N : x 6 max { x }; x 1 6 x 1 + x + + x N ; (11) 1,,N b) Let X be a lnear vector space wth norm. Prove the followng: If one can defne an nner product (, ) such that x (x, x) 1/, then for any x, y X, x + y + x y ( x + y ). (1) c) Fnd a norm on R N that cannot be defned through an nner product. Justfy your answer. Soluton. a) We check. x 6 max 1,,N { x } 0; x 0 max x 0 x 0 for all 1,,, N x0; x 1 6 x 1 + x + + x N 0; x 1 0 x 1 + x + + x N 0 x 0 max x 0 x 0 for all 1,,,N x0.. a x max { a x } max { a x } a max { x } a x ; ax 1 ax 1 + ax + + a x N a ( x 1 + x + + x N ) a x 1.

Due Thursday Sept. 6, 013 5pm 3. (Trangle nequalty). x+ y max x + y max ( x + y ) max x +max y x + y. (13) x+ y 1 x 1 + y 1 + x + y + + x N + y N x 1 + y 1 + + x N + y N ( x 1 + x + + x N ) +( y 1 + y + + y N ) x 1 + y 1. (14) b) We have x + y + x y (x+ y,x+ y) +(x y,x y) (x, x) + (x, y) + (y, x) +(y, y) +(x,x)+ (x, y) +( y, x) +( y, y) (x, x) + (x, y) +(y, y) +(x,x) (x, y)+ (y, y) [(x,x) +(y, y)] ( x + y ). (15) c) Take. All we need to show s that t does not satsfy the equalty proved n b). Take xe 1, y e. Then we have x+ y x y x y 1. The equalty s not satsfed. Queston 4. Let O R N N be such that O x x for any x R N. Prove that O s orthogonal. Please prove t drectly and do not use any theorem from lnear algebra. Proof. Frst we show that (O x) (O y) x y for all x, y R N. To see ths we calculate x x+x y + y y (x + y) (x + y) The clam follows. Recallng x y x T y, we have Thus we have shown for all x, y R N. Takng y e 1, [O(x + y)] [O(x+ y)] (O x) (O x) +(O x) (O y) +(O y) (O y) O x + (O x) (O y) + O y x +(O x) (O y) + y x x+(o x) (O y) + y y. (16) (O x) (O y) (O x) T (Oy) x T O T O y [O T O x] T y (O T O x) y. (17), e N, we see that [(O T O x) x] y 0 (18) O T O xx (19)

4 Math 17 Fall 013 Homework Solutons for all x R N. Fnally takng xe 1,, e N we see that O T O I, that s the matrx O s orthogonal. Queston 5. Let D dag(d 1,,d N ) be a dagonal matrx wth all the d s dstnct. Let A R N N be such that AD DA. What can we conclude about A? Justfy your answer. Proof. The (, j) entry for A D s d j a j whle the (, j) entry for D A s d a j. Thus we have (d d j ) a j 0 (0) for all, j 1,, N. As d s are dstnct, ths means a j 0 when j, that s A s dagonal. It s clear that f A s dagonal, then A D D A. Thus we have fully characterzed the matrces that commute wth a dagonal matrx wth dstnct man dagonal entres. Queston 6. (Twn Prme Conjecture) Earler ths year, Prof. Ytang Zhang of Unversty of New Hampshre made hstory through provng the followng result: where p n s the n-th prme number. lmnf (p n+1 p n ) <7 10 7 (1) n a) Prove that the Twn Prme Conjecture There are nfntely many pars of prme numbers wth dfference s equvalent to lmnf n (p n+1 p n ). () b) One step of hs proof s bascally the followng. Assume (θ,d, c) x(log x) A, (3) for some A > 0 and (θ, d, c) x(log x)/d; c C (d) τ 3 (d) ρ (d) d 1 (log x) B (4) Proof. for some B >0. Then we have E 6 τ 3 (d) ρ (d) c C (d) for any A > 0. Prove the above clam usng Cauchy-Schwarz. a) If lmnf n (p n+1 p n ), then there s a subsequence satsfyng Consequently, there s K N such that for all k > K, x(log x)b+1 A. (5) lmnf (p n k +1 p nk ). (6) k p nk +1 p nk <1/. (7) But the left hand sde s an nteger, so t must be 0. That s there are nfntely many pars of prme numbers wth dfference.

Due Thursday Sept. 6, 013 5pm 5 b) We have E ( τ 3 (d) ρ (d) ( ( c C (d) ( ( τ3 (d) ρ (d) (θ, d, c) 1/)( 1/) ( τ3 (d) ρ (d) (θ,d,c) 1/) ) 1/ ( ) ( 1/ (τ 3 (d) ρ (d) (θ,d,c) τ 3 (d) ρ (d) [ c C (d) ) 1/ (θ, d, c) (θ,d, c) ] 1/ (x(log x) A ) 1/ ) 1/ τ 3 (d) ρ (d) d 1 x (log x) (x (log x) A ) 1/ x 1/ (log x) B+1 x 1/ (log x) A/ x (log x) B+1 A. ) 1/ ) 1/ (8)