Largest and smallest D intersect E can be

  • Thread starter Thread starter kathrynag
  • Start date Start date
Join the discussion
Registration is free. Ask a follow-up in this thread, or start your own.
4 replies · 2K views
kathrynag
Messages
595
Reaction score
0

Homework Statement


Ok so I have D[tex]\cap[/tex][[tex]x_{0}-\epsilon,x_{0}+\epsilon[/tex]]=E[tex]\cap[/tex][[tex]x_{0}-\epsilon,x_{0}+\epsilon[/tex]].
I wnat to find the largest and smallest that D[tex]\cap[/tex]E can be.



Homework Equations





The Attempt at a Solution


For largest I got [tex][x_{0}-\epsilon,x_{0}+\epsilon][/tex]. I feel good about that, but I'm not so sure about smallest. I was thinking x0.
 
Physics news on Phys.org
Ok, I just realized the smallest = [tex]\oslash[/tex], right?
 
kathrynag said:
Ok, I just realized the smallest = [tex]\oslash[/tex], right?

Right, if [tex][x_0 - \epsilon, x_0 + \epsilon][/tex] is not a subset of D.
 
HallsofIvy said:
Yes, which raises the question, "What was the problem, really?"

It was a problem about accumulation points and proving there was a limit. I figured out the rest of the problem already. It was just that part.