Preference orders and continuous representations

2011 ◽  
Vol 61 (1) ◽  
Author(s):  
Alessandro Caterino ◽  
Rita Ceppitelli ◽  
Ghanshyam Mehta
Keyword(s):  
Representation Theorem ◽  
Topological Spaces ◽  
Continuous Representation ◽  
Representation Theorems ◽  
Preference Orders ◽  
Separable Spaces ◽  
Path Connected ◽  
Continuous Representations ◽  
Connected Spaces

AbstractIn this paper we prove some general theorems on the existence of continuous order-preserving functions on topological spaces with a continuous preorder. We use the concepts of network and netweight to prove new continuous representation theorems and we establish our main results for topological spaces that are countable unions of subspaces. Some results in the literature on path-connected, locally connected and separably connected spaces are shown to be consequences of the general theorems proved in the paper. Finally, we prove a continuous representation theorem for hereditarily separable spaces.

scholarly journals Almost-continuous path connected spaces

1981 ◽  
Vol 4 (4) ◽  
pp. 823-825
Author(s):  
Larry L. Herrington ◽  
Paul E. Long
Keyword(s):  
Continuous Function ◽  
Connected Components ◽  
Continuous Path ◽  
Open Set ◽  
Regular Open ◽  
Path Connected ◽  
Almost Continuous ◽  
Connected Spaces

M. K. Singal and Asha Rani Singal have defined an almost-continuous functionf:X→Yto be one in which for eachx∈Xand each regular-open setVcontainingf(x), there exists an openUcontainingxsuch thatf(U)⊂V. A spaceYmay now be defined to be almost-continuous path connected if for eachy0,y1∈Ythere exists an almost-continuousf:I→Ysuch thatf(0)=y0andf(1)=y1An investigation of these spaces is made culminating in a theorem showing when the almost-continuous path connected components coincide with the usual components ofY.

Spaces on which every Continuous Map into a given Space is Constant

1986 ◽  
Vol 38 (6) ◽  
pp. 1281-1298 ◽  
Author(s):  
S. Iliadis ◽  
V. Tzannes
Keyword(s):  
Topological Spaces ◽  
Real Numbers ◽  
Continuous Map ◽  
Countable Space ◽  
Continuous Maps ◽  
Usual Topology ◽  
The Given ◽  
Connected Spaces

This paper is concerned with topological spaces whose continuous maps into a given space R are constant, as well as with spaces having this property locally. We call these spaces R-monolithic and locally R-monolithic, respectively.Spaces with such properties have been considered in [1], [5]-[7], [10], [11], [22], [28], [31], where with the exception of [10], the given space R is the set of real-numbers with the usual topology. Obviously, for a countable space, connectedness is equivalent to the property that every continuous real-valued map is constant. Countable connected (locally connected) spaces have been constructed in papers [2]-[4], [8], [9], [11]-[21], [23]-[26], [30].

scholarly journals Finite, primitive and euclidean spaces

1988 ◽  
Vol 1 (3) ◽  
pp. 177-196 ◽  
Author(s):  
Efim Khalimsky
Keyword(s):  
Image Processing ◽  
Euclidean Space ◽  
Computer Tomography ◽  
Quotient Space ◽  
Robot Vision ◽  
Euclidean Spaces ◽  
Finite Spaces ◽  
Path Connected ◽  
Connected Spaces ◽  
Digital Spaces

Integer and digital spaces are playing a significant role in digital image processing, computer graphics, computer tomography, robot vision, and many other fields dealing with finitely or countable many objects. It is proven here that every finite T0-space is a quotient space of a subspace of some simplex, i.e. of some subspace of a Euclidean space. Thus finite and digital spaces can be considered as abstract simplicial structures of subspaces of Euclidean spaces. Primitive subspaces of finite, digital, and integer spaces are introduced. They prove to be useful in the investigation of connectedness structure, which can be represented as a poset, and also in consideration of the dimension of finite spaces. Essentially T0-spaces and finitely connected and primitively path connected spaces are discussed.

scholarly journals Pythagorean Fuzzy Rough Connected Spaces

2021 ◽  
Vol 2070 (1) ◽  
pp. 012069
Author(s):  
P Revathi ◽  
R Radhamani
Keyword(s):  
Rough Set ◽  
Topological Spaces ◽  
Connected Space ◽  
Fuzzy Rough Set ◽  
Connected Spaces

Abstract In this paper Pythagorean fuzzy rough set and Pythagorean fuzzy rough topological spaces are defined for the connected space. Then, the properties of connectedness are discussed with examples.

REPRESENTATION THEOREM OF INTERVAL-VALUED FUZZY SET

2006 ◽  
Vol 14 (03) ◽  
pp. 259-269 ◽  
Author(s):  
WENYI ZENG ◽  
YU SHI ◽  
HONGXING LI
Keyword(s):  
Fuzzy Set ◽  
Representation Theorem ◽  
Basic Theory ◽  
Classification Theorem ◽  
Representation Theorems ◽  
Interval Valued

In this paper, we introduce the concept of interval-valued nested set on the universal set X, propose two representation theorems and equivalent classification theorem of interval-valued fuzzy set. These works can be used in setting up the basic theory of interval-valued fuzzy set.

scholarly journals A representation theorem for second-order functionals

2015 ◽  
Vol 25 ◽  
Author(s):  
MAURO JASKELIOFF ◽  
RUSSELL O'CONNOR
Keyword(s):  
Wide Class ◽  
Category Theory ◽  
Representation Theorem ◽  
Second Order ◽  
The Other ◽  
Functional Language ◽  
Representation Theorems ◽  
Complex Objects ◽  
Change Of Representation ◽  
Generic Representation

AbstractRepresentation theorems relate seemingly complex objects to concrete, more tractable ones. In this paper, we take advantage of the abstraction power of category theory and provide a datatype-generic representation theorem. More precisely, we prove a representation theorem for a wide class of second-order functionals which are polymorphic over a class of functors. Types polymorphic over a class of functors are easily representable in languages such as Haskell, but are difficult to analyse and reason about. The concrete representation provided by the theorem is easier to analyse, but it might not be as convenient to implement. Therefore, depending on the task at hand, the change of representation may prove valuable in one direction or the other. We showcase the usefulness of the representation theorem with a range of examples. Concretely, we show how the representation theorem can be used to prove that traversable functors are finitary containers, how coalgebras of a parameterised store comonad relate to very well-behaved lenses, and how algebraic effects might be implemented in a functional language.

The Hahn representation theorem for ℓ-groups in ZFA

2000 ◽  
Vol 65 (2) ◽  
pp. 519-524
Author(s):  
D. Gluschankof
Keyword(s):  
Set Theory ◽  
Representation Theorem ◽  
Group Structure ◽  
Ordered Group ◽  
Representation Theorems ◽  
Ordered Groups ◽  
Lattice Ordered Groups ◽  
Totally Ordered Group ◽  
Basic Concepts ◽  
The Axiom Of Choice

In [7] the author discussed the relative force —in the set theory ZF— of some representation theorems for ℓ-groups (lattice-ordered groups). One of the theorems not discussed in that paper is the Hahn representation theorem for abelian ℓ-groups. This result, originally proved by Hahn (see [8]) for totally ordered groups and half a century later by Conrad, Harvey and Holland for the general case (see [4]), states that any abelian ℓ-group can be embedded in a Hahn product of copies of R (the real line with its natural totally-ordered group structure). Both proofs rely heavily on Zorn's Lemma which is equivalent to AC (the axiom of choice).The aim of this work is to point out the use of non-constructible axioms (i.e., AC and weaker forms of it) in the proofs. Working in the frame of ZFA, that is, the Zermelo-Fraenkel set theory where a non-empty set of atoms is allowed, we present alternative proofs which, in the totally ordered case, do not require the use of AC. For basic concepts and notation on ℓ-groups the reader can refer to [1] and [2]. For set theory, to [11].

Sign in / Sign up

Export Citation Format

Share Document