I ‘ve said that I take a vacation in my math research work in order to write a religious book. Unexpectedly quickly I have already finished to write and publish this book and return to my mathematical research. Now having researched enough…
read moreI proved that $latex (\mathsf{FCD})$ is the lower adjoint of $latex (\mathsf{RLD})_{\mathrm{in}}$. Also from this follows that $latex (\mathsf{FCD})$ preserves all suprema and $latex (\mathsf{RLD})_{\mathrm{in}}$ preserves all infima. See Algebraic General Topology and specifically Funcoids and Reloids online article.
read moreI found a counter-example to the following conjecture. Conjecture $latex (\mathsf{FCD}) (\mathsf{RLD})_{\mathrm{out}} f = f$ for every funcoid $latex f$. The counterexample is $latex f = {(=)}|_{\Omega}$ where $latex \Omega$ is the Fréchet filter. See Algebraic General Topology and in particular Funcoids…
read moreI found a counterexample to the following conjecture: Conjecture $latex f\cap^{\mathsf{FCD}} g = f\cap g$ for every binary relations $latex f$ and $latex g$. The counter-example is $latex f = {(=)}|_{\mho}$ and $latex g = \mho\times\mho \setminus f$. I proved $latex f…
read moreI generalized a theorem in the preprint article “Filters on posets and generalizations” on my Algebraic General Topology site. The new theorem is formulated as following: Theorem If $latex (\mathfrak{A}; \mathfrak{Z})$ is a join-closed filtrator and $latex \mathfrak{A}$ is a meet-semilattice and…
read moreMy second submit to Documenta Mathematica journal of “Filters on Posets and Generalizations” preprint was unanswered in reasonable amount of time. As such I submitted it to an other journal, Moscow Mathematical Journal.
read moreI decided to dedicate my free (of working as a programmer) time to write a book about religion (What book? It will be a surprise.) So in a few nearby months I am going to not continue my math research. I am…
read moreIn my online draft article “Convergence of funcoids” at my Algebraic General Topology site is now defined limit of arbitrary (not necessarily continuous) functions (under certain conditions). Thus mathematical analysis goes to the next stage, non-continuous analysis. Please nominate me for Abel…
read moreI mistakenly used yet unproved statement that $latex \mathrm{up}\,f$ (taken on the filtrator of funcoids) is a filter for every funcoid $latex f$ in proof of a theorem. So after I found this error I downgrade this theorem to the status of…
read moreIn “Funcoids and Reloids” online draft there was an erroneous lemma: Lemma For every two sets $latex S$ and $latex T$ of binary relations and every set $latex A$ $latex \bigcap {\nobreak}^{\mathfrak{F}} S = \bigcap {\nobreak}^{\mathfrak{F}} T \Rightarrow \bigcap {\nobreak}^{\mathfrak{F}} \{ \langle…
read more