A Gentle Introduction to the Art of Mathematics

About this book

Joseph E. Fields’s A Gentle Introduction to the Art of Mathematics is a transition from calculating answers to reading and writing proofs. The linked PDF identifies itself as version 3.2 and carries a 2023 copyright notice. Nine chapters develop notation, logic, sets, induction, relations, counting, cardinality, and further proof techniques. This guide treats examples and counterexamples as tools for understanding exactly what a claim says.

Chapter and section guide

1. Introduction and Notation

The opening chapter develops the language needed to state mathematical ideas precisely. Familiar number systems and elementary definitions become objects to examine rather than assumptions left implicit. Symbols condense meaning only when a reader knows their scope and convention. Students should translate notation back into ordinary language and distinguish a definition from a theorem. This chapter’s purpose is not to make prose more complicated, but to make the claim and its conditions unambiguous.

Study application: Choose three symbols or definitions from the chapter and give an example and a nonexample for each. Explain the feature that separates them.

2. Logic and Quantifiers

Logical connectives and quantifiers determine the structure of a statement. Negation, implication, converse, and equivalence require different transformations. The order of quantifiers can change meaning, so students should test a sentence with concrete objects before assuming a symbolic rearrangement is harmless. Truth tables support propositional reasoning, while quantified claims require attention to their domain. The chapter prepares proof by making clear what must be established and what would refute it.

Study application: Write two statements that differ only in quantifier order and explain their meanings with an example. Negate each while preserving the exact logical structure.

3. Proof Techniques I

Direct proof, contrapositive reasoning, and contradiction organize an argument in different ways. The appropriate method depends on the claim’s structure and available definitions. A proof should show why the conclusion follows for every object satisfying the hypotheses, not merely exhibit a successful calculation. Students should state assumptions explicitly and avoid using the desired conclusion as an unsupported intermediate step. Clear prose explains the logical role of each calculation.

Study application: Prove a small implication directly and by contrapositive where feasible. Compare which definitions each method makes easier to use.

4. Sets

Set operations and identities provide a setting for precise proof. Showing two sets are equal commonly requires establishing inclusion in both directions. Membership and subset relations are different claims, and an empty set introduces useful boundary cases. Students should connect a statement about arbitrary elements with the corresponding set expression. Diagrams can guide discovery but should not be mistaken for proofs covering every possible set.

Study application: Prove an elementary identity by a double-inclusion argument. State where the definition of union or intersection is used in each direction.

5. Induction

Induction proves a family of claims by connecting a verified starting case with a valid step. The chapter emphasizes the exact hypothesis available and the way it supports the next conclusion. Recursive objects and strong induction can require a broader collection of earlier cases. Students should avoid assuming the claim for all inputs in a step intended to establish it. A proof with a correct-looking formula but no justified transition is incomplete.

Study application: Write an induction proof for a simple sum or divisibility claim. Mark the base case, hypothesis, and the exact substitution where the hypothesis advances the argument.

6. Relations and Functions

Relations organize connections among objects, while functions specify a unique output for each input in a domain. Equivalence relations, orders, injectivity, surjectivity, and composition provide ways to describe structure. Students should test definitions on both finite examples and less visual settings. A function’s codomain matters to whether it is onto, and an inverse requires appropriate conditions. The chapter links symbolic definitions with proofs of properties.

Study application: Define one function and examine injectivity and surjectivity under two different codomain choices. Explain which property changes and why the formula alone did not determine it.

7. Combinatorics as Proof

Counting can establish identities by showing that two expressions enumerate the same objects in different ways. The chapter develops a proof-oriented approach to combinations and related tools. Students should justify that the cases are exhaustive and disjoint or explain how overlap is corrected. A bijection proves equality by pairing objects reversibly, not merely by observing matching counts in small examples. This broadens the repertoire of mathematical argument.

Study application: Give a combinatorial explanation of a simple identity and identify the objects, the two methods, and the reason neither method loses or duplicates an object.

8. Cardinality

Cardinality compares sets through functions and correspondences rather than only familiar finite counts. Infinite sets can challenge intuitions developed from physical collections. An injection, surjection, or bijection establishes a particular kind of comparison, and a proof must construct or justify the required map. Students should distinguish a list of examples from an enumeration of an entire infinite set. Diagonal arguments show how an assumed complete listing can fail.

Study application: Explain a bijection between a familiar countably infinite set and a proper subset. Then state why a different infinite-set comparison might require a diagonal argument rather than the same intuition.

9. Further Proof Techniques: Magic

The final chapter explores arguments whose key idea may initially look surprising. The title invites curiosity, but the mathematical work remains explicit reasoning rather than a trick accepted without explanation. Students should identify the construction or invariant that makes an apparently difficult problem manageable. A successful proof can become understandable when its decisive choice is isolated. The chapter encourages flexibility: changing representation or approaching the conclusion indirectly can reveal structure missed by routine algebra.

Study application: Take a surprising argument from the chapter and rewrite it as a sequence of justified steps. Explain the decisive idea and a condition under which the same strategy would fail.

Study instructions

1. Keep definitions and theorem hypotheses beside your proof attempts so no condition is silently omitted.
2. Translate every quantified statement into words and identify what would constitute a counterexample.
3. Use examples to discover a pattern, then distinguish that evidence from a general proof.
4. Revise proofs for logical order, explicit variables, and clear reasons, not only grammar.
5. Maintain a portfolio of direct, contrapositive, contradiction, induction, bijection, and diagonal arguments.

Practice and review task

Choose a simple conjecture, test it, and either prove it or construct a counterexample. Present a first attempt and a revised argument, explaining the exact logical gap the revision repairs.

Questions for reflection

What does a counterexample refute, and what does it leave untouched? Why can a proof that reaches a true statement still fail to establish the claim it was meant to prove?

Sources and coverage

This original study guide follows Version 3.2, linked PDF with 2023 copyright notice. It draws on the source contents, chapter introductions, selected explanations and examples, and review material. It condenses the resource rather than replacing the full text; study applications are original exercises. The original catalog cover identifies version 3.1; the downloadable source reviewed for this guide identifies version 3.2. The edition field follows the reviewed text rather than silently equating the two.

Reviewed source text; Book and cover catalog record.