- #1

- 11

- 0

Say we have [itex]a = \sup \{ a_{1}, a_{2}, a_{3}, ... \}[/itex]. Then does this mean we can find some [itex]a_{n} \in \{ a_{1}, a_{2}, ... \}[/itex] such that

[tex]|a - a_{n}| < \varepsilon[/tex]

? My reasoning is that since a (the supremum) is the least upper bound of the set, we have to be able to find some member of the set that is arbitrarily close to a otherwise a wouldn't be a supremum anymore. Is this true?

[tex]|a - a_{n}| < \varepsilon[/tex]

? My reasoning is that since a (the supremum) is the least upper bound of the set, we have to be able to find some member of the set that is arbitrarily close to a otherwise a wouldn't be a supremum anymore. Is this true?

Last edited: