If X has beta property, do $(x_i)_i$ points are LUR?
$begingroup$
Let $X$ be a Banach space, $S_X$ its unit sphere and $B_X$ its unit ball.
The space $X$ is said to has $beta$ property if there exists a system ${(x_i,f_i):i in I} subset S_X times S_{X^*}$ and $0 leq rho <1$ such that
(i) $f_i(x_i)=1$, for all $i in I$
(ii) $|f_i(x_j)| leq rho$, for all $i neq j$
(iii) $||x|| = sup{|f_i(x)|:i in I}$, for all $x in X$
A point $x in S_X$ is called locally uniformly convex (LUR) if for every $epsilon>0$ there exists $delta(epsilon)>0$ such that
$y in S_X, cfrac{||x+y||}{2}>1-delta(epsilon) Rightarrow ||x-y||<epsilon $
I'm trying to prove that if $X$ has $beta$ property and $dim X >1$, such points $(x_i)_{i}$ cannot be LUR points.
My first attempt at a solution was try to define a sequence $(x_n)$ in $S_X$ such that $||x_n+x_i||$ approaches to $2$ and $||x_n-x_i||$ does not approach to $0$. It is easy to see that if $x in S_X cap ker{f_i}$, we have that $||x-x_i|| geq 1$, then maybe it is a good idea to define such sequence in $S_X cap ker{f_i}$.
Is it a good approach? Any other hints?
functional-analysis banach-spaces
$endgroup$
add a comment |
$begingroup$
Let $X$ be a Banach space, $S_X$ its unit sphere and $B_X$ its unit ball.
The space $X$ is said to has $beta$ property if there exists a system ${(x_i,f_i):i in I} subset S_X times S_{X^*}$ and $0 leq rho <1$ such that
(i) $f_i(x_i)=1$, for all $i in I$
(ii) $|f_i(x_j)| leq rho$, for all $i neq j$
(iii) $||x|| = sup{|f_i(x)|:i in I}$, for all $x in X$
A point $x in S_X$ is called locally uniformly convex (LUR) if for every $epsilon>0$ there exists $delta(epsilon)>0$ such that
$y in S_X, cfrac{||x+y||}{2}>1-delta(epsilon) Rightarrow ||x-y||<epsilon $
I'm trying to prove that if $X$ has $beta$ property and $dim X >1$, such points $(x_i)_{i}$ cannot be LUR points.
My first attempt at a solution was try to define a sequence $(x_n)$ in $S_X$ such that $||x_n+x_i||$ approaches to $2$ and $||x_n-x_i||$ does not approach to $0$. It is easy to see that if $x in S_X cap ker{f_i}$, we have that $||x-x_i|| geq 1$, then maybe it is a good idea to define such sequence in $S_X cap ker{f_i}$.
Is it a good approach? Any other hints?
functional-analysis banach-spaces
$endgroup$
add a comment |
$begingroup$
Let $X$ be a Banach space, $S_X$ its unit sphere and $B_X$ its unit ball.
The space $X$ is said to has $beta$ property if there exists a system ${(x_i,f_i):i in I} subset S_X times S_{X^*}$ and $0 leq rho <1$ such that
(i) $f_i(x_i)=1$, for all $i in I$
(ii) $|f_i(x_j)| leq rho$, for all $i neq j$
(iii) $||x|| = sup{|f_i(x)|:i in I}$, for all $x in X$
A point $x in S_X$ is called locally uniformly convex (LUR) if for every $epsilon>0$ there exists $delta(epsilon)>0$ such that
$y in S_X, cfrac{||x+y||}{2}>1-delta(epsilon) Rightarrow ||x-y||<epsilon $
I'm trying to prove that if $X$ has $beta$ property and $dim X >1$, such points $(x_i)_{i}$ cannot be LUR points.
My first attempt at a solution was try to define a sequence $(x_n)$ in $S_X$ such that $||x_n+x_i||$ approaches to $2$ and $||x_n-x_i||$ does not approach to $0$. It is easy to see that if $x in S_X cap ker{f_i}$, we have that $||x-x_i|| geq 1$, then maybe it is a good idea to define such sequence in $S_X cap ker{f_i}$.
Is it a good approach? Any other hints?
functional-analysis banach-spaces
$endgroup$
Let $X$ be a Banach space, $S_X$ its unit sphere and $B_X$ its unit ball.
The space $X$ is said to has $beta$ property if there exists a system ${(x_i,f_i):i in I} subset S_X times S_{X^*}$ and $0 leq rho <1$ such that
(i) $f_i(x_i)=1$, for all $i in I$
(ii) $|f_i(x_j)| leq rho$, for all $i neq j$
(iii) $||x|| = sup{|f_i(x)|:i in I}$, for all $x in X$
A point $x in S_X$ is called locally uniformly convex (LUR) if for every $epsilon>0$ there exists $delta(epsilon)>0$ such that
$y in S_X, cfrac{||x+y||}{2}>1-delta(epsilon) Rightarrow ||x-y||<epsilon $
I'm trying to prove that if $X$ has $beta$ property and $dim X >1$, such points $(x_i)_{i}$ cannot be LUR points.
My first attempt at a solution was try to define a sequence $(x_n)$ in $S_X$ such that $||x_n+x_i||$ approaches to $2$ and $||x_n-x_i||$ does not approach to $0$. It is easy to see that if $x in S_X cap ker{f_i}$, we have that $||x-x_i|| geq 1$, then maybe it is a good idea to define such sequence in $S_X cap ker{f_i}$.
Is it a good approach? Any other hints?
functional-analysis banach-spaces
functional-analysis banach-spaces
edited Dec 12 '18 at 22:12
Juliane
asked Dec 11 '18 at 22:37
JulianeJuliane
186111
186111
add a comment |
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
Assume $X$ has the $beta$ property and $dim X>1.$ Fix $iin I.$ The point $x_i$ fails the LUR property with $epsilon=1-rho.$
For any $kinker f_i,$
$$|k|leq 1-rhoimplies|x_i+k|=1tag{*}$$
because $f_i(x_i+k)=f_i(x_i)=1$ and $|f_j(x_i+k)|leq|f_j(x)|+|f_j(k)|leq rho+|k|leq1.$ (The inequality $|f_j(k)|leq |k|$ comes from property (iii).)
Since $dim X>1,$ there exists $kin ker f_i$ with $|k|=1-rho.$ We get a counterexample to the LUR property with $epsilon=1-rho$ and $y=x+k,$ because $|(x+y)/2|=1$ and $|y|=1$ by (*), but $|x-y|=|k|=epsilon.$
$endgroup$
$begingroup$
Nice proof! :) The inequality $|f_j(k)| leq |k|$ also follows from $|f_j| leq 1$.
$endgroup$
– Roberto Rastapopoulos
Dec 17 '18 at 17:03
add a comment |
$begingroup$
Assume for contradiction that $X$ has the $beta$ property and that the points $x_i$ are LUR,
define
$$ varepsilon = frac12 , sup_{x in S_X} left( inf_{i in I} | pm x - x_i| right), $$
and choose $x_{varepsilon}$ such that
$$ inf_{i in I} |pm x_{varepsilon} - x_i| geq varepsilon, quad $$
If $varepsilon = 0$, then there exists a subsequence of ${x_i}$, say $x_{k_i}$,
such that $x_{k_i} to pm x_{varepsilon}$
(either to $+ x_{varepsilon}$, or to $- x_{varepsilon}$) in $X$.
But then, using the $beta$ property, (i),
begin{align}
|f_{k_i}(x_{k_{i-1}})| &= |f_{k_i}(x_{k_i}) + f_{k_i}(x_{k_{i-1}}-x_{k_i})| \
&geq |f_{k_i}(x_{k_i})| - |f_{k_i}| , |x_{k_i} - x_{k_{i-1}}| \
&= 1 - |x_{k_i} - x_{k_{i-1}}| to 1 quad text{as} quad i to infty,
end{align}
contradicting the $beta$ property, (ii); therefore, $varepsilon > 0$.
Using the $beta$ property, (iii),
for any $alpha > 0$ there exists $i_{alpha} in I$ such that
begin{align}
|f_{i_{alpha}}(x_{varepsilon})| geq 1 - 2alpha = |x_{varepsilon}| - 2alpha.
end{align}
Assume $f_{i_{alpha}}(x_{varepsilon}) geq 0$ (renaming $x_{varepsilon} rightarrow -x_{varepsilon}$ if necessary).
Then we have
begin{align}
frac{1}{2}| x_{varepsilon} + x_{i_{alpha}} | &geq frac{1}{2} f_{i_{alpha}} (x_{varepsilon} + x_{i_{alpha}}) \
&geq 1 - alpha.
end{align}
To obtain a contradiction using this reasoning,
there must exist $delta(varepsilon)$ independent of $i$ such that the convexity condition is satisfied.
If $X$ is finite dimensional,
this is possible,
since there can be only finitely many $x_i$.
If $X$ is infinite-dimensional, I suppose this argument isn't enough for non-uniformly convex norms...
$endgroup$
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3035936%2fif-x-has-beta-property-do-x-i-i-points-are-lur%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Assume $X$ has the $beta$ property and $dim X>1.$ Fix $iin I.$ The point $x_i$ fails the LUR property with $epsilon=1-rho.$
For any $kinker f_i,$
$$|k|leq 1-rhoimplies|x_i+k|=1tag{*}$$
because $f_i(x_i+k)=f_i(x_i)=1$ and $|f_j(x_i+k)|leq|f_j(x)|+|f_j(k)|leq rho+|k|leq1.$ (The inequality $|f_j(k)|leq |k|$ comes from property (iii).)
Since $dim X>1,$ there exists $kin ker f_i$ with $|k|=1-rho.$ We get a counterexample to the LUR property with $epsilon=1-rho$ and $y=x+k,$ because $|(x+y)/2|=1$ and $|y|=1$ by (*), but $|x-y|=|k|=epsilon.$
$endgroup$
$begingroup$
Nice proof! :) The inequality $|f_j(k)| leq |k|$ also follows from $|f_j| leq 1$.
$endgroup$
– Roberto Rastapopoulos
Dec 17 '18 at 17:03
add a comment |
$begingroup$
Assume $X$ has the $beta$ property and $dim X>1.$ Fix $iin I.$ The point $x_i$ fails the LUR property with $epsilon=1-rho.$
For any $kinker f_i,$
$$|k|leq 1-rhoimplies|x_i+k|=1tag{*}$$
because $f_i(x_i+k)=f_i(x_i)=1$ and $|f_j(x_i+k)|leq|f_j(x)|+|f_j(k)|leq rho+|k|leq1.$ (The inequality $|f_j(k)|leq |k|$ comes from property (iii).)
Since $dim X>1,$ there exists $kin ker f_i$ with $|k|=1-rho.$ We get a counterexample to the LUR property with $epsilon=1-rho$ and $y=x+k,$ because $|(x+y)/2|=1$ and $|y|=1$ by (*), but $|x-y|=|k|=epsilon.$
$endgroup$
$begingroup$
Nice proof! :) The inequality $|f_j(k)| leq |k|$ also follows from $|f_j| leq 1$.
$endgroup$
– Roberto Rastapopoulos
Dec 17 '18 at 17:03
add a comment |
$begingroup$
Assume $X$ has the $beta$ property and $dim X>1.$ Fix $iin I.$ The point $x_i$ fails the LUR property with $epsilon=1-rho.$
For any $kinker f_i,$
$$|k|leq 1-rhoimplies|x_i+k|=1tag{*}$$
because $f_i(x_i+k)=f_i(x_i)=1$ and $|f_j(x_i+k)|leq|f_j(x)|+|f_j(k)|leq rho+|k|leq1.$ (The inequality $|f_j(k)|leq |k|$ comes from property (iii).)
Since $dim X>1,$ there exists $kin ker f_i$ with $|k|=1-rho.$ We get a counterexample to the LUR property with $epsilon=1-rho$ and $y=x+k,$ because $|(x+y)/2|=1$ and $|y|=1$ by (*), but $|x-y|=|k|=epsilon.$
$endgroup$
Assume $X$ has the $beta$ property and $dim X>1.$ Fix $iin I.$ The point $x_i$ fails the LUR property with $epsilon=1-rho.$
For any $kinker f_i,$
$$|k|leq 1-rhoimplies|x_i+k|=1tag{*}$$
because $f_i(x_i+k)=f_i(x_i)=1$ and $|f_j(x_i+k)|leq|f_j(x)|+|f_j(k)|leq rho+|k|leq1.$ (The inequality $|f_j(k)|leq |k|$ comes from property (iii).)
Since $dim X>1,$ there exists $kin ker f_i$ with $|k|=1-rho.$ We get a counterexample to the LUR property with $epsilon=1-rho$ and $y=x+k,$ because $|(x+y)/2|=1$ and $|y|=1$ by (*), but $|x-y|=|k|=epsilon.$
answered Dec 17 '18 at 16:25
DapDap
17.2k840
17.2k840
$begingroup$
Nice proof! :) The inequality $|f_j(k)| leq |k|$ also follows from $|f_j| leq 1$.
$endgroup$
– Roberto Rastapopoulos
Dec 17 '18 at 17:03
add a comment |
$begingroup$
Nice proof! :) The inequality $|f_j(k)| leq |k|$ also follows from $|f_j| leq 1$.
$endgroup$
– Roberto Rastapopoulos
Dec 17 '18 at 17:03
$begingroup$
Nice proof! :) The inequality $|f_j(k)| leq |k|$ also follows from $|f_j| leq 1$.
$endgroup$
– Roberto Rastapopoulos
Dec 17 '18 at 17:03
$begingroup$
Nice proof! :) The inequality $|f_j(k)| leq |k|$ also follows from $|f_j| leq 1$.
$endgroup$
– Roberto Rastapopoulos
Dec 17 '18 at 17:03
add a comment |
$begingroup$
Assume for contradiction that $X$ has the $beta$ property and that the points $x_i$ are LUR,
define
$$ varepsilon = frac12 , sup_{x in S_X} left( inf_{i in I} | pm x - x_i| right), $$
and choose $x_{varepsilon}$ such that
$$ inf_{i in I} |pm x_{varepsilon} - x_i| geq varepsilon, quad $$
If $varepsilon = 0$, then there exists a subsequence of ${x_i}$, say $x_{k_i}$,
such that $x_{k_i} to pm x_{varepsilon}$
(either to $+ x_{varepsilon}$, or to $- x_{varepsilon}$) in $X$.
But then, using the $beta$ property, (i),
begin{align}
|f_{k_i}(x_{k_{i-1}})| &= |f_{k_i}(x_{k_i}) + f_{k_i}(x_{k_{i-1}}-x_{k_i})| \
&geq |f_{k_i}(x_{k_i})| - |f_{k_i}| , |x_{k_i} - x_{k_{i-1}}| \
&= 1 - |x_{k_i} - x_{k_{i-1}}| to 1 quad text{as} quad i to infty,
end{align}
contradicting the $beta$ property, (ii); therefore, $varepsilon > 0$.
Using the $beta$ property, (iii),
for any $alpha > 0$ there exists $i_{alpha} in I$ such that
begin{align}
|f_{i_{alpha}}(x_{varepsilon})| geq 1 - 2alpha = |x_{varepsilon}| - 2alpha.
end{align}
Assume $f_{i_{alpha}}(x_{varepsilon}) geq 0$ (renaming $x_{varepsilon} rightarrow -x_{varepsilon}$ if necessary).
Then we have
begin{align}
frac{1}{2}| x_{varepsilon} + x_{i_{alpha}} | &geq frac{1}{2} f_{i_{alpha}} (x_{varepsilon} + x_{i_{alpha}}) \
&geq 1 - alpha.
end{align}
To obtain a contradiction using this reasoning,
there must exist $delta(varepsilon)$ independent of $i$ such that the convexity condition is satisfied.
If $X$ is finite dimensional,
this is possible,
since there can be only finitely many $x_i$.
If $X$ is infinite-dimensional, I suppose this argument isn't enough for non-uniformly convex norms...
$endgroup$
add a comment |
$begingroup$
Assume for contradiction that $X$ has the $beta$ property and that the points $x_i$ are LUR,
define
$$ varepsilon = frac12 , sup_{x in S_X} left( inf_{i in I} | pm x - x_i| right), $$
and choose $x_{varepsilon}$ such that
$$ inf_{i in I} |pm x_{varepsilon} - x_i| geq varepsilon, quad $$
If $varepsilon = 0$, then there exists a subsequence of ${x_i}$, say $x_{k_i}$,
such that $x_{k_i} to pm x_{varepsilon}$
(either to $+ x_{varepsilon}$, or to $- x_{varepsilon}$) in $X$.
But then, using the $beta$ property, (i),
begin{align}
|f_{k_i}(x_{k_{i-1}})| &= |f_{k_i}(x_{k_i}) + f_{k_i}(x_{k_{i-1}}-x_{k_i})| \
&geq |f_{k_i}(x_{k_i})| - |f_{k_i}| , |x_{k_i} - x_{k_{i-1}}| \
&= 1 - |x_{k_i} - x_{k_{i-1}}| to 1 quad text{as} quad i to infty,
end{align}
contradicting the $beta$ property, (ii); therefore, $varepsilon > 0$.
Using the $beta$ property, (iii),
for any $alpha > 0$ there exists $i_{alpha} in I$ such that
begin{align}
|f_{i_{alpha}}(x_{varepsilon})| geq 1 - 2alpha = |x_{varepsilon}| - 2alpha.
end{align}
Assume $f_{i_{alpha}}(x_{varepsilon}) geq 0$ (renaming $x_{varepsilon} rightarrow -x_{varepsilon}$ if necessary).
Then we have
begin{align}
frac{1}{2}| x_{varepsilon} + x_{i_{alpha}} | &geq frac{1}{2} f_{i_{alpha}} (x_{varepsilon} + x_{i_{alpha}}) \
&geq 1 - alpha.
end{align}
To obtain a contradiction using this reasoning,
there must exist $delta(varepsilon)$ independent of $i$ such that the convexity condition is satisfied.
If $X$ is finite dimensional,
this is possible,
since there can be only finitely many $x_i$.
If $X$ is infinite-dimensional, I suppose this argument isn't enough for non-uniformly convex norms...
$endgroup$
add a comment |
$begingroup$
Assume for contradiction that $X$ has the $beta$ property and that the points $x_i$ are LUR,
define
$$ varepsilon = frac12 , sup_{x in S_X} left( inf_{i in I} | pm x - x_i| right), $$
and choose $x_{varepsilon}$ such that
$$ inf_{i in I} |pm x_{varepsilon} - x_i| geq varepsilon, quad $$
If $varepsilon = 0$, then there exists a subsequence of ${x_i}$, say $x_{k_i}$,
such that $x_{k_i} to pm x_{varepsilon}$
(either to $+ x_{varepsilon}$, or to $- x_{varepsilon}$) in $X$.
But then, using the $beta$ property, (i),
begin{align}
|f_{k_i}(x_{k_{i-1}})| &= |f_{k_i}(x_{k_i}) + f_{k_i}(x_{k_{i-1}}-x_{k_i})| \
&geq |f_{k_i}(x_{k_i})| - |f_{k_i}| , |x_{k_i} - x_{k_{i-1}}| \
&= 1 - |x_{k_i} - x_{k_{i-1}}| to 1 quad text{as} quad i to infty,
end{align}
contradicting the $beta$ property, (ii); therefore, $varepsilon > 0$.
Using the $beta$ property, (iii),
for any $alpha > 0$ there exists $i_{alpha} in I$ such that
begin{align}
|f_{i_{alpha}}(x_{varepsilon})| geq 1 - 2alpha = |x_{varepsilon}| - 2alpha.
end{align}
Assume $f_{i_{alpha}}(x_{varepsilon}) geq 0$ (renaming $x_{varepsilon} rightarrow -x_{varepsilon}$ if necessary).
Then we have
begin{align}
frac{1}{2}| x_{varepsilon} + x_{i_{alpha}} | &geq frac{1}{2} f_{i_{alpha}} (x_{varepsilon} + x_{i_{alpha}}) \
&geq 1 - alpha.
end{align}
To obtain a contradiction using this reasoning,
there must exist $delta(varepsilon)$ independent of $i$ such that the convexity condition is satisfied.
If $X$ is finite dimensional,
this is possible,
since there can be only finitely many $x_i$.
If $X$ is infinite-dimensional, I suppose this argument isn't enough for non-uniformly convex norms...
$endgroup$
Assume for contradiction that $X$ has the $beta$ property and that the points $x_i$ are LUR,
define
$$ varepsilon = frac12 , sup_{x in S_X} left( inf_{i in I} | pm x - x_i| right), $$
and choose $x_{varepsilon}$ such that
$$ inf_{i in I} |pm x_{varepsilon} - x_i| geq varepsilon, quad $$
If $varepsilon = 0$, then there exists a subsequence of ${x_i}$, say $x_{k_i}$,
such that $x_{k_i} to pm x_{varepsilon}$
(either to $+ x_{varepsilon}$, or to $- x_{varepsilon}$) in $X$.
But then, using the $beta$ property, (i),
begin{align}
|f_{k_i}(x_{k_{i-1}})| &= |f_{k_i}(x_{k_i}) + f_{k_i}(x_{k_{i-1}}-x_{k_i})| \
&geq |f_{k_i}(x_{k_i})| - |f_{k_i}| , |x_{k_i} - x_{k_{i-1}}| \
&= 1 - |x_{k_i} - x_{k_{i-1}}| to 1 quad text{as} quad i to infty,
end{align}
contradicting the $beta$ property, (ii); therefore, $varepsilon > 0$.
Using the $beta$ property, (iii),
for any $alpha > 0$ there exists $i_{alpha} in I$ such that
begin{align}
|f_{i_{alpha}}(x_{varepsilon})| geq 1 - 2alpha = |x_{varepsilon}| - 2alpha.
end{align}
Assume $f_{i_{alpha}}(x_{varepsilon}) geq 0$ (renaming $x_{varepsilon} rightarrow -x_{varepsilon}$ if necessary).
Then we have
begin{align}
frac{1}{2}| x_{varepsilon} + x_{i_{alpha}} | &geq frac{1}{2} f_{i_{alpha}} (x_{varepsilon} + x_{i_{alpha}}) \
&geq 1 - alpha.
end{align}
To obtain a contradiction using this reasoning,
there must exist $delta(varepsilon)$ independent of $i$ such that the convexity condition is satisfied.
If $X$ is finite dimensional,
this is possible,
since there can be only finitely many $x_i$.
If $X$ is infinite-dimensional, I suppose this argument isn't enough for non-uniformly convex norms...
edited Dec 17 '18 at 15:42
answered Dec 17 '18 at 14:43
Roberto RastapopoulosRoberto Rastapopoulos
928425
928425
add a comment |
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3035936%2fif-x-has-beta-property-do-x-i-i-points-are-lur%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown