Simulate
Check the first claim with numbers
This review asks for two proofs from the definitions: an ε–N proof for a sequence, and an ε–δ proof for a function. As always, each claim is tested first.
Take . Its leading terms are and , so the rule of lesson 2.1.3 points to the limit .
The terms fall short of by at , at and at . For the tolerances 0.1, 0.01 and 0.001, the last term outside the band is , 224 and 2249.
A wrong limit fails. Measured from 2.49, the distance settles near 0.01, not 0: 0.009978 at . So with , the terms never stay within of 2.49.
Conjecture
Three tolerances worked, each from some term on. Your proof must give a rule for that works for every .
Format 4
Write it: a limit of a sequence
Prove from the definition that . Do the scratch work first. Then write the proof: name in terms of , and show that every works.
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
Check the second claim with numbers
Now a function: near , where substituting (lesson 2.1.1) gives . The danger is , where blows up (lesson 2.1.2).
The cell fixes and tries five windows around 2. For each it reports the worst distance from among 1,998 inputs, and whether that is below .
The windows 0.3, 0.2 and 0.1 work, and the window 0.5 fails, with a worst distance of 0.166445.
The window 2 reaches almost to 0, and there the worst distance is 499.5. A proof must keep the window away from 0.
Conjecture
Three windows worked for one tolerance. Your proof must give a rule for that works for every .
Format 4
Write it: a limit of a function
Prove from the definition that . Name in terms of , and keep the window away from 0.
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.
Summary card
- An ε–N proof: write the distance as one fraction, bound it by something simpler, choose from , and check every .
- An ε–δ proof: factor out , and cap to bound what is left. Then take as the smaller of the cap and what needs.
- Many choices of or work. A proof needs one, named explicitly before the terms or inputs it must handle.