How can I proof that this aplication is coercive?












0














I have the next problem. I have to proof that the aplication $a$ is coercive, defined as $$a: H times H longrightarrow R$$
$$ a(x,y) = 2 int_0^1 frac{x'y'}{1+t}dt + x(1) $$



Where $H = {x in H^1(0,1),x(0) = 0} $. I also have to proof that is continous, and I did it, but I not sure that I made it in the right way. Pls HELP!!!










share|cite|improve this question






















  • Pelas, can you show what have you tried? Maybe it would be useful to give an answer
    – Tito Eliatron
    Dec 7 at 22:49










  • I'm sorry, I made a mistake when i was capying the problem. I'll send the whole problem. I have to proof that exists a unique solution for the next problem: $min {int_0^1( frac{|x'|^2}{1+t} -2x)dt + x(1), x in H^1(0,1),x(0) = 0}$. My mistake was that the bilinear form is $a(x,y) = 2int_0^1( frac{x'y'}{1+t})$. $x(1)$ is a part of the linear form.
    – Fernando cañizares
    Dec 8 at 11:28












  • For find the solution i have to use the Lax-Milgram Theorem, and i need to check the condición. That the space is a Hilbert space, but that is obvious, $a(x,y)$ is bilinear, continuous, coercive, and simetric, and that $f(y) = int_0^1 2y(t)dt - y(1)$ is continuous
    – Fernando cañizares
    Dec 8 at 11:36


















0














I have the next problem. I have to proof that the aplication $a$ is coercive, defined as $$a: H times H longrightarrow R$$
$$ a(x,y) = 2 int_0^1 frac{x'y'}{1+t}dt + x(1) $$



Where $H = {x in H^1(0,1),x(0) = 0} $. I also have to proof that is continous, and I did it, but I not sure that I made it in the right way. Pls HELP!!!










share|cite|improve this question






















  • Pelas, can you show what have you tried? Maybe it would be useful to give an answer
    – Tito Eliatron
    Dec 7 at 22:49










  • I'm sorry, I made a mistake when i was capying the problem. I'll send the whole problem. I have to proof that exists a unique solution for the next problem: $min {int_0^1( frac{|x'|^2}{1+t} -2x)dt + x(1), x in H^1(0,1),x(0) = 0}$. My mistake was that the bilinear form is $a(x,y) = 2int_0^1( frac{x'y'}{1+t})$. $x(1)$ is a part of the linear form.
    – Fernando cañizares
    Dec 8 at 11:28












  • For find the solution i have to use the Lax-Milgram Theorem, and i need to check the condición. That the space is a Hilbert space, but that is obvious, $a(x,y)$ is bilinear, continuous, coercive, and simetric, and that $f(y) = int_0^1 2y(t)dt - y(1)$ is continuous
    – Fernando cañizares
    Dec 8 at 11:36
















0












0








0







I have the next problem. I have to proof that the aplication $a$ is coercive, defined as $$a: H times H longrightarrow R$$
$$ a(x,y) = 2 int_0^1 frac{x'y'}{1+t}dt + x(1) $$



Where $H = {x in H^1(0,1),x(0) = 0} $. I also have to proof that is continous, and I did it, but I not sure that I made it in the right way. Pls HELP!!!










share|cite|improve this question













I have the next problem. I have to proof that the aplication $a$ is coercive, defined as $$a: H times H longrightarrow R$$
$$ a(x,y) = 2 int_0^1 frac{x'y'}{1+t}dt + x(1) $$



Where $H = {x in H^1(0,1),x(0) = 0} $. I also have to proof that is continous, and I did it, but I not sure that I made it in the right way. Pls HELP!!!







functional-analysis






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Dec 7 at 22:16









Fernando cañizares

11




11












  • Pelas, can you show what have you tried? Maybe it would be useful to give an answer
    – Tito Eliatron
    Dec 7 at 22:49










  • I'm sorry, I made a mistake when i was capying the problem. I'll send the whole problem. I have to proof that exists a unique solution for the next problem: $min {int_0^1( frac{|x'|^2}{1+t} -2x)dt + x(1), x in H^1(0,1),x(0) = 0}$. My mistake was that the bilinear form is $a(x,y) = 2int_0^1( frac{x'y'}{1+t})$. $x(1)$ is a part of the linear form.
    – Fernando cañizares
    Dec 8 at 11:28












  • For find the solution i have to use the Lax-Milgram Theorem, and i need to check the condición. That the space is a Hilbert space, but that is obvious, $a(x,y)$ is bilinear, continuous, coercive, and simetric, and that $f(y) = int_0^1 2y(t)dt - y(1)$ is continuous
    – Fernando cañizares
    Dec 8 at 11:36




















  • Pelas, can you show what have you tried? Maybe it would be useful to give an answer
    – Tito Eliatron
    Dec 7 at 22:49










  • I'm sorry, I made a mistake when i was capying the problem. I'll send the whole problem. I have to proof that exists a unique solution for the next problem: $min {int_0^1( frac{|x'|^2}{1+t} -2x)dt + x(1), x in H^1(0,1),x(0) = 0}$. My mistake was that the bilinear form is $a(x,y) = 2int_0^1( frac{x'y'}{1+t})$. $x(1)$ is a part of the linear form.
    – Fernando cañizares
    Dec 8 at 11:28












  • For find the solution i have to use the Lax-Milgram Theorem, and i need to check the condición. That the space is a Hilbert space, but that is obvious, $a(x,y)$ is bilinear, continuous, coercive, and simetric, and that $f(y) = int_0^1 2y(t)dt - y(1)$ is continuous
    – Fernando cañizares
    Dec 8 at 11:36


















Pelas, can you show what have you tried? Maybe it would be useful to give an answer
– Tito Eliatron
Dec 7 at 22:49




Pelas, can you show what have you tried? Maybe it would be useful to give an answer
– Tito Eliatron
Dec 7 at 22:49












I'm sorry, I made a mistake when i was capying the problem. I'll send the whole problem. I have to proof that exists a unique solution for the next problem: $min {int_0^1( frac{|x'|^2}{1+t} -2x)dt + x(1), x in H^1(0,1),x(0) = 0}$. My mistake was that the bilinear form is $a(x,y) = 2int_0^1( frac{x'y'}{1+t})$. $x(1)$ is a part of the linear form.
– Fernando cañizares
Dec 8 at 11:28






I'm sorry, I made a mistake when i was capying the problem. I'll send the whole problem. I have to proof that exists a unique solution for the next problem: $min {int_0^1( frac{|x'|^2}{1+t} -2x)dt + x(1), x in H^1(0,1),x(0) = 0}$. My mistake was that the bilinear form is $a(x,y) = 2int_0^1( frac{x'y'}{1+t})$. $x(1)$ is a part of the linear form.
– Fernando cañizares
Dec 8 at 11:28














For find the solution i have to use the Lax-Milgram Theorem, and i need to check the condición. That the space is a Hilbert space, but that is obvious, $a(x,y)$ is bilinear, continuous, coercive, and simetric, and that $f(y) = int_0^1 2y(t)dt - y(1)$ is continuous
– Fernando cañizares
Dec 8 at 11:36






For find the solution i have to use the Lax-Milgram Theorem, and i need to check the condición. That the space is a Hilbert space, but that is obvious, $a(x,y)$ is bilinear, continuous, coercive, and simetric, and that $f(y) = int_0^1 2y(t)dt - y(1)$ is continuous
– Fernando cañizares
Dec 8 at 11:36

















active

oldest

votes











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
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3030431%2fhow-can-i-proof-that-this-aplication-is-coercive%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown






























active

oldest

votes













active

oldest

votes









active

oldest

votes






active

oldest

votes
















draft saved

draft discarded




















































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.





Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


Please pay close attention to the following guidance:


  • 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.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3030431%2fhow-can-i-proof-that-this-aplication-is-coercive%23new-answer', 'question_page');
}
);

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







Popular posts from this blog

Bressuire

Cabo Verde

Gyllenstierna