This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Chapter II Elements of Functional Analysis Lecture 8 1. HahnBanach Theorems The result we are going to discuss is one of the most fundamental theorems in the whole field of Functional Analysis. Its statement is simple but quite technical. Definitions. Let K be either of the fields R or C . Suppose X is a Kvector space. A. A map q : X → R is said to be a quasiseminorm , if (i) q ( x + y ) ≤ q ( x ) + q ( y ), for all x,y ∈ X ; (ii) q ( tx ) = tq ( x ), for all x ∈ X and all t ∈ R with t ≥ 0. B. A map q : X → R is said to be a seminorm if, in addition to the above two properties, it satisfies: (ii’) q ( λx ) =  λ  q ( x ), for all x ∈ X and all λ ∈ K . Remark that if q : X → R is a seminorm, then q ( x ) ≥ 0, for all x ∈ X . (Use 2 q ( x ) = q ( x ) + q ( x ) ≥ q (0) = 0.) There are several versions of the HahnBanach Theorem. Theorem 1.1 (HahnBanach, Rversion) . Let X be an Rvector space. Suppose q : X → R is a quasiseminorm. Suppose also we are given a linear subspace Y ⊂ X and a linear map φ : Y → R , such that φ ( y ) ≤ q ( y ) , for all y ∈ Y . Then there exists a linear map ψ : X → R such that (i) ψ Y = φ ; (ii) ψ ( x ) ≤ q ( x ) for all x ∈ X . Proof. We first prove the Theorem in the following: Particular Case : Assume dim X / Y = 1 . This means there exists some vector x ∈ X such that X = { y + sx : y ∈ Y , s ∈ R } . What we need is to prescribe the value ψ ( x ). In other words, we need a number α ∈ R such that, if we define ψ : X → R by ψ ( y + sx ) = φ ( y )+ sα , ∀ y ∈ Y , s ∈ R , then this map satisfies condition (ii). For s > 0, condition (ii) reads: φ ( y ) + sα ≤ q ( y + sx ) , ∀ y ∈ Y , s > , and, upon dividing by s (set z = s 1 y ), is equivalent to: (1) α ≤ q ( z + x ) φ ( z ) , ∀ z ∈ Y . For s < 0, condition (ii) reads (use t = s ): φ ( y ) tα ≤ q ( y tx ) , ∀ y ∈ Y , t > , 53 54 LECTURE 8 and, upon dividing by t (set w = t 1 y ), is equivalent to: (2) α ≥ φ ( w ) q ( w x ) , ∀ w ∈ Y . Consider the sets Z = { q ( z + x ) φ ( z ) ; z ∈ Y} ⊂ R W = { φ ( w ) q ( w x ) : w ∈ Y} ⊂ R . The conditions (1) and (2) are equivalent to the inequalities (3) sup W ≤ α ≤ inf Z. This means that, in order to find a real number α with the desired property, it suffices to prove that sup W ≤ inf Z , which in turn is equivalent to (4) φ ( w ) q ( w x ) ≤ q ( z + x ) φ ( z ) , ∀ z.w ∈ Y . But the condition (4) is equivalent to φ ( z + w ) ≤ q ( z + x ) + q ( w x ) , which is obviously satisfied because φ ( z + w ) ≤ q ( z + w ) = q ( ( z + x ) + ( w x ) ) ≤ q ( z + x ) + q ( w x ) . Having proved the Theorem in this particular case, let us proceed now with the general case. Let us consider the set Ξ of all pairs ( Z ,ν ) with • Z is a subspace of X such that Z ⊃ Y ; • ν : Z → R is a linear functional such that (i) ν Y = φ ; (ii) ν ( z ) ≤ q ( z ), for all z ∈ Z ....
View
Full
Document
This note was uploaded on 10/11/2010 for the course MATH 11 taught by Professor Smith during the Three '10 term at ADFA.
 Three '10
 Smith

Click to edit the document details