A little error corrected
I corrected a small error in “Filters on Posets and Generalizations” article. The error was in Appendix B in the proof of the theorem stating $latex (t;x)\not\in S$ (I messed $latex t$ and $latex \{t\}$.)
Discrete funcoid which is not complemented
I found an example of a discrete funcoid which is not a complemented element of the lattice of funcoids. Thus the set of discrete funcoids is not the center of the lattice of funcoids, as I conjectured earlier. See the Appendix “Some counter-examples” in my article “Funcoids and Reloids”. The example is simple diagonal relation.
Pointfree funcoids
I put on the Web the first preliminary draft of my article “Pointfree Funcoids”. It seems that pointfree funcoids is a useful tool to research n-ary (multidimensional as opposed to binary) funcoids which in turn is a useful tool to research operations on values of generalized limits of n-ary functions. See Algebraic General Topology for […]
Two propositions and a conjecture
I added to Funcoids and Reloids article the following two new propositions and a conjecture: Proposition $latex (\mathsf{FCD}) (f\cap^{\mathsf{RLD}} ( \mathcal{A}\times^{\mathsf{RLD}} \mathcal{B})) = (\mathsf{FCD}) f \cap^{\mathsf{FCD}} (\mathcal{A}\times^{\mathsf{FCD}} \mathcal{B})$ for every reloid $latex f$ and filter objects $latex \mathcal{A}$ and $latex \mathcal{B}$. Proposition $latex ( \mathsf{RLD})_{\mathrm{in}} (f \cap^{\mathsf{FCD}} ( \mathcal{A} \times^{\mathsf{FCD}} \mathcal{B})) = (( \mathsf{RLD})_{\mathrm{in}} f) […]
Added a new proposition
I added the following proposition to the Funcoids and Reloids article: Proposition $latex (\mathsf{FCD})I_{\mathcal{A}}^{\mathsf{RLD}} = I_{\mathcal{A}}^{\mathsf{FCD}}$ for every filter object $latex \mathcal{A}$.
A conjecture proved
A proof of the following conjecture (now a theorem) was quickly found by me after its formulation: Theorem $latex \left\langle f \right\rangle \mathcal{X} = \bigcap^{\mathfrak{F}} \left\{ \left\langle F \right\rangle \mathcal{X} | F \in \mathrm{up}f \right\}$ for every funcoid $latex f$ and f.o. $latex \mathcal{X}$. See the updated version of my article “Funcoids and Reloids” for […]
Isomorphism of filters expressed through reloids
In the new updated version of the article “Funcoids and Reloids” I proved the following theorem: Theorem Filter objects $latex \mathcal{A}$ and $latex \mathcal{B}$ are isomorphic iff exists a monovalued injective reloid $latex f$ such that $latex \mathrm{dom}f = \mathcal{A}$ and $latex \mathrm{im}f = \mathcal{B}$.
Changes in “Funcoids and Reloids”
I added one new proposition and two open problems to my online article “Funcoids and Reloids”: Conjecture $latex \left\langle f \right\rangle \mathcal{X} = \bigcap^{\mathfrak{F}} \left\{ \left\langle F \right\rangle \mathcal{X} | F \in \mathrm{up}f \right\}$ for every funcoid $latex f$ and f.o. $latex \mathcal{X}$. Proposition $latex \mathrm{dom}( \mathsf{\mathrm{FCD}}) f =\mathrm{dom}f$ and $latex \mathrm{im}(\mathsf{\mathrm{FCD}}) f =\mathrm{im}f$ for […]
Counter-examples against two conjectures
I added counter-examples to the following two conjectures to my online article “Funcoids and Reloids”: Conjecture $latex (\mathsf{RLD})_{\mathrm{out}}(\mathcal{A}\times^{\mathsf{FCD}}\mathcal{B})=\mathcal{A}\times^{\mathsf{RLD}}\mathcal{B}$ for every filter objects $latex \mathcal{A}$ and $latex \mathcal{B}$. Conjecture $latex (\mathsf{RLD})_{\mathrm{out}}(\mathsf{FCD})f=f$ for every reloid $latex f$.
Filters on Posets and Generalizations updated
I uploaded updated version of Filters on Posets and Generalizations article and sent it to Armenian Journal of Mathematics for peer review. The main change in this version is a counter-example to the conjecture, that every weak partition of a filter object on a set is a strong partition. This example was suggested me by […]