Most helpful heuristic? - MathOverflow

Most helpful heuristic?

2009-10-28T16:09:54Z

What's the most useful piece of mathematical "folk wisdom" you've encountered? I'm talking here about things that aren't theorems, or even conjectures, or even shadows of conjectures -- just broad analogies or slogans that nonetheless tend to be incredibly useful for formulating conjectures, understanding when a line of attack on a problem will or won't work, etc.

The first example that leaps to my mind is the Cramer probabilistic model of the primes, which tends to give astoundingly good predictions for all sorts of things despite being horribly simple.

Oh, right: Community wiki, one tidbit of wisdom per post, please!

Answer by Harrison Brown for Most helpful heuristic?

2009-10-28T16:12:16Z

Putting it on here to be up/downvoted with the rest: Cramer's probabilistic model of the primes, wherein an integer n is prime with probability 1/log n.

Answer by Kim Greene for Most helpful heuristic?

2009-10-28T16:21:38Z

Rather than suggest one heuristic, I thought I would point out that the Tricki (http://www.tricki.org) is a repository of useful heuristics.

Answer by Malik Younsi for Most helpful heuristic?

2009-10-28T16:52:11Z

A very interesting heuristic is a principle in complex variables called "Bloch's heuristic principle".

Bloch's principle is about families of analytic functions called "normal". A family F of analytic functions on a domain D is called normal on D if every sequence of functions of F has a subsequence that converges uniformly on compact subsets (either to an analytic function or to infinity). Normal families are very studied for their applications in complex dynamics.

Bloch's principle goes as follows :

A family of analytic functions on a domain D having a property in common is most likely to be normal if there is no non-constant entire function having this property on the whole complex plane.

There are many examples of Bloch's principle. For example, take the property of being bounded : a well known theorem of Montel says that a family of analytic functions on a domain D which is uniformly bounded is necessarily normal on D, and Liouville's theorem says that there is no non-constant entire bounded function.

Or, take the property of omitting two distinct complex values. Again, a theorem of Montel says that a family of analytic functions on a domain D such that each function omits a,b in C, a different than b, is normal on D. The version for the whole complex plane is a well known theorem of Picard, that says that there is no non-constant entire function that omits two distinct complex values.

However, there are many counter-examples to Bloch's principle as it is stated, but it can be transformed into a rigourous theorem that goes like "If a property satisfies these conditions, then bloch's principle is respected".

I wouldn't qualify Bloch's principle as "most helpful", but it is certainly interesting.

Malik

Answer by Yemon Choi for Most helpful heuristic?

2009-10-28T17:06:10Z

I don't know how useful it is in front-line research, but one of my former probability lecturers once made the following suggestion: "When in doubt, interchange the order of integration and summation. Miracles can occur."

On a more temperate note, although Fubini's theorem isn't a heuristic, when correctly applied, it's often worth ignoring integrability/convergence/a.e. issues and doing some formal manipulations, as long as one then goes through it again properly.

Answer by Michael Lugo for Most helpful heuristic?

2009-10-28T19:03:17Z

It's sometimes useful to think of log x as (x^0 / 0), which is what you get by integrating x^(-1) using the usual formula for integrating x^n when n is not -1.

Answer by John D. Cook for Most helpful heuristic?

2009-10-28T19:17:32Z

"The shortest path between two truths in the real domain passes through the complex domain." -- Jacques Hadamard

Answer by Qiaochu Yuan for Most helpful heuristic?

2009-10-28T19:29:44Z

A sort-of heuristic in combinatorics is that if you can't figure out what to do with a set, take the free abelian group / vector space on that set and work with linear transformations instead of functions. For example, there is a certain condition on certain linear operators one can define on the free vector space on a graded poset that guarantees the ranks are unimodal, and for many applications of this condition a direct proof of unimodality isn't known.

Answer by Georges Elencwajg for Most helpful heuristic?

2009-10-28T20:00:52Z

Dear harrison,

in complex geometry there is Oka's principle. It says that on a stein manifold, if there is no obstruction to a continuous construction there will be no obstruction to a holomorphic construction either.

[A stein manifold is a holomorphic submanifold of C^n : it is the analogue in the complex analytic category of affine varieties.]

The simplest example: consider an open subset U of C and a point p in U. Given a holomorphic function on U-p, it can be holomorphically extended across p as soon as it can be continuously extended ( U is stein, as is every connected non-compact complex manifold of dimension one: Behnke-Stein's theorem).

Next simplest example: on a stein manifold two holomorphic line bundles are analytically isomorphic as soon as they are topologically isomorphic.

This last result was vastly generalized by Grauert to the case of an arbitrary principal bundle( with group an arbitrary complex lie group) over a stein manifold: a remarkable achievement.

And Grauert's theorem has been generalized by Gromov to a new instance of Oka's principle...

You will find a very poetic homage to Oka and his principle in the following article

http://www.jstage.jst.go.jp/article/kyushumfs/33/1/83/_pdf

in which J.Kajiwara explains that Oka lives in Buddha's paradise.

Friendly, Georges.

PS Here is a very exhaustive survey by Pit-Mann Wong I have just found by googling

http://www.nd.edu/~pmwong/OKA.pdf

Answer by Agusti Roig for Most helpful heuristic?

2009-10-28T20:24:08Z

Three of the most useful heuristic rules I've learnt:

(1) When trying to define a morphism that has to make a diagram commutative, first forget about signs: in the end, they will agree.

(2) If you want to prove something using induction, first check if it works (besides for n=1) for n=2.

(3) Trying to define a morphism that has to fulfil some universal property? -The first one (diferent from zero or constant) that you can imagine / find is probably: (a) the only non trivial one that exists, (b) that miraculously fulfils also your requirements.

Answer by Gabe Cunningham for Most helpful heuristic?

2009-10-29T00:10:54Z

Any identity of power series that holds for sufficiently small values of the variable(s) also holds for formal power series.

Answer by foocorge for Most helpful heuristic?

2009-10-29T00:13:38Z

I don't remember where I heard this, but I recall hearing about a mathematician who said that if an assertion was true for a general 3x3 matrix, then he would believe that same assertion with confidence for any square matrix.

Answer by Graham Jones for Most helpful heuristic?

2009-10-29T08:57:33Z

In finite group theory: if your conjecture is true for {2,3} groups it is probably true for all soluble groups.

Answer by Sebastian Scholtes for Most helpful heuristic?

2009-10-29T09:43:21Z

I like Littlewood's three principles of real analysis

Every measurable set is nearly a finite sum of intervals
Every L_p function is nearly continuous
Every convergent sequence of functions is nearly uniformly convergent,

of which 2 and 3 are in fact Lusin's and Egorov's Theorems.

http://en.wikipedia.org/wiki/Littlewood%27s_three_principles_of_real_analysis

Answer by Kevin Lin for Most helpful heuristic?

2009-10-29T14:21:36Z

Weinstein's Lagrangian creed: Everything is a Lagrangian submanifold

Answer by Yoo for Most helpful heuristic?

2009-11-02T13:21:28Z

Every set or function you can build in a concrete fashion starting from (countablye many) other measurable sets or functions is measurable.

There are some counterexample to this. But it gets you a feel for measurability like we have a feel for what is continuous and what is not.