Basic question about proving uniqueness The Next CEO of Stack OverflowProving every positive...
Compensation for working overtime on Saturdays
How should I connect my cat5 cable to connectors having an orange-green line?
Could a dragon use hot air to help it take off?
Could a dragon use its wings to swim?
Can I hook these wires up to find the connection to a dead outlet?
Why can't we say "I have been having a dog"?
Is the 21st century's idea of "freedom of speech" based on precedent?
How does a dynamic QR code work?
Car headlights in a world without electricity
Are British MPs missing the point, with these 'Indicative Votes'?
Ising model simulation
My ex-girlfriend uses my Apple ID to login to her iPad, do I have to give her my Apple ID password to reset it?
Is the offspring between a demon and a celestial possible? If so what is it called and is it in a book somewhere?
Is it correct to say moon starry nights?
Is a distribution that is normal, but highly skewed, considered Gaussian?
Why did early computer designers eschew integers?
What happens if you break a law in another country outside of that country?
Shortening a title without changing its meaning
Can this transistor (2N2222) take 6 V on emitter-base? Am I reading the datasheet incorrectly?
Which acid/base does a strong base/acid react when added to a buffer solution?
What is the difference between 서고 and 도서관?
Creating a script with console commands
Find a path from s to t using as few red nodes as possible
Early programmable calculators with RS-232
Basic question about proving uniqueness
The Next CEO of Stack OverflowProving every positive natural number has unique predecessorProving there is a unique binary operation we call multiplicationUniqueness of modular multiplicative inversechange of order in a double seriesShowing that the open ball is homeomorphic to $mathbb{R}^n$Question about required rigour with intro real analysis textUniqueness of a Limit epsilon divided by 2?Fundamental Existence-Uniqueness Theorem of Nonautonomous SystemsProving non-differentiability in a basic senseAnother question about proving Lebesgue Decompositionquestion about limitAmbiguity in Question!Proof of uniqueness of positive cubes
$begingroup$
I just started real analysis. I don't have a background in proofs or logic, simply calculus. So I'm trying to learn more about proofs--so forgive the basic question, please.
How do you go about proving this theorem: If $a$ and $b$ are any numbers, then there is one and only one number $x$ such that $a + x=b$. This number is given by $x=b+(-a)$.
First part of the proof I understand--it's simple. We simply use some axioms and do the following:
$a+b-a=b$, which of course is true. This is just true from plugging in the $b+(-a)$ for $x$.
But how about the uniqueness issue? In my text, it says:
$$(a+x)+(-a)=b+(-a)
x=b+(-a)$$
How does this prove uniqueness? Is this equation essentially saying that the ONLY possible value of $x$ is expressed by $b+(-a)$?
How would I have known to set this up as part of the proof if I was asked to prove something is unique?
Sorry for the basic question--have to start somewhere.
real-analysis
$endgroup$
add a comment |
$begingroup$
I just started real analysis. I don't have a background in proofs or logic, simply calculus. So I'm trying to learn more about proofs--so forgive the basic question, please.
How do you go about proving this theorem: If $a$ and $b$ are any numbers, then there is one and only one number $x$ such that $a + x=b$. This number is given by $x=b+(-a)$.
First part of the proof I understand--it's simple. We simply use some axioms and do the following:
$a+b-a=b$, which of course is true. This is just true from plugging in the $b+(-a)$ for $x$.
But how about the uniqueness issue? In my text, it says:
$$(a+x)+(-a)=b+(-a)
x=b+(-a)$$
How does this prove uniqueness? Is this equation essentially saying that the ONLY possible value of $x$ is expressed by $b+(-a)$?
How would I have known to set this up as part of the proof if I was asked to prove something is unique?
Sorry for the basic question--have to start somewhere.
real-analysis
$endgroup$
$begingroup$
Yes, it is essentially saying that the only possible value is b+(-a).
$endgroup$
– Aryabhata
Dec 23 '10 at 23:04
$begingroup$
Relevant SMBC comic (I think)
$endgroup$
– Nick T
Jan 5 '14 at 19:21
add a comment |
$begingroup$
I just started real analysis. I don't have a background in proofs or logic, simply calculus. So I'm trying to learn more about proofs--so forgive the basic question, please.
How do you go about proving this theorem: If $a$ and $b$ are any numbers, then there is one and only one number $x$ such that $a + x=b$. This number is given by $x=b+(-a)$.
First part of the proof I understand--it's simple. We simply use some axioms and do the following:
$a+b-a=b$, which of course is true. This is just true from plugging in the $b+(-a)$ for $x$.
But how about the uniqueness issue? In my text, it says:
$$(a+x)+(-a)=b+(-a)
x=b+(-a)$$
How does this prove uniqueness? Is this equation essentially saying that the ONLY possible value of $x$ is expressed by $b+(-a)$?
How would I have known to set this up as part of the proof if I was asked to prove something is unique?
Sorry for the basic question--have to start somewhere.
real-analysis
$endgroup$
I just started real analysis. I don't have a background in proofs or logic, simply calculus. So I'm trying to learn more about proofs--so forgive the basic question, please.
How do you go about proving this theorem: If $a$ and $b$ are any numbers, then there is one and only one number $x$ such that $a + x=b$. This number is given by $x=b+(-a)$.
First part of the proof I understand--it's simple. We simply use some axioms and do the following:
$a+b-a=b$, which of course is true. This is just true from plugging in the $b+(-a)$ for $x$.
But how about the uniqueness issue? In my text, it says:
$$(a+x)+(-a)=b+(-a)
x=b+(-a)$$
How does this prove uniqueness? Is this equation essentially saying that the ONLY possible value of $x$ is expressed by $b+(-a)$?
How would I have known to set this up as part of the proof if I was asked to prove something is unique?
Sorry for the basic question--have to start somewhere.
real-analysis
real-analysis
edited Mar 9 '17 at 19:41
user409521
asked Dec 23 '10 at 22:54
rstecklyrsteckly
12314
12314
$begingroup$
Yes, it is essentially saying that the only possible value is b+(-a).
$endgroup$
– Aryabhata
Dec 23 '10 at 23:04
$begingroup$
Relevant SMBC comic (I think)
$endgroup$
– Nick T
Jan 5 '14 at 19:21
add a comment |
$begingroup$
Yes, it is essentially saying that the only possible value is b+(-a).
$endgroup$
– Aryabhata
Dec 23 '10 at 23:04
$begingroup$
Relevant SMBC comic (I think)
$endgroup$
– Nick T
Jan 5 '14 at 19:21
$begingroup$
Yes, it is essentially saying that the only possible value is b+(-a).
$endgroup$
– Aryabhata
Dec 23 '10 at 23:04
$begingroup$
Yes, it is essentially saying that the only possible value is b+(-a).
$endgroup$
– Aryabhata
Dec 23 '10 at 23:04
$begingroup$
Relevant SMBC comic (I think)
$endgroup$
– Nick T
Jan 5 '14 at 19:21
$begingroup$
Relevant SMBC comic (I think)
$endgroup$
– Nick T
Jan 5 '14 at 19:21
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
Usually when you want to prove something is unique you start by assuming there are two things that satisfy the given property, and then you show that they are the same. In this case, if you want to prove that there is exactly one $x$ such that $a + x = b$, you could start by assuming there are two numbers, say $x$ and $y$ that satisfy the identity, that is
$$a + x = b quad text{and} quad a + y = b$$
but then this implies that $a + x = a + y$ since both are equal to $b$. Now you can add $-a$ to both sides of the equation to get
$$-a + (a + x) = -a + (a + y) implies (-a + a) + x = (-a + a) + y $$
$$implies 0 + x = 0 + y implies x = y$$
This takes care of the uniqueness of the number and since you already know one such $x$ then you're done. I suppose you're doing this in the real number field and that you know which axioms take place in the argument. Hope this helps a little.
$endgroup$
$begingroup$
So proof by contradiction? But what about the given argument, is it really air tight?
$endgroup$
– rsteckly
Dec 23 '10 at 23:13
1
$begingroup$
Yes, it is correct. What I did is to assume two numbers $x, y$ satisfy the identity and proved that $x = y$. What your text does is to show what $x$ should be, so it is another way of proving uniqueness.
$endgroup$
– Adrián Barquero
Dec 23 '10 at 23:16
$begingroup$
án: But it's redundant to give such a uniqueness proof - see my answer.
$endgroup$
– Bill Dubuque
Dec 24 '10 at 19:57
$begingroup$
@Bill Yes, you're right. I just wanted to give a different argument than the one the OP already had. I suppose I wanted to show a possible way to attack problems in which one has to prove uniqueness and there's no explicit form for the object that will show uniqueness immediately, since the OP asked for such a method. For instance when proving uniqueness of the inverse element in an arbitrary group.
$endgroup$
– Adrián Barquero
Dec 24 '10 at 20:39
$begingroup$
án: But it's still redundant even for inverses in an arbitrary group - that's merely the special case $b = 0$ above. Perhaps you meant in an arbitrary semigroup, i.e. where an inverse operation need not exist.
$endgroup$
– Bill Dubuque
Dec 24 '10 at 21:16
add a comment |
$begingroup$
Simply use the (additive group) axioms to prove $rm a + x = b Rightarrow x = b + (-a):. $ That yields both existence and uniqueness. That the uniqueness doesn't require further proof is a subtlety that sometimes confuses students. This is discussed at length in my posts in Uniqueness of solution of x+a=b from field, sci.math, May 5, 2003 regarding a slick proof in Max Rosenlicht's Introduction to Analysis.
$endgroup$
add a comment |
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%2f15388%2fbasic-question-about-proving-uniqueness%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$
Usually when you want to prove something is unique you start by assuming there are two things that satisfy the given property, and then you show that they are the same. In this case, if you want to prove that there is exactly one $x$ such that $a + x = b$, you could start by assuming there are two numbers, say $x$ and $y$ that satisfy the identity, that is
$$a + x = b quad text{and} quad a + y = b$$
but then this implies that $a + x = a + y$ since both are equal to $b$. Now you can add $-a$ to both sides of the equation to get
$$-a + (a + x) = -a + (a + y) implies (-a + a) + x = (-a + a) + y $$
$$implies 0 + x = 0 + y implies x = y$$
This takes care of the uniqueness of the number and since you already know one such $x$ then you're done. I suppose you're doing this in the real number field and that you know which axioms take place in the argument. Hope this helps a little.
$endgroup$
$begingroup$
So proof by contradiction? But what about the given argument, is it really air tight?
$endgroup$
– rsteckly
Dec 23 '10 at 23:13
1
$begingroup$
Yes, it is correct. What I did is to assume two numbers $x, y$ satisfy the identity and proved that $x = y$. What your text does is to show what $x$ should be, so it is another way of proving uniqueness.
$endgroup$
– Adrián Barquero
Dec 23 '10 at 23:16
$begingroup$
án: But it's redundant to give such a uniqueness proof - see my answer.
$endgroup$
– Bill Dubuque
Dec 24 '10 at 19:57
$begingroup$
@Bill Yes, you're right. I just wanted to give a different argument than the one the OP already had. I suppose I wanted to show a possible way to attack problems in which one has to prove uniqueness and there's no explicit form for the object that will show uniqueness immediately, since the OP asked for such a method. For instance when proving uniqueness of the inverse element in an arbitrary group.
$endgroup$
– Adrián Barquero
Dec 24 '10 at 20:39
$begingroup$
án: But it's still redundant even for inverses in an arbitrary group - that's merely the special case $b = 0$ above. Perhaps you meant in an arbitrary semigroup, i.e. where an inverse operation need not exist.
$endgroup$
– Bill Dubuque
Dec 24 '10 at 21:16
add a comment |
$begingroup$
Usually when you want to prove something is unique you start by assuming there are two things that satisfy the given property, and then you show that they are the same. In this case, if you want to prove that there is exactly one $x$ such that $a + x = b$, you could start by assuming there are two numbers, say $x$ and $y$ that satisfy the identity, that is
$$a + x = b quad text{and} quad a + y = b$$
but then this implies that $a + x = a + y$ since both are equal to $b$. Now you can add $-a$ to both sides of the equation to get
$$-a + (a + x) = -a + (a + y) implies (-a + a) + x = (-a + a) + y $$
$$implies 0 + x = 0 + y implies x = y$$
This takes care of the uniqueness of the number and since you already know one such $x$ then you're done. I suppose you're doing this in the real number field and that you know which axioms take place in the argument. Hope this helps a little.
$endgroup$
$begingroup$
So proof by contradiction? But what about the given argument, is it really air tight?
$endgroup$
– rsteckly
Dec 23 '10 at 23:13
1
$begingroup$
Yes, it is correct. What I did is to assume two numbers $x, y$ satisfy the identity and proved that $x = y$. What your text does is to show what $x$ should be, so it is another way of proving uniqueness.
$endgroup$
– Adrián Barquero
Dec 23 '10 at 23:16
$begingroup$
án: But it's redundant to give such a uniqueness proof - see my answer.
$endgroup$
– Bill Dubuque
Dec 24 '10 at 19:57
$begingroup$
@Bill Yes, you're right. I just wanted to give a different argument than the one the OP already had. I suppose I wanted to show a possible way to attack problems in which one has to prove uniqueness and there's no explicit form for the object that will show uniqueness immediately, since the OP asked for such a method. For instance when proving uniqueness of the inverse element in an arbitrary group.
$endgroup$
– Adrián Barquero
Dec 24 '10 at 20:39
$begingroup$
án: But it's still redundant even for inverses in an arbitrary group - that's merely the special case $b = 0$ above. Perhaps you meant in an arbitrary semigroup, i.e. where an inverse operation need not exist.
$endgroup$
– Bill Dubuque
Dec 24 '10 at 21:16
add a comment |
$begingroup$
Usually when you want to prove something is unique you start by assuming there are two things that satisfy the given property, and then you show that they are the same. In this case, if you want to prove that there is exactly one $x$ such that $a + x = b$, you could start by assuming there are two numbers, say $x$ and $y$ that satisfy the identity, that is
$$a + x = b quad text{and} quad a + y = b$$
but then this implies that $a + x = a + y$ since both are equal to $b$. Now you can add $-a$ to both sides of the equation to get
$$-a + (a + x) = -a + (a + y) implies (-a + a) + x = (-a + a) + y $$
$$implies 0 + x = 0 + y implies x = y$$
This takes care of the uniqueness of the number and since you already know one such $x$ then you're done. I suppose you're doing this in the real number field and that you know which axioms take place in the argument. Hope this helps a little.
$endgroup$
Usually when you want to prove something is unique you start by assuming there are two things that satisfy the given property, and then you show that they are the same. In this case, if you want to prove that there is exactly one $x$ such that $a + x = b$, you could start by assuming there are two numbers, say $x$ and $y$ that satisfy the identity, that is
$$a + x = b quad text{and} quad a + y = b$$
but then this implies that $a + x = a + y$ since both are equal to $b$. Now you can add $-a$ to both sides of the equation to get
$$-a + (a + x) = -a + (a + y) implies (-a + a) + x = (-a + a) + y $$
$$implies 0 + x = 0 + y implies x = y$$
This takes care of the uniqueness of the number and since you already know one such $x$ then you're done. I suppose you're doing this in the real number field and that you know which axioms take place in the argument. Hope this helps a little.
answered Dec 23 '10 at 23:10
Adrián BarqueroAdrián Barquero
10.8k23982
10.8k23982
$begingroup$
So proof by contradiction? But what about the given argument, is it really air tight?
$endgroup$
– rsteckly
Dec 23 '10 at 23:13
1
$begingroup$
Yes, it is correct. What I did is to assume two numbers $x, y$ satisfy the identity and proved that $x = y$. What your text does is to show what $x$ should be, so it is another way of proving uniqueness.
$endgroup$
– Adrián Barquero
Dec 23 '10 at 23:16
$begingroup$
án: But it's redundant to give such a uniqueness proof - see my answer.
$endgroup$
– Bill Dubuque
Dec 24 '10 at 19:57
$begingroup$
@Bill Yes, you're right. I just wanted to give a different argument than the one the OP already had. I suppose I wanted to show a possible way to attack problems in which one has to prove uniqueness and there's no explicit form for the object that will show uniqueness immediately, since the OP asked for such a method. For instance when proving uniqueness of the inverse element in an arbitrary group.
$endgroup$
– Adrián Barquero
Dec 24 '10 at 20:39
$begingroup$
án: But it's still redundant even for inverses in an arbitrary group - that's merely the special case $b = 0$ above. Perhaps you meant in an arbitrary semigroup, i.e. where an inverse operation need not exist.
$endgroup$
– Bill Dubuque
Dec 24 '10 at 21:16
add a comment |
$begingroup$
So proof by contradiction? But what about the given argument, is it really air tight?
$endgroup$
– rsteckly
Dec 23 '10 at 23:13
1
$begingroup$
Yes, it is correct. What I did is to assume two numbers $x, y$ satisfy the identity and proved that $x = y$. What your text does is to show what $x$ should be, so it is another way of proving uniqueness.
$endgroup$
– Adrián Barquero
Dec 23 '10 at 23:16
$begingroup$
án: But it's redundant to give such a uniqueness proof - see my answer.
$endgroup$
– Bill Dubuque
Dec 24 '10 at 19:57
$begingroup$
@Bill Yes, you're right. I just wanted to give a different argument than the one the OP already had. I suppose I wanted to show a possible way to attack problems in which one has to prove uniqueness and there's no explicit form for the object that will show uniqueness immediately, since the OP asked for such a method. For instance when proving uniqueness of the inverse element in an arbitrary group.
$endgroup$
– Adrián Barquero
Dec 24 '10 at 20:39
$begingroup$
án: But it's still redundant even for inverses in an arbitrary group - that's merely the special case $b = 0$ above. Perhaps you meant in an arbitrary semigroup, i.e. where an inverse operation need not exist.
$endgroup$
– Bill Dubuque
Dec 24 '10 at 21:16
$begingroup$
So proof by contradiction? But what about the given argument, is it really air tight?
$endgroup$
– rsteckly
Dec 23 '10 at 23:13
$begingroup$
So proof by contradiction? But what about the given argument, is it really air tight?
$endgroup$
– rsteckly
Dec 23 '10 at 23:13
1
1
$begingroup$
Yes, it is correct. What I did is to assume two numbers $x, y$ satisfy the identity and proved that $x = y$. What your text does is to show what $x$ should be, so it is another way of proving uniqueness.
$endgroup$
– Adrián Barquero
Dec 23 '10 at 23:16
$begingroup$
Yes, it is correct. What I did is to assume two numbers $x, y$ satisfy the identity and proved that $x = y$. What your text does is to show what $x$ should be, so it is another way of proving uniqueness.
$endgroup$
– Adrián Barquero
Dec 23 '10 at 23:16
$begingroup$
án: But it's redundant to give such a uniqueness proof - see my answer.
$endgroup$
– Bill Dubuque
Dec 24 '10 at 19:57
$begingroup$
án: But it's redundant to give such a uniqueness proof - see my answer.
$endgroup$
– Bill Dubuque
Dec 24 '10 at 19:57
$begingroup$
@Bill Yes, you're right. I just wanted to give a different argument than the one the OP already had. I suppose I wanted to show a possible way to attack problems in which one has to prove uniqueness and there's no explicit form for the object that will show uniqueness immediately, since the OP asked for such a method. For instance when proving uniqueness of the inverse element in an arbitrary group.
$endgroup$
– Adrián Barquero
Dec 24 '10 at 20:39
$begingroup$
@Bill Yes, you're right. I just wanted to give a different argument than the one the OP already had. I suppose I wanted to show a possible way to attack problems in which one has to prove uniqueness and there's no explicit form for the object that will show uniqueness immediately, since the OP asked for such a method. For instance when proving uniqueness of the inverse element in an arbitrary group.
$endgroup$
– Adrián Barquero
Dec 24 '10 at 20:39
$begingroup$
án: But it's still redundant even for inverses in an arbitrary group - that's merely the special case $b = 0$ above. Perhaps you meant in an arbitrary semigroup, i.e. where an inverse operation need not exist.
$endgroup$
– Bill Dubuque
Dec 24 '10 at 21:16
$begingroup$
án: But it's still redundant even for inverses in an arbitrary group - that's merely the special case $b = 0$ above. Perhaps you meant in an arbitrary semigroup, i.e. where an inverse operation need not exist.
$endgroup$
– Bill Dubuque
Dec 24 '10 at 21:16
add a comment |
$begingroup$
Simply use the (additive group) axioms to prove $rm a + x = b Rightarrow x = b + (-a):. $ That yields both existence and uniqueness. That the uniqueness doesn't require further proof is a subtlety that sometimes confuses students. This is discussed at length in my posts in Uniqueness of solution of x+a=b from field, sci.math, May 5, 2003 regarding a slick proof in Max Rosenlicht's Introduction to Analysis.
$endgroup$
add a comment |
$begingroup$
Simply use the (additive group) axioms to prove $rm a + x = b Rightarrow x = b + (-a):. $ That yields both existence and uniqueness. That the uniqueness doesn't require further proof is a subtlety that sometimes confuses students. This is discussed at length in my posts in Uniqueness of solution of x+a=b from field, sci.math, May 5, 2003 regarding a slick proof in Max Rosenlicht's Introduction to Analysis.
$endgroup$
add a comment |
$begingroup$
Simply use the (additive group) axioms to prove $rm a + x = b Rightarrow x = b + (-a):. $ That yields both existence and uniqueness. That the uniqueness doesn't require further proof is a subtlety that sometimes confuses students. This is discussed at length in my posts in Uniqueness of solution of x+a=b from field, sci.math, May 5, 2003 regarding a slick proof in Max Rosenlicht's Introduction to Analysis.
$endgroup$
Simply use the (additive group) axioms to prove $rm a + x = b Rightarrow x = b + (-a):. $ That yields both existence and uniqueness. That the uniqueness doesn't require further proof is a subtlety that sometimes confuses students. This is discussed at length in my posts in Uniqueness of solution of x+a=b from field, sci.math, May 5, 2003 regarding a slick proof in Max Rosenlicht's Introduction to Analysis.
edited Mar 19 at 2:37
answered Dec 24 '10 at 19:56
Bill DubuqueBill Dubuque
213k29196654
213k29196654
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%2f15388%2fbasic-question-about-proving-uniqueness%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
$begingroup$
Yes, it is essentially saying that the only possible value is b+(-a).
$endgroup$
– Aryabhata
Dec 23 '10 at 23:04
$begingroup$
Relevant SMBC comic (I think)
$endgroup$
– Nick T
Jan 5 '14 at 19:21