Timeline for Empty preimage under homomorphism of finitely presented groups independent of ZFC
Current License: CC BY-SA 4.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 22, 2021 at 6:43 | vote | accept | CommunityBot | ||
| Apr 21, 2021 at 20:22 | answer | added | Joel David Hamkins | timeline score: 5 | |
| Apr 21, 2021 at 18:05 | history | edited | user178109 | CC BY-SA 4.0 |
deleted 11 characters in body; edited title
|
| Apr 21, 2021 at 18:05 | comment | added | user178109 | @YCor I think you are right. I got confused there. | |
| Apr 21, 2021 at 17:57 | comment | added | Benjamin Steinberg | From the algorithmic point of view since every thing is fixed, there is no input, the answer is no. From the ZFC point if view my guess would also be no but I don't know set theory | |
| Apr 21, 2021 at 17:54 | comment | added | Benjamin Steinberg | This question seems to confuse the issue of algorithm decidability with independence from ZFC | |
| Apr 21, 2021 at 17:54 | comment | added | user178109 | @Wojowu but the identity is certainly getting sent to the identity | |
| Apr 21, 2021 at 17:53 | comment | added | Wojowu | @Oniqa But ZFC won't be able to prove that these elements are or aren't identity. | |
| Apr 21, 2021 at 17:51 | comment | added | user178109 | @Wojowu isn't the preimage of the identity always non-empty? | |
| Apr 21, 2021 at 17:50 | comment | added | Wojowu | We can take $f$ a morphism taking everything to identity. Then for appropriate $H$ we have that ZFC can't tell whether $H$ is nontrivial, so it can't check the nontriviality on all generators. | |
| Apr 21, 2021 at 17:48 | comment | added | YCor | It seems to me that any homomorphism between finitely presented groups is computable, whatever it means. Do I miss something? | |
| Apr 21, 2021 at 17:25 | history | asked | user178109 | CC BY-SA 4.0 |