Concept

Schanuel's conjecture

In mathematics, specifically transcendental number theory, Schanuel's conjecture is a conjecture made by Stephen Schanuel in the 1960s concerning the transcendence degree of certain field extensions of the rational numbers. The conjecture is as follows: Given any n complex numbers z1, ..., zn that are linearly independent over the rational numbers , the field extension (z1, ..., zn, ez1, ..., ezn) has transcendence degree at least n over . The conjecture can be found in Lang (1966). The conjecture, if proven, would generalize most known results in transcendental number theory. The special case where the numbers z1,...,zn are all algebraic is the Lindemann–Weierstrass theorem. If, on the other hand, the numbers are chosen so as to make exp(z1),...,exp(zn) all algebraic then one would prove that linearly independent logarithms of algebraic numbers are algebraically independent, a strengthening of Baker's theorem. The Gelfond–Schneider theorem follows from this strengthened version of Baker's theorem, as does the currently unproven four exponentials conjecture. Schanuel's conjecture, if proved, would also settle whether numbers such as e + pi and ee are algebraic or transcendental, and prove that e and pi are algebraically independent simply by setting z1 = 1 and z2 = pii, and using Euler's identity. Euler's identity states that epii + 1 = 0. If Schanuel's conjecture is true then this is, in some precise sense involving exponential rings, the only relation between e, pi, and i over the complex numbers. Although ostensibly a problem in number theory, the conjecture has implications in model theory as well. Angus Macintyre and Alex Wilkie, for example, proved that the theory of the real field with exponentiation, exp, is decidable provided Schanuel's conjecture is true. In fact they only needed the real version of the conjecture, defined below, to prove this result, which would be a positive solution to Tarski's exponential function problem.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.