Simulate
Check the claim with numbers
Lesson 2.1.1 said that means gets as close to as you like once is close enough to . This stage review turns that sentence into quantifiers and proves things with it. Take near , where .
"As close as you like" is a tolerance (epsilon), and "close enough" is a distance (delta). For each the cell tries two choices of . For each choice it finds the largest gap over 999 points strictly within of 2.
With the largest gap is about : 2.994 for . With it stays below every time: 0.998 for . So a good exists for each tried, and it depends on .
Conjecture
For every there is a such that, for every real ,
Three tolerances worked, but the claim is about every , and every within of 2. The proof must handle any at all.
Reading the statement
The statement uses everything in this stage: two quantifiers in order (lesson PG1.3), an implication (lesson PG1.2), and absolute values as distances (lesson 0.3.3). Read it as a game with three moves, played left to right.
Rule: For every ε there exists δ
A challenger names any tolerance . You answer with a distance , which may depend on . Then the challenger picks any within of , and must be within of .
So a proof follows the moves. It starts "let ", with nothing else assumed about . It then names as a formula in , takes any with , and shows .
Stage PG4 takes this sentence, with itself left out, as the definition of a limit. Here it is practice in reading and proving quantified statements.
Format 4
Write it
Prove the conjecture: for every there is a such that implies for every real .
Saved in this browser as you type.
Write your own first: a proof you have tried to write teaches far more than one you only read.
Simulate
A function that jumps
Now a function where the game is lost. The step function gives for and for , so . Near 0, does stay close to ? For each the cell tries the point , halfway to the left edge.
Every tried has a point within of 0 whose gap is 1. So none of them meets a tolerance such as , and making smaller does not help.
Conjecture
For the step function , the statement
is false.
Three values of failed. To show that every fails, prove the negation of the statement.
Format 4
Write it
Write the negation of the statement, using the rules of lesson PG1.4. Then prove the negation, which shows that the statement is false.
Saved in this browser as you type.
Write your own first: a proof you have tried to write teaches far more than one you only read.
In the language of lesson 2.1.2, the step function has a jump at 0, so it is not continuous there. Stage PG4 proves limits from this definition.
Summary card
- "For every there is a such that, for every , " is a game: first, then , then .
- To prove it: let , name from , take any with , and show .
- For at 2, works, because .
- To disprove it: prove the negation. Find one such that every has an with and .