Timeline for Generalized geometries
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 16, 2015 at 17:06 | comment | added | Will Sawin | @Guntram let me modify the odd-numbered steps to, if no elements would otherwise be added, add one element and not put it in no sets. | |
| Jul 16, 2015 at 15:47 | comment | added | Guntram | This does not work for $n=1$ as the resulting set is finite. For other $n$ it also needs to be shown that this process does not terminate. | |
| Jul 16, 2015 at 13:16 | vote | accept | Dominic van der Zypen | ||
| Jul 16, 2015 at 12:57 | comment | added | Will Sawin | @DominicvanderZypen Every $n$-tuple of elements of $S$ appears in one of the odd numbered step, when the last element appears. Then unless it's already contained in an element of $\mathfrak B$, by the next even numbered step it enters $\mathfrak B$, and it stays contained in an element of $\mathfrak B$ for each subsequence step. Similarly, every pair of elements of $\mathfrak B$ appears at some point, and then the intersection becomes $n-1$, and then it doesn't go down or up. | |
| Jul 16, 2015 at 6:55 | comment | added | Dominic van der Zypen | Thanks for these ideas! It looks like they work, but I'm still a little uneasy about the statement "So both are satisfied in the limit." Can you elaborate on this a little bit? (Sorry for not accepting your answer yet; I will do it once I understand the limit part.) | |
| Jul 16, 2015 at 2:07 | history | answered | Will Sawin | CC BY-SA 3.0 |