Proving a linear map to be injective and/or surjective
$begingroup$
So the linear map I'm talking about is defined as follows:
$l_1: P_1(mathbb{R}) rightarrow mathbb{R}^2, l_1(p):= begin{pmatrix}int_{0}^{1} p(x) dx\2p(1) end{pmatrix}$
My approach is this:
For injectivity:
Let $p,q in P_1(mathbb{R}),, p(x):= ax+b ; ,, q(x) = cx+d$
Now assume that $l_1(p) = l_1(q)$
Show that this possible if and only if $p = q Rightarrow a=c land b=d$
$l_1(p) = begin{pmatrix}frac{a}{2}+b\2a+2b end{pmatrix}$
$l_1(q) = begin{pmatrix}frac{c}{2}+d\2c+2d end{pmatrix}$
Because of my assumption from the beginning I can now write:
$begin{pmatrix}frac{a}{2}+b\2a+2b end{pmatrix} = begin{pmatrix}frac{c}{2}+d\2c+2d end{pmatrix} $
Two vectors are equal if their components in the same row are equal i.e.:
$frac{a}{2}+b = frac{c}{2}+d$ and $2a+2b = 2c+2d$
But now I'm struggling how to show that this means that a = c and b = d and therefore p = q or the opposite that $p neq q$
Note:
$P_1(mathbb{R})$ denotes the set of all polynomials with degree 1 which take reals as inputs.
linear-algebra proof-writing linear-transformations
$endgroup$
add a comment |
$begingroup$
So the linear map I'm talking about is defined as follows:
$l_1: P_1(mathbb{R}) rightarrow mathbb{R}^2, l_1(p):= begin{pmatrix}int_{0}^{1} p(x) dx\2p(1) end{pmatrix}$
My approach is this:
For injectivity:
Let $p,q in P_1(mathbb{R}),, p(x):= ax+b ; ,, q(x) = cx+d$
Now assume that $l_1(p) = l_1(q)$
Show that this possible if and only if $p = q Rightarrow a=c land b=d$
$l_1(p) = begin{pmatrix}frac{a}{2}+b\2a+2b end{pmatrix}$
$l_1(q) = begin{pmatrix}frac{c}{2}+d\2c+2d end{pmatrix}$
Because of my assumption from the beginning I can now write:
$begin{pmatrix}frac{a}{2}+b\2a+2b end{pmatrix} = begin{pmatrix}frac{c}{2}+d\2c+2d end{pmatrix} $
Two vectors are equal if their components in the same row are equal i.e.:
$frac{a}{2}+b = frac{c}{2}+d$ and $2a+2b = 2c+2d$
But now I'm struggling how to show that this means that a = c and b = d and therefore p = q or the opposite that $p neq q$
Note:
$P_1(mathbb{R})$ denotes the set of all polynomials with degree 1 which take reals as inputs.
linear-algebra proof-writing linear-transformations
$endgroup$
add a comment |
$begingroup$
So the linear map I'm talking about is defined as follows:
$l_1: P_1(mathbb{R}) rightarrow mathbb{R}^2, l_1(p):= begin{pmatrix}int_{0}^{1} p(x) dx\2p(1) end{pmatrix}$
My approach is this:
For injectivity:
Let $p,q in P_1(mathbb{R}),, p(x):= ax+b ; ,, q(x) = cx+d$
Now assume that $l_1(p) = l_1(q)$
Show that this possible if and only if $p = q Rightarrow a=c land b=d$
$l_1(p) = begin{pmatrix}frac{a}{2}+b\2a+2b end{pmatrix}$
$l_1(q) = begin{pmatrix}frac{c}{2}+d\2c+2d end{pmatrix}$
Because of my assumption from the beginning I can now write:
$begin{pmatrix}frac{a}{2}+b\2a+2b end{pmatrix} = begin{pmatrix}frac{c}{2}+d\2c+2d end{pmatrix} $
Two vectors are equal if their components in the same row are equal i.e.:
$frac{a}{2}+b = frac{c}{2}+d$ and $2a+2b = 2c+2d$
But now I'm struggling how to show that this means that a = c and b = d and therefore p = q or the opposite that $p neq q$
Note:
$P_1(mathbb{R})$ denotes the set of all polynomials with degree 1 which take reals as inputs.
linear-algebra proof-writing linear-transformations
$endgroup$
So the linear map I'm talking about is defined as follows:
$l_1: P_1(mathbb{R}) rightarrow mathbb{R}^2, l_1(p):= begin{pmatrix}int_{0}^{1} p(x) dx\2p(1) end{pmatrix}$
My approach is this:
For injectivity:
Let $p,q in P_1(mathbb{R}),, p(x):= ax+b ; ,, q(x) = cx+d$
Now assume that $l_1(p) = l_1(q)$
Show that this possible if and only if $p = q Rightarrow a=c land b=d$
$l_1(p) = begin{pmatrix}frac{a}{2}+b\2a+2b end{pmatrix}$
$l_1(q) = begin{pmatrix}frac{c}{2}+d\2c+2d end{pmatrix}$
Because of my assumption from the beginning I can now write:
$begin{pmatrix}frac{a}{2}+b\2a+2b end{pmatrix} = begin{pmatrix}frac{c}{2}+d\2c+2d end{pmatrix} $
Two vectors are equal if their components in the same row are equal i.e.:
$frac{a}{2}+b = frac{c}{2}+d$ and $2a+2b = 2c+2d$
But now I'm struggling how to show that this means that a = c and b = d and therefore p = q or the opposite that $p neq q$
Note:
$P_1(mathbb{R})$ denotes the set of all polynomials with degree 1 which take reals as inputs.
linear-algebra proof-writing linear-transformations
linear-algebra proof-writing linear-transformations
asked Jan 22 at 15:23
Fo Young Areal LoFo Young Areal Lo
345
345
add a comment |
add a comment |
3 Answers
3
active
oldest
votes
$begingroup$
You second equation implies $a+b = c+d$, which is equivalent to $frac{a}{2}+b+frac{a}{2} = frac{c}{2}+d+frac{c}{2}$. By the first equation, this gets you $a = c$ and hence also $b = d$.
By the way, since you have a linear map, it actually suffices to check that only $0$ is mapped to $0$, which would make the computation a little easier.
$endgroup$
add a comment |
$begingroup$
The spaces have the same dimension, so you just need to prove one of the properties and the other will follow.
For injectivity you need, given $p(x)=ax+b$ with $l_1(p)=0$,
$$
int_0^1(ax+b),dx=frac{a}{2}+b=0qquad 2p(1)=2a+2b=0
$$
This easily implies $a=b=0$. Thus the kernel of $l_1$ is ${0}$ and you're done.
It's not difficult to prove surjectivity as well: given $begin{pmatrix} s \ t end{pmatrix}$ you need to find $a$ and $b$ such that
$$
begin{pmatrix} a/2+b \ 2a+2b end{pmatrix}=begin{pmatrix} s \ t end{pmatrix}
$$
and this is a linear system.
More abstract method: find the matrix of $l_1$ with respect to the basis ${1,x}$ and the standard basis on $mathbb{R}^2$. Since
$$
l_1(1)=begin{pmatrix} 1 \ 2 end{pmatrix}
qquadtext{and}qquad
l_1(x)=begin{pmatrix} 1/2 \ 2 end{pmatrix}
$$
the matrix is
$$
begin{pmatrix}
1 & 1/2 \
2 & 2
end{pmatrix}
$$
which has rank $2$.
$endgroup$
add a comment |
$begingroup$
You have 2 equations (Note: I didn't check if your previous calculations were right)
$$
begin{cases}
frac{a}{2} + b = frac{c}{2} + d\
2a+2b = 2c + 2d
end{cases}$$
Now, multiply the first equation by $2$, and divide the second one by $2$
$$
begin{cases}
a + 2b = c + 2d\
a+b = c + d \
end{cases}$$
Substract second equation from the first one
$$
begin{cases}
b = d\
a+b = c + d \
end{cases}$$
Substract again:
$$
begin{cases}
b = d \
a = c
end{cases}$$
And you're done
$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%2f3083294%2fproving-a-linear-map-to-be-injective-and-or-surjective%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
3 Answers
3
active
oldest
votes
3 Answers
3
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
You second equation implies $a+b = c+d$, which is equivalent to $frac{a}{2}+b+frac{a}{2} = frac{c}{2}+d+frac{c}{2}$. By the first equation, this gets you $a = c$ and hence also $b = d$.
By the way, since you have a linear map, it actually suffices to check that only $0$ is mapped to $0$, which would make the computation a little easier.
$endgroup$
add a comment |
$begingroup$
You second equation implies $a+b = c+d$, which is equivalent to $frac{a}{2}+b+frac{a}{2} = frac{c}{2}+d+frac{c}{2}$. By the first equation, this gets you $a = c$ and hence also $b = d$.
By the way, since you have a linear map, it actually suffices to check that only $0$ is mapped to $0$, which would make the computation a little easier.
$endgroup$
add a comment |
$begingroup$
You second equation implies $a+b = c+d$, which is equivalent to $frac{a}{2}+b+frac{a}{2} = frac{c}{2}+d+frac{c}{2}$. By the first equation, this gets you $a = c$ and hence also $b = d$.
By the way, since you have a linear map, it actually suffices to check that only $0$ is mapped to $0$, which would make the computation a little easier.
$endgroup$
You second equation implies $a+b = c+d$, which is equivalent to $frac{a}{2}+b+frac{a}{2} = frac{c}{2}+d+frac{c}{2}$. By the first equation, this gets you $a = c$ and hence also $b = d$.
By the way, since you have a linear map, it actually suffices to check that only $0$ is mapped to $0$, which would make the computation a little easier.
answered Jan 22 at 15:31
KlausKlaus
2,00911
2,00911
add a comment |
add a comment |
$begingroup$
The spaces have the same dimension, so you just need to prove one of the properties and the other will follow.
For injectivity you need, given $p(x)=ax+b$ with $l_1(p)=0$,
$$
int_0^1(ax+b),dx=frac{a}{2}+b=0qquad 2p(1)=2a+2b=0
$$
This easily implies $a=b=0$. Thus the kernel of $l_1$ is ${0}$ and you're done.
It's not difficult to prove surjectivity as well: given $begin{pmatrix} s \ t end{pmatrix}$ you need to find $a$ and $b$ such that
$$
begin{pmatrix} a/2+b \ 2a+2b end{pmatrix}=begin{pmatrix} s \ t end{pmatrix}
$$
and this is a linear system.
More abstract method: find the matrix of $l_1$ with respect to the basis ${1,x}$ and the standard basis on $mathbb{R}^2$. Since
$$
l_1(1)=begin{pmatrix} 1 \ 2 end{pmatrix}
qquadtext{and}qquad
l_1(x)=begin{pmatrix} 1/2 \ 2 end{pmatrix}
$$
the matrix is
$$
begin{pmatrix}
1 & 1/2 \
2 & 2
end{pmatrix}
$$
which has rank $2$.
$endgroup$
add a comment |
$begingroup$
The spaces have the same dimension, so you just need to prove one of the properties and the other will follow.
For injectivity you need, given $p(x)=ax+b$ with $l_1(p)=0$,
$$
int_0^1(ax+b),dx=frac{a}{2}+b=0qquad 2p(1)=2a+2b=0
$$
This easily implies $a=b=0$. Thus the kernel of $l_1$ is ${0}$ and you're done.
It's not difficult to prove surjectivity as well: given $begin{pmatrix} s \ t end{pmatrix}$ you need to find $a$ and $b$ such that
$$
begin{pmatrix} a/2+b \ 2a+2b end{pmatrix}=begin{pmatrix} s \ t end{pmatrix}
$$
and this is a linear system.
More abstract method: find the matrix of $l_1$ with respect to the basis ${1,x}$ and the standard basis on $mathbb{R}^2$. Since
$$
l_1(1)=begin{pmatrix} 1 \ 2 end{pmatrix}
qquadtext{and}qquad
l_1(x)=begin{pmatrix} 1/2 \ 2 end{pmatrix}
$$
the matrix is
$$
begin{pmatrix}
1 & 1/2 \
2 & 2
end{pmatrix}
$$
which has rank $2$.
$endgroup$
add a comment |
$begingroup$
The spaces have the same dimension, so you just need to prove one of the properties and the other will follow.
For injectivity you need, given $p(x)=ax+b$ with $l_1(p)=0$,
$$
int_0^1(ax+b),dx=frac{a}{2}+b=0qquad 2p(1)=2a+2b=0
$$
This easily implies $a=b=0$. Thus the kernel of $l_1$ is ${0}$ and you're done.
It's not difficult to prove surjectivity as well: given $begin{pmatrix} s \ t end{pmatrix}$ you need to find $a$ and $b$ such that
$$
begin{pmatrix} a/2+b \ 2a+2b end{pmatrix}=begin{pmatrix} s \ t end{pmatrix}
$$
and this is a linear system.
More abstract method: find the matrix of $l_1$ with respect to the basis ${1,x}$ and the standard basis on $mathbb{R}^2$. Since
$$
l_1(1)=begin{pmatrix} 1 \ 2 end{pmatrix}
qquadtext{and}qquad
l_1(x)=begin{pmatrix} 1/2 \ 2 end{pmatrix}
$$
the matrix is
$$
begin{pmatrix}
1 & 1/2 \
2 & 2
end{pmatrix}
$$
which has rank $2$.
$endgroup$
The spaces have the same dimension, so you just need to prove one of the properties and the other will follow.
For injectivity you need, given $p(x)=ax+b$ with $l_1(p)=0$,
$$
int_0^1(ax+b),dx=frac{a}{2}+b=0qquad 2p(1)=2a+2b=0
$$
This easily implies $a=b=0$. Thus the kernel of $l_1$ is ${0}$ and you're done.
It's not difficult to prove surjectivity as well: given $begin{pmatrix} s \ t end{pmatrix}$ you need to find $a$ and $b$ such that
$$
begin{pmatrix} a/2+b \ 2a+2b end{pmatrix}=begin{pmatrix} s \ t end{pmatrix}
$$
and this is a linear system.
More abstract method: find the matrix of $l_1$ with respect to the basis ${1,x}$ and the standard basis on $mathbb{R}^2$. Since
$$
l_1(1)=begin{pmatrix} 1 \ 2 end{pmatrix}
qquadtext{and}qquad
l_1(x)=begin{pmatrix} 1/2 \ 2 end{pmatrix}
$$
the matrix is
$$
begin{pmatrix}
1 & 1/2 \
2 & 2
end{pmatrix}
$$
which has rank $2$.
answered Jan 22 at 15:34
egregegreg
183k1486205
183k1486205
add a comment |
add a comment |
$begingroup$
You have 2 equations (Note: I didn't check if your previous calculations were right)
$$
begin{cases}
frac{a}{2} + b = frac{c}{2} + d\
2a+2b = 2c + 2d
end{cases}$$
Now, multiply the first equation by $2$, and divide the second one by $2$
$$
begin{cases}
a + 2b = c + 2d\
a+b = c + d \
end{cases}$$
Substract second equation from the first one
$$
begin{cases}
b = d\
a+b = c + d \
end{cases}$$
Substract again:
$$
begin{cases}
b = d \
a = c
end{cases}$$
And you're done
$endgroup$
add a comment |
$begingroup$
You have 2 equations (Note: I didn't check if your previous calculations were right)
$$
begin{cases}
frac{a}{2} + b = frac{c}{2} + d\
2a+2b = 2c + 2d
end{cases}$$
Now, multiply the first equation by $2$, and divide the second one by $2$
$$
begin{cases}
a + 2b = c + 2d\
a+b = c + d \
end{cases}$$
Substract second equation from the first one
$$
begin{cases}
b = d\
a+b = c + d \
end{cases}$$
Substract again:
$$
begin{cases}
b = d \
a = c
end{cases}$$
And you're done
$endgroup$
add a comment |
$begingroup$
You have 2 equations (Note: I didn't check if your previous calculations were right)
$$
begin{cases}
frac{a}{2} + b = frac{c}{2} + d\
2a+2b = 2c + 2d
end{cases}$$
Now, multiply the first equation by $2$, and divide the second one by $2$
$$
begin{cases}
a + 2b = c + 2d\
a+b = c + d \
end{cases}$$
Substract second equation from the first one
$$
begin{cases}
b = d\
a+b = c + d \
end{cases}$$
Substract again:
$$
begin{cases}
b = d \
a = c
end{cases}$$
And you're done
$endgroup$
You have 2 equations (Note: I didn't check if your previous calculations were right)
$$
begin{cases}
frac{a}{2} + b = frac{c}{2} + d\
2a+2b = 2c + 2d
end{cases}$$
Now, multiply the first equation by $2$, and divide the second one by $2$
$$
begin{cases}
a + 2b = c + 2d\
a+b = c + d \
end{cases}$$
Substract second equation from the first one
$$
begin{cases}
b = d\
a+b = c + d \
end{cases}$$
Substract again:
$$
begin{cases}
b = d \
a = c
end{cases}$$
And you're done
answered Jan 22 at 15:33
F.CaretteF.Carette
1,21612
1,21612
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%2f3083294%2fproving-a-linear-map-to-be-injective-and-or-surjective%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