This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: MATHEMATICS 116, FALL 2007 CONVEXITY AND OPTIMIZATION WITH APPLICATIONS Assignment #8 Last modified: November 14, 2007 Due Tuesday, Nov. 20 at class. 1. Luenberger, Problem 5.14.1. 2. Luenberger, Problem 5.14.3. Explain why this result shows that the dual of l cannot be l 1 . Hint: Choose a countable dense subset of the unit sphere in X * : the ele ments of X * for which  x *  = 1. For each x * n in this subset, choose a vector x n for which  < x n  x * n >  is close to 1 (say bigger than 1 2 ). Now form the closure of the space Y generated by all these x n . Prove (easily) that this space is separable. If it also equals X , you are done. So assume that X contains an element x that is not in Y , and show that this assumption leads to a contradiction. 3. Luenberger, Problem 5.14.2. This is challenging. Both dual spaces are isomorphic to l 1 , but if the isomorphism is different they are not identical. For c you can use an approach that parallels the one for l p and l 1...
View
Full
Document
This document was uploaded on 08/30/2011.
 Fall '09
 Math

Click to edit the document details