Drexel dragonThe Math ForumDonate to the Math Forum



Search All of the Math Forum:

Views expressed in these public forums are not endorsed by Drexel University or The Math Forum.


Math Forum » Discussions » sci.math.* » sci.math.research

Topic: The algebraic closure of the rationals
Replies: 10   Last Post: May 10, 2006 12:30 PM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
John Baez

Posts: 542
Registered: 12/6/04
The algebraic closure of the rationals
Posted: Apr 6, 2006 2:00 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

Vaughan Pratt and I were discussing the fundamental theorem of
algebra, and we were led to some puzzles neither of us knows
anything about. Let Qbar stand for the algebraic closure of
the field of rational numbers. To what extent can we get our
hands on Qbar in an explicit way?

(Perhaps I should say Qbar is "an" algebraic closure, since
while they're all isomorphic, the full set of isomorphisms is
hard to understand, and this is part of the issue.)

For example:

1) Is there a way to enumerate the elements of Qbar such that
relative to this enumeration, the field operations are computable?
If so, how efficiently can they be computed? If not, how far
up the hierarchy of impossible-to-actually-compute functions do
we have to go?

2) On the other extreme: can we even prove the existence of Qbar
without the axiom of choice, or perhaps countable choice?

3) I've heard that it's even hard to get an "explicit" description
of the algebraic closures of finite fields - are there any
theorems to this effect?








Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2014. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.