# Kenneth Ira Appel

### Quick Info

Brooklyn, New York, USA

Dover, New Hampshire, USA

**Kenneth Appel**was an American mathematician best-known for his part in proving the four-colour theorem.

### Biography

**Kenneth Appel**'s parents were Irwin Appel (1903-1994) and Lillian Sender (1905-1987). Irwin Appel was born in Russia but emigrated to the United States. He graduated from Cooper Union for the Advancement of Science and Art in New York City and became an electrical engineer working for the water department. He married Lillian on 17 September 1924. She was born in New York and before her marriage had been working there in an office. Neither Irwin nor Lillian had attended College. As well as Kenneth, the subject of this biography, Irwin and Lillian Appel had a daughter Lois who was about five years younger than their son. Kenneth lived the first few years of his life in Brooklyn but was brought up in Queens, New York, where the family moved after 1935.

Appel was educated in New York. He received a bachelor's degree in mathematics from Queens College in New York in 1953. This College had been established in the Queens district of New York in 1937 to provide an affordable, but good quality, education for local students. After graduating, Appel spent a short spell working as an actuary before serving for two years in the US army. He was stationed at the army post of Fort Benning, near Columbus, Georgia, before being sent to Baumholder, Birkenfeld, Rhineland-Palatinate, in Germany. The United States garrison at Baumholder was the largest stationed in Germany during the 1950s. After two years of army service, Appel enrolled in the graduate programme at the University of Michigan in 1955. He was awarded a Master's Degree by Michigan in 1956 and then continued to undertake research towards a Ph.D. His thesis advisor was Roger Lyndon and he was awarded the degree in 1959 for his thesis

*Two Investigations on the Borderline of Logic and Algebra*. Also in 1959 his paper

*Horn sentences in identity theory*appeared and, two years later, the paper

*Partition rings of cyclic groups of odd prime power order*was published which formed part of his thesis. Appel writes in [2] about his years as Lyndon's doctoral student:-

I fondly remember my experiences working as a thesis student in the years 1957-59. My conversations with Lyndon often took place in the newly established common room, which was supplied with a large coffee percolator. As a "morning person," I would want to discuss my work with Lyndon as soon as he arrived at Angell Hall. It soon became clear to me that no mathematical discussion was possible until he had consumed at least two cups of coffee, so during my last two years of graduate work I was the unofficial coffee preparer for the common room. Lyndon produces elegant mathematics and thinks in broad and deep ideas. ... I tend to work from the combinatorial aspects of particular problems without thinking of abstract structural considerations. While I was a graduate student, many of my conversations with Lyndon proceeded as follows. I would announce proudly that I could prove a lemma and write it on the blackboard, and he would copy it down. I would then proceed through a detailed if rough hewn proof. When I had finished, he would admit that he had not followed much of what I had said. A day later, working from the statement of my lemma and a few recollections of my methods, he would show me an extremely elegant proof. It often took me quite a while to understand what he had done, and I learned a good bit of mathematics in the process. I have become fascinated with several problems that he has attacked in his papers and the methods he has developed to work on them. This interest has led me to study these problems further and proceed a bit further along the path. Thus he has continued to inspire my work in the more than twenty years since I have left Ann Arbor.Another important event in Appel's life happened while he was a graduate student. During these years he met Carole S Stein who later became his wife [9]:-

During Carole's first week of graduate school at the University of Michigan, she met Ken through the outing club. Eight days later, the two shared a canoe, talking about various subjects, including Carole's recent purchase of a season ticket to a classical music concert series. Ken, who was in his fourth year of his Ph.D. studies, also had a ticket, but his seat was in the orchestra, unlike Carole's seat in the balcony. When the two agreed to go to a concert together the following day, Ken gave his seat up to the man who was sitting beside Carole. For the rest of the year, the two sat together - in the balcony. "It was like him to do that," she said. "When he saw something that was worth doing, he plunged in and did it, and if he thought meeting me was worth it, look, he plunged in and did it." That year, Ken's professor gave him a problem to solve for his thesis, a problem that typically takes months to complete. Ken solved the problem over the weekend. "You need something more difficult," Ken's thesis professor told him. He was told to find something that connected logic and algebra and he worked on the problem for months. That same year, once it was complete and Carole received her masters, in 1959, Ken and Carole got married back in Carole's home city of Philadelphia.Carole and Kenneth Appel had three children, Andrew Wilson Appel (1960-) who became professor of computer science at Princeton University, Laurel (1962-2013) who became a professor of biology at Wesleyan University, and Peter (1964-) who is Administrator of the US Research and Innovative Technology Administration.

Three months after he was married, Appel began a two-year appointment with the Institute for Defense Analyses. This institute, which is involved in national security issues, set up the Center for Communications Research in Princeton, New Jersey with the aim of protecting the information and communications of the United States government, and also studying foreign signals intelligence. Appel worked at this Center in Princeton using both his mathematical and computing expertise. In particular he was involved in research on cryptography. Following his two years with the Institute for Defense Analyses in Princeton, Appel was offered a assistant professorship at the University of Illinois at Urbana. Taking up the appointment in 1961, he taught mathematics and undertook research in group theory and computability theory. He published papers over the next few years including: (with F M Djorup)

*On the group generated by a free semigroup*(1964); (with Thomas G McLaughlin)

*On properties of regressive sets*(1965);

*No recursively enumerable set is the union of finitely many immune retraceable sets*(1967);

*There exist two regressive sets whose intersection is not regressive*(1967); and (with E T Parker)

*On unsolvable groups of degree*$p = 4q + 1$

*, p and q primes*(1967).

One of the two theorems presented in the last mentioned paper uses a computer to prove that there is no unsolvable transitive permutation group of degree $p$ = 29, 53, 149, 173, 269, 293, or 317 properly contained in the alternating group of degree $p$. This result using computers to prove a mathematical theorem, was a technique that Appel used to great effect as we explain below. In [3] he writes about this group theory result:-

I believe that the program was correct, but it was not an easy program and was written in assembly language for a machine that was unique. Since the result was negative it was not something that was likely to be independently checked; indeed our hope was to find such groups and we regarded their nonexistence as a disappointment. I cannot believe that most mathematicians could have accepted our announcement as utterly convincing, although later work in the classification of simple groups showed it to be correct.Appel is best known, however, for his work with his colleague at the University of Illinois at Urbana, Wolfgang Haken where again he used computers to prove a theorem. Together they solved one of the biggest open problems in mathematics, namely the "Four Colour Conjecture".

For a history of this conjecture see: THIS LINK.

Appel and Haken published their first step towards a proof with

*The existence of unavoidable sets of geographically good configurations*in 1976. They write:-

A set of configurations is unavoidable if every planar map contains at least one element of the set. A configuration C is called geographically good if whenever a member country M of C has any three neighbours $N_{1}, N_{2}, N_{3}$ which are not members of C then $N_{1}, N_{2}, N_{3}$ are consecutive (in some order) about M. The main result is a constructive proof that there exist finite unavoidable sets of geographically good configurations. This result is the first step in an investigation of an approach towards the four colour conjecture.They announced that they had a proof of the Four Colour Theorem in

*Every planar map is four colorable*(1976). Frank Bernhart begins a review of the paper as follows:-

This is an announcement of a proof of the 'four colour conjecture' (to appear in two parts in Illinois J. Math.). The reviewer has seen and studied this proof in the form of a technical report, though not exhaustively. Nearly every year there is a spate of alleged 'four colour conjecture' proofs. A few of them require careful and lengthy scrutiny. Except for the proof announced here, none of them appears to survive technical examination. What makes the claim of Appel and Haken more convincing? One reason is simply that the approach is different. There is no special trick of induction, and no unfamiliar equivalent form of the 'four colour conjecture'. There is no surprise attack from algebra. Rather, the proof hinges on several complex elaborations of the classical approach through reducible configurations. The difficulties that arise are largely computational. In fact, 1200 hours of computer time were used for reductions.The proof appeared in two papers, each with substantial microfiche supplements, in 1977, namely

*Every planar map is four colorable. I. Discharging*and

*Every planar map is four colorable. II. Reducibility*. Although much of the proof was verified by computer calculations, nevertheless Appel enlisted help from his children to check that the diagrams displayed in the papers corresponded to the computer printouts [7]:-

Appel's son, Andrew, said his sister, Laurel, found some 800 mistakes, most of which she could fix herself.The proof was published in 1989 by Appel and Haken in the form of a book with title

*Every planar map is four colorable*. This presented their proof without the microfiche supplements. Frank Bernhart reviewed the book and begins his review as follows:-

The confirmation of the Four Colour Conjecture stands out as a major mathematical achievement in our time. It is a distinct pleasure to have the 1977 proof and the microfiche supplement brought together in a book, which replaces and updates the original. Missing (of course!) is the computer-assisted proof of reducibility for a host of configurations. Nearly fifteen hundred are required, most of them not previously published. Verifying the new reductions consumed over 1100 hours of time on three computers at the University of Illinois. There are oft-heard objections to the validity of such a proof. But where a very long, dull computation is called for, surely mechanical aids shorten the time and enhance the accuracy - recall the celebrated hand calculation of to 707 decimal places, in which only 526 were correct. That error was undetected for seventy years. In recent years we have computer-assisted factoring of large integers, and the nonexistence of a projective plane of order ten. In the Four Colour Conjecture case, the basic technique is over sixty years old, and specific programs that embody it can be checked in a number of ways, to give weight to certification.For their remarkable achievement, Appel and Haken were awarded the Delbert Ray Fulkerson prize by the American Mathematical Society and the Mathematical Programming Society in 1979.

In 1993 Appel left the University of Illinois and moved to New Hampshire when he was appointed as the Chairman of the Mathematics Department at the University of New Hampshire. Carole Appel explained in [9] how this move came about:-

Carole said a single phone call from her brother on the Fourth of July pushed them to move back to the East Coast. Carole's second grandson had just been born and her brother called to brag about the "cutest little baby" sitting on his lap. "I hung up the phone and I said to Ken, 'We have to leave. My brother gets to see my grandchildren every few weeks and I see them twice a year,'" Carole said, adding she was jealous. Carole and Ken immediately began looking for jobs out East. Ken called Carole at work after he found an ad in a mathematics journal for an opening for a department head at the University of New Hampshire. He asked if she would be interested in moving to the Granite State. Carole said as long as she could get The New York Times on the same day it was published, she would go. Driving into Dover in May of 1993, looking at the sailboats on the Great Bay and the shores of Southern Maine, Carole said she knew she wanted Ken to get the job. Ken formally accepted the position of chair of the math department in June 1993 and the two of them settled in their new home in Dover.He retired in 2003 and was made professor emeritus at that time. Retirement did not end Appel's involvement with teaching mathematics, however, for he was keen to participate in mathematics enrichment programmes in Dover schools and other southern Maine schools. As part of this voluntary work he worked with students of all levels and abilities but he got the most satisfaction working with the gifted students [14]:-

He felt that all students, at any level, deserved to be working at the level they are able to work at and not be restricted by what grade they are in and also not to have to skip a grade because they should be able to stay with their age group and socialize with their age group and not go to college at 16.He also served on the Dover School Board and for a time was the treasurer of the Strafford County Democratic Party.

Appel's hobbies included playing tennis, collecting stamps, playing Go, and baking bread. In [14] (see also [7]) there is a quote from Kevin Short, who was his colleague at the University of New Hampshire. Short described Appel as "an incredibly humble man":-

One of the things he prided himself on was trying to help other faculty members in general, but in particular, young faculty members, to get them started in a research career.In October 2012 Appel was diagnosed with esophageal cancer. He died in April 2013 a month after the death of his daughter Laurel. After a funeral at Tasker Funeral Home in Dover on 22 April 2013, he was buried at Pine Hill Cemetery.

### References (show)

- R Wilson,
*Four Colors Suffice: How the Map Problem Was Solved*(Princeton University Press, Princeton, 2002). - K I Appel, Roger C Lyndon: a biographical and personal note, in K I Appel, J G Ratcliffe and P E Schupp (eds.),
*Contributions to group theory, Contemporary Mathematics***33**(Prividence, 1984), 1-10. - K I Appel, The Use of the Computer in the Proof of the Four Color Theorem,
*Proc. Amer. Philos. Soc.***128**(1) (1984), 35-39. - K I Appel and W Haken, The Nature of Proof: Limits and Opportunities,
*The Two-Year College Mathematics Journal***12**(2) (1981), 118-119. - K I Appel and W Haken, The Four Color Proof Suffices,
*The Mathematical Intelligencer***8**(1) (1986), 10-20. - Kenneth Appel, mathematician of maps, died on April 19th, aged 80,
*The Economist*(4 May 2013). - Kenneth Appel, 80; first to use a computer to prove a major math theorem,
*The Boston Globe*(30 April 2013). - D Brooks, Proving the four-color theorem expanded math's frontiers,
*University of New Hampshire Magazine Online*(Spring 2002). http://unhmagazine.unh.edu/sp02/mathpioneers.html - M Kingston, Famed mathematician Ken Appel recalled fondly,
*Fosters.com*. http://www.fosters.com/apps/pbcs.dll/article?AID=/20130508/GJNEWS_01/130509284 - Obituary: Kenneth I Appel (October 8, 1932 - April 19, 2013),
*Tasker Funeral Service*. http://www.taskerfh.com/fh/obituaries/obituary.cfm?o_id=2069700&fh_id=12298 - D Overbye, Kenneth I Appel, Mathematician Who Harnessed Computer Power, Dies at 80,
*The New York Times*(28 April 2013). - R Thomas, An update on the Four Color Theorem,
*Notices Amer. Math. Soc.***45**(7) (1998), 848-859. - B Toft, Review: Four Colors Suffice: How the Map Problem Was Solved, by Robin Wilson,
*Notices Amer. Math. Soc.***51**(2) (2004), 205-207. - A Ward, Kenneth Appel Dies: Mathematician Ushered Computer Into Everyday Use,
*Newsmax*(30 April 2013). - M Weil, Kenneth Appel, mathematician who solved four-color map problem, dies at 80,
*The Washington Post*(30 April 2013).

### Additional Resources (show)

Other pages about Kenneth Appel:

Other websites about Kenneth Appel:

### Cross-references (show)

Written by J J O'Connor and E F Robertson

Last Update October 2013

Last Update October 2013