On the Generic Uniqueness of Pareto-Efficient Solutions of Vector Optimization Problems

In this paper, the generic uniqueness of Pareto weakly efficient solutions, especially Pareto-efficient solutions, of vector optimization problems is studied by using the nonlinear and linear scalarization methods, and some further results on the generic uniqueness are proved. These results present that, for most of the vector optimization problems in the sense of the Baire category, the Pareto weakly efficient solution, especially the Pareto-efficient solution, is unique. Furthermore, based on these results, the generic Tykhonov well-posedness of vector optimization problems is given.

On the Size of Subclasses of Quasi-Copulas and Their Dedekind–MacNeille Completion

We study some topological properties of the class of supermodular n-quasi-copulas and check that the topological size of the Dedekind–MacNeille completion of the set of n-copulas is small, in terms of the Baire category, in the Dedekind–MacNeille completion of the set of the supermodular n-quasi-copulas, and in turn, this set and the set of n-copulas are small in the set of n-quasi-copulas.

Generic Existence of Solutions of Symmetric Optimization Problems

In this paper we study a class of symmetric optimization problems which is identified with a space of objective functions, equipped with an appropriate complete metric. Using the Baire category approach, we show the existence of a subset of the space of functions, which is a countable intersection of open and everywhere dense sets, such that for every objective function from this intersection the corresponding symmetric optimization problem possesses a solution.

The Baire Category of Subsequences and Permutations which preserve Limit Points

Let $$\mathcal {I}$$ I be a meager ideal on $$\mathbf {N}$$ N . We show that if x is a sequence with values in a separable metric space then the set of subsequences [resp. permutations] of x which preserve the set of $$\mathcal {I}$$ I -cluster points of x is topologically large if and only if every ordinary limit point of x is also an $$\mathcal {I}$$ I -cluster point of x. The analogue statement fails for all maximal ideals. This extends the main results in [Topology Appl. 263 (2019), 221–229]. As an application, if x is a sequence with values in a first countable compact space which is $$\mathcal {I}$$ I -convergent to $$\ell $$ ℓ , then the set of subsequences [resp. permutations] which are $$\mathcal {I}$$ I -convergent to $$\ell $$ ℓ is topologically large if and only if x is convergent to $$\ell $$ ℓ in the ordinary sense. Analogous results hold for $$\mathcal {I}$$ I -limit points, provided $$\mathcal {I}$$ I is an analytic P-ideal.

Open sets in computability theory and reverse mathematics

To enable the study of open sets in computational approaches to mathematics, lots of extra data and structure on these sets is assumed. For both foundational and mathematical reasons, it is then a natural question, and the subject of this paper, what the influence of this extra data and structure is on the logical and computational properties of basic theorems pertaining to open sets. To answer this question, we study various basic theorems of analysis, like the Baire category, Heine, Heine–Borel, Urysohn and Tietze theorems, all for open sets given by their (third-order) characteristic functions. Regarding computability theory, the objects claimed to exist by the aforementioned theorems undergo a shift from ‘computable’ to ‘not computable in any type 2 functional’, following Kleene’s S1–S9. Regarding reverse mathematics, the latter’s main question, namely which set existence axioms are necessary for proving a given theorem, does not have a unique or unambiguous answer for the aforementioned theorems, working in Kohlenbach’s higher-order framework. A finer study of representations of open sets leads to the new ‘$\varDelta$-functional’ that has unique (computational) properties.

Stability Analysis of Optimal Trajectory for Nonlinear Optimal Control Problems

Due to the need for numerical calculation and mathematical modelling, this paper focuses on the stability of optimal trajectories for optimal control problems. The basic ideas and techniques are based on the compactness of the optimal trajectory set and set-valued mapping theorem. Through lack of optimal control stability, the result of generic stability for optimal trajectories is obtained under the perturbations of the right-hand side functions of the state equations; in the sense of Baire category, the right-hand side functions of the state equations of optimal control can be approximated by other functions.

Generic Quantum Metric Rigidity

We introduce the coherent algebra of a compact metric measure space by analogy with the corresponding concept for a finite graph. As an application we show that upon topologizing the collection of isomorphism classes of compact metric measure spaces appropriately, the subset consisting of those with trivial compact quantum automorphism group is of 2nd Baire category. The latter result can be paraphrased as saying that “most” compact metric measure spaces have no (quantum) symmetries; in particular, they also have trivial ordinary (i.e., classical) automorphism group.