Timeline for What are the conjugacy classes of the category of ($\kappa$-small) sets?
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 25, 2021 at 4:37 | history | edited | Emily | CC BY-SA 4.0 |
added 95 characters in body
|
| Oct 25, 2021 at 4:28 | history | edited | Emily | CC BY-SA 4.0 |
resolving set-theoretic issues
|
| Oct 24, 2021 at 5:25 | history | edited | Emily | CC BY-SA 4.0 |
added 440 characters in body
|
| Oct 24, 2021 at 5:22 | comment | added | Emily | @BenjaminSteinberg Thanks! I was sure I had mentioned this (I made exactly this mistake a year ago when asking a similar question!). I updated the above to include this, and also tried to hopefully make the descriptions of $\sim_1$, $\sim_2$, and $\sim_3$ clearer. | |
| Oct 23, 2021 at 22:49 | answer | added | Maxime Ramzi | timeline score: 6 | |
| Oct 23, 2021 at 20:06 | comment | added | Benjamin Steinberg | I think $\sim_2$ should be generated by pairs a,b with ma=bm for some m. This is what people usually use | |
| Oct 23, 2021 at 13:10 | comment | added | Benjamin Steinberg | For finite sets this is well known. I believe for infinite sets it will likely boil down to understanding the case of the monoid $T_X$ of all self maps of X. The answer should be some "combinatorial" property that doesn't rely on the ambient $X$. My understanding is that description of the $\sim_3$ classes was an open question a few years ago for X uncountable. I'm not sure if the countable case is known João Araújo and Mike Kinyon and their coauthors have a lot of papers on these things | |
| Oct 23, 2021 at 11:53 | history | became hot network question | |||
| Oct 23, 2021 at 11:50 | comment | added | Benjamin Steinberg | You have to generate equivalence relations for monoids | |
| Oct 23, 2021 at 3:51 | history | asked | Emily | CC BY-SA 4.0 |