Timeline for d-refining covering of normal space
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 27, 2014 at 12:12 | comment | added | MyIsmail | I have to add that $d\geq n$ where $n$ denotes the number of initial open sets $U_i$ | |
| Oct 27, 2014 at 3:15 | comment | added | Mirko | Say $d=2$ while the cover consist of a single element, $X$, that is $(U_i)=\{X\}$. In this case we could take $F=O=G=X$. Unless you count $F$ more than once, the covering $\{F\}$ would not be a $d$-covering, if I understand your definition. | |
| Jul 22, 2014 at 8:52 | history | asked | MyIsmail | CC BY-SA 3.0 |