Greater than or equal to/Epsilon form
From Maths
< Greater than or equal to
Revision as of 15:07, 9 April 2016 by Alec (Talk | contribs) (Created page with "<noinclude> ==Statement== * {{M|1=x\ge y\iff\forall\epsilon>0[x+\epsilon>y]}} ==Proof==</noinclude> {{M|1=x\ge y\implies\forall\epsilon>0[x+\epsilon>y]}} * Let {{M|\epsilon >...")
Statement
- x≥y⟺∀ϵ>0[x+ϵ>y]
Proof
x≥y⟹∀ϵ>0[x+ϵ>y]
- Let ϵ>0 be given
- As ϵ>0 we see x+ϵ>0+x=x
- But by hypothesis x≥y
- So x+ϵ>x≥y
- Thus x+ϵ>y
- As ϵ>0 we see x+ϵ>0+x=x
- This completes this part of the proof.
∀ϵ>0[x+ϵ>y]⟹x≥y (this will be a proof by contrapositive)
- We will show: x<y⟹∃ϵ>0[x+ϵ<y] Warning:I wrongly negated >, it should be ≤ not < - in light of this I might be able to get away with ϵ=y−x
- As x<y we know 0<y−x.
- Choose ϵ:=y−x2 (which we may do for both R and Q)
- Now x+ϵ=2x2+y−x2=x+y2
- But by hypothesis x<y so x+y<y+y=2y, so:
- x+ϵ=x+y2<2y2=y
- We have shown ∃ϵ>0[x+ϵ<y]
This completes this part of the proof.
TODO: Fix warning. Note that x+ϵ<y⟹x+ϵ≤y so this content isn't wrong, but it requires multiplication by 12 which you cannot do in the ring Z for example.
References
Categories:
- Todo
- Theorems
- Theorems, lemmas and corollaries
- Order Theory Theorems
- Order Theory Theorems, lemmas and corollaries
- Order Theory
- Elementary Set Theory Theorems
- Elementary Set Theory Theorems, lemmas and corollaries
- Elementary Set Theory
- Real Analysis Theorems
- Real Analysis Theorems, lemmas and corollaries
- Real Analysis