Questions tagged [upper-lower-bounds]

For questions about finding upper or lower bounds for functions (discrete or continuous).

Definitions

Given a function $f$ with domain $D$ and a partially ordered set $(K, \le)$ as codomain, an element $y \in K$ is an upper bound of $f$ if $f(x) \le y$ for each $x \in D$. The upper bound is called sharp if equality holds for at least one value of $x \in D$.

Function $g$ defined on domain $D$ and having the same codomain $(K, \le)$ is an upper bound of $f$ if $f(x) \le g(x)$ for each $x \in D$.

Function $g$ is further said to be an upper bound of a set of functions if it is an upper bound of each function in that set.

The notion of lower bound for (sets of) functions is defined analogously, with $\ge$ replacing $\le$.

An upper bound is said to be a tight upper bound, a least upper bound, or a supremum if no smaller value is an upper bound. Similarly, a lower bound is said to be a tight lower bound, a greatest lower bound, or an infimum if no greater value is a lower bound.

Source: Wikipedia

Examples

  1. For a random variable $X$ and $a > 0$: $$\Bbb{P}(X \ge a) \le \dfrac{\Bbb{E}(X)}{a}$$

    This inequality is called Markov's inequality and provides an upper bound for the probability that the value of $X$ exceeds $a$.

  2. For any real $x \ge 0 $: $$1 - e^{-x} \le x$$ So $x$ is an upper bound for $1-e^{-x}$, and vise versa, $1-e^{-x}$ is a lower bound in $[0; +\infty)$.

2313 questions
3
votes
2 answers

Why is $\sum_{t=0}^{n-1} \exp \{ -t \Delta^2 \} \geq \frac{1-e^{-1}}{\Delta^2}$ for $n \geq \frac{1}{\Delta^2}$?

This is a follow-up question on this question. I was reading a paper about lower bounds for bandit problems (https://arxiv.org/abs/1302.1611). In Theorem 5, they prove a lower bound with an example problem with two arms. In the comments/answers of…
Tchaikovski
  • 329
  • 1
  • 7
2
votes
1 answer

An upper bound problem with inverse hyperbolic

Need to show that $$ \sum_{r=1}^n \operatorname{sech}(r) < \int_0^n \operatorname{sech}(x) \mathrm{d} x $$ which is done and got to $$ \sum_{r=1}^n \operatorname{sech}(r) < \tan^{-1} \left( \sinh(n) \right) $$ Then we need to find an upper bound for…
CasperYC
  • 228
2
votes
1 answer

Finding bounds of a set defined by two affine functions and bounded variables

Suppose I have two affine functions $f:\mathbb{R}^n\to \mathbb{R}$ $f(\vec{x}) = a_1\cdot x_1 + \dots + a_n \cdot x_n +q$ and $h(\vec{x}) = b_1 \cdot x_1 + \dots + b_n \cdot x_n + p$ where $x_i$ are bounded varibles (for each $x_i$ there is a…
user1070872
2
votes
2 answers

Upper bound for $E(\log(1+e^X))$

I'm looking for an upper bound for the $E(\log(1+\exp(X)))$, where $X$ is a normal random variable. I tried Jensen's inequality for the $\log$ function, but Im searching for a more tight bound, or maybe an upper bound for the function itself.
tata
  • 41
2
votes
3 answers

Why is $\sum_{t=1}^n \exp \{ -t \Delta^2\} \geq \frac{1}{\Delta^2}$?

I am reading a paper about lower bounds for bandit problems (https://arxiv.org/abs/1302.1611). In Theorem 5, they prove a lower bound with an example problem with two arms. In the proof, I see the following step and I wonder where it comes…
Tchaikovski
  • 329
  • 1
  • 7
2
votes
1 answer

Finding lower bounds for a function

Given a function $w\left(x\right)=\sum_{n=1}^x\lfloor\frac{x}{n}\rfloor$. And $f(x) = w(6x+1)-w(6x-2)$, prove that for $x>3; f(x) \geq 12$ EDIT: This doesn't really come from anywhere, I was just messing around with discrete functions and wondered…
Nimish
  • 691
2
votes
0 answers

Finding a Better Upper Bound of A Ratio

I am working on a proof to a problem, and stumbled upon related work by Guy Robin, who created this function as an upper bound of $\sigma_1(x)$--the sum of divisors:$$e^{\gamma}\ln \ln n+\frac{0.6483n}{\ln \ln n}$$ Using that,I made another upper…
MathRH
  • 21
2
votes
1 answer

Upper and Lower bounds Exam style question

Ewan uses a piece of wood 0.8m long, correct to 0.02m, to make a shelf. He then marks out the shelf every 10cm. He finds he has space at the end. What is the maximum length the space could be. So I know that 0.79m ≤ length of wood < 0.81m But…
Chris
  • 301
2
votes
2 answers

Lower bound of log(1-x)

I've been thinking about this problem for several weeks, and I can't seem to come to an answer. I've tried using Taylor's Series with Taylor's Remainder Theorem, but I've hit a dead end in that direction. I've been told the lower bound is…
noah.c
  • 23
2
votes
2 answers

Show $ f(m) = \left( 1 - \frac{1}{m^2} \right)^{m(m-1)/2} $ is lower-bounded by $\frac{1}{2}$ for $m \ge 1$

It is also possible to assume $m$ is an integer if this is useful. One way I can see to solve the problem is to show (1) $f(m)$ is monotonically decreasing, which can be done either by showing $f'(m) \leq 0$ or showing $f(m+1) \leq f(m)$ for all…
Klint Qinami
  • 1,402
1
vote
0 answers

bounds to the nearest 5.

"Ebony makes bracelets. the materials cost £190, correct to the nearest £5. Ebony sells all the bracelets for a total of £875, correct to the nearest £5. the total time taken to make and sell was 72 hours, correct to the nearest hour. Ebony uses…
user1298864
1
vote
1 answer

Does this series converges fast enough to $e$ in order to guarantee this upper bound?

Define the integral $I_n$ as $$I_n = \int_0^1 \frac{d^n}{dx^n} \frac{(x-x^2)^n}{n!} e^xdx = a_ne+b_n $$ where $a_n$ and $b_n$ are integers. We can integrate $I_n$ by parts $n$ times $$I_n = (-1)^n \int_0^1\frac{(x-x^2)^n}{n!}…
Pinteco
  • 2,631
1
vote
0 answers

How to prove or disprove the boundedness of the variable $y$?

Consider the set of linear constraints $C = \{(x,y)\in \mathbb{R}_+^n\times \mathbb{R}_+^n: Bx \geq A y, e^{\top}x = 1\},$ where $e$ denotes the vector of ones, and the matrices $B$ and $A$ are assumed to be real positive definite (without requiring…
kaienfr
  • 199
1
vote
2 answers

infimum and supremum of n/(n+k) where n,k are natural numbers

find infimum and supremum of set $\frac n{n+k}$ where n,k are natural numbers firstly i wrote $$\frac{n}{n+k} = \frac{n+k-k}{n+k}$$ which is equal to $$1-\frac k{n+k}$$ and we know that $n$ and $k$ are natural numbers so supremum is 1 i know that…