Timeline for The Parity Principle and $\mathbf{C}_2$ (choice for $2$-sets)
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 16, 2023 at 6:34 | vote | accept | Dominic van der Zypen | ||
| Sep 16, 2023 at 5:53 | comment | added | François G. Dorais | @bof Thank you! | |
| Sep 16, 2023 at 3:28 | comment | added | bof | In human language the Axiom of Multiple Choice says you can assign to each nonempty set a finite nonempty subset. Since the connected components of the Hamming graph on $2^X$ are sublattices, if you choose a nonempty finite subset of each component, you can choose an element of each component by taking the supremum. As the graph has no odd cycles, once you establish a base point in each component, there is a unique proper $2$-coloring with all the base points colored blue. I post this redundant comment for the benefit of those like me who get a headache from deciphering a lot of notation. | |
| Sep 15, 2023 at 21:51 | history | edited | Elliot Glazer | CC BY-SA 4.0 |
unambiguous subset notation
|
| Sep 15, 2023 at 18:41 | history | answered | Elliot Glazer | CC BY-SA 4.0 |