community
directory
books
authors
images
encyclopedia

Email:
Password:
Register

Knowledgerush Search

 

Google
  Web knowledgerush


Search for images of Unifying conjecture


Message boards   Post comment

Unifying conjecture

This page has been listed on . Please see that page for justifications and discussion.

In mathematics, a unifying conjecture is a claim that one branch of mathematics is isomorphic to another. Thus, a calculation in one branch that is difficult may be translated into the other branch and become easier to perform.

A well-known example is the Taniyama-Shimura conjecture, now the Taniyama-Shimura theorem, which proposed that each elliptic curve over the rational numbers can be translated into a modular form. The two fields, elliptic curves and modular curves, had not been considered as directly related. This conjecture stood for decades before being proved.

It is anticipated that unifying conjectures in general are difficult to discover and hard to prove, so they are expected to retain the title 'conjecture' for a relatively long time.

Unifying conjecture tends also to be referenced often even in finished mathematics - statements such as "assuming Taniyama-Shimura..." were not uncommon in the mathematical literature long before the theorem was proved. Thus a conjecture that is described as 'unifying' in this sense may get more attention.

The difference between a 'unifying' and a merely 'useful' conjecture tends to be social: the implication is that one is 'unifying' several subcultures within mathematics, different groups of people as opposed to different sets of theorems.

See also: philosophy of mathematics, foundations of mathematics

Referenced By

List of mathematical topics (S-U)

 

Compose Your Message

Your Email Address or Pen Name (optional):
Subject:
Your Message:
 

 

 

 

 

 

This article is licensed under the GNU Free Documentation License. It uses material from the Wikipedia article "Unifying conjecture".

 

Contact UsPrivacy Statement & Terms of Use

 
Copyright © 1999-2003 Knowledgerush.com. All rights reserved.