The following conjecture seems trivial but I have a hard hour trying to prove it. I suspect I have a big difficulty on the course of my research. Conjecture $latex \prod^{\mathsf{FCD}} a \not\asymp\prod^{\mathsf{FCD}} b \Leftrightarrow \forall i\in n : a_i \not\asymp b_i$…

read moreFirst, we can define product of reloids as a trivial generalization of the alternative definition of product of uniform spaces. There are no trivial simplification of this relatively inelegant definition, it is not algebraic as I would want. I (without any evidence…

read moreIt was my long time dream since the first course of the university to do math analysis in algebraic fashion instead of the notorious epsilon-delta notation overloaded with quantifiers. This dream has been accomplished. I discovered a new math theory in which…

read moreI have proved the conjecture “Upgrading a multifuncoid is multifuncoid”. The proof is currently presented in this online draft article.

read more