Prove $-0=0$ using the theorem of uniqueness of inverses.
$begingroup$
Theorem: Let $x$ be a real number. There exists one one real number $y$ such that $x+y=0$. Similarly, if $xneq 0$, there exists only one real number $y$ such that $xdot y$=1.
Using this theorem, prove $-0=0$.
I wrote down some steps of what is considered my scattered logic, but I am having a hard time forming a proof.
$0=-0$ (restating it)
$0=0+(-0)$ $rightarrow$ existence of additive inverse
$0=(-0)+0$ $rightarrow$ addition is commutative
$0=-0$ $rightarrow$ definition of additive identity
Is this correct? And if so, how can I form a proof using the theorem above?
real-analysis
$endgroup$
add a comment |
$begingroup$
Theorem: Let $x$ be a real number. There exists one one real number $y$ such that $x+y=0$. Similarly, if $xneq 0$, there exists only one real number $y$ such that $xdot y$=1.
Using this theorem, prove $-0=0$.
I wrote down some steps of what is considered my scattered logic, but I am having a hard time forming a proof.
$0=-0$ (restating it)
$0=0+(-0)$ $rightarrow$ existence of additive inverse
$0=(-0)+0$ $rightarrow$ addition is commutative
$0=-0$ $rightarrow$ definition of additive identity
Is this correct? And if so, how can I form a proof using the theorem above?
real-analysis
$endgroup$
1
$begingroup$
Apart from your "restating it", your proof is correct -- although I would call the last line "definition of additive identity", not "existence of additive identity", because you are using the equality $a = a + 0$, not the fact that an element satisfying that equality exists.
$endgroup$
– Mees de Vries
Jan 15 at 16:19
$begingroup$
Thanks! I knew I wasn't "restating" it. I am not sure why I included that. Its 6am here!
$endgroup$
– Ryan
Jan 15 at 16:29
add a comment |
$begingroup$
Theorem: Let $x$ be a real number. There exists one one real number $y$ such that $x+y=0$. Similarly, if $xneq 0$, there exists only one real number $y$ such that $xdot y$=1.
Using this theorem, prove $-0=0$.
I wrote down some steps of what is considered my scattered logic, but I am having a hard time forming a proof.
$0=-0$ (restating it)
$0=0+(-0)$ $rightarrow$ existence of additive inverse
$0=(-0)+0$ $rightarrow$ addition is commutative
$0=-0$ $rightarrow$ definition of additive identity
Is this correct? And if so, how can I form a proof using the theorem above?
real-analysis
$endgroup$
Theorem: Let $x$ be a real number. There exists one one real number $y$ such that $x+y=0$. Similarly, if $xneq 0$, there exists only one real number $y$ such that $xdot y$=1.
Using this theorem, prove $-0=0$.
I wrote down some steps of what is considered my scattered logic, but I am having a hard time forming a proof.
$0=-0$ (restating it)
$0=0+(-0)$ $rightarrow$ existence of additive inverse
$0=(-0)+0$ $rightarrow$ addition is commutative
$0=-0$ $rightarrow$ definition of additive identity
Is this correct? And if so, how can I form a proof using the theorem above?
real-analysis
real-analysis
edited Jan 15 at 16:34
Ryan
asked Jan 15 at 16:10
RyanRyan
1448
1448
1
$begingroup$
Apart from your "restating it", your proof is correct -- although I would call the last line "definition of additive identity", not "existence of additive identity", because you are using the equality $a = a + 0$, not the fact that an element satisfying that equality exists.
$endgroup$
– Mees de Vries
Jan 15 at 16:19
$begingroup$
Thanks! I knew I wasn't "restating" it. I am not sure why I included that. Its 6am here!
$endgroup$
– Ryan
Jan 15 at 16:29
add a comment |
1
$begingroup$
Apart from your "restating it", your proof is correct -- although I would call the last line "definition of additive identity", not "existence of additive identity", because you are using the equality $a = a + 0$, not the fact that an element satisfying that equality exists.
$endgroup$
– Mees de Vries
Jan 15 at 16:19
$begingroup$
Thanks! I knew I wasn't "restating" it. I am not sure why I included that. Its 6am here!
$endgroup$
– Ryan
Jan 15 at 16:29
1
1
$begingroup$
Apart from your "restating it", your proof is correct -- although I would call the last line "definition of additive identity", not "existence of additive identity", because you are using the equality $a = a + 0$, not the fact that an element satisfying that equality exists.
$endgroup$
– Mees de Vries
Jan 15 at 16:19
$begingroup$
Apart from your "restating it", your proof is correct -- although I would call the last line "definition of additive identity", not "existence of additive identity", because you are using the equality $a = a + 0$, not the fact that an element satisfying that equality exists.
$endgroup$
– Mees de Vries
Jan 15 at 16:19
$begingroup$
Thanks! I knew I wasn't "restating" it. I am not sure why I included that. Its 6am here!
$endgroup$
– Ryan
Jan 15 at 16:29
$begingroup$
Thanks! I knew I wasn't "restating" it. I am not sure why I included that. Its 6am here!
$endgroup$
– Ryan
Jan 15 at 16:29
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
Note that $0+(-0)=0$ by the definition of inverse. On the other hand adding $0$ to a number doesn't change the number, hence $0+0=0$. That means $0,-0$ are both additive inverses of $0$. But the inverse is unique so they are equal.
$endgroup$
add a comment |
$begingroup$
It's not clear how your proof is supposed to work: you state what you're trying to prove as the first line, making it appear that you're engaging in proof by assertion and/or circular reasoning.
You don't need the uniqueness of inverses (note that while the uniqueness of the identity is a theorem -- it can be derived from the axioms -- the existence of the identity is an axiom, not theorem).
$0+(-0)=0$ by definition of inverses, and $0+(-0)=-0$ by definition of identity. So $0$ and $-0$ are both equal to $0+(-0)$, and by transitivity of equality they are equal to each other.
$endgroup$
$begingroup$
Duly noted -- thank you!
$endgroup$
– Ryan
Jan 15 at 16:41
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%2f3074589%2fprove-0-0-using-the-theorem-of-uniqueness-of-inverses%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$
Note that $0+(-0)=0$ by the definition of inverse. On the other hand adding $0$ to a number doesn't change the number, hence $0+0=0$. That means $0,-0$ are both additive inverses of $0$. But the inverse is unique so they are equal.
$endgroup$
add a comment |
$begingroup$
Note that $0+(-0)=0$ by the definition of inverse. On the other hand adding $0$ to a number doesn't change the number, hence $0+0=0$. That means $0,-0$ are both additive inverses of $0$. But the inverse is unique so they are equal.
$endgroup$
add a comment |
$begingroup$
Note that $0+(-0)=0$ by the definition of inverse. On the other hand adding $0$ to a number doesn't change the number, hence $0+0=0$. That means $0,-0$ are both additive inverses of $0$. But the inverse is unique so they are equal.
$endgroup$
Note that $0+(-0)=0$ by the definition of inverse. On the other hand adding $0$ to a number doesn't change the number, hence $0+0=0$. That means $0,-0$ are both additive inverses of $0$. But the inverse is unique so they are equal.
answered Jan 15 at 16:17
MarkMark
6,913416
6,913416
add a comment |
add a comment |
$begingroup$
It's not clear how your proof is supposed to work: you state what you're trying to prove as the first line, making it appear that you're engaging in proof by assertion and/or circular reasoning.
You don't need the uniqueness of inverses (note that while the uniqueness of the identity is a theorem -- it can be derived from the axioms -- the existence of the identity is an axiom, not theorem).
$0+(-0)=0$ by definition of inverses, and $0+(-0)=-0$ by definition of identity. So $0$ and $-0$ are both equal to $0+(-0)$, and by transitivity of equality they are equal to each other.
$endgroup$
$begingroup$
Duly noted -- thank you!
$endgroup$
– Ryan
Jan 15 at 16:41
add a comment |
$begingroup$
It's not clear how your proof is supposed to work: you state what you're trying to prove as the first line, making it appear that you're engaging in proof by assertion and/or circular reasoning.
You don't need the uniqueness of inverses (note that while the uniqueness of the identity is a theorem -- it can be derived from the axioms -- the existence of the identity is an axiom, not theorem).
$0+(-0)=0$ by definition of inverses, and $0+(-0)=-0$ by definition of identity. So $0$ and $-0$ are both equal to $0+(-0)$, and by transitivity of equality they are equal to each other.
$endgroup$
$begingroup$
Duly noted -- thank you!
$endgroup$
– Ryan
Jan 15 at 16:41
add a comment |
$begingroup$
It's not clear how your proof is supposed to work: you state what you're trying to prove as the first line, making it appear that you're engaging in proof by assertion and/or circular reasoning.
You don't need the uniqueness of inverses (note that while the uniqueness of the identity is a theorem -- it can be derived from the axioms -- the existence of the identity is an axiom, not theorem).
$0+(-0)=0$ by definition of inverses, and $0+(-0)=-0$ by definition of identity. So $0$ and $-0$ are both equal to $0+(-0)$, and by transitivity of equality they are equal to each other.
$endgroup$
It's not clear how your proof is supposed to work: you state what you're trying to prove as the first line, making it appear that you're engaging in proof by assertion and/or circular reasoning.
You don't need the uniqueness of inverses (note that while the uniqueness of the identity is a theorem -- it can be derived from the axioms -- the existence of the identity is an axiom, not theorem).
$0+(-0)=0$ by definition of inverses, and $0+(-0)=-0$ by definition of identity. So $0$ and $-0$ are both equal to $0+(-0)$, and by transitivity of equality they are equal to each other.
answered Jan 15 at 16:37
AcccumulationAcccumulation
6,9042618
6,9042618
$begingroup$
Duly noted -- thank you!
$endgroup$
– Ryan
Jan 15 at 16:41
add a comment |
$begingroup$
Duly noted -- thank you!
$endgroup$
– Ryan
Jan 15 at 16:41
$begingroup$
Duly noted -- thank you!
$endgroup$
– Ryan
Jan 15 at 16:41
$begingroup$
Duly noted -- thank you!
$endgroup$
– Ryan
Jan 15 at 16:41
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%2f3074589%2fprove-0-0-using-the-theorem-of-uniqueness-of-inverses%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
1
$begingroup$
Apart from your "restating it", your proof is correct -- although I would call the last line "definition of additive identity", not "existence of additive identity", because you are using the equality $a = a + 0$, not the fact that an element satisfying that equality exists.
$endgroup$
– Mees de Vries
Jan 15 at 16:19
$begingroup$
Thanks! I knew I wasn't "restating" it. I am not sure why I included that. Its 6am here!
$endgroup$
– Ryan
Jan 15 at 16:29