Solving discrete systems of nonlinear equations

We study the existence problem of a zero point of a function defined on a finite set of elements of the integer lattice Zⁿ of the n-dimensional Euclidean space Rⁿ. It is assumed that the set is integrally convex, which implies that the convex hull of the set can be subdivided in simplices such that every vertex is an element of Zⁿ and each simplex of the triangulation lies in an n-dimensional cube of size one. With respect to this triangulation we assume that the function satisfies some property that replaces continuity. Under this property and some boundary condition the function has a zero point. To prove this we use a simplicial algorithm that terminates with a zero point within a finite number of iterations. The standard technique of applying a fixed point theorem to a piecewise linear approximation cannot be applied, because the ‘continuity property’ is too weak to assure that a zero point of the piecewise linear approximation induces a zero point of the function itself. We apply the main existence result to prove the existence of a pure Cournot-Nash equilibrium in a Cournot oligopoly model. We further obtain a discrete analogue of the well-known Borsuk-Ulam theorem and a theorem for the existence of a solution for the discrete nonlinear complementarity problem.     

On C‐Suslin spaces

We prove a closed graph theorem for Baire locally convex spaces (for Baire linear topological spaces) in the domain and weakly C‐Suslin locally convex spaces (respectively, for C‐Suslin linear topological spaces) in the range which improves some classic closed graph theorems and other, more recent, related results.     

On the closedness of the algebraic difference of closed convex sets

We characterize in a reflexive Banach space all the closed convex sets C₁ containing no lines for which the condition C₁^∞∩C₂^∞={0} ensures the closedness of the algebraic difference C₁−C₂ for all closed convex sets C₂. We also answer a closely related problem: determine all the pairs C₁, C₂ of closed convex sets containing no lines such that the algebraic difference of any sufficiently small uniform perturbations of C₁ and C₂ remains closed. As an application, we state the broadest setting for the strict separation theorem in a reflexive Banach space.     

Representation of Bounded Convex Sets By Rational Convex Hull Of Its Gamma-Extreme Points

H. Minkowski proved C= convext C whenever C is a compact convex subset of a finite-dimensional linear space. If C is bounded but not closed, this representation does not hold anymore. In this case, we introduce the set of so-called γ-extreme points extγC of C and show C = convext γ C = raco extγ C, where raco M denotes the rational convex hull of M.     

Convex Hulls of Integral Points

The convex hull of all integral points contained in a compact polyhedron C is obviously a compact polyhedron. If C is not compact, then the convex hull K of its integral points need not be a closed set. However, under some natural assumptions, K is a closed set and a generalized polyhedron. Bibliography: 11 titles.     

Best interpolation in seminorm with convex constraints

Implicit and explicit characterizations of the solutions to the following constrained best interpolation problem $$\min \left\{ {\left\| {Tx - z} \right\|:x \in C \cap A^{ - 1} d} \right\}$$ are presented. Here,T is a densely-defined, closed, linear mapping from a Hilbert spaceX to a Hilbert spaceY, A: X→Z is a continuous, linear mapping withZ a locally, convex linear topological space,C is a closed, convex set in the domain domT ofT, andd∈AC. For the case in whichC is a closed, convex cone, it is shown that the constrained best interpolation problem can generally be solved by finding the saddle points of a saddle function on the whole space, and, if the explicit characterization is applicable, then solving this problem is equivalent to solving an unconstrained minimization problem for a convex function.     

The Empty Hexagon Theorem

Let P be a finite set of points in general position in the plane. Let C(P) be the convex hull of P and let Cⁱ_P be the ith convex layer of P. A minimal convex set S of P is a convex subset of P such that every convex set of P ∩ C(S) different from S has cardinality strictly less than |S|. Our main theorem states that P contains an empty convex hexagon if C¹_P is minimal and C⁴_P is not empty. Combined with the Erdos-Szekeres theorem, this result implies that every set P with sufficiently many points contains an empty convex hexagon, giving an affirmative answer to a question posed by Erdos in 1977.     

A generalized localization theorem and geometric inequalities for convex bodies

In this article, we generalize a localization theorem of Lovász and Simonovits [Random walks in a convex body and an improved volume algorithm, Random Struct. Algorithms 4-4 (1993) 359-412] which is an important tool to prove dimension-free functional inequalities for log-concave measures. In a previous paper [Fradelizi and Guédon, The extreme points of subsets of s-concave probabilities and a geometric localization theorem, Discrete Comput. Geom. 31 (2004) 327-335], we proved that the localization may be deduced from a suitable application of Krein-Milman's theorem to a subset of log-concave probabilities satisfying one linear constraint and from the determination of the extreme points of its convex hull. Here, we generalize this result to more constraints, give some necessary conditions satisfied by such extreme points and explain how it may be understood as a generalized localization theorem. Finally, using this new localization theorem, we solve an open question on the comparison of the volume of sections of non-symmetric convex bodies in Rⁿ by hyperplanes. A surprising feature of the result is that the extremal case in this geometric inequality is reached by an unusual convex set that we manage to identify.     

Erdős–Szekeres Theorem for Lines

According to the Erd?s–Szekeres theorem, for every n, a sufficiently large set of points in general position in the plane contains n in convex position. In this note we investigate the line version of this result, that is, we want to find n lines in convex position in a sufficiently large set of lines that are in general position. We prove almost matching upper and lower bounds for the minimum size of the set of lines in general position that always contains n in convex position. This is quite unexpected, since in the case of points, the best known bounds are very far from each other. We also establish the dual versions of many variants and generalizations of the Erd?s–Szekeres theorem.     

Approximate fixed points of nonexpansive mappings in unbounded sets

It follows from Banach’s fixed point theorem that every nonexpansive self-mapping of a bounded, closed and convex set in a Banach space has approximate fixed points. This is no longer true, in general, if the set is unbounded. Nevertheless, as we show in the present paper, there exists an open and everywhere dense set in the space of all nonexpansive self-mappings of any closed and convex (not necessarily bounded) set in a Banach space (endowed with the natural metric of uniform convergence on bounded subsets) such that all its elements have approximate fixed points.     

Quotient-bounded elements in locally convex algebras. II

Consideration of quotient-bounded elements in a locally convexGB ^*-algebra leads to the study of properGB ^*-algebras viz those that admit nontrivial quotient-bounded elements. The construction and structure of such algebras are discussed. A representation theorem for a properGB ^*-algebra representing it as an algebra of unbounded Hilbert space operators is obtained in a form that unifies the well-known Gelfand-Naimark representation theorem forC ^*-algebra and two other representation theorems forb ^*-algebras (also calledlmc ^*-algebras), one representinga b ^*-algebra as an algebra of quotient bounded operators and the other as a weakly unbounded operator algebra. A number of examples are discussed to illustrate quotient-bounded operators. An algebra of unbounded operators constructed out of noncommutativeL ^p-spaces on a regular probability gauge space and the convolution algebra of periodic distributions are analyzed in detail; whereas unbounded Hilbert algebras andL ^w-integral of a measurable field ofC ^*-algebras are discussed briefly.     

On the Stability of the Motzkin Representation of Closed Convex Sets

A set is called Motzkin decomposable when it can be expressed as the Minkowski sum of a compact convex set with a closed convex cone. This paper analyzes the continuity properties of the set-valued mapping associating to each couple $\left( C,D\right) $ formed by a compact convex set C and a closed convex cone D its Minkowski sum C?+?D. The continuity properties of other related mappings are also analyzed.     

Ball and spindle convexity with respect to a convex body

Let ${C \subset \mathbb{R}^n}$ be a convex body. We introduce two notions of convexity associated to C. A set K is C-ball convex if it is the intersection of translates of C, or it is either ${\emptyset}$ , or ${\mathbb{R}^n}$ . The C-ball convex hull of two points is called a C-spindle. K is C-spindle convex if it contains the C-spindle of any pair of its points. We investigate how some fundamental properties of conventional convex sets can be adapted to C-spindle convex and C-ball convex sets. We study separation properties and Carathéodory numbers of these two convexity structures. We investigate the basic properties of arc-distance, a quantity defined by a centrally symmetric planar disc C, which is the length of an arc of a translate of C, measured in the C-norm that connects two points. Then we characterize those n-dimensional convex bodies C for which every C-ball convex set is the C-ball convex hull of finitely many points. Finally, we obtain a stability result concerning covering numbers of some C-ball convex sets, and diametrically maximal sets in n-dimensional Minkowski spaces.     

A converse to the Eidelheit theorem in real Hilbert spaces

We establish the following converse to the Eidelheit theorem: an unbounded closed and convex set of a real Hilbert space may be separated by a closed hyperplane from every other disjoint closed and convex set, if and only if it has a finite codimension and a non-empty interior with respect to its affine hull.     

Uniform asymptotic regularity for Mann iterates

In Numer. Funct. Anal. Optim. 22 (2001) 641-656, we obtained an effective quantitative analysis of a theorem due to Borwein, Reich, and Shafrir on the asymptotic behavior of general Krasnoselski-Mann iterations for nonexpansive self-mappings of convex sets C in arbitrary normed spaces. We used this result to obtain a new strong uniform version of Ishikawa's theorem for bounded C. In this paper we give a qualitative improvement of our result in the unbounded case and prove the uniformity result for the bounded case under the weaker assumption that C contains a point x whose Krasnoselski-Mann iteration (x_k) is bounded. We also consider more general iterations for which asymptotic regularity is known only for uniformly convex spaces (Groetsch). We give uniform effective bounds for (an extension of) Groetsch's theorem which generalize previous results by Kirk, Martinez-Yanez, and the author.     

Geometrical coefficients and the structure of the fixed-point set of asymptotically regular mappings in Banach spaces

It is shown that if E is a separable and uniformly convex Banach space with Opial’s property and C is a nonempty bounded closed convex subset of E, then for some asymptotically regular self-mappings of C the set of fixed points is not only connected but even a retract of C. Our results qualitatively complement, in the case of a uniformly convex Banach space, a corresponding result presented in [T. Domínguez, M.A. Japón, G. López, Metric fixed point results concerning measures of noncompactness mappings, in: W.A. Kirk, B. Sims (Eds.), Handbook of Metric Fixed Point Theory, Kluwer Acad. Publishers, Dordrecht, 2001, pp. 239-268].     

Topological convexities, selections and fixed points

A convexity on a set X is a family of subsets of X which contains the whole space and the empty set as well as the singletons and which is closed under arbitrary intersections and updirected unions. A uniform convex space is a uniform topological space endowed with a convexity for which the convex hull operator is uniformly continuous. Uniform convex spaces with homotopically trivial polytopes (convex hulls of finite sets) are absolute extensors for the class of metric spaces; if they are completely metrizable then a continuous selection theorem à la Michael holds. Upper semicontinuous maps have approximate selections and fixed points, under the usual assumptions.     

Motzkin decomposition of closed convex sets

Theodore Motzkin proved, in 1936, that any polyhedral convex set can be expressed as the (Minkowski) sum of a polytope and a polyhedral convex cone. This paper provides five characterizations of the larger class of closed convex sets in finite dimensional Euclidean spaces which are the sum of a compact convex set with a closed convex cone. These characterizations involve different types of representations of closed convex sets as the support functions, dual cones and linear systems whose relationships are also analyzed in the paper. The obtaining of information about a given closed convex set F and the parametric linear optimization problem with feasible set F from each of its different representations, including the Motzkin decomposition, is also discussed.     

An Analog of the Krein--Mil'man Theorem for Strongly Convex Hulls in Hilbert Space

We prove the following theorem: in Hilbert space a closed bounded set is contained in the strongly convex R-hull of its R-strong extreme points. R-strong extreme points are a subset of the set of extreme points (it may happen that these two sets do not coincide); the strongly convex R-hull of a set contains the closure of the convex hull of the set.     

Vectorial exceptional families of elements

Let Z{\mathcal{Z}} be an ordered Hausdorff topological vector space with a preorder defined by a pointed closed convex cone C ì Z{C \subset {\mathcal Z}} with a nonempty interior. In this paper, we introduce exceptional families of elements w.r.t. C for multivalued mappings defined on a closed convex cone of a normed space X with values in the set L(X, Z){L(X, {\mathcal Z})} of all continuous linear mappings from X into Z{\mathcal{Z}} . In Banach spaces, we prove a vectorial analogue of a theorem due to Bianchi, Hadjisavvas and Schaible. As an application, the C-EFE acceptability of C-pseudomonotone multivalued mappings is investigated.