1,343 reputation
516
bio website mathematics21.org
location
age
visits member for 3 years, 9 months
seen 16 hours ago

An amateur general topology researcher.


1d
revised Another conjecture about filters and cartesian products
deleted 1718 characters in body
1d
comment Another conjecture about filters and cartesian products
In mathematics21.org/binaries/funcoids-are-filters.pdf I have shown that $\Gamma$ in both my questions are the same. So the answer to this question is: yes, it can be proved
1d
answered A conjecture about filters and finite unions of cartesian products
1d
comment A conjecture about filters and finite unions of cartesian products
I provided a counter-example as an answer. That counter-example was wrong.
2d
accepted A “rearrangement” of a finite set
2d
awarded  Necromancer
Sep
11
answered A “rearrangement” of a finite set
Sep
11
comment A “rearrangement” of a finite set
For pairwise non-equivalent elements $a_0, \ldots, a_k$ we have $\forall i, j \in \{ 0, \ldots, k \} : (i \neq j \Rightarrow a_i \not\in X_{i, j} \wedge a_j \in X_{i, j})$ where $X_{i, j} \in T$. How to derive that $k \leqslant 2^n$?
Sep
11
comment A “rearrangement” of a finite set
@ThomasAndrews: I've spent more then a hour trying to prove this. I feel I am very near to the solution, but something prevents me to find it. Please explain how to derive the solution. It is not a homework and your help won't harm
Sep
11
comment A “rearrangement” of a finite set
@ThomasAndrews I feel that I am near to the answer. Probably I need to select a canonical representative element from every equivalence class
Sep
11
comment A “rearrangement” of a finite set
@ThomasAndrews I am stalled in the attempt to figure out the property of equivalence relations which corresponds to finiteness. Why would you not give me an answer? It is not a homework
Sep
11
comment A “rearrangement” of a finite set
@ThomasAndrews Maybe this is an eclipse in my mind. Why $S$ has at most $2^n$ elements?
Sep
11
comment A “rearrangement” of a finite set
@Hippalectryon I tried to meditate a half of minute and had no ideas
Sep
11
asked A “rearrangement” of a finite set
Sep
11
asked Terms for particular equivalence relation and partition?
Sep
11
revised Shortest possible proof of a simple theorem
the list made numbered
Sep
11
asked Shortest possible proof of a simple theorem
Sep
11
revised A conjecture about filters and finite unions of cartesian products
joins -> unions
Sep
10
comment A lattice generated by two particular sublattices of the lattice of binary relations
@JairTaylor: Yes. Maybe the answer is the set of all finite unions of cartesian products?
Sep
10
comment A lattice generated by two particular sublattices of the lattice of binary relations
Maybe, it is the lattice consisting of all finite unions of pairwise non-intersecting cartesian products?