
06135823
b
2014a.00523
Bajnok, B\'ela
An invitation to abstract mathematics.
Undergraduate Texts in Mathematics. New York, NY: Springer (ISBN 9781461466352/hbk; 9781461466369/ebook). xiv, 406~p. (2013).
2013
New York, NY: Springer
EN
E15
A15
K25
K35
M45
abstract mathematics
bridge course
cardinalities
decision trees
infinity
logic
mathematical proof
combinatorial games
set theory
writing proofs
pedagogy
set theory
surreal numbers
transition course
doi:10.1007/9781461466369
This textbook aims for the spot in many departments' curriculum where students are introduced to advanced mathematics. The book takes a somewhat novel approach of starting and ending with combinatorial games; Hackenbush games appear repeatedly as a motivating example, starting (and ending) with one named Aerion, on account of its horselike shape. Despite the emphasis on abstract mathematics, as evidenced by the title, the author introduces the game in an applied setting that the reader will likely find both compelling and intriguing: a set of options for two corporations in competition. Those familiar with the surreal numbers will be glad to learn that they make an appearance at the end of the book. Many textbooks in this area straddle the bridge of a discrete mathematics course, and target an audience with interests in computer science. This text definitely focuses on mathematics. The material covers a wide range of material, probably more than most instructors will cover in one semester (such as those whose students come from especially weak backgrounds). The author advises against skipping very much material in the twentyfour chapters, as he believes in the ``spiral'' method, where topics are introduced in one chapter, then reintroduced in subsequent chapters, with deeper investigation and additional insights. Four appendices cover additional material, including ``Famous conjectures in mathematics'' and ``A top 40 list of math theorems.'' As chapters vary in both length and difficulty, instructors must take care in their pacing. The style of writing is careful, but joyously enthusiastic; chapter titles feature puns (``Quantifier mechanics'', ``Order, please!''), some of which require some reading to comprehend (``Games are valuable!''). The author's clear attitude is that mathematics consists of problem solving, and that writing a proof falls into this category. Students of mathematics are, therefore, engaged in problem solving, and should be given problems to solve, rather than problems to imitate. The author attributes this approach to his Hungarian background, citing a ``holy trinity'' of Hungarian mathematicians within the first few pages (P\'olya, Halmos, Erd\H os), and encourages students to embrace the challenge in the same way an athlete engages in vigorous practice.
John Perry (Hattiesburg)