@AlexanderGruber If I take a group of one element, and name the element 'apple' and otherwise 'pear'. Is it still the same group?
The point I am trying to make is that '=' is not purely equal as sets, but has many meanings, it is just an equivalence relation which captures the 'equality' your are interested in.
@JonasTeuwen i mean, i understand that you are saying writing the $=$ sign implies some equivalence relation. i'm just trying to tell you what that equivalence relation is in algebra, and why we insist on $\cong$.
@JonasTeuwen they must have been speaking informally... i would never see any algebraist say $\langle (0,1)\rangle = \langle (1,0) \rangle$ as in the earlier example.
the reason that is different between our disciplines is that algebra is mostly about the $=$ sign, figuring out equalities and isomorphisms and whatnot
it's about the nature of the objects we're working with, whereas in analysis there are a lot of more specific properties you study
I have seen in Fourier analysis on quantum groups commutator diagrams to prove the existence of the Fourier transform, but no way of computing it for specific functions.
Yes - ...
As you declared you did not know much analysis.
Also, I have seen yesterday a very nice example of using only inequalities to bootstrap another inequality to obtain $=$.
yeah, i don't mean that all of analysis is inequalities.
but you must admit there is a difference in the nature of these branches of math - it makes sense that we use $=$ differently. i don't think either use is necessarily better, just adapted to fit the situation
@caveman i'll develop this into an answer if i can, but i believe the reason has to do with something called Chermak-Delgado measure. if we can prove that the Sylow $2$-subgroup $P$ must be centralized by (or equal to) more than $|G|/|P|$ elements in a group whose order is of that form, i'll be able to tell you why.