‎let $x$ be a real normed  space, then  $c(subseteq x)$  is  functionally  convex  (briefly, $f$-convex), if  $t(c)subseteq bbb r $ is  convex for all bounded linear transformations $tin b(x,r)$; and $k(subseteq x)$  is  functionally   closed (briefly, $f$-closed), if  $t(k)subseteq bbb r $ is  closed  for all bounded linear transformations $tin b(x,r)$. we improve the    krein-milman theorem  ...

In this paper, a Krein-Milman  type theorem in $T_0$ semitopological cone is proved,  in general. In fact, it is shown that in any locally convex $T_0$ semitopological cone, every convex compact saturated subset is the compact saturated convex hull of its extreme points, which improves the results of Larrecq.

We give a simpler proof of the Gromov–Milman theorem on concentration phenomenon on uniformly convex sphere. We also outline Rohlin’s theory of measurable partitions used in the proof. The purpose of this note is to present a localization technique for the sphere S on an example of the Gromov–Milman theorem [Gr-M] about the concentration phenomenon on uniformly convex spheres. This result was o...

G. Žitković defined the notion of a convexly compact set in a topological space and, among other things, used it to give an extension of the Walrasian excess-demand theorem. We continue the study of convexly compactness in LCS spaces and prove a Krein-Milman theorem in this setting.

A generalization of the classical Leray-Schauder fixed point theorem, based on the infinitedimensional Borsuk-Ulam type antipode construction, is proposed. Two completely different proofs based on the projection operator approach and on a weak version of the well known Krein-Milman theorem are presented. MIRAMARE – TRIESTE May 2007 [email protected]; [email protected]

We construct rather general random ensembles that yield the optimal (isomorphic) estimate in Dvoretzky-Milman Theorem. This is first construction of non gaussian/spherical exhibit behaviour. The constructed here need not satisfy any rotation invariance and can be heavy-tailed.