In number theory, the Mordell conjecture is the conjecture made by Mordell (1922) that a curve of genus greater than 1 over the field Q of rational numbers has only finitely many rational points. The conjecture was later generalized by replacing Q by a finite extension. It was proved by Gerd Faltings (1983), and is now known as Faltings' theorem.
Faltings' original proof used the known reduction to a case of the Tate conjecture, and a number of tools from algebraic geometry, including the theory of Néron models. A very different proof, based on diophantine approximation, was found by Paul Vojta. A more elementary variant of Vojta's proof was given by Enrico Bombieri.
Faltings' 1983 paper had as consequences a number of statements which had previously been conjectured:
The reduction of the Mordell conjecture to the Shafarevich conjecture was due to Parshin (1971). A sample application of Faltings' theorem is to a weak form of Fermat's Last Theorem: for any fixed n > 4 there are at most finitely many primitive integer solutions to an + bn = cn, since for such n the curve xn + yn = 1 has genus greater than 1.
Because of the Mordell–Weil theorem, Faltings' theorem can be reformulated as a statement about the intersection of a curve C with a finitely generated subgroup Γ of an abelian variety A. Generalizing by replacing C by an arbitrary subvariety of A and Γ by an arbitrary finite-rank subgroup of A leads to the Mordell–Lang conjecture, which has been proved.
Another higher-dimensional generalization of Faltings' theorem is the Bombieri–Lang conjecture that if X is a pseudo-canonical variety (i.e., variety of general type) over a number field k, then X(k) is not Zariski dense in X. Even more general conjectures have been put forth by Paul Vojta.
Dictionary and translator for handheld
New : sensagent is now available on your handheld
A windows (pop-into) of information (full-content of Sensagent) triggered by double-clicking any word on your webpage. Give contextual explanation and translation from your sites !
With a SensagentBox, visitors to your site can access reliable information on over 5 million pages provided by Sensagent.com. Choose the design that fits your site.
Improve your site content
Add new content to your site from Sensagent by XML.
Crawl products or adds
Get XML access to reach the best products.
Index images and define metadata
Get XML access to fix the meaning of your metadata.
Please, email us to describe your idea.
Lettris is a curious tetris-clone game where all the bricks have the same square shape but different content. Each square carries a letter. To make squares disappear and save space for other squares you have to assemble English words (left, right, up, down) from the falling squares.
Boggle gives you 3 minutes to find as many words (3 letters or more) as you can in a grid of 16 letters. You can also try the grid of 16 letters. Letters must be adjacent and longer words score better. See if you can get into the grid Hall of Fame !
Change the target language to find translations.
Tips: browse the semantic fields (see From ideas to words) in two languages to learn more.