Sy Friedman and I recently submitted the paper and projective well-orderings of the reals to The Journal of Symbolic Logic. The preprint is available at my papers page.

In a previous paper, Boban Velickovic and I showed that if the bounded version of the proper forcing axiom, holds, then one can define a well-ordering of the reals using what is in essence a subset of as a parameter. The argument uses Justin Moore‘s technique of the Mapping Reflection Principle, and provides us with a well-ordering. In this sense, the result is best possible.

In earlier work, I had shown that is consistent with a projective well-ordering of the reals. The result with Velickovic dramatically improves this; for example, if and holds, then there is a projective well-ordering of Note that this is an implication rather than just a consistency result, and does not require that the universe is a forcing extension of The point here is that the parameter can be chosen in so that it is “projective in the codes,” and then provides us with enough coding machinery to transform the definition of the well-ordering into a projective one.

In the new paper, Friedman and I show that in fact under the projective definition is best possible, For this we need to combine the coding technique giving the well-ordering with a powerful coding device in the absence of sharps, what Friedman calls David’s trick. The point now is that the forcing required to add the witnesses that make the coding work is proper, and suffices to grant in the universe the existence of these objects.

As a technical problem, it would be interesting to see whether the appeal to the mapping reflection principle can be eliminated here. We only obtain a well-ordering in that case. Also, since turns out, perhaps unexpectedly, to provides us with definable well-orderings, it would be interesting to see that does not suffice for this.

Advertisements

Like this:

LikeLoading...

Related

This entry was posted on Thursday, December 17th, 2009 at 2:15 pm and is filed under Papers. You can follow any responses to this entry through the RSS 2.0 feed.
You can leave a response, or trackback from your own site.

Craig: For a while, there was some research on improving bounds on the number of variables or degree of unsolvable Diophantine equations. Unfortunately, I never got around to cataloging the known results in any systematic way, so all I can offer is some pointers to relevant references, but I am not sure of what the current records are. Perhaps the first pape […]

Yes. Consider, for instance, Conway's base 13 function $c$, or any function that is everywhere discontinuous and has range $\mathbb R$ in every interval. Pick continuous bijections $f_n:\mathbb R\to(-1/n,1/n)$ for $n\in\mathbb N^+$. Pick a strictly decreasing sequence $(x_n)_{n\ge1}$ converging to $0$. Define $f$ by setting $f(x)=0$ if $x=0$ or $\pm x_n […]

(1) Patrick Dehornoy gave a nice talk at the Séminaire Bourbaki explaining Hugh Woodin's approach. It omits many technical details, so you may want to look at it before looking again at the Notices papers. I think looking at those slides and then at the Notices articles gives a reasonable picture of what the approach is and what kind of problems remain […]

The description below comes from József Beck. Combinatorial games. Tic-tac-toe theory, Encyclopedia of Mathematics and its Applications, 114. Cambridge University Press, Cambridge, 2008, MR2402857 (2009g:91038). Given a finite set $S$ of points in the plane $\mathbb R^2$, consider the following game between two players Maker and Breaker. The players alternat […]

Yes. This is a consequence of the Davis-Matiyasevich-Putnam-Robinson work on Hilbert's 10th problem, and some standard number theory. A number of papers have details of the $\Pi^0_1$ sentence. To begin with, take a look at the relevant paper in Mathematical developments arising from Hilbert's problems (Proc. Sympos. Pure Math., Northern Illinois Un […]

It is easy to see without choice that if there is a surjection from $A$ onto $B$, then there is an injection from ${\mathcal P}(B)$ into ${\mathcal P}(A)$, and the result follows from Cantor's theorem that $B

Only noticed this question today. Although the selected answer is quite nice and arguably simpler than the argument below, none of the posted answers address what appeared to be the original intent of establishing the inequality using the Arithmetic Mean-Geometric Mean Inequality. For this, simply notice that $$ 1+3+\ldots+(2n-1)=n^2, $$ which can be easily […]

First of all, $f(z)+e^z\ne 0$ by the first inequality. It follows that $e^z/(f(z)+e^z)$ is entire, and bounded above. You should be able to conclude from that.

Yes. The standard way of defining these sequences goes by assigning in an explicit fashion to each limit ordinal $\alpha$, for as long as possible, an increasing sequence $\alpha_n$ that converges to $\alpha$. Once this is done, we can define $f_\alpha$ by diagonalizing, so $f_\alpha(n)=f_{\alpha_n}(n)$ for all $n$. Of course there are many possible choices […]

I disagree with the advice of sending a paper to a journal before searching the relevant literature. It is almost guaranteed that a paper on the fundamental theorem of algebra (a very classical and well-studied topic) will be rejected if you do not include mention on previous proofs, and comparisons, explaining how your proof differs from them, etc. It is no […]