Timeline for Sieve for an infinite array of sets, resulting in an array of the same size of pairwise disjoint sets
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 4 at 5:28 | vote | accept | Tri | ||
| Jul 3 at 19:22 | review | Close votes | |||
| Jul 18 at 3:03 | |||||
| Jul 3 at 16:01 | answer | added | KP Hart | timeline score: 3 | |
| Jul 3 at 13:48 | comment | added | Tri | @KPHart I still think I captured the "gist." Since it was a fact, I threw it in as a fact one could use. Hajnal's indication of how to prove the main result I want was completely unhelpful to me. | |
| Jul 3 at 11:03 | comment | added | KP Hart | That is not quite the gist. It states that the assumption on sets of cardinality $\lambda$ is not an assumption but a fact: since the $E^\nu_\xi$ are pairwise disjoint $\xi\mapsto \min(E^\nu_\xi\cap T)$ is an injection into $T$, where $\xi$ runs through the indices corresponding to a nonempty intersection. And second: Hajnal indicates how to prove this, by induction. | |
| Jul 1 at 18:55 | history | asked | Tri | CC BY-SA 4.0 |