Skip to main content
Notice removed Draw attention by CommunityBot
Bounty Ended with Alex Ravsky's answer chosen by CommunityBot
added 72 characters in body
Source Link

Let $\mathcal A_{s}$ be the set of sequences $X=(x_m)_{m \in I}$ where $I=\{1,2,...,n\}$ with $n \ge 2$ and possibly $n =\infty$ is an index set with $x_1=0$, $x_2=s>0$ and $x_m>x_{m-1}$ for $m,m-1 \in I.$ In addition, we require that the sequence $X$ satisfies $$ \sum_{m \in I} e^{-\gamma x_m}<\infty \text{ for all }\gamma>0.$$

We then fix $x_2=s>0$ (as $x_1=0$ is always fixed) and define $\gamma(X,\lambda)>0$ for $\lambda \in (0,x_2)$ by the condition $$ \sum_{m \in I} (\lambda-x_m) e^{-\gamma(X,\lambda) x_m}=0.$$ Based on some examples, I then claim that for $\lambda \in (0,s)$ $$\max_{X\in \mathcal A_s} \sum_{m \in I} e^{-\gamma(X,\lambda) x_m} $$ is attained for the sequence $X=(0,s)$, i.e. $I=\{1,2\}$ such that

$$\max_{X\in \mathcal A_s} \sum_{m \in I} e^{-\gamma(X,\lambda) x_m} = 1 + e^{-\gamma((0,s),\lambda)s}.$$$$\max_{X\in \mathcal A_s} \sum_{m \in I} e^{-\gamma(X,\lambda) x_m} = 1 + e^{-\gamma((0,s),\lambda)s}=(1-\lambda/s)^{-1}.$$

In other words, I would like to understand whether

$$ \sum_{m \in I} e^{-\gamma(X,\lambda) x_m} \le (1-\lambda/s)^{-1}$$ for any $X \in \mathcal A_s$ and $\lambda \in (0,s).$

Example: For $I= \mathbb N$ and $X = (m-1)_{m \in \mathbb N}$, we have $s=1$ and compute $$\sum_{m \in \mathbb N_0} m e^{-\gamma m} = \frac{e^{\gamma}}{(e^{\gamma}-1)^2} \text{ and } \sum_{m \in \mathbb N_0} \lambda e^{-\gamma m} =\frac{ \lambda e^{\gamma}}{e^{\gamma}-1}.$$

Thus, the defining equation is $\lambda = (e^{\gamma}-1)^{-1}$ which shows that $\gamma = \log(1+\frac{1}{\lambda}).$

Then $\sum_{m \ge 0} e^{-\log(1+\frac{1}{\lambda})m} = 1+\lambda \le (1-\lambda)^{-1}.$$\sum_{m \ge 0} e^{-\log(1+\frac{1}{\lambda})m} =\sum_{m \ge 0} \left(1+\frac{1}{\lambda}\right)^{-m}= 1+\lambda \le (1-\lambda)^{-1}.$

Let $\mathcal A_{s}$ be the set of sequences $X=(x_m)_{m \in I}$ where $I=\{1,2,...,n\}$ with $n \ge 2$ and possibly $n =\infty$ is an index set with $x_1=0$, $x_2=s>0$ and $x_m>x_{m-1}$ for $m,m-1 \in I.$ In addition, we require that the sequence $X$ satisfies $$ \sum_{m \in I} e^{-\gamma x_m}<\infty \text{ for all }\gamma>0.$$

We then fix $x_2=s>0$ (as $x_1=0$ is always fixed) and define $\gamma(X,\lambda)>0$ for $\lambda \in (0,x_2)$ by the condition $$ \sum_{m \in I} (\lambda-x_m) e^{-\gamma(X,\lambda) x_m}=0.$$ Based on some examples, I then claim that for $\lambda \in (0,s)$ $$\max_{X\in \mathcal A_s} \sum_{m \in I} e^{-\gamma(X,\lambda) x_m} $$ is attained for the sequence $X=(0,s)$, i.e. $I=\{1,2\}$ such that

$$\max_{X\in \mathcal A_s} \sum_{m \in I} e^{-\gamma(X,\lambda) x_m} = 1 + e^{-\gamma((0,s),\lambda)s}.$$

In other words, I would like to understand whether

$$ \sum_{m \in I} e^{-\gamma(X,\lambda) x_m} \le (1-\lambda/s)^{-1}$$ for any $X \in \mathcal A_s$ and $\lambda \in (0,s).$

Example: For $I= \mathbb N$ and $X = (m-1)_{m \in \mathbb N}$, we have $s=1$ and compute $$\sum_{m \in \mathbb N_0} m e^{-\gamma m} = \frac{e^{\gamma}}{(e^{\gamma}-1)^2} \text{ and } \sum_{m \in \mathbb N_0} \lambda e^{-\gamma m} =\frac{ \lambda e^{\gamma}}{e^{\gamma}-1}.$$

Thus, the defining equation is $\lambda = (e^{\gamma}-1)^{-1}$ which shows that $\gamma = \log(1+\frac{1}{\lambda}).$

Then $\sum_{m \ge 0} e^{-\log(1+\frac{1}{\lambda})m} = 1+\lambda \le (1-\lambda)^{-1}.$

Let $\mathcal A_{s}$ be the set of sequences $X=(x_m)_{m \in I}$ where $I=\{1,2,...,n\}$ with $n \ge 2$ and possibly $n =\infty$ is an index set with $x_1=0$, $x_2=s>0$ and $x_m>x_{m-1}$ for $m,m-1 \in I.$ In addition, we require that the sequence $X$ satisfies $$ \sum_{m \in I} e^{-\gamma x_m}<\infty \text{ for all }\gamma>0.$$

We then fix $x_2=s>0$ (as $x_1=0$ is always fixed) and define $\gamma(X,\lambda)>0$ for $\lambda \in (0,x_2)$ by the condition $$ \sum_{m \in I} (\lambda-x_m) e^{-\gamma(X,\lambda) x_m}=0.$$ Based on some examples, I then claim that for $\lambda \in (0,s)$ $$\max_{X\in \mathcal A_s} \sum_{m \in I} e^{-\gamma(X,\lambda) x_m} $$ is attained for the sequence $X=(0,s)$, i.e. $I=\{1,2\}$ such that

$$\max_{X\in \mathcal A_s} \sum_{m \in I} e^{-\gamma(X,\lambda) x_m} = 1 + e^{-\gamma((0,s),\lambda)s}=(1-\lambda/s)^{-1}.$$

In other words, I would like to understand whether

$$ \sum_{m \in I} e^{-\gamma(X,\lambda) x_m} \le (1-\lambda/s)^{-1}$$ for any $X \in \mathcal A_s$ and $\lambda \in (0,s).$

Example: For $I= \mathbb N$ and $X = (m-1)_{m \in \mathbb N}$, we have $s=1$ and compute $$\sum_{m \in \mathbb N_0} m e^{-\gamma m} = \frac{e^{\gamma}}{(e^{\gamma}-1)^2} \text{ and } \sum_{m \in \mathbb N_0} \lambda e^{-\gamma m} =\frac{ \lambda e^{\gamma}}{e^{\gamma}-1}.$$

Thus, the defining equation is $\lambda = (e^{\gamma}-1)^{-1}$ which shows that $\gamma = \log(1+\frac{1}{\lambda}).$

Then $\sum_{m \ge 0} e^{-\log(1+\frac{1}{\lambda})m} =\sum_{m \ge 0} \left(1+\frac{1}{\lambda}\right)^{-m}= 1+\lambda \le (1-\lambda)^{-1}.$

added 488 characters in body
Source Link

Let $\mathcal A_{s}$ be the set of sequences $X=(x_m)_{m \in I}$ where $I=\{1,2,...,n\}$ with $n \ge 2$ and possibly $n =\infty$ is an index set with $x_1=0$, $x_2=s>0$ and $x_m>x_{m-1}$ for $m,m-1 \in I.$ In addition, we require that the sequence $X$ satisfies $$ \sum_{m \in I} e^{-\gamma x_m}<\infty \text{ for all }\gamma>0.$$

We then fix $x_2=s>0$ (as $x_1=0$ is always fixed) and define $\gamma(X,\lambda)>0$ for $\lambda \in (0,x_2)$ by the condition $$ \sum_{m \in I} (\lambda-x_m) e^{-\gamma(X,\lambda) x_m}=0.$$ Based on some examples, I then claim that for $\lambda \in (0,s)$ $$\max_{X\in \mathcal A_s} \sum_{m \in I} e^{-\gamma(X,\lambda) x_m} $$ is attained for the sequence $X=(0,s)$, i.e. $I=\{1,2\}$ such that

$$\max_{X\in \mathcal A_s} \sum_{m \in I} e^{-\gamma(X,\lambda) x_m} = 1 + e^{-\gamma((0,s),\lambda)s}.$$

In other words, I would like to understand whether

$$ \sum_{m \in I} e^{-\gamma(X,\lambda) x_m} \le (1-\lambda/s)^{-1}$$ for any $X \in \mathcal A_s$ and $\lambda \in (0,s).$

Example: For $I= \mathbb N$ and $X = (m-1)_{m \in \mathbb N}$, we have $s=1$ and compute $$\sum_{m \in \mathbb N_0} m e^{-\gamma m} = \frac{e^{\gamma}}{(e^{\gamma}-1)^2} \text{ and } \sum_{m \in \mathbb N_0} \lambda e^{-\gamma m} =\frac{ \lambda e^{\gamma}}{e^{\gamma}-1}.$$

Thus, the defining equation is $\lambda = (e^{\gamma}-1)^{-1}$ which shows that $\gamma = \log(1+\frac{1}{\lambda}).$

Then $\sum_{m \ge 0} e^{-\log(1+\frac{1}{\lambda})m} = 1+\lambda \le (1-\lambda)^{-1}.$

Let $\mathcal A_{s}$ be the set of sequences $X=(x_m)_{m \in I}$ where $I=\{1,2,...,n\}$ with $n \ge 2$ and possibly $n =\infty$ is an index set with $x_1=0$, $x_2=s>0$ and $x_m>x_{m-1}$ for $m,m-1 \in I.$ In addition, we require that the sequence $X$ satisfies $$ \sum_{m \in I} e^{-\gamma x_m}<\infty \text{ for all }\gamma>0.$$

We then fix $x_2=s>0$ (as $x_1=0$ is always fixed) and define $\gamma(X,\lambda)>0$ for $\lambda \in (0,x_2)$ by the condition $$ \sum_{m \in I} (\lambda-x_m) e^{-\gamma(X,\lambda) x_m}=0.$$ Based on some examples, I then claim that for $\lambda \in (0,s)$ $$\max_{X\in \mathcal A_s} \sum_{m \in I} e^{-\gamma(X,\lambda) x_m} $$ is attained for the sequence $X=(0,s)$, i.e. $I=\{1,2\}$ such that

$$\max_{X\in \mathcal A_s} \sum_{m \in I} e^{-\gamma(X,\lambda) x_m} = 1 + e^{-\gamma((0,s),\lambda)s}.$$

In other words, I would like to understand whether

$$ \sum_{m \in I} e^{-\gamma(X,\lambda) x_m} \le (1-\lambda/s)^{-1}$$ for any $X \in \mathcal A_s$ and $\lambda \in (0,s).$

Let $\mathcal A_{s}$ be the set of sequences $X=(x_m)_{m \in I}$ where $I=\{1,2,...,n\}$ with $n \ge 2$ and possibly $n =\infty$ is an index set with $x_1=0$, $x_2=s>0$ and $x_m>x_{m-1}$ for $m,m-1 \in I.$ In addition, we require that the sequence $X$ satisfies $$ \sum_{m \in I} e^{-\gamma x_m}<\infty \text{ for all }\gamma>0.$$

We then fix $x_2=s>0$ (as $x_1=0$ is always fixed) and define $\gamma(X,\lambda)>0$ for $\lambda \in (0,x_2)$ by the condition $$ \sum_{m \in I} (\lambda-x_m) e^{-\gamma(X,\lambda) x_m}=0.$$ Based on some examples, I then claim that for $\lambda \in (0,s)$ $$\max_{X\in \mathcal A_s} \sum_{m \in I} e^{-\gamma(X,\lambda) x_m} $$ is attained for the sequence $X=(0,s)$, i.e. $I=\{1,2\}$ such that

$$\max_{X\in \mathcal A_s} \sum_{m \in I} e^{-\gamma(X,\lambda) x_m} = 1 + e^{-\gamma((0,s),\lambda)s}.$$

In other words, I would like to understand whether

$$ \sum_{m \in I} e^{-\gamma(X,\lambda) x_m} \le (1-\lambda/s)^{-1}$$ for any $X \in \mathcal A_s$ and $\lambda \in (0,s).$

Example: For $I= \mathbb N$ and $X = (m-1)_{m \in \mathbb N}$, we have $s=1$ and compute $$\sum_{m \in \mathbb N_0} m e^{-\gamma m} = \frac{e^{\gamma}}{(e^{\gamma}-1)^2} \text{ and } \sum_{m \in \mathbb N_0} \lambda e^{-\gamma m} =\frac{ \lambda e^{\gamma}}{e^{\gamma}-1}.$$

Thus, the defining equation is $\lambda = (e^{\gamma}-1)^{-1}$ which shows that $\gamma = \log(1+\frac{1}{\lambda}).$

Then $\sum_{m \ge 0} e^{-\log(1+\frac{1}{\lambda})m} = 1+\lambda \le (1-\lambda)^{-1}.$

added 22 characters in body
Source Link

Let $\mathcal A_{s}$ be the set of sequences $X=(x_m)_{m \in I}$ where $I=\{1,2,...,n\}$ with $n \ge 2$ and possibly $n =\infty$ is an index set with $x_1=0$, $x_2=s>0$ and $x_m>x_{m-1}$ for $m,m-1 \in I.$ In addition, we require that the sequence $X$ satisfies $$ \sum_{m \in I} e^{-\gamma x_m}<\infty \text{ for all }\gamma>0.$$

We then fix $x_2=s>0$ (as $x_1=0$ is always fixed) and define $\gamma(X,\lambda)>0$ for $\lambda \in (0,x_2)$ by the condition $$ \sum_{m \in I} (\lambda-x_m) e^{-\gamma(X,\lambda) x_m}=0.$$ Based on some examples, I then claim that for $\lambda \in (0,s)$ $$\max_{X\in \mathcal A_s} \sum_{m \in I} e^{-\gamma(X,\lambda) x_m} $$ is attained for the sequence $X=(0,s)$, i.e. $I=\{1,2\}$ such that

$$\max_{X\in \mathcal A_s} \sum_{m \in I} e^{-\gamma(X,\lambda) x_m} = 1 + e^{-\gamma((0,s),\lambda)s}.$$

This claim is equivalentIn other words, I would like to understand whether

$$ \sum_{m \in I} e^{-\gamma(X,\lambda) x_m} \le (1-\lambda/s)^{-1}$$ for any $X \in \mathcal A_s$ and $\lambda \in (0,s).$

Let $\mathcal A_{s}$ be the set of sequences $X=(x_m)_{m \in I}$ where $I=\{1,2,...,n\}$ with $n \ge 2$ and possibly $n =\infty$ is an index set with $x_1=0$, $x_2=s>0$ and $x_m>x_{m-1}$ for $m,m-1 \in I.$ In addition, we require that the sequence $X$ satisfies $$ \sum_{m \in I} e^{-\gamma x_m}<\infty \text{ for all }\gamma>0.$$

We then fix $x_2=s>0$ (as $x_1=0$ is always fixed) and define $\gamma(X,\lambda)>0$ for $\lambda \in (0,x_2)$ by the condition $$ \sum_{m \in I} (\lambda-x_m) e^{-\gamma(X,\lambda) x_m}=0.$$ Based on some examples, I then claim that for $\lambda \in (0,s)$ $$\max_{X\in \mathcal A_s} \sum_{m \in I} e^{-\gamma(X,\lambda) x_m} $$ is attained for the sequence $X=(0,s)$, i.e. $I=\{1,2\}$ such that

$$\max_{X\in \mathcal A_s} \sum_{m \in I} e^{-\gamma(X,\lambda) x_m} = 1 + e^{-\gamma((0,s),\lambda)s}.$$

This claim is equivalent to

$$ \sum_{m \in I} e^{-\gamma(X,\lambda) x_m} \le (1-\lambda/s)^{-1}$$ for any $X \in \mathcal A_s$ and $\lambda \in (0,s).$

Let $\mathcal A_{s}$ be the set of sequences $X=(x_m)_{m \in I}$ where $I=\{1,2,...,n\}$ with $n \ge 2$ and possibly $n =\infty$ is an index set with $x_1=0$, $x_2=s>0$ and $x_m>x_{m-1}$ for $m,m-1 \in I.$ In addition, we require that the sequence $X$ satisfies $$ \sum_{m \in I} e^{-\gamma x_m}<\infty \text{ for all }\gamma>0.$$

We then fix $x_2=s>0$ (as $x_1=0$ is always fixed) and define $\gamma(X,\lambda)>0$ for $\lambda \in (0,x_2)$ by the condition $$ \sum_{m \in I} (\lambda-x_m) e^{-\gamma(X,\lambda) x_m}=0.$$ Based on some examples, I then claim that for $\lambda \in (0,s)$ $$\max_{X\in \mathcal A_s} \sum_{m \in I} e^{-\gamma(X,\lambda) x_m} $$ is attained for the sequence $X=(0,s)$, i.e. $I=\{1,2\}$ such that

$$\max_{X\in \mathcal A_s} \sum_{m \in I} e^{-\gamma(X,\lambda) x_m} = 1 + e^{-\gamma((0,s),\lambda)s}.$$

In other words, I would like to understand whether

$$ \sum_{m \in I} e^{-\gamma(X,\lambda) x_m} \le (1-\lambda/s)^{-1}$$ for any $X \in \mathcal A_s$ and $\lambda \in (0,s).$

Notice added Draw attention by Pritam Bemis
Bounty Started worth 500 reputation by Pritam Bemis
added 160 characters in body
Source Link
Loading
edited tags
Link
Alex Ravsky
  • 5.4k
  • 1
  • 17
  • 31
Loading
Notice removed Draw attention by CommunityBot
Bounty Ended with no winning answer by CommunityBot
deleted 41 characters in body
Source Link
Loading
added 64 characters in body
Source Link
Loading
Notice added Draw attention by António Borges Santos
Bounty Started worth 200 reputation by António Borges Santos
added 2 characters in body
Source Link
Loading
added 32 characters in body
Source Link
Loading
edited body
Source Link
Loading
added 39 characters in body
Source Link
Loading
deleted 17 characters in body
Source Link
Loading
Source Link
Loading