Skip to main content

Appendix B Answers for the Progress Checks

1 Introduction to Writing Proofs in Mathematics
1.1 Statements and Conditional Statements
Statements

Techniques of Exploration

Conditional Statements

Further Remarks about Conditional Statements

Closure Properties of Number Systems

1.2 Constructing Direct Proofs
Writing Guidelines for Mathematics Proofs

Some Comments about Constructing Direct Proofs

Progress Check 1.12. Exploring a Proposition.

Progress Check 1.13. Constructing and Writing a Proof.

2 Logical Reasoning
2.1 Statements and Logical Operators
Other Forms of Conditional Statements

Constructing Truth Tables

Progress Check 2.5. Constructing Truth Tables.

Tautologies and Contradictions

Progress Check 2.7. Tautologies and Contradictions.

2.2 Logically Equivalent Statements
Another Method of Establishing Logical Equivalencies

2.3 Open Sentences and Sets
Some Set Notation

Variables and Open Sentences

Set Builder Notation

Progress Check 2.20. Set Builder Notation.

2.4 Quantifiers and Negations
Negations of Quantified Statements

Counterexamples and Negations of Conditional Statements

Quantifiers in Definitions

Statements with More than One Quantifier

Progress Check 2.29. Negating a Statement with Two Quantifiers.

3 Constructing and Writing Proofs in Mathematics
3.1 Direct Proofs
Writing Guidelines for Equation Numbers

Using Counterexamples

Progress Check 3.3. Using a Counterexample.

Congruence

3.2 More Methods of Proof
Using Other Logical Equivalencies

3.3 Proof by Contradiction
Writing Guidelines: Keep the Reader Informed

Important Note

Proving that Something Does Not Exist

3.4 Using Cases in Proofs
Writing Guidelines for a Proof Using Cases

Progress Check 3.26. Using Cases: \(\boldsymbol{n}\) Is Even or \(\boldsymbol{n}\) Is Odd.

Absolute Value

3.5 The Division Algorithm and Congruence
The Division Algorithm

Properties of Congruence

Progress Check 3.35. Proving Item 1 of Theorem 3.34.

Using Cases Based on Congruence Modulo \(\boldsymbol{n}\)

Progress Check 3.40. Using Properties of Congruence.

4 Mathematical Induction
4.1 The Principle of Mathematical Induction
Inductive Sets

Summation Notation

Progress Check 4.3. An Example of a Proof by Induction.

Some Comments about Mathematical Induction

4.2 Other Forms of Mathematical Induction
Using the Extended Principle of Mathematical Induction

Using the Second Principle of Mathematical Induction

Progress Check 4.12. Using the Second Principle of Induction.

4.3 Induction and Recursion
The Fibonacci Numbers

Progress Check 4.15. Every Third Fibonacci Number Is Even.

5 Set Theory
5.1 Sets and Operations on Sets
Set Equality, Subsets, and Proper Subsets

More about Venn Diagrams

5.2 Proving Set Relationships
The Choose-an-Element Method

Progress Check 5.14. Using the Choose-an-Element Method.

Proving Set Equality

Progress Check 5.17. Set Equality.

Disjoint Sets

Progress Check 5.21. Proving Two Sets Are Disjoint.

5.3 Properties of Set Operations
Proof of One of the Commutative Laws in Theorem 5.24

Important Properties of Set Complements

5.4 Cartesian Products
Cartesian Products

The Cartesian Plane

5.5 Indexed Families of Sets
The Union and Intersection of an Indexed Family of Sets

Pairwise Disjoint Families of Sets

Progress Check 5.41. Disjoint Families of Sets.

6 Functions
6.1 Introduction to Functions
The Definition of a Function

The Codomain and Range of a Function

The Graph of a Real Function

Arrow Diagrams

Progress Check 6.7. Working with Arrow Diagrams.

6.2 More about Functions
Functions Involving Congruences

Equality of Functions

Progress Check 6.11. Equality of Functions.

Mathematical Processes as Functions

Sequences as Functions

Functions of Two Variables

6.3 Injections, Surjections, and Bijections
Injections

Progress Check 6.16. Working with the Definition of an Injection.

Surjections

Progress Check 6.17. Working with the Definition of a Surjection.

The Importance of the Domain and Codomain

Progress Check 6.21. The Importance of the Domain and Codomain.

Working with a Function of Two Variables

6.4 Composition of Functions
Composition and Arrow Diagrams

Progress Check 6.26. The Composition of Two Functions.

Decomposing Functions

Theorems about Composite Functions

Progress Check 6.28. Compositions of Injections and Surjections.

6.5 Inverse Functions
The Ordered Pair Representation of a Function

Progress Check 6.32. Sets of Ordered Pairs that Are Not Functions.

The Inverse of a Function

6.6 Functions Acting on Sets
Functions Acting on Sets

Set Operations and Functions Acting on Sets

7 Equivalence Relations
7.1 Relations
Introduction to Relations

Notation for Relations

Functions as Relations

Visual Representations of Relations

Progress Check 7.8. The Directed Graph of a Relation.

7.2 Equivalence Relations
Directed Graphs and Properties of Relations

Progress Check 7.11. Properties of Relations.

Definition of an Equivalence Relation

Progress Check 7.13. A Relation that Is an Equivalence Relation.

Examples of Other Equivalence Relations

Progress Check 7.15. Another Equivalence Relation.

7.3 Equivalence Classes
The Definition of an Equivalence Class

Progress Check 7.16. Equivalence Classes from Beginning Activity 1.

Congruence Modulo \(\boldsymbol{n}\) and Congruence Classes

Progress Check 7.17. Congruence Modulo 4.

Properties of Equivalence Classes

7.4 Modular Arithmetic
The Integers Modulo \(\boldsymbol{n}\)

8 Topics in Number Theory
8.1 The Greatest Common Divisor
The Greatest Common Divisor

The Euclidean Algorithm

Writing \(\boldsymbol{\gcd (a, b)}\) in Terms of \(a\) and \(b\)

Progress Check 8.9. Writing the gcd as a Linear Combination.

8.2 Prime Numbers and Prime Factorizations
Relatively Prime Integers

Progress Check 8.15. Completing the Proof of Theorem 8.14.

8.3 Linear Diophantine Equations

Progress Check 8.22. An Example of a Linear Diophantine Equation.

Progress Check 8.23. Revisiting Beginning Activity 2.

9 Finite and Infinite Sets
9.1 Finite Sets
Equivalent Sets

9.2 Countable Sets
Infinite Sets

Countably Infinite Sets

9.3 Uncountable Sets
Uncountable Subsets of \(\boldsymbol{\mathbb{R}}\)

Progress Check 9.28. Dodge Ball and Cantor's Diagonal Argument.