- #1
Miike012
- 1,009
- 0
This calc book that I am reading uses words like "upper bound" and "sup" a lot when proving theorems. I have never heared these terms before so it makes it hard for me to understand the proofs.
I think it has to deal with max's values of a graph: For example given a set S of all elements c in a ≤ c ≤ b would the the upper bound in the following graph in [a,b] be c? and also c = Sup S...
is this correct?
I think it has to deal with max's values of a graph: For example given a set S of all elements c in a ≤ c ≤ b would the the upper bound in the following graph in [a,b] be c? and also c = Sup S...
is this correct?