Stone -Weierstrass theorem











up vote
0
down vote

favorite













let $A$ be a set of continuous functions over the closed interval $[0,1]$, which applies to the following conditions:



$ 1: forall f in A , forall x in [0,1] , f(x) geq 0 $



$2: forall f, g in A , f + g in A $



$3: forall x in [0,1], textbf{there is} f in A quad textbf{so that} f(x) > 0 $




By Stone -Weierstrass theorem , How can I Prove "that there is $ h in A$ so that $ forall x in [0,1], h(x) > 0$" ?.




Should I use the below theorem?




THEOREM:



Let A $subset C(K)$ such that



1) A is a subalgebra with unity 1



2) For each $ x_1, x_2 in K $ with $ x_1 neq x_2 $, exist $f in A$ such that f($ x_1$) $ neq $ f($ x_2$).



Then $ overline A = C(K)$, where C(K) is the space of continuous functions over a compact space










share|cite|improve this question




















  • 1




    It does not seem like you can use the theorem. Consider $A := {f: [0,1] to mathbb R|, forall x: f(x) = c geq 0}$. This $A$ does not satisfy condition 2) of your theorem, but it does satisfy 1,2 and 3 above.
    – N.Beck
    Nov 18 at 19:47












  • You recieved an answer to your question. Is it what you needed? If so, you should upvote and accept it.
    – 5xum
    Nov 27 at 10:51















up vote
0
down vote

favorite













let $A$ be a set of continuous functions over the closed interval $[0,1]$, which applies to the following conditions:



$ 1: forall f in A , forall x in [0,1] , f(x) geq 0 $



$2: forall f, g in A , f + g in A $



$3: forall x in [0,1], textbf{there is} f in A quad textbf{so that} f(x) > 0 $




By Stone -Weierstrass theorem , How can I Prove "that there is $ h in A$ so that $ forall x in [0,1], h(x) > 0$" ?.




Should I use the below theorem?




THEOREM:



Let A $subset C(K)$ such that



1) A is a subalgebra with unity 1



2) For each $ x_1, x_2 in K $ with $ x_1 neq x_2 $, exist $f in A$ such that f($ x_1$) $ neq $ f($ x_2$).



Then $ overline A = C(K)$, where C(K) is the space of continuous functions over a compact space










share|cite|improve this question




















  • 1




    It does not seem like you can use the theorem. Consider $A := {f: [0,1] to mathbb R|, forall x: f(x) = c geq 0}$. This $A$ does not satisfy condition 2) of your theorem, but it does satisfy 1,2 and 3 above.
    – N.Beck
    Nov 18 at 19:47












  • You recieved an answer to your question. Is it what you needed? If so, you should upvote and accept it.
    – 5xum
    Nov 27 at 10:51













up vote
0
down vote

favorite









up vote
0
down vote

favorite












let $A$ be a set of continuous functions over the closed interval $[0,1]$, which applies to the following conditions:



$ 1: forall f in A , forall x in [0,1] , f(x) geq 0 $



$2: forall f, g in A , f + g in A $



$3: forall x in [0,1], textbf{there is} f in A quad textbf{so that} f(x) > 0 $




By Stone -Weierstrass theorem , How can I Prove "that there is $ h in A$ so that $ forall x in [0,1], h(x) > 0$" ?.




Should I use the below theorem?




THEOREM:



Let A $subset C(K)$ such that



1) A is a subalgebra with unity 1



2) For each $ x_1, x_2 in K $ with $ x_1 neq x_2 $, exist $f in A$ such that f($ x_1$) $ neq $ f($ x_2$).



Then $ overline A = C(K)$, where C(K) is the space of continuous functions over a compact space










share|cite|improve this question
















let $A$ be a set of continuous functions over the closed interval $[0,1]$, which applies to the following conditions:



$ 1: forall f in A , forall x in [0,1] , f(x) geq 0 $



$2: forall f, g in A , f + g in A $



$3: forall x in [0,1], textbf{there is} f in A quad textbf{so that} f(x) > 0 $




By Stone -Weierstrass theorem , How can I Prove "that there is $ h in A$ so that $ forall x in [0,1], h(x) > 0$" ?.




Should I use the below theorem?




THEOREM:



Let A $subset C(K)$ such that



1) A is a subalgebra with unity 1



2) For each $ x_1, x_2 in K $ with $ x_1 neq x_2 $, exist $f in A$ such that f($ x_1$) $ neq $ f($ x_2$).



Then $ overline A = C(K)$, where C(K) is the space of continuous functions over a compact space







real-analysis functional-analysis






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Nov 18 at 19:39

























asked Nov 18 at 19:34









joe

874




874








  • 1




    It does not seem like you can use the theorem. Consider $A := {f: [0,1] to mathbb R|, forall x: f(x) = c geq 0}$. This $A$ does not satisfy condition 2) of your theorem, but it does satisfy 1,2 and 3 above.
    – N.Beck
    Nov 18 at 19:47












  • You recieved an answer to your question. Is it what you needed? If so, you should upvote and accept it.
    – 5xum
    Nov 27 at 10:51














  • 1




    It does not seem like you can use the theorem. Consider $A := {f: [0,1] to mathbb R|, forall x: f(x) = c geq 0}$. This $A$ does not satisfy condition 2) of your theorem, but it does satisfy 1,2 and 3 above.
    – N.Beck
    Nov 18 at 19:47












  • You recieved an answer to your question. Is it what you needed? If so, you should upvote and accept it.
    – 5xum
    Nov 27 at 10:51








1




1




It does not seem like you can use the theorem. Consider $A := {f: [0,1] to mathbb R|, forall x: f(x) = c geq 0}$. This $A$ does not satisfy condition 2) of your theorem, but it does satisfy 1,2 and 3 above.
– N.Beck
Nov 18 at 19:47






It does not seem like you can use the theorem. Consider $A := {f: [0,1] to mathbb R|, forall x: f(x) = c geq 0}$. This $A$ does not satisfy condition 2) of your theorem, but it does satisfy 1,2 and 3 above.
– N.Beck
Nov 18 at 19:47














You recieved an answer to your question. Is it what you needed? If so, you should upvote and accept it.
– 5xum
Nov 27 at 10:51




You recieved an answer to your question. Is it what you needed? If so, you should upvote and accept it.
– 5xum
Nov 27 at 10:51










1 Answer
1






active

oldest

votes

















up vote
2
down vote













I would use compactness: find for every $x$ a function $f_x$ as in 3), also take $delta_x>0$ such that $f_x$ is positive inside the $delta_x$-nbd of $x$. Now apply compactness to reduce to finitely many function and add them.



Addendum: there are finitely many $x_1$, ..., $x_n$ such that $[0,1]$ is covered by the corresponding $delta_{x_i}$-nbds. Now take $f=f_{x_1}+cdots+f_{x_n}$.






share|cite|improve this answer























  • please, give me more guidance about "apply compactness to reduce to finitely many function and add them. "? Thanks.
    – joe
    Nov 19 at 5:05










  • I have expanded the answer a bit.
    – hartkp
    Nov 19 at 9:00











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',
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%2f3004020%2fstone-weierstrass-theorem%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























1 Answer
1






active

oldest

votes








1 Answer
1






active

oldest

votes









active

oldest

votes






active

oldest

votes








up vote
2
down vote













I would use compactness: find for every $x$ a function $f_x$ as in 3), also take $delta_x>0$ such that $f_x$ is positive inside the $delta_x$-nbd of $x$. Now apply compactness to reduce to finitely many function and add them.



Addendum: there are finitely many $x_1$, ..., $x_n$ such that $[0,1]$ is covered by the corresponding $delta_{x_i}$-nbds. Now take $f=f_{x_1}+cdots+f_{x_n}$.






share|cite|improve this answer























  • please, give me more guidance about "apply compactness to reduce to finitely many function and add them. "? Thanks.
    – joe
    Nov 19 at 5:05










  • I have expanded the answer a bit.
    – hartkp
    Nov 19 at 9:00















up vote
2
down vote













I would use compactness: find for every $x$ a function $f_x$ as in 3), also take $delta_x>0$ such that $f_x$ is positive inside the $delta_x$-nbd of $x$. Now apply compactness to reduce to finitely many function and add them.



Addendum: there are finitely many $x_1$, ..., $x_n$ such that $[0,1]$ is covered by the corresponding $delta_{x_i}$-nbds. Now take $f=f_{x_1}+cdots+f_{x_n}$.






share|cite|improve this answer























  • please, give me more guidance about "apply compactness to reduce to finitely many function and add them. "? Thanks.
    – joe
    Nov 19 at 5:05










  • I have expanded the answer a bit.
    – hartkp
    Nov 19 at 9:00













up vote
2
down vote










up vote
2
down vote









I would use compactness: find for every $x$ a function $f_x$ as in 3), also take $delta_x>0$ such that $f_x$ is positive inside the $delta_x$-nbd of $x$. Now apply compactness to reduce to finitely many function and add them.



Addendum: there are finitely many $x_1$, ..., $x_n$ such that $[0,1]$ is covered by the corresponding $delta_{x_i}$-nbds. Now take $f=f_{x_1}+cdots+f_{x_n}$.






share|cite|improve this answer














I would use compactness: find for every $x$ a function $f_x$ as in 3), also take $delta_x>0$ such that $f_x$ is positive inside the $delta_x$-nbd of $x$. Now apply compactness to reduce to finitely many function and add them.



Addendum: there are finitely many $x_1$, ..., $x_n$ such that $[0,1]$ is covered by the corresponding $delta_{x_i}$-nbds. Now take $f=f_{x_1}+cdots+f_{x_n}$.







share|cite|improve this answer














share|cite|improve this answer



share|cite|improve this answer








edited Nov 19 at 9:00

























answered Nov 18 at 19:58









hartkp

1,27965




1,27965












  • please, give me more guidance about "apply compactness to reduce to finitely many function and add them. "? Thanks.
    – joe
    Nov 19 at 5:05










  • I have expanded the answer a bit.
    – hartkp
    Nov 19 at 9:00


















  • please, give me more guidance about "apply compactness to reduce to finitely many function and add them. "? Thanks.
    – joe
    Nov 19 at 5:05










  • I have expanded the answer a bit.
    – hartkp
    Nov 19 at 9:00
















please, give me more guidance about "apply compactness to reduce to finitely many function and add them. "? Thanks.
– joe
Nov 19 at 5:05




please, give me more guidance about "apply compactness to reduce to finitely many function and add them. "? Thanks.
– joe
Nov 19 at 5:05












I have expanded the answer a bit.
– hartkp
Nov 19 at 9:00




I have expanded the answer a bit.
– hartkp
Nov 19 at 9:00


















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%2f3004020%2fstone-weierstrass-theorem%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

mysqli_query(): Empty query in /home/lucindabrummitt/public_html/blog/wp-includes/wp-db.php on line 1924

How to change which sound is reproduced for terminal bell?

Can I use Tabulator js library in my java Spring + Thymeleaf project?