Customize Consent Preferences

We use cookies to help you navigate efficiently and perform certain functions. You will find detailed information about all cookies under each consent category below.

The cookies that are categorized as "Necessary" are stored on your browser as they are essential for enabling the basic functionalities of the site. ... 

Always Active

Necessary cookies are required to enable the basic features of this site, such as providing secure log-in or adjusting your consent preferences. These cookies do not store any personally identifiable data.

No cookies to display.

Functional cookies help perform certain functionalities like sharing the content of the website on social media platforms, collecting feedback, and other third-party features.

No cookies to display.

Analytical cookies are used to understand how visitors interact with the website. These cookies help provide information on metrics such as the number of visitors, bounce rate, traffic source, etc.

No cookies to display.

Performance cookies are used to understand and analyze the key performance indexes of the website which helps in delivering a better user experience for the visitors.

No cookies to display.

Advertisement cookies are used to provide visitors with customized advertisements based on the pages you visited previously and to analyze the effectiveness of the ad campaigns.

No cookies to display.

New corollary

To the theorem “Every monovalued reloid is a restricted function.” I added a new corollary “Every monovalued injective reloid is a restricted injection.” See the online article “Funcoids and Reloids” and this Web page.

“Pointfree Funcoids” is now a good draft

I updated online article “Pointfree Funcoids” from “preliminary draft” to just “draft”. This means that it was somehow checked for errors and ready for you to read. (No 100% warranty against errors however.) Having finished with that draft the way is now free for my further Algebraic General Topology research, such as n-ary (multidimensional) funcoids, […]

Draft: Pointfree funcoids

My draft article Pointfree Funcoids was not yet thoroughly checked for errors. However at this stage of the draft I expect that there are no big errors there only possible little errors. Familiarize yourself with Algebraic General Topology.

Completion of a join of reloids

I proved true the following conjecture: Theorem $latex \mathrm{Compl} \left( \bigcup^{\mathsf{RLD}} R \right) = \bigcup ^{\mathsf{RLD}} \langle \mathrm{Compl} \rangle R$ for every set $latex R$ of reloids. The following conjecture remains open: Conjecture $latex \mathrm{Compl}\,f \cap^{\mathsf{RLD}} \mathrm{Compl}\,g =\mathrm{Compl} (f \cap^{\mathsf{RLD}} g)$ for every reloids $latex f$ and $latex g$. See here for definitions and proofs.

Compl CoCompl f = CoCompl Compl f = Cor f

I proved true the following conjecture: Theorem $latex \mathrm{Compl} \, \mathrm{CoCompl}\, f = \mathrm{CoCompl}\, \mathrm{Compl}\, f = \mathrm{Cor}\, f$ for every reloid $latex f$. See here for definitions and proofs.

Yet two simple theorems

I proved the following two simple theorems: Proposition $latex \mathrm{Compl}f = \bigcup^{\mathsf{FCD}} \left\{ f|^{\mathsf{FCD}}_{\{ \alpha \}} \middle| \alpha \in \mho \right\}$ for every funcoid $latex f$. Proposition $latex \mathrm{Compl}f = \bigcup^{\mathsf{RLD}} \left\{ f|^{\mathsf{RLD}}_{\{ \alpha \}} \middle| \alpha \in \mho \right\}$ for every reloid $latex f$. See this online article for definitions and proofs.

Two similar theorems about funcoids and reloids

I proved the following two similar theorems about funcoids and reloids: Theorem For a complete funcoid $latex f$ there exist exactly one function $latex F \in \mathfrak{F}^{\mho}$ such that $latex f = \bigcup^{\mathsf{FCD}} \left\{ \{ \alpha \} \times^{\mathsf{FCD}} F(\alpha) | \alpha \in \mho \right\}$. For a co-complete funcoid $latex f$ there exist exactly one function […]

Restricting a reloid to a trivial atomic filter object

I proved the following (not very hard) theorem: Theorem $latex f|^{\mathsf{RLD}}_{\{ \alpha \}} = \{ \alpha \} \times^{\mathsf{RLD}} \mathrm{im} \left( f|^{\mathsf{RLD}}_{\{ \alpha \}} \right)$ for every reloid $latex f$ and $latex \alpha \in \mho$. See the online article about funcoids and reloids.

If a reloid is both complete and co-complete it is discrete

Today I proved the following conjecture: If a reloid is both complete and co-complete it is discrete. The proof was easily constructed by me shortly after I noticed an obvious but not noticed before proposition: Proposition A reloid $latex f$ is complete iff there exists a function $latex G : \mho \rightarrow \mathfrak{F}$ such that […]

Two new propositions about funcoids and reloids

I proved the following equality for $latex \mathcal{A}$ being a filter object and $latex f$ being either a funcoid: $latex \mathrm{dom}f|^{\mathsf{FCD}}_{\mathcal{A}} = \mathcal{A} \cap^{\mathfrak{F}} \mathrm{dom}f$ or reloid: $latex \mathrm{dom}f|^{\mathsf{RLD}}_{\mathcal{A}} = \mathcal{A} \cap^{\mathfrak{F}} \mathrm{dom}f$. See the updated version of Funcoids and Reloids online article. The proofs are short but they may be not as obvious at […]