Approximation of analytic by Borel sets and definable countable chain conditions

LetI be a σ-ideal on a Polish space such that each set fromI is contained in a Borel set fromI. We say thatI fails to fulfil theΣ ₁ ¹ countable chain condition if there is aΣ ₁ ¹ equivalence relation with uncountably many equivalence classes none of which is inI. Assuming definable determinacy, we show that if the family of Borel sets fromI is definable in the codes of Borel sets, then eachΣ ₁ ¹ set is equal to a Borel set modulo a set fromI iffI fulfils theΣ ₁ ¹ countable chain condition. Further we characterize the σ-idealsI generated by closed sets that satisfy the countable chain condition or, equivalently in this case, the approximation property forΣ ₁ ¹ sets mentioned above. It turns out that they are exactly of the formMGR(F)={A : ∀F ∈ F A ∩F is meager inF} for a countable family F of closed sets. In particular, we verify partially a conjecture of Kunen by showing that the σ-ideal of meager sets is the unique σ-ideal onR, or any Polish group, generated by closed sets which is invariant under translations and satisfies the countable chain condition. Research partially supported by NSF grant DMS-9317509.     

Compact,convex sets in R n and a new banach lattice. I.- Theory.

The present paper shows that compact, non-empty convex sets in R ⁿ form a wedge in a well-defined Banach lattice, which turns out to be isometrically Riesz-isomorphic to the continuous functions in S ^n–1, the unit sphere of R ⁿ . Among other results, we obtain Dini-like convergence results for sets, linking order- and norm-convergence.     

Comparison between different duals in multiobjective fractional programming

The present paper is a continuation of [2] where we deal with the duality for a multiobjective fractional optimization problem. The basic idea in [2] consists in attaching an intermediate multiobjective convex optimization problem to the primal fractional problem, using an approach due to Dinkelbach ([6]), for which we construct then a dual problem expressed in terms of the conjugates of the functions involved. The weak, strong and converse duality statements for the intermediate problems allow us to give dual characterizations for the efficient solutions of the initial fractional problem. The aim of this paper is to compare the intermediate dual problem with other similar dual problems known from the literature. We completely establish the inclusion relations between the image sets of the duals as well as between the sets of maximal elements of the image sets.      

Substitution Delone Sets

   Abstract. Substitution Delone set families are families of Delone sets X =(X ₁ , . . ., X _n ) which satisfy the inflation functional equation

On lightly and countably compact spaces in ZF

Abstract

Given a topological space X = (X, T ), we show in the Zermelo-Fraenkel set theory ZF that:

1. Every locally finite family of open sets of X is finite iff every pairwise disjoint, locally finite family of open sets is finite.

2. Every locally finite family of subsets of X is finite iff every pairwise disjoint, locally finite family of subsets of X is finite iff every locally finite family of closed subsets of X is finite.

3. The statement “every locally finite family of closed sets of X is finite” implies the proposition “every locally finite family of open sets of X is finite”. The converse holds true in case X is T₄ and the countable axiom of choice holds true.

   We also show:

4. It is relatively consistent with ZF the existence of a non countably compact T₁ space such that every pairwise disjoint locally finite family of closed subsets is finite but some locally finite family of subsets is infinite.

5. It is relatively consistent with ZF the existence of a countably compact T₄ space including an infinite pairwise disjoint locally finite family of open (resp. closed) sets.

     

NOTE ON BRIDGING THEOREMS FOR SEMISIMPLICIAL SETS

Abstract

In this note we present a variant of bridging theorems in abstract homotopy theory which applies to the category of semisimplicial sets yielding bridging theorems for semisimplicial sets which might prove useful in semi-algebraic topology.     

Geometric Models for Quasicrystals I. Delone Sets of Finite Type

This paper studies three classes of discrete sets X in ⁿ which have a weak translational order imposed by increasingly strong restrictions on their sets of interpoint vectors X-X . A finitely generated Delone set is one such that the abelian group [X-X] generated by X-X is finitely generated, so that [X-X] is a lattice or a quasilattice. For such sets the abelian group [X] is finitely generated, and by choosing a basis of [X] one obtains a homomorphism . A Delone set of finite type is a Delone set X such that X-X is a discrete closed set. A Meyer set is a Delone set X such that X-X is a Delone set. Delone sets of finite type form a natural class for modeling quasicrystalline structures, because the property of being a Delone set of finite type is determined by ``local rules.' That is, a Delone set X is of finite type if and only if it has a finite number of neighborhoods of radius 2R , up to translation, where R is the relative denseness constant of X . Delone sets of finite type are also characterized as those finitely generated Delone sets such that the map ϕ satisfies the Lipschitz-type condition ||ϕ (x) - ϕ (x')|| < C ||x - x'|| for x, x' ∈X , where the norms || . . . || are Euclidean norms on ^s and ⁿ , respectively. Meyer sets are characterized as the subclass of Delone sets of finite type for which there is a linear map and a constant C such that ||ϕ (x) - (x)|| for all x∈X . Suppose that X is a Delone set with an inflation symmetry, which is a real number η > 1 such that . If X is a finitely generated Delone set, then η must be an algebraic integer; if X is a Delone set of finite type, then in addition all algebraic conjugates | η ' | η; and if X is a Meyer set, then all algebraic conjugates | η ' | 1. Received May 9, 1997, and in revised form March 5, 1998.     

Some Geometric Properties of Julia Sets and filled-in Julia Sets of Polynomials

In this paper, some geometric properties of connected Julia sets and filled-in Julia sets of polynomials are given.     

Difference Sets Corresponding to a Class of Symmetric Designs

We study difference sets with parameters(v, k, ) = (p ^s(r ^2m - 1)/(r - 1), p ^s-1 r ^2m-2 r - 1)r ^{2m -2}, where r = r ^s - 1)/(p - 1) and p is a prime. Examples for such difference sets are known from a construction of McFarland which works for m = 1 and all p,s. We will prove a structural theorem on difference sets with the above parameters; it will include the result, that under the self-conjugacy assumption McFarland's construction yields all difference sets in the underlying groups. We also show that no abelian .160; 54; 18/-difference set exists. Finally, we give a new nonexistence prove of (189, 48, 12)-difference sets in Z ₃ × Z ₉ × Z ₇.     

Differences of Convex Compact Sets in the Space of Directed Sets. Part II: Visualization of Directed Sets

This paper is a continuation of the author's first paper (Set-Valued Anal. 9 (2001), pp. 217–245), where the normed and partially ordered vector space of directed sets is constructed and the cone of all nonempty convex compact sets in R ⁿ is embedded. A visualization of directed sets and of differences of convex compact sets is presented and its geometrical components and properties are studied. The three components of the visualization are compared with other known differences of convex compact sets.     

The stability of the solution sets for set optimization problems via improvement sets

ABSTRACT

The aim of this paper is to investigate the stability of the solution sets for set optimization problems via improvement sets. Firstly, we consider the relations among the solution sets for optimization problem with set optimization criterion. Then, the closeness and the convexity of solution sets are discussed. Furthermore, the upper semi-continuity, Hausdorff upper semi-continuity and lower semi-continuity of solution mappings to parametric set optimization problems via improvement sets are established under some suitable conditions. These results extend and develop some recent works in this field.     

Difference of two sets and estimation of clarke generalized Jacobian via quasidifferential

The notion of difference for two convex compact sets inR ⁿ , proposed by Rubinovet al, is generalized toR ^m×n . A formula of the difference for the two sets, which are convex hulls of a finite number of points, is developed. In the light of this difference, the relation between Clarke generalized Jacobian and quasidifferential, in the sense of Demyanov and Rubinov, for a nonsnooth function, is established. Based on the relation, the method of estimating Clarke generalized Jacobian via quasidifferential for a certain class of functions, is presented.     

Construction of wavelet sets with certain self-similarity properties

A measurable set Q ⊂ R ⁿ is a wavelet set for an expansive matrix A if F ⁻¹ _(ΧQ) is an A-dilation wavelet. Dai, Larson, and Speegle [7] discovered the existence of wavelet sets in R _n associated with any real n ×n expansive matrix. In this work, we construct a class of compact wavelet sets which do not contain the origin and which are, up to a certain linear transformation, finite unions of integer translates of an integral selfaffine tile associated with the matrix B = A ^t. Some of these wavelet sets may have good potential for applications because of their tractable geometric shapes.     

POWERSET OPERATOR BASED FOUNDATION FORPOINT-SET LATTICE-THEORETIC (POSLAT) FUZZY SET THEORIES and TOPOLOGIES

Abstract

This paper sets forth in detail point-set lattice-theoretic or poslat foundations of all mathematical and fuzzy set disciplines in which the operations of taking the image and pre-image of (fuzzy) subsets play a fundamental role; such disciplines include algebra, measure and probability theory, and topology. In particular, those aspects of fuzzy sets, hinging around (crisp) powersets of fuzzy subsets and around powerset operators between such powersets lifted from ordinary functions between the underlying base sets, are examined and characterized using point-set and lattice-theoretic methods. The basic goal is to uniquely derive the powerset operators and not simply stipulate them, and in doing this we explicitly distinguish between the “fixed-basis” case (where the underlying lattice of membership values is fixed for the sets in question) and the “variable-basis” case (where the underlying lattice of membership values is allowed to change). Applications to fuzzy sets/logic include: development and justification/characterization of the Zadeh Extension Principle [36], with applications for fuzzy topology and measure theory; characterizations of ground category isomorphisms; rigorous foundation for fuzzy topology in the poslat sense; and characterization of those fuzzy associative memories in the sense of Kosko [18] which are powerset operators. Some results appeared without proof in [31], some with partial proofs in [32], and some in the fixed-basis case in Johnstone [13] and Manes [22].     

A CHARACTERIZATION OF LINEAR OPERATORS IN CERTAIN PARANORMED SEQUENCE SPACES

Abstract

We define a new class B of sets of strongly summable and bounded sequences, determine their first and second α- and β-duals, and characterize linear operators on the spaces in B.     

Recurrence relations among moments of order statistics from two related sets of independent and non-identically distributed random variables

Some recurrence relations among moments of order statistics from two related sets of variables are quite well-known in the i.i.d. case and are due to Govindarajulu (1963a, Technometrics, 5, 514–518 and 1966, J. Amer. Statist. Assoc., 61, 248–258). In this paper, we generalize these results to the case when the order statistics arise from two related sets of independent and non-identically distributed random variables. These relations can be employed to simplify the evaluation of the moments of order statistics in an outlier model for symmetrically distributed random variables.     

Approximation of Analytic Sets with Proper Projection by Algebraic Sets

Let X be an analytic subset of U×C ⁿ of pure dimension k such that the projection of X onto U is a proper mapping, where U⊂C ^k is a Runge domain. We show that X can be approximated by algebraic sets. Next we present a constructive method for local approximation of analytic sets by algebraic ones.     

NON-ARCHIMEDEAN KÖTHE SPACES

Abstract

Köthe type non-Archimedean spaces are introduced in this paper. Bounded sets, compactoid sets, dual spaces, nuclearity, reflexivity and other properties of such spaces are investigated.     

Convex-cone-based comparisons of and difference evaluations for fuzzy sets

Abstract

This paper focuses on how to compare two fuzzy sets and, from the viewpoint of set optimization, proposes eight types of fuzzy-set relations based on a convex cone as new comparison criteria of fuzzy sets. Then, difference evaluation functions for fuzzy sets are introduced. Under suitable assumptions of certain compactness and stability of fuzzy sets, we show that these functions correspond well to the fuzzy-set relations. In addition, through transforming these functions stepwise, we deal with numerical calculation methods of them in particular cases. Consequently, we can judge whether each fuzzy-set relation holds or not for given two fuzzy sets with the aid of computers.     

A note on the growth of topological Sidon sets

We give an estimate for the number of elements in the intersection of topological Sidon sets inR ⁿ with compact convex subsets and deduce a necessary and sufficient conditions for an orbit of a linear transformation ofR ⁿ to be a topological Sidon set.