A further study on the Riemann-integrability for abstract-valued functions from a closed real interval to a complete random normed module

2012 ◽  
Vol 42 (9) ◽  
pp. 897-903 ◽  
Author(s):  
MingZhi WU
Keyword(s):  
Real Interval ◽  
Random Normed Module ◽  
Normed Module

THE RANDOM SUBREFLEXIVITY OF COMPLETE RANDOM NORMED MODULES

2012 ◽  
Vol 23 (03) ◽  
pp. 1250047 ◽  
Author(s):  
SHIEN ZHAO ◽  
TIEXIN GUO
Keyword(s):  
Random Normed Module ◽  
Convex Topology ◽  
Normed Module ◽  
Random Normed Modules

Combining respective advantages of the (ε, λ)-topology and the locally L0-convex topology we first prove that every complete random normed module is random subreflexive under the (ε, λ)-topology. Further, we prove that every complete random normed module with the countable concatenation property is also random subreflexive under the locally L0-convex topology, at the same time we also provide a counterexample which shows that it is necessary to require the random normed module to have the countable concatenation property.

scholarly journals L0-Linear Modulus of a Random Linear Operator

2014 ◽  
Vol 2014 ◽  
pp. 1-4
Author(s):  
Ming Liu ◽  
Xia Zhang
Keyword(s):  
Linear Operator ◽  
Classical Case ◽  
Random Normed Module ◽  
Normed Module

We prove that there exists a uniqueL0-linear modulus for an a.s. bounded random linear operator on a specifical random normed module, which generalizes the classical case.

scholarly journals A Minimax Theorem forL-0-Valued Functions on Random Normed Modules

2013 ◽  
Vol 2013 ◽  
pp. 1-10
Author(s):  
Shien Zhao ◽  
Yuan Zhao
Keyword(s):  
Lower Semicontinuous ◽  
Saddle Points ◽  
Minimax Theorem ◽  
Lower Semicontinuous Function ◽  
Semicontinuous Function ◽  
Minimax Theorems ◽  
Random Normed Module ◽  
Normed Module ◽  
Random Normed Modules ◽  
Definition Of

We generalize the well-known minimax theorems toL¯0-valued functions on random normed modules. We first give some basic properties of anL0-valued lower semicontinuous function on a random normed module under the two kinds of topologies, namely, the (ε,λ)-topology and the locallyL0-convex topology. Then, we introduce the definition of random saddle points. Conditions for anL0-valued function to have a random saddle point are given. The most greatest difference between our results and the classical minimax theorems is that we have to overcome the difficulty resulted from the lack of the condition of compactness. Finally, we, using relations between the two kinds of topologies, establish the minimax theorem ofL¯0-valued functions in the framework of random normed modules and random conjugate spaces.

Decision making based on intuitionistic fuzzy preference relations with additive approximate consistency

2020 ◽  
Vol 39 (3) ◽  
pp. 4041-4058
Author(s):  
Fang Liu ◽  
Xu Tan ◽  
Hui Yang ◽  
Hui Zhao
Keyword(s):  
Decision Making ◽  
Decision Makers ◽  
Real Interval ◽  
Preference Relations ◽  
Intuitionistic Fuzzy ◽  
Proposed Model ◽  
Fuzzy Preference Relations ◽  
Novel Concept ◽  
Fuzzy Weights ◽  
Fuzzy Preference

Intuitionistic fuzzy preference relations (IFPRs) have the natural ability to reflect the positive, the negative and the non-determinative judgements of decision makers. A decision making model is proposed by considering the inherent property of IFPRs in this study, where the main novelty comes with the introduction of the concept of additive approximate consistency. First, the consistency definitions of IFPRs are reviewed and the underlying ideas are analyzed. Second, by considering the allocation of the non-determinacy degree of decision makers’ opinions, the novel concept of approximate consistency for IFPRs is proposed. Then the additive approximate consistency of IFPRs is defined and the properties are studied. Third, the priorities of alternatives are derived from IFPRs with additive approximate consistency by considering the effects of the permutations of alternatives and the allocation of the non-determinacy degree. The rankings of alternatives based on real, interval and intuitionistic fuzzy weights are investigated, respectively. Finally, some comparisons are reported by carrying out numerical examples to show the novelty and advantage of the proposed model. It is found that the proposed model can offer various decision schemes due to the allocation of the non-determinacy degree of IFPRs.

Criterion of cyclically compactness infinite-dimensional normed module

2018 ◽  
Vol 2018 (3) ◽  
pp. 51-62
Author(s):  
V.I. Chilin ◽  
J.A. Karimov
Keyword(s):  
Infinite Dimensional ◽  
Normed Module

scholarly journals Keplerian trigonometry

2021 ◽  
Author(s):  
Alessandro Gambini ◽  
Giorgio Nicoletti ◽  
Daniele Ritelli
Keyword(s):  
Elliptic Curve ◽  
Real Interval ◽  
Planar Curve ◽  
Signed Area

AbstractTaking the hint from usual parametrization of circle and hyperbola, and inspired by the pathwork initiated by Cayley and Dixon for the parametrization of the “Fermat” elliptic curve $$x^3+y^3=1$$ x 3 + y 3 = 1 , we develop an axiomatic study of what we call “Keplerian maps”, that is, functions $${{\,\mathrm{{\mathbf {m}}}\,}}(\kappa )$$ m ( κ ) mapping a real interval to a planar curve, whose variable $$\kappa $$ κ measures twice the signed area swept out by the O-ray when moving from 0 to $$\kappa $$ κ . Then, given a characterization of k-curves, the images of such maps, we show how to recover the k-map of a given parametric or algebraic k-curve, by means of suitable differential problems.

scholarly journals Generalization of real interval matrices to other fields

2019 ◽  
Vol 35 ◽  
pp. 285-296
Author(s):  
Elena Rubei
Keyword(s):  
Full Rank ◽  
Maximal Rank ◽  
Interval Matrix ◽  
Real Interval ◽  
Rational Matrix ◽  
Rank One ◽  
Rational Rank ◽  
Q Matrix ◽  
Rational Interval ◽  
Rank Of A Matrix

An interval matrix is a matrix whose entries are intervals in $\R$. This concept, which has been broadly studied, is generalized to other fields. Precisely, a rational interval matrix is defined to be a matrix whose entries are intervals in $\Q$. It is proved that a (real) interval $p \times q$ matrix with the endpoints of all its entries in $\Q$ contains a rank-one matrix if and only if it contains a rational rank-one matrix, and contains a matrix with rank smaller than $\min\{p,q\}$ if and only if it contains a rational matrix with rank smaller than $\min\{p,q\}$; from these results and from the analogous criterions for (real) inerval matrices, a criterion to see when a rational interval matrix contains a rank-one matrix and a criterion to see when it is full-rank, that is, all the matrices it contains are full-rank, are deduced immediately. Moreover, given a field $K$ and a matrix $\al$ whose entries are subsets of $K$, a criterion to find the maximal rank of a matrix contained in $\al$ is described.

Sign in / Sign up

Export Citation Format

Share Document