I have added to my book section “Expressing limits as implications”. The main (easy to prove) theorem basically states that $latex \lim_{x\to\alpha} f(x) = \beta$ when $latex x\to\alpha$ implies $latex f(x)\to\beta$. Here $latex x$ can be taken an arbitrary filter or just…
read moreBelow contains an error. Trying to calculate $latex (\mathcal{B} \times^{\mathsf{RLD}}_F \mathcal{C}) \circ (\mathcal{A} \times^{\mathsf{RLD}}_F \mathcal{B})$, I’ve proved (not yet quite thoroughly checked for errors) the following partial result: Proposition $latex (\mathcal{B} \times^{\mathsf{RLD}}_F \mathcal{C}) \circ (\mathcal{A} \times^{\mathsf{RLD}}_F \mathcal{B}) \neq \mathcal{A} \times^{\mathsf{RLD}}_F \mathcal{C}$ for some proper…
read moreI have proved that join of two connected (regarding a funcoid) filters, whose meet is proper, is connected. (I remind that in my texts filters are ordered reverse set-theoretic inclusion.) The not so complex proof is available in the file addons.pdf. (I am…
read moreI added more on connectedness of filters to the file addons.pdf (to be integrated into the book later). It is a rough incomplete draft. Particularly the proof, that the join of two connected filters with proper meet is connected, is not complete. (Remember…
read moreI have corrected some errors in my book about connectedness of funcoids and reloids. In some theorems I replace like $latex S(\mu)$ with $latex S_1(\mu)$ and arbitrary paths with nonzero-length paths. I also discovered (not yet available online) some new results about connected…
read moreI have defined sides of a surface (represented by such things as a set in a topological space) purely topologically. I also gave two (possible non-equivalent) definitions of special points of a surface (such “singularities” as points of the border of a…
read moreI have almost finished developing theory of filters on posets (not including cardinality issues, maps between filters, and maybe specifics of ultrafilters). Yeah, it is finished! I have completely developed a field of math. Well, there remains yet some informal problems, see…
read moreI have proved this recently formulated conjecture. See my book. Currently it is theorem number 598.
read moreLet $latex \mathfrak{F}(S)$ denotes the set of filters on a poset $latex S$, ordered reversely to set theoretic inclusion of filters. Let $latex Da$ for a lattice element $latex a$ denote its sublattice $latex \{ x \mid x \leq a \}$. Let…
read moreLike a complete idiot, this took me a few years to disprove my conjecture, despite the proof is quite trivial. Here is the complete solution: Example $latex [S]\ne\{\bigsqcup^{\mathfrak{A}}X \mid X\in\mathscr{P} S\}$, where $latex [S]$ is the complete lattice generated by a strong partition $latex…
read more