Barry Mazur's current BAMS article

  • Thread starter Thread starter DeaconJohn
  • Start date Start date
  • Tags Tags
    article Current

What did you think of Barry Mazur's April 08 BAMS article?

  • From what you say, DJ, it sounds interesting.

    Votes: 0 0.0%
  • Won't know 'till I read it.

    Votes: 0 0.0%
  • I read it and it left me kind of cold.

    Votes: 0 0.0%
  • Man, it was fantastic! Hope we see more like it.

    Votes: 0 0.0%

  • Total voters
    0
DeaconJohn
Messages
122
Reaction score
0
From a post by Mathwonk in the recent thread about randomness in prime numbers: :approve:
mathwonk said:
OK, here you go, an article in the math monthly, written for anyone.

http://www.dms.umontreal.ca/~andrew/PDF/PrimeRace.pdf

The argument there is that IF we had the naively expected degree of randomness of prime distribution, THEN for all large x, the number of primes less than x, and congruent to 1 mod4, should have a 50-50 chance of being greater than the number of such primes congruent to 3 mod4;

but, it isn't true. The primes congruent to 3 mod4, exceed the others for almost all x.

This a good readable article.

In general granville excels at being able to make number theory interesting and understandable to a broad audience, when that is his goal.

Barry Mazur's article on "Error Terms" in the current issue of the Bulliten of the AMS (BAMS) uses the "Prime Number Races" that Mathwonk is talking about as a "jumping off point."

Has anybody read Barry Mazur's article in the current issue of the Bulliten of the AMS? :confused:

If so, please let me know what you think about it. :bugeye:

Here are my thoughts:

1) Mazur references the excellent Prime Race article quoted by Mathwonk above. This raises the following questions.

A) Did Mathwonk get the reference to the monthly article from Mazur?
B) Did Mazur get the reference from Mathwonk?
C) Is Mathwonk really Barry Mazur? :cool:

2) Mazur's article gives a really good introduction to modern number theory for non-number theory specialists like me. For example, he has an elementary introduction to Galois deformations, one of the primary highly specialized techniques that Wiles used to prove FLT.

3) Mazur gives really understandable explanations of the links between
A) Prime Races
B) the (yet to be found) proof of the Riemann hypothesis
C) elliptic modular functions
D) L-series
E) Wiles proof of FLT

4) Mazur makes it seem to me (although he does not say this) that it is highly likely that the same body of knowledge that allowed Wiles to prove FLT will allow some genius to prove the Riemann conjecture in the near future (or, at least in this century).

5) Before reading Mazur's article, I was slowly becoming convincedc that the Langlands program was key in Wiles proof and will be even more key in future breakthroughs. After reading Mazur's article, I feel even more strongly this way.

6) The equivalence of demonstrating suspected magnitudes of various error terms to the Riemann hypothesis sure looks like a promising approach to resolving the Riemann hypothesis.

7) Note that I said "resolving" and not "proving" the RH. Even the experts admit that, at this point in time, it's an even bet. This is not true of the FLT before Wiles proved it. After Ribet's work, everybody was pretty sure it was true. Everybody who followed Ribet's work, that is.

:smile:

DJ
 
Physics news on Phys.org
Link: Barry Mazur's Finding meaning in error terms.

As for your #7, I don't get that impression at all. I think not even 10% of of computer scientists think that \mathcal{P}=\mathcal{NP}, and I think that many fewer mathematicians think that RH is false.
 
CRGreathouse said:
Link: Barry Mazur's Finding meaning in error terms.

As for your #7, I don't get that impression at all. I think not even 10% of of computer scientists think that \mathcal{P}=\mathcal{NP}, and I think that many fewer mathematicians think that RH is false.

Greathouse,

So, what was your reaction, or, some of your reactions, to Mazur's article?

Did you experience the same feelings that I expressed in #1 - #6?

What was your over-all feeling about the article?

Or, is the jury still out?

I don't have any quarrel with your statement about P != NP being the common opinion. I don't think I addressed that point in my write-up, but I more-or-less agree with you (my only caveat being the growing number who suspect it might be undecidable, in which case, the words "true" and "false" take on very strange meaning. Reference: the interview with Martin Davis in one of the recent issues of the Notices of the AMS.

I also really have no basis to disagree with your statement about "the majority of mathematicians." That was not my claim, of course, so the impression you have about the "majority of mathematicians" thinking it is true does not contradict the impression that I have that "the experts agree that it is a 50-50 bet."

In fact, I'm glad you bought the subject up. I didn't want to take up space laying out the information on which I base my impression about the "opinion of the experts" on the RH if nobody was interested.

But, not in this post. I have to get some stuff together first. I hope I can dig up what I am looking for.

DJ
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...

Similar threads

Replies
2
Views
2K
Back
Top