Real valued continuous functions on [a,b] form a vector space with respect to usual addition and multiplication by scalars.
Clash Royale CLAN TAG#URR8PPP
up vote
0
down vote
favorite
Real valued continuous functions on $[a,b]$ form a vector space with respect to usual addition and multiplication by scalars.
Please help to show a proof. I think it would be a laborious one. Is it really?
vector-spaces
add a comment |Â
up vote
0
down vote
favorite
Real valued continuous functions on $[a,b]$ form a vector space with respect to usual addition and multiplication by scalars.
Please help to show a proof. I think it would be a laborious one. Is it really?
vector-spaces
This is wrong there is for example not always a zero element
â john
Jul 25 '15 at 5:47
You shold just to check axioms of vector space. Why you stucked?
â Michael Galuza
Jul 25 '15 at 5:47
@john, $f(x)equiv 0$ is not a zero element?
â Michael Galuza
Jul 25 '15 at 5:47
add a comment |Â
up vote
0
down vote
favorite
up vote
0
down vote
favorite
Real valued continuous functions on $[a,b]$ form a vector space with respect to usual addition and multiplication by scalars.
Please help to show a proof. I think it would be a laborious one. Is it really?
vector-spaces
Real valued continuous functions on $[a,b]$ form a vector space with respect to usual addition and multiplication by scalars.
Please help to show a proof. I think it would be a laborious one. Is it really?
vector-spaces
edited Jul 25 '15 at 5:57
Rebecca J. Stones
20.7k22580
20.7k22580
asked Jul 25 '15 at 5:43
user251057
This is wrong there is for example not always a zero element
â john
Jul 25 '15 at 5:47
You shold just to check axioms of vector space. Why you stucked?
â Michael Galuza
Jul 25 '15 at 5:47
@john, $f(x)equiv 0$ is not a zero element?
â Michael Galuza
Jul 25 '15 at 5:47
add a comment |Â
This is wrong there is for example not always a zero element
â john
Jul 25 '15 at 5:47
You shold just to check axioms of vector space. Why you stucked?
â Michael Galuza
Jul 25 '15 at 5:47
@john, $f(x)equiv 0$ is not a zero element?
â Michael Galuza
Jul 25 '15 at 5:47
This is wrong there is for example not always a zero element
â john
Jul 25 '15 at 5:47
This is wrong there is for example not always a zero element
â john
Jul 25 '15 at 5:47
You shold just to check axioms of vector space. Why you stucked?
â Michael Galuza
Jul 25 '15 at 5:47
You shold just to check axioms of vector space. Why you stucked?
â Michael Galuza
Jul 25 '15 at 5:47
@john, $f(x)equiv 0$ is not a zero element?
â Michael Galuza
Jul 25 '15 at 5:47
@john, $f(x)equiv 0$ is not a zero element?
â Michael Galuza
Jul 25 '15 at 5:47
add a comment |Â
2 Answers
2
active
oldest
votes
up vote
2
down vote
It is quite laborious, but it's not too difficult. In my experiences, students tend to struggle with this kind of question particularly simply because it's so straightforward, they think they're not doing it properly, and it doesn't feel like they've actually proven anything.
Here, let me get you started. First, I'll address closure of the operations. Then I'll prove associativity of vector addition, then I'll establish the additive identity, and I'll leave you to do the rest.
Suppose $f, g in C[a, b]$ and $lambda in mathbbR$. The definitions of addition and scalar multiplication are respectively,
beginalign
(f + g)(x) &:= f(x) + g(x) &forall x in [a, b] \
(lambda f)(x) &:= lambda f(x) &forall x in [a, b]
endalign
By the algebra of continuous functions, $f + g$ and $lambda f$ are both continuous on $[a, b]$.
Suppose $f, g, h$ are continuous on $[a, b]$. We must establish that $(f + g) + h = f + (g + h)$. That is, we must establish, for all $x in [a, b]$,
$$((f + g) + h)(x) = (f + (g + h))(x).$$
Suppose $x in [a, b]$. Using the definition of vector addition, as well as the associativity of real numbers, we get
beginalign*
((f + g) + h)(x) &= (f + g)(x) + h(x) &ldots text definition \
&= (f(x) + g(x)) + h(x) &ldots text definition \
&= f(x) + (g(x) + h(x)) &ldots text associativity \
&= f(x) + (g + h)(x) &ldots text definition \
&= (f + (g + h))(x) &ldots text definition
endalign*
This holds for any $x in [a, b]$, so $(f + g) + h = f + (g + h)$.
Finally, to establish the identity $mathbf0$, we must specify what it is. We let $mathbf0$ be the function that maps any $x in [a, b]$ to $0$. This is a constant function, hence it is continuous. We now must prove it is an identity, that is, $mathbf0 + f = f$ for any $f$.
(In a wider sense, in order to establish $mathbf0$ is truly an identity, we would also need to prove $f + mathbf0 = f$, but you'll be proving commutativity later, which will make this redundant.)
Suppose $f$ is continuous on $[a, b]$ and $x in [a, b]$. Then,
$$(mathbf0 + f)(x) = mathbf0(x) + f(x) = 0 + f(x) = f(x).$$
Therefore $mathbf0 + f = mathbf0$.
Now you can establish the rest! You don't necessarily need as much detail as I'm using while writing it out, but you do need to cover all the axioms.
add a comment |Â
up vote
0
down vote
If you have to prove it without knowing anything about function spaces, @Theo Bendit has pointed out what you have to do. However, if you already know that $$mathcalV=f:mathbb Rrightarrowmathbb R$$ is a vector space, it is enough to show that $$mathcalW=f:mathbb Rrightarrowmathbb R~$$ is a subspace of of $mathcalV$.
To prove that:
- Show that the $fequiv 0inmathcalW$
- Let $f,ginmathcalW$ and $ainmathbb R$. Show that this implies $f+acdot ginmathcalW$.
add a comment |Â
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
2
down vote
It is quite laborious, but it's not too difficult. In my experiences, students tend to struggle with this kind of question particularly simply because it's so straightforward, they think they're not doing it properly, and it doesn't feel like they've actually proven anything.
Here, let me get you started. First, I'll address closure of the operations. Then I'll prove associativity of vector addition, then I'll establish the additive identity, and I'll leave you to do the rest.
Suppose $f, g in C[a, b]$ and $lambda in mathbbR$. The definitions of addition and scalar multiplication are respectively,
beginalign
(f + g)(x) &:= f(x) + g(x) &forall x in [a, b] \
(lambda f)(x) &:= lambda f(x) &forall x in [a, b]
endalign
By the algebra of continuous functions, $f + g$ and $lambda f$ are both continuous on $[a, b]$.
Suppose $f, g, h$ are continuous on $[a, b]$. We must establish that $(f + g) + h = f + (g + h)$. That is, we must establish, for all $x in [a, b]$,
$$((f + g) + h)(x) = (f + (g + h))(x).$$
Suppose $x in [a, b]$. Using the definition of vector addition, as well as the associativity of real numbers, we get
beginalign*
((f + g) + h)(x) &= (f + g)(x) + h(x) &ldots text definition \
&= (f(x) + g(x)) + h(x) &ldots text definition \
&= f(x) + (g(x) + h(x)) &ldots text associativity \
&= f(x) + (g + h)(x) &ldots text definition \
&= (f + (g + h))(x) &ldots text definition
endalign*
This holds for any $x in [a, b]$, so $(f + g) + h = f + (g + h)$.
Finally, to establish the identity $mathbf0$, we must specify what it is. We let $mathbf0$ be the function that maps any $x in [a, b]$ to $0$. This is a constant function, hence it is continuous. We now must prove it is an identity, that is, $mathbf0 + f = f$ for any $f$.
(In a wider sense, in order to establish $mathbf0$ is truly an identity, we would also need to prove $f + mathbf0 = f$, but you'll be proving commutativity later, which will make this redundant.)
Suppose $f$ is continuous on $[a, b]$ and $x in [a, b]$. Then,
$$(mathbf0 + f)(x) = mathbf0(x) + f(x) = 0 + f(x) = f(x).$$
Therefore $mathbf0 + f = mathbf0$.
Now you can establish the rest! You don't necessarily need as much detail as I'm using while writing it out, but you do need to cover all the axioms.
add a comment |Â
up vote
2
down vote
It is quite laborious, but it's not too difficult. In my experiences, students tend to struggle with this kind of question particularly simply because it's so straightforward, they think they're not doing it properly, and it doesn't feel like they've actually proven anything.
Here, let me get you started. First, I'll address closure of the operations. Then I'll prove associativity of vector addition, then I'll establish the additive identity, and I'll leave you to do the rest.
Suppose $f, g in C[a, b]$ and $lambda in mathbbR$. The definitions of addition and scalar multiplication are respectively,
beginalign
(f + g)(x) &:= f(x) + g(x) &forall x in [a, b] \
(lambda f)(x) &:= lambda f(x) &forall x in [a, b]
endalign
By the algebra of continuous functions, $f + g$ and $lambda f$ are both continuous on $[a, b]$.
Suppose $f, g, h$ are continuous on $[a, b]$. We must establish that $(f + g) + h = f + (g + h)$. That is, we must establish, for all $x in [a, b]$,
$$((f + g) + h)(x) = (f + (g + h))(x).$$
Suppose $x in [a, b]$. Using the definition of vector addition, as well as the associativity of real numbers, we get
beginalign*
((f + g) + h)(x) &= (f + g)(x) + h(x) &ldots text definition \
&= (f(x) + g(x)) + h(x) &ldots text definition \
&= f(x) + (g(x) + h(x)) &ldots text associativity \
&= f(x) + (g + h)(x) &ldots text definition \
&= (f + (g + h))(x) &ldots text definition
endalign*
This holds for any $x in [a, b]$, so $(f + g) + h = f + (g + h)$.
Finally, to establish the identity $mathbf0$, we must specify what it is. We let $mathbf0$ be the function that maps any $x in [a, b]$ to $0$. This is a constant function, hence it is continuous. We now must prove it is an identity, that is, $mathbf0 + f = f$ for any $f$.
(In a wider sense, in order to establish $mathbf0$ is truly an identity, we would also need to prove $f + mathbf0 = f$, but you'll be proving commutativity later, which will make this redundant.)
Suppose $f$ is continuous on $[a, b]$ and $x in [a, b]$. Then,
$$(mathbf0 + f)(x) = mathbf0(x) + f(x) = 0 + f(x) = f(x).$$
Therefore $mathbf0 + f = mathbf0$.
Now you can establish the rest! You don't necessarily need as much detail as I'm using while writing it out, but you do need to cover all the axioms.
add a comment |Â
up vote
2
down vote
up vote
2
down vote
It is quite laborious, but it's not too difficult. In my experiences, students tend to struggle with this kind of question particularly simply because it's so straightforward, they think they're not doing it properly, and it doesn't feel like they've actually proven anything.
Here, let me get you started. First, I'll address closure of the operations. Then I'll prove associativity of vector addition, then I'll establish the additive identity, and I'll leave you to do the rest.
Suppose $f, g in C[a, b]$ and $lambda in mathbbR$. The definitions of addition and scalar multiplication are respectively,
beginalign
(f + g)(x) &:= f(x) + g(x) &forall x in [a, b] \
(lambda f)(x) &:= lambda f(x) &forall x in [a, b]
endalign
By the algebra of continuous functions, $f + g$ and $lambda f$ are both continuous on $[a, b]$.
Suppose $f, g, h$ are continuous on $[a, b]$. We must establish that $(f + g) + h = f + (g + h)$. That is, we must establish, for all $x in [a, b]$,
$$((f + g) + h)(x) = (f + (g + h))(x).$$
Suppose $x in [a, b]$. Using the definition of vector addition, as well as the associativity of real numbers, we get
beginalign*
((f + g) + h)(x) &= (f + g)(x) + h(x) &ldots text definition \
&= (f(x) + g(x)) + h(x) &ldots text definition \
&= f(x) + (g(x) + h(x)) &ldots text associativity \
&= f(x) + (g + h)(x) &ldots text definition \
&= (f + (g + h))(x) &ldots text definition
endalign*
This holds for any $x in [a, b]$, so $(f + g) + h = f + (g + h)$.
Finally, to establish the identity $mathbf0$, we must specify what it is. We let $mathbf0$ be the function that maps any $x in [a, b]$ to $0$. This is a constant function, hence it is continuous. We now must prove it is an identity, that is, $mathbf0 + f = f$ for any $f$.
(In a wider sense, in order to establish $mathbf0$ is truly an identity, we would also need to prove $f + mathbf0 = f$, but you'll be proving commutativity later, which will make this redundant.)
Suppose $f$ is continuous on $[a, b]$ and $x in [a, b]$. Then,
$$(mathbf0 + f)(x) = mathbf0(x) + f(x) = 0 + f(x) = f(x).$$
Therefore $mathbf0 + f = mathbf0$.
Now you can establish the rest! You don't necessarily need as much detail as I'm using while writing it out, but you do need to cover all the axioms.
It is quite laborious, but it's not too difficult. In my experiences, students tend to struggle with this kind of question particularly simply because it's so straightforward, they think they're not doing it properly, and it doesn't feel like they've actually proven anything.
Here, let me get you started. First, I'll address closure of the operations. Then I'll prove associativity of vector addition, then I'll establish the additive identity, and I'll leave you to do the rest.
Suppose $f, g in C[a, b]$ and $lambda in mathbbR$. The definitions of addition and scalar multiplication are respectively,
beginalign
(f + g)(x) &:= f(x) + g(x) &forall x in [a, b] \
(lambda f)(x) &:= lambda f(x) &forall x in [a, b]
endalign
By the algebra of continuous functions, $f + g$ and $lambda f$ are both continuous on $[a, b]$.
Suppose $f, g, h$ are continuous on $[a, b]$. We must establish that $(f + g) + h = f + (g + h)$. That is, we must establish, for all $x in [a, b]$,
$$((f + g) + h)(x) = (f + (g + h))(x).$$
Suppose $x in [a, b]$. Using the definition of vector addition, as well as the associativity of real numbers, we get
beginalign*
((f + g) + h)(x) &= (f + g)(x) + h(x) &ldots text definition \
&= (f(x) + g(x)) + h(x) &ldots text definition \
&= f(x) + (g(x) + h(x)) &ldots text associativity \
&= f(x) + (g + h)(x) &ldots text definition \
&= (f + (g + h))(x) &ldots text definition
endalign*
This holds for any $x in [a, b]$, so $(f + g) + h = f + (g + h)$.
Finally, to establish the identity $mathbf0$, we must specify what it is. We let $mathbf0$ be the function that maps any $x in [a, b]$ to $0$. This is a constant function, hence it is continuous. We now must prove it is an identity, that is, $mathbf0 + f = f$ for any $f$.
(In a wider sense, in order to establish $mathbf0$ is truly an identity, we would also need to prove $f + mathbf0 = f$, but you'll be proving commutativity later, which will make this redundant.)
Suppose $f$ is continuous on $[a, b]$ and $x in [a, b]$. Then,
$$(mathbf0 + f)(x) = mathbf0(x) + f(x) = 0 + f(x) = f(x).$$
Therefore $mathbf0 + f = mathbf0$.
Now you can establish the rest! You don't necessarily need as much detail as I'm using while writing it out, but you do need to cover all the axioms.
answered Jul 25 '15 at 7:23
Theo Bendit
12.2k1844
12.2k1844
add a comment |Â
add a comment |Â
up vote
0
down vote
If you have to prove it without knowing anything about function spaces, @Theo Bendit has pointed out what you have to do. However, if you already know that $$mathcalV=f:mathbb Rrightarrowmathbb R$$ is a vector space, it is enough to show that $$mathcalW=f:mathbb Rrightarrowmathbb R~$$ is a subspace of of $mathcalV$.
To prove that:
- Show that the $fequiv 0inmathcalW$
- Let $f,ginmathcalW$ and $ainmathbb R$. Show that this implies $f+acdot ginmathcalW$.
add a comment |Â
up vote
0
down vote
If you have to prove it without knowing anything about function spaces, @Theo Bendit has pointed out what you have to do. However, if you already know that $$mathcalV=f:mathbb Rrightarrowmathbb R$$ is a vector space, it is enough to show that $$mathcalW=f:mathbb Rrightarrowmathbb R~$$ is a subspace of of $mathcalV$.
To prove that:
- Show that the $fequiv 0inmathcalW$
- Let $f,ginmathcalW$ and $ainmathbb R$. Show that this implies $f+acdot ginmathcalW$.
add a comment |Â
up vote
0
down vote
up vote
0
down vote
If you have to prove it without knowing anything about function spaces, @Theo Bendit has pointed out what you have to do. However, if you already know that $$mathcalV=f:mathbb Rrightarrowmathbb R$$ is a vector space, it is enough to show that $$mathcalW=f:mathbb Rrightarrowmathbb R~$$ is a subspace of of $mathcalV$.
To prove that:
- Show that the $fequiv 0inmathcalW$
- Let $f,ginmathcalW$ and $ainmathbb R$. Show that this implies $f+acdot ginmathcalW$.
If you have to prove it without knowing anything about function spaces, @Theo Bendit has pointed out what you have to do. However, if you already know that $$mathcalV=f:mathbb Rrightarrowmathbb R$$ is a vector space, it is enough to show that $$mathcalW=f:mathbb Rrightarrowmathbb R~$$ is a subspace of of $mathcalV$.
To prove that:
- Show that the $fequiv 0inmathcalW$
- Let $f,ginmathcalW$ and $ainmathbb R$. Show that this implies $f+acdot ginmathcalW$.
answered Jul 25 '15 at 8:14
Hirshy
4,31721336
4,31721336
add a comment |Â
add a comment |Â
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
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f1373215%2freal-valued-continuous-functions-on-a-b-form-a-vector-space-with-respect-to-us%23new-answer', 'question_page');
);
Post as a guest
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
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
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
This is wrong there is for example not always a zero element
â john
Jul 25 '15 at 5:47
You shold just to check axioms of vector space. Why you stucked?
â Michael Galuza
Jul 25 '15 at 5:47
@john, $f(x)equiv 0$ is not a zero element?
â Michael Galuza
Jul 25 '15 at 5:47