Eigen fuzzy sets and fuzzy relations

When R is a fuzzy relation between the elements of a finite set X, the fuzzy sets A of X such that R ° A = A (MAX-MIN composition) are called eigen fuzzy sets. The main result of this paper is the determination of the greatest eigen fuzzy set associated with a given fuzzy relation and we give three methods illustrated by an example. We then state that the greatest eigen fuzzy set associated with $\text{R}\text{?}$, the transitive closure of R, is exactly the one associated with R. Finally we describe how to obtain all fuzzy relations keeping invariant a given fuzzy set.     

Fixed points for fuzzy mappings

In this paper the problem of the existence and computation of fixed points for fuzzy mappings is approached. A fuzzy mapping R over a set X is defined to be a function attaching to each x in X a fuzzy subset R_χ of X. An element x of X is called fixed point of R iff its membership degree to R_χ is at least equal to the membership degree to R_χ of any y?X, i.e. R_χ(χ)? R_χ(y)(?y?X). Two existence theorems for fixed points of a fuzzy mapping are proved and an algorithm for computing approximations of such a fixed point is described. The convergence theorem of our algorithm is proved under the restrictive assumption that for any x in X, the membership function of R_χ has a ‘complementary function’. Examples of fuzzy mappings having this property are given, but the problem of proving general criteria for a function to have a complementary remain open.     

A transfer algorithm for hierarchical clustering

Transfer algorithms are usually used to optimize an objective function that is defined on the set of partitions of a finite set X. In this paper we define an equivalence relation ? on the set of fuzzy equivalence relations on X and establish a bijection from the set of hierarchies on X to the set of equivalence classes with respect to ?. Thus, hierarchies can be identified with fuzzy equivalence relations and the transfer algorithm can be modified in order to optimize an objective function that is defined on the set of hierarchies on X.     

Method of solution to fuzzy relation equations in a complete Brouwerian lattice

Up to now, how to solve a fuzzy relation equation in a complete Brouwerian lattice is still an open problem as Di Nola et al. point out. To this problem, the key problem is whether there exists a minimal element in the solution set when a fuzzy relation equation is solvable. In this paper, we first show that there is a minimal element in the solution set of a fuzzy relation equation AX=b (where A=(a₁,a₂,…,a_n) and b are known, and X=(x₁,x₂,…,x_n)^T is unknown) when its solution set is nonempty, and b has an irredundant finite join-decomposition. Further, we give the method to solve AX=b in a complete Brouwerian lattice under the same conditions. Finally, a method to solve a more general fuzzy relation equation in a complete Brouwerian lattice when its solution set is nonempty is also given under similar conditions.     

测试模糊码的一种算法

Abstract. How to verify that a given fuzzy set A∈F(X ) is a fuzzy code? In this paper, an al-gorithm of test has been introduced and studied with the example of test. The measure notionfor a fuzzy code and a precise formulation of fuzzy codes and words have been discussed.     

Who's who in fuzzy sets

In this paper some fuzzy relation equations provided with one solution on a finite set are characterized: we consider fuzzy relation equations H ° Q = T with Q?F(XxY) and card X ? cardY. After recalling the definition of equivalent fuzzy relation equations, we introduce the definition of ρ-equivalent ones, which allows us to constrain our research without loss of generality to fuzzy relation equations where T does not have zero-components.     

Solution of fuzzy equations with extended operations

Assuming that 1 is any operation defined on a product set X × Y and taking values on a set Z, it can be extended to fuzzy sets by means of Zadeh's extension principle. Given a fuzzy subset C of Z, it is here shown how to solve the equation $\text{A 1 B = C}$ (or $\text{A 1 B ? C}$) when a fuzzy subset A of X (or a fuzzy subset B of Y) is given. The methodology we provide includes, as a special case, the resolution of fuzzy arithmetical operations, i.e. when 1 stands for +, ?, × or ÷, extended to fuzzy numbers (fuzzy subsets of the real line). The paper is illustrated with several examples in fuzzy arithmetic.     

Rank one operators and norm of elementary operators

Let A be a standard operator algebra acting on a (real or complex) normed space E. For two n-tuples A = (A₁, … , A_n) and B = (B₁, … , B_n) of elements in A, we define the elementary operator R_A,B on A by the relation for all X in A. For a single operator A∈A, we define the two particular elementary operators L_A and R_A on A by L_A(X) = AX and R_A(X) = XA, for every X in A. We denote by d(R_A,B) the supremum of the norm of R_A,B(X) over all unit rank one operators on E. In this note, we shall characterize: (i) the supremun d(R_A,B), (ii) the relation , (iii) the relation d(L_A − R_B) = ∥A∥ + ∥B∥, (iv) the relation d(L_AR_B − L_BR_A) = 2∥A∥ + ∥B∥. Moreover, we shall show the lower estimate d(L_A − R_B) ? max{sup_λ∈V(B)∥A − λI∥, sup_λ∈V(A)∥B − λI∥} (where V(X) is the algebraic numerical range of X in A).     

Bases for modules

Let R be a ring and A an R-module. We examine different notions of bases or generating sets for A. Of particular interest is the notion of an irredundant basis for A, that is, a subset X of A that generates A but for which no proper subset of X generates A. We investigate the existence and cardinality of irredundant bases.     

On some chains of fuzzy sets

A partial order relation σ is defined in the set $\text{F}$(X) of the fuzzy sets in X. If this ordering is induced in the subset F(X) of the measurable fuzzy sets in the set X with totally finite positive measure, then fσg implies that the entropy of the fuzyy set f is not less than the entropyof g. By means of this ordering a lattice L on $\text{F}$(X) is defined and a lattice structure is induced in the set of infinite chains in L. Furthermore the set F′(X) of the fuzzy sets of F(X) which assume value in a finite subset of the real interval [0,1] is considered and the following properties are stated: any chain of elements of F′(X) is an infinite sequence of functions convergent in the mean to an integrable function, and the entropy is a valuation of bounded variation on the sublattice of L whose elements are in F′(X). The chains on L can offer a model of a cognitive process in a fuzzy environment when their elements are determined by a sequence of decisions. The limit property traduces the determinism of a such procedure.     

The variety of the asymptotic values of a real polynomial etale map

A polynomial map F: R² → R² is said to satisfy the Jacobian condition if ∀(X, Y)ϵ R², J(F)(X, Y) ≠ 0. The real Jacobian conjecture was the assertion that such a map is a global diffeomorphism. Recently the conjecture was shown to be false by S. Pinchuk. According to a theorem of J. Hadamard any counterexample to the conjecture must have asymptotic values. We give the structure of the variety of all the asymptotic values of a polynomial map F: R² → R² that satisfies the Jacobian condition. We prove that the study of the asymptotic values of such maps can be reduced to those maps that have only X- or Y-finite asymptotic values. We prove that a Y-finite asymptotic value can be realized by F along a rational curve of the type (X^{− k}, A₀ + A₁ X + … + A_{N − 1} X^{N − 1} + YX^N), where X → 0, Y is fixed and K, N > 0 are integers. More precisely we prove that the coordinate polynomials P(U, V) of F(U, V) satisfy finitely many asymptotic identities, namely, identities of the following type, P(X^{− k}, A₀ + A₁ X + … + A_{N − 1} X^{N − 1} + YX^N) = A(X, Y)ϵ R[X, Y], which ‘capture’ the whole set of asymptotic values of F.     

The decomposition of Cr(K) into the direct sum of subalgebras

Let A and B be closed subalgebras of C_r(X) whose direct sum is C_r(X). Some consequences of this relation are explored in this paper. For example if 1 ?A (as may be assumed) it is shown that the norm of the projection onto A is an odd integer and there is a retraction of X onto the set of common zeros of elements of B.     

An example on movable approximations of a minimal set in a continuous flow

In the present paper the study of flows on n-manifolds in particular in dimension three, e.g., R³, is motivated by the following question. Let A be a compact invariant set in a flow on X. Does every neighbourhood of A contain a movable invariant set M containing A? It is known that a stable solenoid in a flow on a 3-manifold has approximating periodic orbits in each of its neighbourhoods. The solenoid with the approximating orbits form a movable set, although the solenoid is not movable. Not many such examples are known. The main part of the paper consists of constructing an example of a set in R³ that is not stable, is not a solenoid, and is approximated by Denjoy-like invariant sets instead of periodic orbits. As in the case of a solenoid, the constructed set is an inverse limit of its approximating sets. This gives a partial answer to the above question.     

When is c(x) a Clean Ring?

An element of a ring R is called clean if it is the sum of a unit and an idempotent and a subset A of R is called clean if every element of A is clean. A topological characterization of clean elements of C(X) is given and it is shown that C(X) is clean if and only if X is strongly zero-dimensional, if and only if there exists a clean prime ideal in C(X). We will also characterize topological spaces X for which the ideal C_K(X) is clean. Whenever X is locally compact, it is shown that C_K(X) is clean if and only if X is zero-dimensional.     

Reduction of variance for Gaussian densities via restriction to convex sets

Let X be a random vector with values in $\text{R}$ⁿ and a Gaussian density f. Let Y be a random vector whose density can be factored as k · f, where k is a logarithmically concave function on $\text{R}$ⁿ. We prove that the covariance matrix of X dominates the covariance matrix of Y by a positive semidefinite matrix. When k is the indicator function of a compact convex set A of positive measure the difference is positive definite. If A and X are both symmetric Var(a · X) is bounded above by an expression which is always strictly less than Var(a · X) for every a ∈ $\text{R}$ⁿ. Finally some counterexamples are given to show that these results cannot be extended to the general case where f is any logarithmically concave density.     

A conjugated version of the countable dense homogeneity

We are interested in finding a homeomorphism h of a space X with h⁻¹○Φ○h(A)=B for a given bijection Φ of X and every pair of countable dense subsets A and B of X. For a separable Banach space X, such a homeomorphism h always exists provided the fixed-point set of Φ has the empty interior. Moreover, h can be chosen to be real-analytic. As a consequence, there exists a real analytic flow that sends A onto B after time t=1. Actually, for X=Rn, any bounded real-analytic vector field can be approximated by a real-analytic vector field whose induced flow sends A onto B after time t=1. Topological and Cp smooth counterparts of these results are also obtained.     

On nonmeasurable images

Let (X, ⫿) be a Polish ideal space and let T be any set. We show that under some conditions on a relation R ⊆ T ² × X it is possible to find a set A ⊆ T such that R(A ²) is completely ⫿-nonmeasurable, i.e, it is ⫿-nonmeasurable in every positive Borel set. We also obtain such a set A ⊆ T simultaneously for continuum many relations (R_a )_{a < 2^w} {({R_\alpha })_{\alpha < {2^\omega }}}. Our results generalize those from the papers of K. Ciesielski, H. Fejzić, C. Freiling and M. Kysiak.     

On fuzzy almost continuous convergence in fuzzy function spaces

In this paper, we study the fuzzy almost continuous convergence of fuzzy nets on the set FAC(X, Y) of all fuzzy almost continuous functions of a fuzzy topological space X into another Y. Also, we introduce the notions of fuzzy splitting and fuzzy jointly continuous topologies on the set FAC(X, Y) and study some of its basic properties.     

Retraction spaces and the homotopy metric

Let X be a finite-dimensional compactum. Let $\text{R}$(X) and $\text{N}$(X) be the spaces of retractions and non-deformation retractions of X, respectively, with the compact-open (=sup-metric) topology. Let 2^X_h be the space of non-empty compact ANR subsets of X with topology induced by the homotopy metric. Let R^X_h be the subspace of 2^X_h consisting of the ANR's in X that are retracts of X.We show that $\text{N}$(S^m) is simply-connected for m > 1. We show that if X is an ANR and A₀?R^X_h, then lim_i→∞A_i=A₀ in 2^X_h if and only if for every retraction r₀ of X onto A₀ there are, for almost all i, retractions r_i of X onto A_i such that lim_i→∞r_i=r_o in $\text{R}$(X). We show that if X is an ANR, then the local connectedness of $\text{R}$(X) implies that of R^X_h. We prove that $\text{R}$(M) is locally connected if M is a closed surface. We give examples to show how some of our results weaken when X is not assumed to be an ANR.     

Ordinal regression revisited: Multiple criteria ranking using a set of additive value functions

We present a new method, called UTA^GMS, for multiple criteria ranking of alternatives from set A using a set of additive value functions which result from an ordinal regression. The preference information provided by the decision maker is a set of pairwise comparisons on a subset of alternatives A^R ⊆ A, called reference alternatives. The preference model built via ordinal regression is the set of all additive value functions compatible with the preference information. Using this model, one can define two relations in the set A: the necessary weak preference relation which holds for any two alternatives a, b from set A if and only if for all compatible value functions a is preferred to b, and the possible weak preference relation which holds for this pair if and only if for at least one compatible value function a is preferred to b. These relations establish a necessary and a possible ranking of alternatives from A, being, respectively, a partial preorder and a strongly complete relation. The UTA^GMS method is intended to be used interactively, with an increasing subset A^R and a progressive statement of pairwise comparisons. When no preference information is provided, the necessary weak preference relation is a weak dominance relation, and the possible weak preference relation is a complete relation. Every new pairwise comparison of reference alternatives, for which the dominance relation does not hold, is enriching the necessary relation and it is impoverishing the possible relation, so that they converge with the growth of the preference information. Distinguishing necessary and possible consequences of preference information on the complete set of actions, UTA^GMS answers questions of robustness analysis. Moreover, the method can support the decision maker when his/her preference statements cannot be represented in terms of an additive value function. The method is illustrated by an example solved using the UTA^GMS software. Some extensions of the method are also presented.