I have added another essay to my career advice page, inspired partly by some earlier blog discussion, entitled “Continually aim just beyond one’s current range“.

Also, there seems to be some demand for discussion here on topics not directly related to any of the posts. So I will experiment a little here and turn this post into an “open thread”, in which discussion on any topic is permitted (though, of course, I would continue to ask that all comments remain polite and constructive). If this experiment turns out well, I will try to initiate some further open threads at periodic intervals on this blog.

[Update, Sep 22: As you might have noticed, I am experimenting with wordpress tags, which have recently been decoupled from wordpress categories. I am still not sure exactly what the best way to use tags and categories are, and whether there should be any attempt at standardisation amongst the maths blogs; suggestions are of course welcome.]

### Like this:

Like Loading...

*Related*

## 78 comments

Comments feed for this article

21 September, 2007 at 1:07 pm

GaspardDear Terry, it appears you are planning courses in the winter “topics in ergodic theory” and in the spring “Perelman’s proof of the Poincaré conjecture”. I was simply wondering if by any chance you were planning to have them filmed and posted on youtube or google video (that is, in the event such a thing is indeed allowed by your university)?

21 September, 2007 at 9:50 pm

James CookDear Terry,

I know it isn’t technically within your field of expertise, but nonetheless I can’t help wondering whether you’ve ever thought about the invariant subspace problem. This has always struck me as a very basic (and easy to understand) question in analysis — one which has, however, been stubbornly resistant to resolution (though lots of partial progress has been made).

22 September, 2007 at 7:02 am

RavinderYes Gaspard thats the amazing idea.

22 September, 2007 at 8:51 am

Terence TaoDear Gaspard: UCLA does not currently have a systematic program to videotape classes. But I am planning to intertwine this blog with those courses heavily when I teach them (posting lecture notes, encouraging discussion by students, and so forth); indeed, I expect my postings on non-class related topics to decrease markedly during those two quarters. It will of course be something of an experiment, and we’ll see how it goes.

Dear James: I haven’t looked at this problem since graduate school (and almost every graduate student secretly tries his or her hand at a famous unsolved problem or two). I never got anywhere myself; I would be much more comfortable with the problem if there was an obvious finite-dimensional or otherwise “discretised” or “quantitative” analogue to investigate, since that would bring things much closer to things that I actually have some experience in. [The conjecture is of course true for finite-dimensional spaces, but this does not seem to be the "right" finitisation, as it does not come close to implying the infinite-dimensional version in the limit.] But I think Timothy Gowers (who is much closer to this area) has looked a bit more at the problem, though I recall he told me once that it didn’t look amenable to the type of Banach geometry methods that he is expert in.

22 September, 2007 at 10:44 am

AdamDear Terry,

Thanks a lot for setting up this post!

I would like to write some thoughts about the Perelman situation.

In applied mathematics, we have the concept of a formal proof, where

a plan is laid out for a construction, and that of a rigorous proof, where

the formal proof is made rigorous. Usually both these works are respected

by our community, as often it is hard for anyone to be versatile enough

to both set up an interesting problem and prove all the intricate technical details.

About the general feeling that Perelman’s proof is or can be made

rigorous: Terry has written about part of the proof, and stated that

some of the geometric formulas seem miraculous. I don’t know whether

he checked all the analytical details, or whether anybody with serious credentials can vouch for the completeness of the proof, like was the

case with FLT. I think that Perelman’s antics have put mathematics in uncharted waters, and as a community we should be careful what to

do with it, to avoid a possible future embarrassment.

To show why I am uneasy, let me give an example of a soft analysis amplification problem, which was long considered to be obvious, yet

turned out not to be so. It is the Dirichlet principle, as a method of

solving Laplace’s equation. Riemann thought that for the underlying functional to attain a minimum it is enough that it is bounded below,

until Weierstrass gave a counterexample. Since in this problem one

has somehow to get around the lack of compactness, a common construction of the minimum is to amplify the space on which the

functional is defined to H^1, use its structure to get a weak solution,

and then bootstrap to show it is a classical one. Many new objects and ideas come out of this application: Sobolev spaces, functional analysis,

etc.

22 September, 2007 at 9:27 pm

Terence TaoDear Adam,

Actually, Perelman’s argument for the Poincare conjecture is perhaps one of the most intensively checked proofs in recent memory; the proof is amazing, but definitely within the reach of certification by experts (there is no computer-assisted component, for instance). In particular, the book by Morgan and Tian, just published by the Clay Institute, is very thorough with the details. Thanks to all the recent literature on Perelman’s argument, many key steps now have multiple proofs, which also adds confidence (though the variations from Perelman’s original argument are fairly minor). Finally, while Perelman’s work has many highly original ingredients, much of the actual technical execution of his ideas follows well-trodden lines, for instance building on the work of Hamilton, or on the comparison geometry of Bishop and Gromov. This reliance on (or at least similarity with) existing technology also lends confidence; to use your example, any modern paper which exploited the Dirichlet principle using modern techniques (starting with weak solutions and bootstrapping the regularity, etc.) would not arouse suspicion, given that the subtleties here have been intensively studied and it is now well understood what the pitfalls are.

I do indeed view Perelman’s entropy monotonicity formula as miraculous, but he does motivate them from a statistical mechanics perspective (and I believe some alternate derivations of this formula, related to the Yamabe invariant, have since been established). I might try to understand these derivations better when I start my class on the topic.

23 September, 2007 at 2:07 am

Attila SmithDear Terry,

since you allow us to ramble, let me ask if you know families of non-compact differentiable manifolds X such that a submersion with fibre X is a locally trivial bundle (i.e. locally downstairs the submersion is a product) .

This is true for compact X (Ehresmann) and for X=R^n ( I have no reference).

More importantly, let me thank you for your wonderful blog: you are living proof that one can be a sparkling mathematician and a gentleman. (I put Deligne in the same small category , where “small” does not only mean that I’m talking about sets …).

With all my gratitude,

Attila

23 September, 2007 at 5:56 am

robertTerry

I am wholly blown away by what you and Tim Gowers are doing to bring maths to those much younger and more able than myself. You really do do the business. At a time when western civilization seems to be eschewing several centuries of enlightenment, you guys keep shining on. And it’s a much belated education for old boys like myself.

23 September, 2007 at 11:36 am

AdamDear Terry,

To me, Perelman’s style of writing is that of a theoretical physicist,

and may not be to everyone’s liking. On the other hand, the Cao-Zhu

write-up has a soft analysis style, so that a casual reader doesn’t get

mad at nasty gaps.

The functional \int (Ru^2 + u’^2) that Perelman introduced comes up

in one of the few basic and sound physical theories, as is explained

below. What is miraculous to me, is that he doesn’t seem to know

how to provide a coherent physical explanation for its origin.

So, statistical mechanics, a play with fancy definitions, is a theory

which assumes a thermodynamical process is reversible, which is

usually not the case. In 1893, a theory for irreversible phase

transitions was proposed by van der Waals, which is based on

a free energy functional, defined on the space of phase fields

(e.g., density, quantum order parameter, etc.). Usually, it is

known in the scientific community only in rediscovered and

incomplete forms, e.g., Ginzburg-Landau superconductivity, Higgs

symmetry breaking mechanism, Cahn-Hilliard, Ball-James nonlinear elasticity, etc. Very briefly, the original functional takes the form

(in which I skip all irrelevant constants):

– \int \int K(x,y)u(x)u(y) +

\int (-u^2 + Tk [(1-u)ln(1-u)+(1+u)ln(1+u)] ), (*)

where T is the absolute temperature, k is Boltzmann’s constant,

and the double integral is recognized as Ising’s model, introduced

later. Statistical mechanics and this model are distinct extensions

of thermodynamics, unlike some recent physics textbooks claim.

To derive (*), one has to assume that (*) is a Helmholtz free

energy with a certain interplay between molecular interactions

(1st law of thermodynamics) and entropy (2nd law).

The controversy surrounding (*) is obvious: amplifying, it is defined,

say, on L^2, which is a space in which critical points are not smooth,

as below a certain critical T, call it T_c, the integrand in the single

integral is a double-well function (exercise). Therefore, the

investigation of the model is not accessible to crude analysis,

and one is tempted to use an approximation. However, then we get

a theory (I call it incomplete) which is incompatible with phase

transitions (defined, by the way, as two different densities coexisting

at the same pressure). For large T, since critical points become

smooth, the following approximation is qualitatively sound: expand

both the double and single integral in Taylor series, and take

first terms in the expansions. We get \int (u’^2 + u^2). Since

we are in the gas phase, entropy effects are dominating, and it is

correct to say that the functional used by Perelman is an entropy one.

ps The van der Waals paper was translated into English just

recently: J. Stat. Phys. 20 (1979), 197-244. Since its introduction,

uses of (*) have been mired in misunderstanding and high emotions.

23 September, 2007 at 3:01 pm

Sunday evening links! « Entertaining Research[...] evening links! 1] Terry Tao has added another essay titled Continually aim just beyond one’s current range to hi…; the title reminded me of the lines from James Elroy Flecker’s Hassan: We are the Pilgrims, [...]

23 September, 2007 at 7:25 pm

TomDear Terry,

I was just wondering what your hobbies are besides math? What are your favorite tv shows, books, movies etc..

What is your favorite food?

Thanks

24 September, 2007 at 11:36 am

AdamFood for thought: in the nineties, the name Richard Hamilton was well known in the variational phase transitions community. That certain equations are gradient flows of functionals was also well known, e.g.,

the semilinear heat equation is the L^2 gradient flow of the gradient squared version of the van der Waals free energy (\int (u’^2 + W(u))) without a mass constraint, and the Cahn-Hilliard equation is the H^-1 gradient flow of this functional with a mass constraint. An interesting reference is:

P.C. Fife, Models for phase separation and their mathematics, Electronic

Journal of Differential equations, Vol. 2000(2000), No. 48, 1-26.

Abstract: The gradient flow approach to the Cahn-Hilliard and phase

field models is developed …

As the author explains, this paper was submitted for the proceedings

of a workshop in 1991, however did not get published (I don’t know

why). It might be worth adding that it was widely and freely circulated.

It is well known that in analysis progress is done in small steps by

many previous contributors, and I hope these facts shed some light

on Terry’s comment that a part of the proof looks miraculous.

25 September, 2007 at 12:12 am

RolandFrom what I understand, Dr Perelman has abandoned mathematics and he has a heavy heart.

Can anything be done to help him?

25 September, 2007 at 3:05 am

AdamI think he said in one of his interviews in glossy magazines

that he had a problem with a lack of ethics in mathematics,

so maybe we could start to write things more honestly?

By the way, he is not the first one to abandon mathematics.

Grothendieck, a founder of modern algebraic geometry, did

so in a similar way.

26 September, 2007 at 10:01 am

AdamDear All,

I would like to thank everybody for the amazingly deep posts

and comments about so many areas of mathematics. Having

this opportunity, I would like to ask for some advice on a well

known problem many scientists have struggled with, e.g.,

Stephen Wolfram. It has to do with the prediction of pattern

formation in nature, e.g., hexagonal ones in superconductors.

Our understanding of such phenomena may lead to better

communication, e.g., fast trains.

The question is: What area of pure mathematics would be best

suited for such research?

An example of what I have in mind is a very fast one in a recent

issue of ARMA:

Xinfu Chen and Y. Oshita, An application of the modular function

in nonlocal variational problems, Arch. Ration. Mech. Anal. 186

(2007), 109-132. Abstract: Using the modular function and its

invariance under the action of a modular group and an heuristic

reduction of a mathematical model, we present a mathematical

account of a hexagonal pattern selection observed in di-block

copolymer melts.

28 September, 2007 at 2:45 am

TauberSome metaphysicists wrote a book about these issues:

R. Nadeau and M. Kafatos, The Non-Local Universe: The New

Physics and Matters of the Mind, Oxford University Press, 2001.

ps Blogs are wonderful, here is an interesting link:

http://www.cnn.com/2007/WORLD/asiapcf/09/27/myanmar.dissidents/index.html

about Ko Htike’s one.

28 September, 2007 at 10:58 pm

MaudSince this is both an open thread and a career advice thread, let me pose what I think is one of the hardest problems a beginning graduate student in math is faced with: How should one go about choosing an advisor? What factors are most important?

While everyone’s situation will be different, I’d bet that the general considerations are quite common. The student has a general idea of the area he/she would like to work in however is flexible/unsure within this area. Subject to this constraint he/she has a small list of faculty members, each in somewhat distinct areas of the field and each with his/her own basket of mixed qualities (big name but very busy, very approachable but hasn’t published a paper in several year, notoriously harsh on students but has a track record for training excellent students, track record as a good advisor but research in a related but different area, etc).

Obviously there is no formula and ‘the right thing to do’ will be dependent on the specific characteristics (of both the the potential advisers and student), which isn’t easily addressed in a generic blog entry. However, generally speaking, what considerations should one weigh most heavily?

29 September, 2007 at 8:35 am

them-wmnDear Maud: I think a good advice is to first learn two languages

well, so that one’s name is not insultive to the community.

I had this experience with Cambridge – they rejected my application

for a participation in a workshop, even though I was a Marie Curie

Fellow in Britain at the time. An Australian expert thought that my

last name sounded Indian.

30 September, 2007 at 10:16 pm

John BaezDear Maud – I wrote some advice for young scientists, including how to choose an advisor. But, I’m sure Terry would have some interesting things to add.

1 October, 2007 at 1:38 am

BaruteDear John Baez,

Your long advice has lots of interesting viewpoints, e.g., a quotation from

Grothendieck. However, to me an advisor is chosen for the purpose

of getting oneself into a specific research area. E.g., if I wanted to

work on the incompressible 3-D Euler equations, I would choose

a singular integrals expert. For an attack on the Riemann hypothesis,

I would learn functional analysis in graduate school. But such choices

are often a reflection of one’s past in high school. E.g., my favourite

pastime was doing a few integrals, rather than arithmetic and geometric problems.

1 October, 2007 at 8:39 am

Terence TaoDear Maud,

Choosing an advisor depends on quite a lot of factors, including how compatible your personality and work habits are with your advisor’s. Subject area and expertise is important, of course, but I would recommend keeping an open mind about this; just because you came into grad school wanting to work on problem X doesn’t mean that you shouldn’t also look into other problems in adjacent fields, or even in very different fields. Taking graduate courses given by a potential advisor is a good way to gauge whether that advisor would be a good fit (and also has the benefit of introducing yourself to that advisor). If there are regular graduate student seminars in your fields of interest in which faculty and graduate students interact (e.g. the graduate students present papers) I would strongly recommend you participate in them. Looking up some papers or other research of potential advisors, and otherwise “doing your homework” (e.g. looking at how other students of that advisor have fared) would also be recommended.

On my own advice page, I have two brief essays on these topics – one is to make sure that your advisor is someone who you can really talk to on a regular basis. (In some cases, you will be talking more with an informal advisor than with your formal advisor, which is fine also; the point is that you should be able to talk about research and career issues to

someonemore senior than yourself.) The other is that you should also be independently taking the initiative on these matters (e.g. looking for papers to read, conferences to attend, questions to ask, places to visit or apply to, etc.), though of course you should keep your advisor informed of your decisions in this regard.2 October, 2007 at 5:25 am

AdamDear Terry,

Due to the continuing vandalising of your blog, I suggest you

issue passes to people with academic employment, so that

they can post nonanonymously anytime. The rest could be

screened by you first. This method works quite well in interesting

news (from all over the world) discussions, in some countries.

3 October, 2007 at 6:46 am

BotongDear Terry,

I am a second year graduate student in math. When I was talking with professors and senior students about how to start my own research, I got different opinions. One is we should get well prepared before we go into a real problem — we need to be familiar with the basic language and tools in the area first. The other one is to find a problem first, and try to solve it, perhaps work together with adviser, and learn all the useful language and tools while attacking the problem. Both of them sound reasonable to me, I was wondering how to find a balance between them.

Can you give me some advice on this?

3 October, 2007 at 8:23 am

Terence TaoDear Botong,

To me, it seems that the best approach is to keep some big problems in mind as long-term goals, but focus in the short-term on easier model problems (or “dumb questions”) which lie just outside the range of what you currently know, and which therefore force you to learn more theory in order to tackle them. As you solve these “toy” problems and acquire more knowledge of your field, you will be able to better judge how feasible (or how interesting) your long-term research goals are, and to calibrate them.

I have several essays on my career page about these topics.

4 October, 2007 at 3:34 am

AdamDear All,

The proof of Riemann Hypothesis is of major interest to many

branches of science. At the current rate of progress, it may take

years to complete. Has anyone thought about establishing some

kind of collaborative effort, akin to the Manhattan Project?

4 October, 2007 at 11:30 am

ChessI would like to congratulate Ben Green, our frequent contributor:

http://www.ams.org/dynamic_archive/home-news.html#sastra-2007

4 October, 2007 at 7:03 pm

Terence TaoDear Adam,

I think there is not enough of an overall plan of attack to make a concerted effort on the Riemann hypothesis an efficient use of mathematical talent. (This is in contrast to, say, the classification of finite simple groups, which did have a coherent vision that was able to successfully coordinate the effort of a hundred or so mathematicians.) On the other hand, I could imagine that the Langlands program could one day require a sustained collaborative effort.

My guess (based on very little data) is that any new breakthrough on RH would first require a breakthrough in some tangentially related problem (e.g., to pick an example at random, some breakthrough in our understanding of eigenfunctions on arithmetic surfaces), in order to introduce a new method or idea which may eventually impact RH. So a direct assault may not be the right way to proceed at this point.

4 October, 2007 at 7:12 pm

AdamDear Terry,

I agree, though I heard that only one famous mathematician

is attacking the Langlands program seriously.

4 October, 2007 at 8:32 pm

AdamThere was some mention about quarternions earlier today.

Curiously, Maxwell’s equations were originally written in

quarternion form, before they were modified by Oliver

Heaviside and William Gibbs into today’s most used

notation with vectors.

4 October, 2007 at 9:19 pm

AdamDear Terry,

Now that the academic year started, I getting interested in

your work with Ben Green, however, I would like to ask:

where was van der Corput’s result on length 3 progressions

published, because in:

Green, Ben, Annals of Mathematics, 161 (2005), 1609-1636,

this work is not referenced.

5 October, 2007 at 7:58 am

Terence TaoAdam: please do not use sockpuppets to create the illusion of dialogue. If you wish to discuss your own topics extensively, I suggest that you use your own personal web site or blog for this purpose.

5 October, 2007 at 8:22 am

Adam ChmajDear Adam,

There are 3 fine books and some others giving an apprioprate

introduction to the quaternions. On amazon.com, this one was written

first, has five stars and is the cheapest:

Quaternions and Rotation Sequences: A Primer with Applications

to Orbits, Aerospace and Virtual Reality (Paperback), by J. B. Kuipers,

Princeton University Press (August 19, 2002).

5 October, 2007 at 12:44 pm

Adam ChmajDear All,

Going back to giving advice to young students, I think it is

best not to use any sophisticated doping, apart from coffee,

as to produce something truly original sometimes takes a lot of

time.

Dear Terry,

Going back to discussions about Perelman’s preprints, what do

you think about line (1.5.6) in “A complete proof of the Poincare

…”, Asian J. Math. Vol. 10, No.2 pp. 165-492, June 2006?

5 October, 2007 at 11:47 pm

EvrenHello Terry,

I have a question about your answer to Botong, which was basically about making research in mathematics (learning theory by itself or get ourselves forced to learn theory to tackle a problem). If we wanted to learn theory as we tackle with toy problems, where should we find such toy problems? I mean, the problems in math journals are already too specialized to be understood by a beginner. By toy problems, did you mean that some hard problems in respected grad textbooks? If so, should we just open the exercises section of the book try out some problems than read the relevant text to solve the problem? Do you think that taking a text book reading it and solving the problems at the end of each section is a good way of learning?

THANKS!

6 October, 2007 at 8:52 am

Terence TaoDear Evren,

I talk a bit about this in my essays “asking yourself dumb questions” and “learn and relearn your field“. Your advisor should also know what the good “toy” versions of various interesting problems are. And, of course, doing the exercises in textbooks is certainly an important aspect to learning a subject, which really can’t be substituted for.

7 October, 2007 at 1:04 am

Ganesh RaghavanDear Dr Terry Tao-

I have an intuitive proof of Goldbach Conjecture that Iam pasting here. Can you provide your comments on this?

Thanks,

Ganesh Raghavan

“Let us consider an even number N. N is greater than 2. The following is the construct that goes to prove that an even number can be written as a sum of 2 primes.

1. From N, go back through (N-1), (N-2), etc till a prime number is encountered.

2. The prime number encountered can be called P1 and is at a distance of (N-P1) from N. i.e P1=> (N-P1)

3. The prime number P1 is at a distance P1 from 0

4. From P1, go back till half of the number N is reached.

We now can have 2 cases

Case (i) Half of the number is even or odd but not prime

1. Find the difference between (N/2) and P1 and call it ∆

2. ∆ = (N/2) – (N-P1) —– (1)

3. With ∆ as radius from (N/2), draw a circle.

4. If there is another prime at the same distance ∆ from (N/2), call it P2

5. P2 = (P1-2∆) ——- (2)

6. Equation (1) can be written in terms of N as

N = 2 (P1-∆) = P1-2∆+P1 ——- (3)

7. Substituting (2) in (3) we get N.

N = P2 + P1

This means an even number can be written as a sum of 2 primes

If there is no prime at the same distance ∆ from (N/2), we do not consider P1 as prime but go back till we reach another prime number. Then we iterate steps 1 to 7 in Case (i)

Case (ii) Half of the number is prime

8. Find a prime number greater than half of the even number N

9. Repeat steps 1 through 7 from Case (i)

10. If there is no prime at the same distance ∆ from (N/2) which is smaller than (N/2), stop at (N/2) and call it as prime number P1

11. From Equation (1) in Step 2, ∆ = 0

12. From Equation (2) in Step 5, P2=P1=(N/2)

13. Equation (3) says, the number N is then a sum of 2 same prime numbers (N/2)

Thus combining Case (i) and Case (ii), any even number, N > 2, can always be written as a sum of 2 primes”

7 October, 2007 at 11:22 am

AnonymousI’m not Terrence Tao, but I don’t think there is any reason case (i) should terminate, i.e. it seems possible that you could go through all the primes and never be able to find your P2.

9 October, 2007 at 1:03 am

Ganesh RaghavanBen Green, together with Terence Tao have proved that, given any number n, there are infinitely many sequences consisting of exactly n evenly spaced primes. This can be invoked to prove that we will always be able to find P2

9 October, 2007 at 8:42 am

Terence TaoDear Ganesh,

Unfortunately my theorem with Ben is not a magic wand; we do provide infinitely many arithmetic progressions of primes, but these progressions need not be placed where one would desire them to be. Sometimes, even having infinitely many of a given object is not enough. (For instance, there are infinitely many even numbers, but one still cannot write an odd number as the sum of two even numbers, because the even numbers are placed in an unfavourable location for this task.)

However, if one applies the heuristic that the primes are distributed “randomly”, then (as was first done by Hardy and Littlewood), one can use probabilistic arguments to provide a fairly convincing case (though definitely not a rigorous proof) that the Goldbach conjecture should be true for all sufficiently large even integers (see e.g. the Wikipedia page on the conjecture for a discussion). Unfortunately we do not have enough control on the (pseudo)-randomness of the primes to make this heuristic argument precise yet.

11 October, 2007 at 3:57 am

freshmanMy teachers told me that the concepts of the maths are important.But I don’t accept this teaching method.The college students may have a new way of studying.Would you like to give me some advice?

13 October, 2007 at 12:46 pm

Jonathan Vos PostConversely:

A131741 a(n) is least prime (not already in list) such that no 3-term subset forms an arithmetic progression.

2, 3, 5, 11, 13, 29, 31, 37, 41, 67, 73, 83, 89, 101, 107, 127, 139, 157, 179, 193, 227, 233, 263, 271, 281, 307, 331, 337, 379, 389, 397, 401, 409, 431, 433, 467, 491, 499, 509, 563, 571, 613, 641, 647, 743, 769, 809, 823, 883, 887, 907, 937, 983, 1009, 1021

COMMENT

a(n) is the smallest prime such that there is no i < j < n with a(n) – a(j) = a(j) – a(i).

EXAMPLE

Table showing derivation of first 10 values.

n a(n) comment

1 2

2 3

3 5

4 11 a(4) can’t be 7 because (3,5,7) is in arithmetic progression.

5 13

6 29 can’t be 17 because (5,11,17); can’t be 19 because (3,11,19); can’t be 23 because (3,13,23)

7 31

8 37

9 41

10 67 not 43 as (31,37,43); not 47 as (11,29,47); not 53 as (29,41,53); not 59 as (13,31,59); not 61 as (13,37,61)

MATHEMATICA

f[l_List] := Block[{c, f = 0}, c = If[l == {}, 0, l[[ -1]]]; While[f == 0, c = NextPrime[c]; If[Intersection[l, l - (c - l)] == {}, f = 1]; ]; Append[l, c] ]; Nest[f, {}, 100]

CROSSREFS

Cf. A000040, A065825.

KEYWORD

easy,nonn,new

AUTHOR

Jonathan Vos Post (jvospost2(AT)yahoo.com), Oct 04 2007

EXTENSIONS

More terms and program from Ray Chandler .

16 December, 2007 at 2:18 am

GordonDear Adam,

Quaternions could be helpful in the proof of the RH

– this is the approach Louis de Branges is counting on

(see the Apologies and other preprints on his website).

However, Brian Conrey doesn’t think much of this approach:

http://www.lrb.co.uk/v26/n14/sabb01_.html

17 December, 2007 at 11:29 am

AdamDear Gordon,

Lehmer’s phenomenon is a typical lack of structural stability.

There are nonlinear toy models which behave this way – they

were successfully handled not only by complex embedding,

but also by combinatorial argumentation – this is what Conrey

suggested for the proof of the RH. The calculation would surely

have to be massive.

ps “If I were to awaken after having slept for a thousand

years, my first question would be: has the Riemann hypothesis

been proven?” – David Hilbert.

7 February, 2008 at 3:22 pm

MiltosCool…

23 March, 2008 at 3:13 am

puzzledOkay, I give up on this.

It’s already paradoxical if you look at only one of the triangles, e.g. the top one: if you calculate the area using the formula A=(1/2)bh, you get 32.5; whereas if you add the areas of the subregions you get 32.

What in the world am I missing?

23 March, 2008 at 6:39 am

John Armstrongpuzzled, the problem is that the triangles don’t quite have the same slope. The greenish one has a slope of 2/5, while the red one has a slope of 3/8.

Since 3/8 is just slightly lower than 2/5, the upper “triangle” actually has a very slight dent in its hypotenuse, while the lower one has a very slight bulge. The difference between the dent and the bulge amounts to exactly one square.

30 March, 2008 at 3:34 pm

Dick BolandDear Terry,

I have read your advice blogs on writing and submitting papers and I take them to heart. I have been working on a paper and went back and wrote a detailed introduction and I can see that the structure needs some work – thank you. I have read the career advice on your site with great interest. I saw somewhere, a comment from somebody giving you kudos for a comment you apparently made regarding ‘the dangers of self-study’ or the like. I am certainly interested in anything you have to say about this, but could not find the referenced comment.

I also wanted to ask for your thoughts on a situation which is best described as hypothetical, though the veil is extremely thin. Assume there is an amateur mathematician who only discovered his gifts and passions for math latently. But, he is a working stiff with no resources, friends or contact with the mathematical community or academia. Early on, in his self discovery and road to mathematical maturity, he makes some mistakes and a couple of claims, which he does retract – the point being, he learns and matures via the only option open to him, that being self-study. He stumbles, but never becomes a flamer or a crank, and in fact becomes afraid to say anything at all. Fast-forward a few years and here is this guy who doesn’t know much except how much he doesn’t know, but he has kept on spear-heading into his areas of interest because he his helplessly compelled to do so, related in part to a disability which also affects his abilities for ‘human social communication’, something like Asperger’s Syndrome say. Now say, again hypothetically, this guy makes a couple of breakthroughs and wants to publish and seek to find a way to go back to school and pursue a proper education and career as a research mathematician.

If such a person actually exists and actually ‘has the stuff’ and the motivation, and now has results that prove that contention, what is the best way to proceed toward the goal of breaking through? It seems obvious that he should publish, but let’s say the results could be taken much farther in the hands of a ‘pro’, turning a remarkable amateur paper into a seminal paper for the times. So, perhaps he wants to make friends with a ‘pro’ for co-authoring, or a transmitted by, or at least a reality check. Part of the appeal of this approach is that there are some pieces of advice on writing papers that are impossible for this fellow to follow, such as referencing all the current work and giving the proper acknowledgments, not to mention an inability to produce a paper that doesn’t have ‘amateur’ written all over it. He can submit what he has on his own, and it is good, let’s say, but still incomplete in many regards and he fears, whether accepted or not, he will be left in the dust anyway.

He also fears that all amateur papers are summarily dismissed and that no one in the mathematical community actually believes his existence is possible. Due to his status and communication problems, and despite the warm-hearted, welcoming, outreaching, forgiving, friendly hand of hope, encouragement and universal love that every mathematician is famous for, he can’t seem to make enough of a connection to simply get advice on the best way to proceed, much less anyone to have a look, much less anyone to help, yet he has learned enough to know that what he has discovered is original and important, a claim which only increases the ‘scoff’ factor. What advice would you have for this poor, tortured, hypothetical soul?

31 March, 2008 at 9:45 pm

Terence TaoDear Dick,

Pretty much the only way to get the level of experience and familiarity with modern mathematics (and its attendant literature, folklore, culture, etc.) needed to publish quality mathematical research is to go through graduate school (or at least an honours undergraduate program). It is not unheard of to have mature students attend and complete a Ph.D. in mathematics; I know of one person, for instance, who left graduate school to pursue a business career, but then return two decades later to finish the Ph.D.

I should note, though, that writing papers is only one aspect of mathematical research; for instance, a large portion of one’s research time as a graduate student tends to be devoted to hunting down and reading books and papers (or listening to talks and seminars) and working out countless minor technical issues with what one learns from these sources. It can be a fair amount of work at times, and not particularly glamorous, but it is rather essential to getting a full and deep understanding of one’s field.

1 April, 2008 at 9:28 am

Dick BolandThanks Terry,

I appreciate your blog and taking the time to pen your thoughts. I do believe our mature friend understands what you have said implicitly. If he has important results that should be on the books irrespective of his formal education and wants them to serve as demonstration of merit toward justifying financial support to acquire a formal education (because it is the only conceivably feasible option to acquire said financing), but he can’t publish without the formal education, what should he do with the results?

Regards,

Dick Boland

9 June, 2008 at 6:21 am

Beetle B.Hi Terry,

I was just wondering if it would be possible for you to have per-category (or per-tag) feeds. I know this is possible with the WordPress software – either in the Settings or via a plugin – not sure about wordpress.com.

It would be immensely useful. Some people may only want to read just your opinion, expository and/or non-technical posts…

Thanks.

14 June, 2008 at 8:30 am

Terence TaoDear Beetle B.,

According to the wordpress.com FAQ entry at

http://faq.wordpress.com/2005/09/26/category-atom-feeds/

it seems that RSS feeds are available for each category by adding “/feed/” at the end of the URL for that category.

28 January, 2009 at 3:01 pm

Restriction questionHello,

I have a question about your (Park City) survey on the restriction conjecture (this is the most appropriate thread I could find). In these notes you talk about the Restriction problem for the cone, sphere, and paraboloid. You endow each of these surfaces with what you call the canonical measure. In the case of the sphere its the surface measure, in the case of the paraboloid it is the Lebesgue measure under a pullback, yet in the case of the cone its the Lebesgue measure under pullback with an additional factor. In the case of the cone, you have a brief comment/exercise justifying this particular choice (because it preserves certain symmetries of the cone with respect to linear transformations). Also, these choices of measures seem to be the right ones for applications to the related (wave, Schrodinger, and Helmholtz) PDEs.

That said, however, I can’t see why these choices are canonical to the particular surfaces. For example, if I were to consider the restriction problem for an arbitrary surface in R^n is there a canonical choice of measure?

28 January, 2009 at 4:36 pm

Terence TaoNot every surface has a canonical measure (other than surface measure, of course, although this measure depends on the inner product structure of the ambient space and so can be argued to not be totally canonical either). What distinguishes the sphere, paraboloid, and cone from other surfaces is that they are homogeneous spaces, i.e. they have the transitive action of a Lie group (the rotation group, Galilean group, and Lorentz group respectively), and thus come with a Haar measure which is well-defined up to constants.

29 January, 2009 at 8:58 am

aWhat about using results whose proofs you don’t know/don’t understand?

Sometimes in, say, analytic number theory, people borrow results that some algebraic geometer promised is true, and it would take a lifetime to go and verify the proof. That’s very scary.

Why do we do mathematics? Is it:

1. to know: ie to have answers to any questions about the things you study

2. to understand: ie to be able to prove whatever you want about the things you study.

I guess most of us do math to gain a deep understanding of the mathematical objects we study; because we care about *those particular objects* (otherwise it becomes an exercise in logical deductions). But some of the most crucial facts about our favourite objects are ridiculously hard to prove, and it may take decades to properly understand them.

Of course, I like knowing the answers too. But all my life I always thought that whenever you make any mathematical statement, if someone tortures you enough, you should be able to write down the proof from first principles.

29 January, 2009 at 9:01 am

rcourantDear Terry,

What do you mean when you say you put things in a “black box?” For example in your most recent Analysis notes you said that it would be okay to put a particular concept in a “black box.”

29 January, 2009 at 9:06 am

supermanIs it possible that every 100-term AP in the primes is contained in a 101-term AP in the primes? The quantitative/density bounds aren’t enough for this, but perhaps there is a direct argument?

29 January, 2009 at 10:49 am

Terence TaoDear rcourant, a “black box” result is one for which the hypotheses and conclusion is known, but the proof is not (in analogy with black box systems). It relates to a’s question about whether one should feel comfortable using results for which one does not know the proof. As a temporary measure, there is nothing wrong with this, especially if the proof comes from a very different area of mathematics than the one that one is focusing on, but of course one would ideally like to understand all the mathematical results that go into a proof one is trying to give, in order to be more certain about the proof, and to avoid errors caused by misunderstanding a result that was being applied as a black box.

Of course, given how vast mathematics is, it is often not feasible to read the proof of every result one needs line-by-line, but if one can get to the point where one has a heuristic understanding of why the result is true, at least (e.g. one works out some key examples, or reasons by analogy with simpler results of a similar nature, etc.), this is often good enough. In many cases, one does not need the full strength of a difficult result in one’s applications, and a simpler special case of it can often be worked out more directly by hand, which is also a good exercise to help one understand the full result.

Dear superman: my theorem with Ben implies that the number of progressions of primes less than N of length 100 is asymptotically larger than for some absolute constant c, whereas standard sieve theory methods show that the number of progressions if length 101 is less than for some other constant C. Letting N be large enough, we can conclude that not every prime 100-AP is part of a prime 101-AP.

8 February, 2009 at 11:28 pm

Stuart AndersonI have been reading some of your comments on Perelman’s proof, and if I have understood correctly, among other things, he has made some progress in statistical mechanics. This called to mind an old problem I had read recently;

In a paper ‘An Introduction To Probability And Random Processes’ by Kenneth Baclawski and Gian-Carlo Rota (1979) http://www.ellerman.org/Davids-Stuff/Maths/Rota-Baclawski-Prob-Theory-79.pdf, the authors posed a problem;

“We have a rectangular carpet and an indefinite supply of perfect pennies. What is the probability that if we drop the pennies on the carpet at random no two of them will overlap? This problem is one of the most important problems in statistical mechanics. If we could answer it we would know, for example, why water boils at 100C, on the basis of purely atomic computations. Nothing is known about this problem.”

I’ve tried using my undergraduate calculus but didnt get far, perhaps reducing the problem to simpler one and using combinatoric arguments might work?

Do you or anyone else know if this has been solved, or if progress has been made on it?

15 June, 2009 at 1:23 am

janiceenbergI’m new here on the forum, found it by searching google. I look forward to chatting about various topics with all of you.

21 June, 2009 at 8:35 pm

AnonymousCould you give a reference for the reoccurring statement (on your blog) that the restriction conjecture implies the Kakeya conjecture? thanks.

22 June, 2009 at 8:28 pm

Terence TaoDear Anonymous,

One can find a proof in Wolff’s survey article “recent progress on the Kakeya problem”. I believe the first formal appearance of this claim is in a paper by Beckner, Carbery, Semmes, and Soria, though the idea really goes back to Fefferman’s famous disk multiplier problem.

24 June, 2009 at 4:15 pm

AP QuestionI have two (related) questions regarding your work with Green on Primes in AP.

First, in the original paper as well as subsequent work (as well as on this blog and a note on your website) you have addressed numerous quantitative questions related to the theorem such as (1) how big can the first k term AP (in the primes) be and (2) how many k term AP’s are there less then N (which is sharp up to the constant!). However, as far as I have seen, you didn’t explicitly give bounds of the form, “any subset of P \cap [N] with density greater than F_k(N) must contain a k-term AP”, although maybe I just missed this. I did notice that Green obtained a bound of this form in his initial work on 3-term AP’s. Can bounds of this form be extracted from these methods or is it (perhaps) a casualty of moving to a more ergodic point of view?

Secondly, related to this last point, I was hopefuly you would say something about why you took the ergodic approach. Was this a matter of convenience, or is there a fundamental obstacle to taking a more Fourier analytic approach, consistent with Green’s original paper?

25 June, 2009 at 12:38 pm

Terence TaoThe arguments in my paper with Ben are quantitative (we use finitary analogues of ergodic theory rather than infinitary ones) do in principle give an effective bound for this quantity . My guess is that it will look something like where is the 5-fold iterated logarithm.

The Fourier analytic approach eventually works (modulo the inverse conjecture for the Gowers norm, which is not yet fully resolved), and is the topic of several further papers of myself with Ben. The approach actually gives more precise information (in particular, it gives the right constant for the number of k-term progressions asymptotically), but is substantially lengthier.

4 November, 2009 at 11:14 am

Ardninam LawargaHi Professor Tao and To Whom It May Concern:

I program for fun in various languages, mostly in C# language using WPF, Silverlight, ADO, ASP as the front end. Saw this blog on Forbes magazine and was curious to anybody reading this thread if they could suggest some cool math related programs to write. I have a few ideas but could use some more input.

I did see the suggestion by Prof. Tao for turning math classifications into a sort of periodic table. This is quite easy to do in ADO.NET as a database but the difficulty would be in having nice graphics… that is the gating factor in writing such an app. If anybody would supply me with the graphics I can write this type program fairly easily.

Here are some thoughts I have for programs that are math related, but I could use more input.

1) The Game of Life as expresed by British mathematician John Horton Conway in 1970. I wrote this already actually, and I mention it here as the class of idea I am interested in finding from anybody reading this.

2) Gambler’s Ruin problem–where you flip a coin from a given level and count how many iterations N it takes to go to zero, with 50% chance of going up one unit and 50% chance of going down– I wrote this as well in console mode (non-graphical output), and now I am going to work on expressing the output in Silverlight or WPF (which has outstanding graphics capabilities). What’s interesting is that ‘survivors’ of Gambler’s Ruin (candidates that did not touch zero in period M) for any period M (M > N) of iterations appear to be a sort of Poisson distribution. The longer you make M, at any given level, the more survivors you but it’s a nonlinear relationship it seems, like Poisson’s distribution perhaps. It’s also cool to graph the output and see how many candidates die in any interval despite reaching a very high level. This is sort of like the laws of entropy–you can actually defeat falling to zero for a very long time.

3) A Polya urn problem (http://en.wikipedia.org/wiki/Urn_problem) but for ants. I saw this in the book “Butterfly Economics” and it involves the following: given some ants who have the opportunity to visit two food sources, A and B (you can generalize this to any number though), and given three different outcomes (ant visits previous food source it visited, ant visits the food source of the first ant it meets returning from a food source, and ant visits randomly one of the two food sources), you graph the percentage of ants that are at any given food source at any time. The graph is nonlinear and depending on how you tweak the coefficients you can get jumps in the percentage of ants visiting any given pile–feed-forward behavior as they say in systems engineering, no pun intended.

Anyway I have a few other ideas such as graphing the output of various distributions like the broken stick distribution and the Galton–Watson process but the point of this was to underscore what kind of projects I’m looking for.

No time limit, any replies appreciated, as I just do this outside of my day job for fun.

Sincerely,

Ardninam Lawarga

email: yamun31781@mypacks.net

8 November, 2009 at 1:12 am

Two new science & physics sites for asking questions « episodic thoughts[...] that rule, but at least there’s a great potential here! I hope influencial bloggers like Terry Tao, and Peter Woit (who asked if such site existed), can mention them: that would boost the [...]

24 December, 2009 at 9:20 pm

marthafinesMerry Christmas to all… and to all a good night.

21 April, 2010 at 2:17 pm

Wayne LewisProfessor Tao,

I have what may be silly question, but I have given up trying to figure it out and trying to find analysts who know the answer. Is Gamma(z) ever a negative real number if z is not a negative real number?

Aloha,

Wayne

21 April, 2010 at 8:49 pm

Terence TaoYes; this can be seen from Stirling’s approximation and the argument principle.

More generally, for these sorts of questions, I recommend Math Overflow,

http://mathoverflow.net/

27 September, 2010 at 8:35 am

HONGDear Professor Tao,

I am not sure this is the right place to ask the question about your paper “CALESON MEASURES, TREEES, EXTRAPOLATION, AND T(b) THEOREMS”. In Lemma 4.1(or Lemma 4.2)(Calderon-Zygmund decomposition for size), I can not check that your induction hypothesis can give the right estimation, i.e. your induction on the size of a tree can give the estimation on the corresponding maximal size for the same tree. I wonder maybe we can go back to the method in “Chopping big trees into little trees”.

Thank you very much for all the wonderful works, thought I am not sure you have the time to answer my question.

27 September, 2010 at 10:50 am

Terence TaoI am sorry, I do not understand the question. No induction argument appears in the proofs of Lemmas 4.1 and 4.2 in our paper. To bound the maximal size of a on a tree, we can upper bound it by 2^n because we are assuming that a has maximal size at most 2^n on the larger collection P_n, and we can of course lower bound the maximal size by the size, which is at least 2^{n-1} by construction.

28 September, 2010 at 3:50 am

HONGIn Lemma 4.1 we select a tree T such that the size of a on the tree bigger than 2^{n-1} maximal with respect to set inclusion, but this can not ensure that the size of a on any convex subtree of T is bigger than 2^{n-1}, even if we are assuming the upper-bound for the size of a on any convex tree is 2^n. For instance, a tree T consisted of two tiles is selected most due to its top, the size of a on another tile can be very small.

Maybe, I’m making some dumb mistakes!

Thanks anyway!

28 September, 2010 at 7:42 am

Terence TaoTo ensure a lower bound on the maximal size of a tree T, it suffices to lower bound just a single sub-tree of T; one does not need to lower bound _all_ subtrees of T. (This is because we are lower-bounding a sup, rather than an inf.)

In this particular case, the entire tree T has size at least 2^{n-1}, and so the maximal size of T is also at least 2^{n-1}.

23 May, 2011 at 9:02 am

KenDear Terence,

I have been fascinated with the greatest integer function for the past decade. I have read journal and internet articles on it, read books on number-theory, and did a lot of research on my own. Although I have accumulated a lot of material over ten years, good literature on the greatest integer function (aside from its basic properties and applications) is very scarce. My purpose for posting this entry is not to promote my research here, but to inquire about advanced properties and applications for the greatest integer function that I have missed. I have put this question to other professors, but none of them seemed to know very much about the greatest integer function.

Then again, I cannot ask you what I missed unless I show you what I have done. The Full Text page on my site has a short summary listing chapter objectives just below the link to the pdf. In addition to addressing topics that I missed, by reading the summary, you could also give me ideas for what chapter objectives could be pursued further. Thank you.

Your fan,

Kenneth Beitler

12 October, 2012 at 10:33 am

Anthony MorrisHello there. I would greatly appreciate a comment on this original take on prime numbers – http://archive.org/details/PrimeNumbers_986

Thanks Ant

11 November, 2012 at 6:06 pm

Ahmed RomanDr. Tao,

I and a few of my colleagues have been thinking about the following problem and are not making much progress. The question is made up by one of us and we think it is rather interesting. Here is the question:

1) Find a function from the real line to itself such that the function sends the rational numbers to the rational numbers and such that the derivative of the function at q is not rational for some rational number q.

2) After thinking about problem 1, one might ask the following question:

Is every continuous function from the real line to itself which sends the rational numbers to the rational numbers locally rational i.e. can one approximate the function on any small neighborhood by some rational function(different neighborhoods requiring different rational functions of-course).

Any intuition or hints would be appreciated.

29 November, 2012 at 12:37 pm

JeremyTerry, I accidentally posted my email address in my name field (and vice versa) with this post: http://terrytao.wordpress.com/2011/04/07/the-blue-eyed-islanders-puzzle-repost/#comment-197446. Would you please fix this for me? Or just delete the post? I reposted with the correct information just after I noticed my mistake, so if you can fix the first post (preferable, since it has replies already) then you can delete the second. Otherwise, vice-versa.

Thanks!

[Done - T.]27 January, 2013 at 5:07 pm

RolandHi there.

This is an open challenge for any mathematically-apt mind looking for entertainment. Presented in a math olympiad 25 years ago:

Some Pythagorean triangles (a²+b²=c²), coincidentally, have integer lengths. For example 3²+4²=5².

Prove that for any integer Pythagorean triangle, one of the side lengths is

always a multiple of 5.

The original challenge consists of answering this in less than 1 hour,

with an 8th grader’s toolset.

Needless to say: i lamely excused myself in the original situation and got zero points. 25 years later, i have studied something other than mathematics. But my hard drive still rattling…

Any idea, any one ???

17 February, 2014 at 3:24 am

mattiThis fan site has spelt your name wrong

http://retrokiwi.spreadshirt.com/terry-teo-mens-t-shirt-colour-changeable-A1157786/customize/color/2