Results 1 to 6 of 6
Like Tree1Thanks
  • 1 Post By emakarov

Math Help - 4 color theorem

  1. #1
    Newbie wasp's Avatar
    Joined
    Oct 2012
    From
    Lisbeth Salander's apartment
    Posts
    8
    Thanks
    2

    4 color theorem

    Once upon a time I read that the 4 color theorem had been proven, but required a computer to prove it for about 2000 cases.

    I'm looking for opinions or fact: Is a theorem proved by simply reducing it to cases of such a large number of examples?
    Follow Math Help Forum on Facebook and Google+

  2. #2
    MHF Contributor

    Joined
    Mar 2011
    From
    Tejas
    Posts
    3,310
    Thanks
    687

    Re: 4 color theorem

    some theorems CAN be proved that way. combinatorial problems are particularly amenable to such an approach.

    in general, however, merely proving something is true for even a large number of cases does not prove it. a good example is the riemann hypothesis which is known to be true for a LOT of cases, but the general conjecture remains unproven.

    there is a notion in some fields of "asymptotic" proof, that is: that the "possible exceptions" to a theorem get farther and farther apart. so, for example, we can calculate a "rough estimate" of the probability whether or not a certain number is prime, without knowing if, in fact, it IS prime. this can be useful.

    with regard to computer-aided proofs, usually what is proven is "a proof of the proof": that is, that the algorithm for the program that carries out the proof is correctly written. this in and of itself can be a daunting task (and the devil is in the details). the fact is that computers can carry out calculations that would be unfeasible for mere mortals, especially when large numbers are involved.
    Follow Math Help Forum on Facebook and Google+

  3. #3
    MHF Contributor

    Joined
    Apr 2005
    Posts
    15,367
    Thanks
    1312

    Re: 4 color theorem

    The "hard part" is reducing from an infinite number of cases to a finite number. With only a finite number, we can just check every case- even if "finite" is so large you need a computer to check the cases.
    Follow Math Help Forum on Facebook and Google+

  4. #4
    MHF Contributor
    Prove It's Avatar
    Joined
    Aug 2008
    Posts
    11,403
    Thanks
    1291

    Re: 4 color theorem

    Quote Originally Posted by HallsofIvy View Post
    The "hard part" is reducing from an infinite number of cases to a finite number. With only a finite number, we can just check every case- even if "finite" is so large you need a computer to check the cases.
    Wiles' proof of Fermat's Last Theorem comes to mind here...
    Follow Math Help Forum on Facebook and Google+

  5. #5
    MHF Contributor
    Joined
    Oct 2009
    Posts
    5,513
    Thanks
    769

    Re: 4 color theorem

    For more on the formally verified proof of the four-color theorem, see this issue of the Notices of the AMS.
    Thanks from topsquark
    Follow Math Help Forum on Facebook and Google+

  6. #6
    MHF Contributor
    Joined
    Oct 2008
    Posts
    1,034
    Thanks
    49

    Re: 4 color theorem

    Just bumping this over the spam
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Four color theorem and computers
    Posted in the Math Software Forum
    Replies: 1
    Last Post: November 21st 2010, 10:31 PM
  2. color wheel
    Posted in the LaTeX Help Forum
    Replies: 2
    Last Post: March 15th 2010, 12:19 PM
  3. color probability
    Posted in the Statistics Forum
    Replies: 3
    Last Post: January 12th 2009, 09:28 AM
  4. another eye color problem
    Posted in the Advanced Statistics Forum
    Replies: 2
    Last Post: September 15th 2008, 12:13 AM

Search Tags


/mathhelpforum @mathhelpforum