Yeah this was a possibility I was thinking as well. The superscript n could just be n recursive applications, but then n is still not defined. It’s one of the things that makes me thing that it’s just nonsense. Also, how do you do math on Lemmy? Can you just use LaTeX math syntax or did you copy those symbols?
Wrote it from my phone using Unexpected Keyboard app with Greek symbols included and used superscripts and subscripts feature. I just used the markdown feature of writing code to create some formatting. Like this A = {}
It’s not nonsense, although there is a typo that makes it technically unsolvable. If you fix the typo, it’s an example calculation in the wikipedia page on the universal coefficient theorem: https://en.m.wikipedia.org/wiki/Universal_coefficient_theorem
All I can say is that
P(ℝ)
refers to a power set of ℝ (all rational numbers). Although I don’t know what n stands for inPⁿ(ℝ)
Basically
P(A),
whereA = {1,2,3}
, equal{Φ,1,2,3,(1,2),(2,3),(1,3),(1,2,3)}
Yeah this was a possibility I was thinking as well. The superscript n could just be n recursive applications, but then n is still not defined. It’s one of the things that makes me thing that it’s just nonsense. Also, how do you do math on Lemmy? Can you just use LaTeX math syntax or did you copy those symbols?
Wrote it from my phone using Unexpected Keyboard app with Greek symbols included and used superscripts and subscripts feature. I just used the markdown feature of writing code to create some formatting. Like this
A = {}
Also this post is nonsense, hence posted here.
It’s not nonsense, although there is a typo that makes it technically unsolvable. If you fix the typo, it’s an example calculation in the wikipedia page on the universal coefficient theorem: https://en.m.wikipedia.org/wiki/Universal_coefficient_theorem
Learned something new today