 login/create account
login/create account
    Direct proof of a theorem about compact funcoids ★★
Author(s): Porton
Conjecture   Let  is a
 is a  -separable (the same as
-separable (the same as  for symmetric transitive) compact funcoid and
 for symmetric transitive) compact funcoid and  is a uniform space (reflexive, symmetric, and transitive endoreloid) such that
 is a uniform space (reflexive, symmetric, and transitive endoreloid) such that  . Then
. Then  .
. 
 is a
 is a  -separable (the same as
-separable (the same as  for symmetric transitive) compact funcoid and
 for symmetric transitive) compact funcoid and  is a uniform space (reflexive, symmetric, and transitive endoreloid) such that
 is a uniform space (reflexive, symmetric, and transitive endoreloid) such that  . Then
. Then  .
. The main purpose here is to find a direct proof of this conjecture. It seems that this conjecture can be derived from the well known theorem about existence of exactly one uniformity on a compact set. But that would be what I call an indirect proof, we need a direct proof instead.
The direct proof may be constructed by correcting all errors an omissions in this draft article.
Direct proof could be better because with it we would get a little more general statement like this:
Conjecture   Let  be a
 be a  -separable compact reflexive symmetric funcoid and
-separable compact reflexive symmetric funcoid and  be a reloid such that
 be a reloid such that
 be a
 be a  -separable compact reflexive symmetric funcoid and
-separable compact reflexive symmetric funcoid and  be a reloid such that
 be a reloid such that-    \item 
 ;      \item
;      \item  .
.  Then  .
. 
Keywords: compact space; compact topology; funcoid; reloid; uniform space; uniformity
Generalized path-connectedness in proximity spaces ★★
Author(s): Porton
Let  be a proximity.
 be a proximity.
A set  is connected regarding
 is connected regarding  iff
 iff  .
.
Conjecture   The following statements are equivalent for every endofuncoid  and a set
 and a set  :
:
 and a set
 and a set  :
:-    \item 
 is connected regarding
 is connected regarding  .      \item For every
.      \item For every  there exists a totally ordered set
 there exists a totally ordered set  such that
 such that  ,
,  , and for every partion
, and for every partion  of
   of  into two sets
 into two sets  ,
,  such that
 such that  ,   we have
,   we have ![$ X \mathrel{[ \mu]^{\ast}} Y $](/files/tex/0ef560be389646efd1fdde5ebc9afc9ac98ee64e.png) .
. Keywords: connected; connectedness; proximity space
 
           Drupal
 Drupal CSI of Charles University
 CSI of Charles University