Let $a\in [0,1]$. FInd all the closed intervals $I \subset [0,1]$ such that the following inequality holds for any convex differentiable function $f:[0,1]\to \mathbb{R}$ :
$$\int_0^1 \max\{f(a), f(x)\}dx\ge \max_{x \in I} f(x)$$
What I did was setting $I=[u, v]$ and plugging in $f(x)=x$ and $f(x)=-x$ which gave me in turn that $a^2+1\ge 2v$ and $2a-a^2\le 2u$. Then I got stuck. I also thought about using the fact that a convex function attains its maximum at the endpoints of a closed interval, but I wasn't successful
2026-03-26 21:14:00.1774559640
Find $I$ if $\int_0^1 \max\{f(a), f(x)\}dx\ge \max_{x \in I} f(x)$
45 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in REAL-ANALYSIS
- how is my proof on equinumerous sets
- Finding radius of convergence $\sum _{n=0}^{}(2+(-1)^n)^nz^n$
- Optimization - If the sum of objective functions are similar, will sum of argmax's be similar
- On sufficient condition for pre-compactness "in measure"(i.e. in Young measure space)
- Justify an approximation of $\sum_{n=1}^\infty G_n/\binom{\frac{n}{2}+\frac{1}{2}}{\frac{n}{2}}$, where $G_n$ denotes the Gregory coefficients
- Calculating the radius of convergence for $\sum _{n=1}^{\infty}\frac{\left(\sqrt{ n^2+n}-\sqrt{n^2+1}\right)^n}{n^2}z^n$
- Is this relating to continuous functions conjecture correct?
- What are the functions satisfying $f\left(2\sum_{i=0}^{\infty}\frac{a_i}{3^i}\right)=\sum_{i=0}^{\infty}\frac{a_i}{2^i}$
- Absolutely continuous functions are dense in $L^1$
- A particular exercise on convergence of recursive sequence
Related Questions in INEQUALITY
- Confirmation of Proof: $\forall n \in \mathbb{N}, \ \pi (n) \geqslant \frac{\log n}{2\log 2}$
- Prove or disprove the following inequality
- Proving that: $||x|^{s/2}-|y|^{s/2}|\le 2|x-y|^{s/2}$
- Show that $x\longmapsto \int_{\mathbb R^n}\frac{f(y)}{|x-y|^{n-\alpha }}dy$ is integrable.
- Solution to a hard inequality
- Is every finite descending sequence in [0,1] in convex hull of certain points?
- Bound for difference between arithmetic and geometric mean
- multiplying the integrands in an inequality of integrals with same limits
- How to prove that $\pi^{e^{\pi^e}}<e^{\pi^{e^{\pi}}}$
- Proving a small inequality
Related Questions in INTEGRAL-INEQUALITY
- Prove or disprove the following inequality
- multiplying the integrands in an inequality of integrals with same limits
- inequality with arc length integral
- Ideas to prove an inequality
- Separation of variables and inequality
- $\exists c>0$ such that $ (z-x)\int_z^y{f(t)dt} - (y-z)\int_x^z{f(t)dt \geq c(z-x)(y-z)}$
- Cauchy Schwarz Inequality Integral
- An integral inequality (one variable)
- An inequality deduced for $-\sum_{n=1}^\infty\frac{\mu(n)}{n}x^{n-1}$ on assumption of convexity, invoking a theorem due to Dragomir
- Integral inequality on decreasing function
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
I guess that the missing part to your argument is to recognize that the two linear functions $L(x) = -x$ and $R(x) = x$ represent the worst cases for the inequalities you are trying to prove.
First note that the inequality is invariant for linear transformation of the image of $f$ in the form $f \mapsto \alpha f + \beta$ where $\alpha, \beta \in \mathbb{R}$ with $\alpha > 0 $.
Define the interval $I_a$ as follows $$ I_a = [u_a, v_a] \dot= \left[ a-\frac{a^2}{2}, \frac{a^2+1}{2} \right] $$ (it is straightforward to check that $I_a$ is always not empty).
Let $f$ be any convex differentiable function on $[0,1]$ (for the argument that follows, this assumption might be relaxed, requiring only a bound on the "slope" of $f$ at $x=0,1$). Being convex, the function $f$ can reach its maximum over $I_A$ either at $u_a$ or at $v_a$. In what follows we will assume that $$ \max_{x \in I_a} f(x) = f(v_a). $$ (the argument in the over case is very similar).
Up to a linear transformation of $f$ in the form above, we can further assume $f(v_a) = R(v_a) = v_a$ and, by convexity that $$ f(x) \geq R(x) \qquad \forall x \in [0,1] $$ holds.
Finally, we deduce $$ \int_0^1 \max \{ f(a), f(x) \} \, \mathrm{d}x \geq \int_0^1 \max \{ R(a), R(x) \} \, \mathrm{d}x \geq \max_{x \in I_a} R(x) = \max_{x \in I_a} f(x). $$