MW 1:30-2:45pm

Krieger 302

The syllabus can be found here.

**REFERENCES**

The main text with be Clive Newstead's An Infinite Descent into Pure Mathematics, version 0.3, which is available for free in a variety of formats (PDF, tablet, smartphone). Note this text is currently under construction so the ground may shift under our feet.

An optional supplemental reference is How To Prove It: A Structured Approach by Daniel J Velleman.

You might also enjoy How to write proofs: a quick guide by Eugenia Cheng.

**PROBLEM SETS**

Problem sets are due in class on Wednesdays. The first problem set will be due on Wednesday, September 11.

- Problem Set 1
- Problem Set 2
- Problem Set 3; solutions
- Problem Set 4
- Problem Set 5
- Problem Set 6
- Problem Set 7; Coq version

Here are some resources, originally developed by tslil clingman:

- JsCoq, an online theorem prover
- lecture notes
- source code

Here are some questions for discussion (feel free to add others):

- What is a proof? (see On proof and progress in mathematics, Mathematicians know how to admit they're wrong, What is a proof?)
- If an expert mathematician writes up an argument that few others understand, does this constitute a proof? Did Mochizuki resolve the ABC conjecture? (see The ABC conjecture has not been proved, The ABC conjecture has still not been proved, A crisis of identification)
- If mathematicians reduce a problem to 730 cases and a computer verifies the claimed result in each case, does this constitute a proof? Did Appel and Haken prove the four-color theorem and did Ferguson and Hales prove the Kepler conjecture? (see The colorful life of the four-color theorem, Proof confirmed of 400-year-old fruit-stacking problem)
- Does an argument constitute a proof if it hasn’t been formally verified? (see The Origins and Motivations of Univalent Foundations)

If you have any questions about the course, please get in touch. My contact info can be found on my personal website.