On convexity of fuzzy sets and fuzzy relations (Q1177389)

A fuzzy set \(A\) on the vector space \(X\) (i.e. \(A\) is a mapping from \(X\) to the unit interval) is called convex if all \(\alpha\)-cuts of \(A\) are convex. The question that paper deals with is: For which operations applied to convex fuzzy sets or convex fuzzy relations is the resulting fuzzy set or relation again convex? The results are that intersection, composition of fuzzy relations and cylindrical extension are convexity preserving operations. The paper also extends the definition of convexity for fuzzy sets \(A:X\to [0,1]\) on a finite, linearly ordered set \(X\) by requiring \(A\) to satisfy \(A(y)\geq A(x)\land A(z)\) for all \(x\leq y\leq z\). The results obtained in the case of finite universes of discourse are similar to those in the case of vector spaces.