|Dror Bar-Natan: Classes: 2002-03: Math 157 - Analysis I:||(16)||
Next: Wang Ying's Solution of Homework Assignment 2
Previous: Class Notes for the Week of September 9 (8 of 8)
All of Spivak Chapters 2 and 3.
From Spivak Chapter 2: 1, 5.
From Spivak Chapter 3: 6, 13.
From Spivak Chapter 2: 3, 4, 12, 22.
From Spivak Chapter 3: 1, 7, 21.
An extra problem: Is there a problem with the following inductive proof that all horses are of the same color?
We assert that in all sets with precisely horses, all horses are of the same color. For , this is obvious: it is clear that in a set with just one horse, all horses are of the same color. Now assume our assertion is true for all sets with horses, and let us be given a set with horses in it. By the inductive assumption, the first of those are of the same color and also the last of those. Hence they are all of the same color as illustrated below:
From Spivak Chapter 2: 27, 28.
A little more on Chapter 2, Problem 22:
This document was generated using the LaTeX2HTML translator Version 2K.1beta (1.49)
Copyright © 1993, 1994, 1995, 1996,
Computer Based Learning Unit, University of Leeds.
Copyright © 1997, 1998, 1999, Ross Moore, Mathematics Department, Macquarie University, Sydney.
The command line arguments were:
latex2html -no_math -html_version 3.2 -dir l2h -split 0 -long_titles 4 -show_section_numbers -no_navigation -no_auto_link -white -no_footnode HW02.tex
The translation was initiated by Dror Bar-Natan on 2002-09-30