Since the Dyson–Montgomery conversation, random matrix theory has made a considerable impact in number theory in the decades following. I have recently written a blog post dedicated to this exciting subject:https://t.co/cdXblohaHZ
While we're on the topic of Montgomery:
In 1972 a year prior, as a grad student Hugh Montgomery spoke with Freeman Dyson at tea in the Institute for Advanced Study, Princeton.
Together they realized a connection between Number Theory and Random Matrix Theory.
This proved to be one of the most important conversations in the history of mathematics.
"Montgomery and Dyson discovered that the zeros of the Riemann zeta function, important for understanding prime numbers, seem to obey the same distribution patterns as the eigenvalues of large random unitary (or hermitian) matrices, which had been extensively studied by physicists, especially to model the interactions within large atomic nuclei.
This stunning connection has held up to extensive numerical and theoretical tests over the intervening years and has been extended to give random matrix models for the low lying zeros of families of L-functions and for the moments and distribution of values of the L-functions in these families"
https://t.co/KgVKM0HVWo
(Dyson was already a renown physicist; though less-known, he was a number theorist by training!)
The legendary Montgomery-Dyson meeting on zeros of ζ(s) led to an unexpected connection between number theory and random matrices in particle physics. Check out my new post for a systematic account:
https://t.co/cdXblohaHZ
@Evo_Alg @sine_unique @pickover However, these only apply to sum over countably many terms. There might be different conclusions for sums over uncountably many terms because we cannot define it in a manner similar to countable sum (i.e. approximation by finite partial sums).
@Evo_Alg @sine_unique @pickover Order of summation is important because the theory of series is derived from the theory of limits of sequences. The value of the series depends on the order of summation because different orders correspond to different sequences, which would result in different limits.
A number n is called cyclic if every group of order n is cyclic. Lagrange's theorem in group theory indicates that every prime is cyclic. In the article quoted below, we show that n is cyclic if and only if n is coprime to Euler's φ(n).
https://t.co/qTAI0VFfOX
@Cyber_Tronic@nullpointer233@LongFormMath I really think my uni should start with this argument instead of the diagonalization, which would be a much more adequate introduction to rigorous mathematics.
@Cyber_Tronic@nullpointer233@LongFormMath ... and ak=0 otherwise. Consequently, by Cantor-Bernstein-Schroder theorem, there exists a bijection from [0,1) to 2^N. It is easy to make a bijection from [0,1) to R so we are finished.
A detailed proof of the quoted theorem can be found in Wikipedia.
@Cyber_Tronic@nullpointer233@LongFormMath You can make an injection from [0,1) to 2^N by associating binary base expansions (following a carefully designed algorithm will make it unique) with subsets of N and make an injection from 2^N to [0,1) by base 10 expansion 0.a1a2a3... in which ak=1 if k is in the subset
@Cyber_Tronic@nullpointer233@LongFormMath Have a look at my replies. You are always safe if you study functions between sets instead of manipulating the elements explicitly.
@nullpointer233@Cyber_Tronic@LongFormMath Because 2^N and the continuum have the same cardinality, the above argument effectively establishes that the continuum's cardinality is strictly higher than that of N.
@nullpointer233@Cyber_Tronic@LongFormMath since f is a surjection, we can find y s.t. f(y)=B, so we consider the following situations:
1. y∈B => y∈f(y) => y∉B.
2. y∉B => y∉f(y) => y∈B.
Since these two cases account for all possibilities, we reach a contradiction by assuming the existence of such bijection.