Skip to content
June 14, 2015 / porton

Ideals, free stars, and mixers in my book

I wrote a section on ideals, free stars, and mixers in my book.

Now free stars (among with ideals and mixers) are studied as first class objects, being shown isomorphic to filters on posets.

In (not so far) future it should allow to extend our research of pointfree funcoids and staroids/multifuncoids, using now comprehensive theory of free stars (as now we know that they are isomorphic to filters and so their properties are quite clear).

See the development version of my book.

June 5, 2015 / porton

I’ve rewritten my book in LyX

Previously I wrote my research monograph with TeXmacs word processors.

TeXmacs is a very good program. However annoying bugs of TeXmacs (incorrect file “saved” status, failure to work well when multiple windows with the same document are opened, etc.) and also its slowness when working with a long (300 pages) document, forced me to switch to another software.

So I have rewritten my draft book with LyX word processor (based on LaTeX).

There are also small changes which I accomplished due rewriting:

  1. notatiton change 0 \rightarrow \bot and 1 \rightarrow \top for the least and the greatest element of a poset
  2. notatiton change \langle f \rangle X \rightarrow \langle f \rangle^\ast X for applying a function f to a set X; X \mathrel{[f]} Y \rightarrow X \mathrel{[f]^\ast} Y for existence of a point (x;y)\in X\times Y such that x \mathrel{f} y.
  3. other small changes

Now I am going to start the boring process of checking if I rewrite the book correctly, paragraph by pragraph.

May 23, 2015 / porton

An example of a separable poset with certain property

With help of sci.math crowd it was demonstrated an example that there exist a (finite) poset, which is separable (in the sense defined in this book), but \star x \subseteq \star y does not imply x \sqsubseteq y (where \sqsubseteq denotes our order) for elements x, y of this poset.

See this short article with a diagram of such a poset.

May 11, 2015 / porton

Modular hyperlinked mathematics (as a replacement of books)

The following are suggestions how to replace math books with hyperlinked modules, in general, and particularly suggestions how to support it in a future version of TeXmacs software. TeXmacs is an advanced math writing software, and the easiest way to implement my ideas are to modify this existing software, rather than writing a completely new software from scratch.

We want presenting math as hyperlinked modules published on the Web. In principle, it is possible to do with TeXmacs, as that software supports hyperlinks and exporting into HTML+MathML (or HTML with images) format. However, the current version of TeXmacs does not provide all features to do it effectively.

First I will describe what I want (irrespective of any particular software).

I want to split a math book (a collection of related math knowledge) into modules.

Every module should contain one theorem or one definition. I may also contain a proof or several proofs of the same statement.

Also, for a given theorem, its module should contain:

  • (hyperlinked) list of theorems and definitions this theorem depends on
  • (hyperlinked) list of its generalizations
  • (hyperlinked) list of other theorems it generalizes
  • (hyperlinked) list of counterexamples of non-possible generalizations (example: we cannot strengthen “x=y implies x/z=y/z for nonzero z” for zero z)
  • (hyperlinked) list of its consequences (“consequence” probably should not be defined formally as implication, because otherwise every true theorem is a consequence of every other true theorem, but understood in a human way)
  • other?

We also need the possibility to transform a set of modules into a traditional linearly ordered PDF (or HTML) book. We should have the option to exclude some of features when forming a book, as described in the following paragraph:

When converting into book form, we shall have the option to exclude all proofs. Not being too pedantic, we may allow some users to believe us without reading proofs.

Problems with existing TeXmacs version: We can implement this as modules being separate TeXmacs .tm files. Hyperlinks are already supported by TeXmacs. But we have no TeXmacs feature to transform a set of modules into a linear book. For this, we may make a “content” TeXmacs module, which would contain an ordered list of modules, to make a book of this order. We need the feature to export (say in HTML format, into a folder on a disk) all modules from the “content” file, without manually exporting the files one-by-one.

Most of the following can be done with TeXmacs macroses, without modifying its core. However, who knows, we may probably need changes in TeXmacs itself.

We also need to add to TeXmacs a mechanism to check for invalid forward references, for example when “list of theorems and definitions this theorem depends on” is circular.

We need hyperlinks ordering the list of modules linearly, for the case if somebody wants to read it completely. These links should be based on the above mentioned “content” file.

We also need to generate an index and a list of notations from all modules in a “book”

Also it may probably be sometimes useful to put several modules into one file. This issue should be further investigated.

May 8, 2015 / porton

About topological structures corresponding to partial order

Intuitively (not in the sense of comparing cardinalities, but in some other sense), the set of natural numbers is less than the set of whole numbers, which is less than the set of rational numbers, which is less than the set of real numbers, which is less than the set of complex numbers.

First, we could define: poset A is less than the poset B if there is an order embedding from A to B but not vice versa. It plays good, except that the order is commonly just undefined for complex numbers.

To compare reals and complex numbers, we can use topology embedding: Reals can be topologically embedded into complex numbers, but not vice verse.

The problem here is that we need to use two different structures: partial order and topology. We need to “join” it into just one fundamental and natural structure.

Topology in very abstract terms is a description of which elements are near which.

So on \mathbb{N} and \mathbb{Z} there can be defined a structure similar to topology (which points are near which) as relations such as \{ (x;x) \mid x\in\mathbb{Z} \} \cup \{ (x;x+1) \mid x\in\mathbb{Z} \} \cup \{ (x;x-1) \mid x\in\mathbb{Z} \}.

This structure is just a binary relation not a topology. Fortunately, there are abstractions: funcoids and reloids (see my book and these updates for the book) which generalize both binary relations and topologies.

So, our task, refined, is to construct adequate reloids on \mathbb{N}, \mathbb{Z}, \mathbb{Q}, \mathbb{R}, \mathbb{C}.

Topologies on \mathbb{N} and \mathbb{Z} are wrong for our purposes: Them are discrete and just say nothing about set structure.

For \mathbb{Q} and \mathbb{R} the structure we generate from the usual partial order should be the same as the usual topology on these sets.

I propose the structure which I call micronization as a generalization for both order and topology for sets \mathbb{N}, \mathbb{Z}, \mathbb{Q}, \mathbb{R} (but not \mathbb{C}, for which we define the correct reloid only directly from topology, as there is no customary order on \mathbb{C}).

Let F be a binary relation on a set U. Then S(F) = \mathrm{id}_U \cup F \cup F^2 \cup F^3 \cup \dots.

Let E be a partial order on a set U. Micronization \mu(E) = \bigcap^{\mathsf{RLD}} \{ f\in\mathscr{P}(A\times A) \mid S(f)=E \}.

I conjecture that for E being the posets \mathbb{Q}, \mathbb{R} we have that \mu(\le) \cup \mu(\ge) coincides with the customary topology. For \mathbb{N} and \mathbb{Z} the micronization probably is \{ (x;x) \mid x\in\mathbb{Z} \} \cup \{ (x;x+1) \mid x\in\mathbb{Z} \} (that is exactly what our feelings describe as natural/whole numbers being “near” to each other).

So we have defined the same kind of structure for all \mathbb{N}, \mathbb{Z}, \mathbb{Q}, \mathbb{R}, \mathbb{C} (for \mathbb{N}, \mathbb{Z} defined from order, for \mathbb{C} defined from topology, and for \mathbb{Q}, \mathbb{R} defined from both order and topology which as I conjecture are the same). Now we can define: A is less than B if there is an embedding from A to B but not vice verse. How to define the term “embedding”? I am yet not sure but probably we should define “embedding” as a continuous injective function (see my book) from a reloid A to a reloid B.

Finally a conjecture:

Conjecture For every poset E we have S^{\ast}(\mu(E)) = E. (S^{\ast} is defined in my book.)

See also http://math.stackexchange.com/questions/1272198/the-least-relation-which-produces-a-partial-order

April 24, 2015 / porton

Generalized Fréchet filters

Just a few minutes ago I conceived a definition of generalized Fréchet filters with definition for every poset on which filters are considered (however, I have not yet calculated the class of posets for which generalized Fréchet filter is defined; it should be easy but I am busy with other business).

Generalized Fréchet filter on a poset \mathfrak{A} is a filter \Omega such that \partial \Omega = \left\{ x \in \mathfrak{A} \hspace{0.5em} | \hspace{0.5em} \mathrm{atoms}\, x \text{ is infinite} \right\} .

See my book for a definition of \partial.

March 29, 2015 / porton

Proximities are reflexive, symmetric, transitive funcoids

I’ve done a little discovery today: Proximities are the same reflexive, symmetric, transitive funcoids.

For now I leave to prove this as an exercise for a reader. But later I am going to include this theorem into the book I am writing.

Follow

Get every new post delivered to your Inbox.

Join 67 other followers