Introduction edit

For  -norms are a generalization of norms. The definition requires the notion of (absolute)  -convex hull (see Köthe 1966[1]).

Definition: p-convex edit

Let   be a subset of a vector space   and  , then   is called  -convex if   fulfills the following property:

 

Definition: absolute p-convex edit

Let   be a subset of a vector space   and  , then   is said to be absolutely  -convex if   fulfills the following property:

 

Definition: p-convex hull edit

The  -convex hull of the set   (label:  ) is the intersection over all  -convex sets containing  .

 

Definition: absolute p-convex hull edit

The absolutely  -convex hull of the set   (label:  ) is the section over all absolutely  -convex sets containing  .

 

Lemma: Display of the absolutely p-convex hull edit

Let   be a subset of a vector space   over the body   and  , then the absolute  -convex hull of   can be written as follows:

 

Proof edit

3 subassertions are shown, where (1) and (2) gives   and (3) gives the subset relation  .

  • (Proof part 1)  ,
  • (Proof part 2)   is absolutely  -convex and.
  • (Proof part 3)   is contained in any absolutely  -convex set  .


Proof part 1 edit

 , because  

Proof part 2 edit

Now let   and   be given. One must show that  .

Proof Part 2.1 - Absolute p-convex edit

Let   now have   the following representations:

  •   with  
  •   with  .

Now we have to show that the absolute  -convex combination is an element of  , i.e.  


proof-part-2.2-absolutely-p-convex edit

  is absolutely  -convex, because it holds with  :

 

This gives:

 

Proof Part 2.3 - Zero Vector edit

 , because it holds   with   and any   gets  .

Proof part 3 edit

We now show that the absolutely  -convex hull is contained in every absolutely  -convex superset   of  .

Proof Part 3.1 - Induction over Number of Summands edit

Now let us show inductively via the number of summands   that every element of the form

 

in a given absolutely  -convex set   is contained.

Proof Part 3.2 - Induction Start edit

For  , the assertion follows via the definition of an absolutely  -convex set  .

Proof Part 3.3 - Induction Precondition edit

Now let the condition for   hold, i.e.:

 

Proof Part 3.4 - Induction Step edit

For  , the assertion follows as follows:

Let   and   with   for all  .   is now to be proved.

Proof Part 3.5 - Induction Step edit

If  , then there is nothing to show, since then all   are for   .

Proof Part 3.6 - Constructing a p-convex combination of n summands edit

We now construct a sum of non-negative summands  

 

Proof part 3.7 - Application of the induction assumption edit

So let  . The inequality

 

Returns after induction assumption  .


Proof Part 3.8 - Induction Step edit

Since   is absolutely  -convex, it follows with  

 

Proof 4 edit

From the proof parts  ,   and   together the assertion follows.  

Lemma: p-convex hull edit

Let   be a subset of a vector space   over the body   and  , then the Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "http://localhost:6011/en.wikiversity.org/v1/":): {\textstyle p} -convex hull of   can be written as follows:

 

Proof: task for learners edit

Transfer the above proof analogously to the  -convex hull.


See also edit

References edit

  1. Gottfried Köthe (1966) Topological Vector Spaces, 15.10, pp.159-162.

Page Information edit

You can display this page as Wiki2Reveal slides

Wiki2Reveal edit

The Wiki2Reveal slides were created for the Inverse-producing extensions of Topological Algebras' and the Link for the Wiki2Reveal Slides was created with the link generator.