Explicit Hamel basis of real numbers Is there an explicit construction of a Hamel basis of the  vector space of real numbers $\mathbb R $ over the field of rational numbers $\mathbb Q $?
 A: It is consistent with the axioms of ZFC that there is a
Hamel basis of $\mathbb{R}$ over $\mathbb{Q}$ with
complexity $\Delta^1_2$ in the descriptive set theoretic
hierarchy. This is true, for example, in the constructible
universe $L$, where there is a $\Delta^1_2$ well-ordering
of the reals, as I explain in this MO
answer,
which is closely related to this question. Complexity $\Delta^1_2$ is a surprisingly low complexity, since such a set (and its complement) can both be obtained by starting with a certain closed set in $\mathbb{R}^3$, projecting it to $\mathbb{R}^2$, taking the complement, and projecting down to $\mathbb{R}$, and so it would seem to count as fairly explicit. 
Meanwhile, there can never be a Hamel basis of $\mathbb{R}$
over $\mathbb{Q}$ that is Borel, that is, with complexity
$\Delta^1_1$, since from any Borel Hamel basis one can produce a
non-Lebesgue measurable set of the same complexity by the Vitali argument (remove
an element, take the span of the other elements, and
consider its cosets). But of course every Borel set is
Lebesgue measurable.
At the same time, it is a consequence of the existence of large
cardinals that every projective set of reals is Lebesgue
measurable, and in this case, there can be no projective
Hamel basis for $\mathbb{R}$ over $\mathbb{Q}$, again by the Vitali argument. The
projective hierarchy of sets arises by closing the Borel
sets under continuous images, as well as complements,
countable unions and intersections. Thus, in such a
situation, there can be no easily-described Hamel basis for
$\mathbb{R}$ over $\mathbb{Q}$.
A: Re Andreas' comment, I have a writeup of a generalization of Miller's result:  https://ivv5hpp.uni-muenster.de/u/rds/talks_kiel.pdf
A: If you have such a basis, you also have a subspace of co-dimension 1, and this turns out to be a Vitali set, that is quite a non-constructible object. For details, e.g. check this answer and this. 
A: Arnie Miller has shown that if V=L then one can do a bit better than what Joel said; there will be a $\Pi^1_1$ Hamel basis for the reals over the rationals.  The reference is "Infinite combinatorics and definability," Annals of Pure and Applied Logic 41 (1989) 179-203.  This paper also improves the complexity bound from $\Delta^1_2$ to $\Pi^1_1$ for several other constructions under the hypothesis V=L.
