Evaluating a proposition that is empty
Here is a silly example to illustrate my question:
Definition We call a function zeroed-at-one if $f(1)=0$.
If $1$ is not in the domain of $f$, is the statement "$f$ is zeroed-at-one" true or false? The problem is that $f(1)$ is undefined.
Consider that Wolfram MathWorld states: "Undefined: An expression in mathematics which does not have meaning and so which is not assigned an interpretation."
Let:
P = "$f(1)=0$"
Q = "$f$ is called "zeroed-at-one".
If $f(1)$ is undefined, is P true or false, or does it have no meaning/interpretation?
Can we say that, for this definition, we have P $Rightarrow$ Q, or P$Leftrightarrow$ Q? I think we really want an "if and only if" for definitions since if P is false and Q is true, then P$Rightarrow$Q is true, but P$Leftrightarrow$ Q is false. If P is meaningless in such a case, then is it the case that we can neither say $f$ satisfies the definition, nor that $f$ does not satisfy the definition?
I feel that we want P here to be false if $f(1)$ is undefined, but how is that justified? Moreover, how is it properly notated in formal logic, and how is the undefined issue dealt with there?
logic propositional-calculus first-order-logic
add a comment |
Here is a silly example to illustrate my question:
Definition We call a function zeroed-at-one if $f(1)=0$.
If $1$ is not in the domain of $f$, is the statement "$f$ is zeroed-at-one" true or false? The problem is that $f(1)$ is undefined.
Consider that Wolfram MathWorld states: "Undefined: An expression in mathematics which does not have meaning and so which is not assigned an interpretation."
Let:
P = "$f(1)=0$"
Q = "$f$ is called "zeroed-at-one".
If $f(1)$ is undefined, is P true or false, or does it have no meaning/interpretation?
Can we say that, for this definition, we have P $Rightarrow$ Q, or P$Leftrightarrow$ Q? I think we really want an "if and only if" for definitions since if P is false and Q is true, then P$Rightarrow$Q is true, but P$Leftrightarrow$ Q is false. If P is meaningless in such a case, then is it the case that we can neither say $f$ satisfies the definition, nor that $f$ does not satisfy the definition?
I feel that we want P here to be false if $f(1)$ is undefined, but how is that justified? Moreover, how is it properly notated in formal logic, and how is the undefined issue dealt with there?
logic propositional-calculus first-order-logic
1
Yes, definitions introduce equivalences, but are traditionally formulated with "if" only.
– Hagen von Eitzen
Nov 28 at 19:54
add a comment |
Here is a silly example to illustrate my question:
Definition We call a function zeroed-at-one if $f(1)=0$.
If $1$ is not in the domain of $f$, is the statement "$f$ is zeroed-at-one" true or false? The problem is that $f(1)$ is undefined.
Consider that Wolfram MathWorld states: "Undefined: An expression in mathematics which does not have meaning and so which is not assigned an interpretation."
Let:
P = "$f(1)=0$"
Q = "$f$ is called "zeroed-at-one".
If $f(1)$ is undefined, is P true or false, or does it have no meaning/interpretation?
Can we say that, for this definition, we have P $Rightarrow$ Q, or P$Leftrightarrow$ Q? I think we really want an "if and only if" for definitions since if P is false and Q is true, then P$Rightarrow$Q is true, but P$Leftrightarrow$ Q is false. If P is meaningless in such a case, then is it the case that we can neither say $f$ satisfies the definition, nor that $f$ does not satisfy the definition?
I feel that we want P here to be false if $f(1)$ is undefined, but how is that justified? Moreover, how is it properly notated in formal logic, and how is the undefined issue dealt with there?
logic propositional-calculus first-order-logic
Here is a silly example to illustrate my question:
Definition We call a function zeroed-at-one if $f(1)=0$.
If $1$ is not in the domain of $f$, is the statement "$f$ is zeroed-at-one" true or false? The problem is that $f(1)$ is undefined.
Consider that Wolfram MathWorld states: "Undefined: An expression in mathematics which does not have meaning and so which is not assigned an interpretation."
Let:
P = "$f(1)=0$"
Q = "$f$ is called "zeroed-at-one".
If $f(1)$ is undefined, is P true or false, or does it have no meaning/interpretation?
Can we say that, for this definition, we have P $Rightarrow$ Q, or P$Leftrightarrow$ Q? I think we really want an "if and only if" for definitions since if P is false and Q is true, then P$Rightarrow$Q is true, but P$Leftrightarrow$ Q is false. If P is meaningless in such a case, then is it the case that we can neither say $f$ satisfies the definition, nor that $f$ does not satisfy the definition?
I feel that we want P here to be false if $f(1)$ is undefined, but how is that justified? Moreover, how is it properly notated in formal logic, and how is the undefined issue dealt with there?
logic propositional-calculus first-order-logic
logic propositional-calculus first-order-logic
asked Nov 28 at 19:52
jdods
3,59411134
3,59411134
1
Yes, definitions introduce equivalences, but are traditionally formulated with "if" only.
– Hagen von Eitzen
Nov 28 at 19:54
add a comment |
1
Yes, definitions introduce equivalences, but are traditionally formulated with "if" only.
– Hagen von Eitzen
Nov 28 at 19:54
1
1
Yes, definitions introduce equivalences, but are traditionally formulated with "if" only.
– Hagen von Eitzen
Nov 28 at 19:54
Yes, definitions introduce equivalences, but are traditionally formulated with "if" only.
– Hagen von Eitzen
Nov 28 at 19:54
add a comment |
4 Answers
4
active
oldest
votes
It depends on what logical framework you're working in. If, as your tags suggest, $f$ is a function symbol in a first-order theory with $1$ and $0$ being constants, then $f$ can't not be defined at $1$. Either you're working in a single-sorted FOL, and thus every function symbol is applicable to every term (there is only one "domain"), or you're working in a multi-sorted FOL and either $1$ is of the appropriate sort to be an input to $f$ and so $f$ is defined at $1$, or it's not and your definition itself is just syntactically ill-formed.
If you want to talk about functions that are partially defined, you would typically model them as predicates in FOL. You'd have a predicate $P(x,y)$ that informally corresponded to "$f$ is defined at $x$ and $f(x)=y$". "Zeroed-at-one" would then be the assertion that $P(1,0)$ holds. This is also effectively what happens if you want to consider this as working in set theory. That is, $f(1)=0$ is often viewed as being short-hand for $(1,0)in f$ in a set theoretic context. Using the set theoretic view, if $1$ is not in the domain of $f$, then $(1,0)in f$ is certainly false and so $f$ would not be "zeroed-at-one". There is never an "undefined" value.
Ok, this answers my question about how to deal with an undefined part of a definition. As you might have gathered, I really know nothing about FOL. I thought that the conclusion might be that the given silly example definition is ill-formed. Looking at it in terms of whether $(1,0)in f$ or not makes it much more tractable, and eliminates the issue of being undefined; it's just a question of set membership which can be easily answered yes or no.
– jdods
Nov 28 at 22:59
add a comment |
The answer by Derek Elkins explains how this is treated in first-order logic: we use relations instead of functions when the functions may not be total, or we use set theory so that we can ask explicitly whether elements are in the domain of the function.
There is an alternative: we can change to a different "free logic" in which there can be terms (such as "f(0)") that do not actually denote anything. These are called "singular terms".
Free logic is unlike first-order logic where all terms must denote, but more like English where "the 12th king of the United States" is a well formed noun phrase that does not denote any person. For this reason, free logic is more heavily studied in linguistics and philosophy than in mathematical logic.
In free logic, there are several ways of defining the truth of formulas when they may have singular terms. Generally, in free logics that require every formula to be true or false in each interpretation, if $f(0)$ is a singular term then $f(0) = 1$ is teated as false provided that the term $1$ does denote something. In other words, a singular term cannot be equal to a denoting term in these logics, and a claim that they are equal evaluates to false.
There are many more details about free logic in the link above, so I will not try to go much further here, but they do provide an established basis for reasoning in the presence of singular terms.
Thank you, this is helpful as well, and provides another way to address the issue of undefined terms.
– jdods
Nov 29 at 1:01
add a comment |
I believe as you have it written, part of the definition of being zeroed-at-one requires that $1$ be in the domain and $0$ be in the codomain. If either of those conditions are not met, you have no chance to be zeroed-at-one, and so you would say that the statement "$f$ is zeroed-at-one" is false. Basically, your definition is not explicit enough, and I think that any reasonable mathematician would assume what I have about the implict requirements.
add a comment |
Consider the definition of continuity of a function for comparison:
The function $f$ is continuous at some point $c$ of its domain if the limit of $f(x)$, as $x$ approaches $c$ through the domain of $f$, exists and is equal to $f(c)$.
As you can see, there's a slight difference with your definition. In this case the definition includes that $c$ must be in the domain. Therefore both continuous and discontinuous are not defined at a point $c$ that is not in the domain of the function.
Since you did not include the domain-condition in your definition, we must assume that not-zeroed-at-one means that either $f(1)$ is undefined, or $f(1)ne 0$ as JDMan already pointed out.
Edit: There is a certain abuse of definition where discontinuity is concerned when talking about a removable discontinuity.
The term removable discontinuity is an abuse of terminology for cases in which the limits in both directions exist and are equal, while the function is undefined at the point $c$. This use is abusive because continuity and discontinuity of a function are concepts defined only for points in the function's domain. Such a point not in the domain is properly named a removable singularity.
Continuity is one of the actual examples I had in mind. This leads to the problem where a function like $f(x)=frac1{x^2}$ or a constant function will a hole punched out at $0$ are then neither continuous nor discontinuous at $x=0$, but many books will say they are discontinuous there. Of course, they don't address the fact that $sqrt x$ is then discontinuous at all negative numbers.
– jdods
Nov 28 at 20:38
1
I've extended my answer to address what is called a removable discontinuity @jdods.
– I like Serena
Nov 28 at 23:30
Neat, I hadn't heard it phrased as removable singularity before, but that is so much more palatable! I supposed a removable discontinuity is only for the case where the function is already defined there.
– jdods
Nov 28 at 23:56
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%2f3017606%2fevaluating-a-proposition-that-is-empty%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
4 Answers
4
active
oldest
votes
4 Answers
4
active
oldest
votes
active
oldest
votes
active
oldest
votes
It depends on what logical framework you're working in. If, as your tags suggest, $f$ is a function symbol in a first-order theory with $1$ and $0$ being constants, then $f$ can't not be defined at $1$. Either you're working in a single-sorted FOL, and thus every function symbol is applicable to every term (there is only one "domain"), or you're working in a multi-sorted FOL and either $1$ is of the appropriate sort to be an input to $f$ and so $f$ is defined at $1$, or it's not and your definition itself is just syntactically ill-formed.
If you want to talk about functions that are partially defined, you would typically model them as predicates in FOL. You'd have a predicate $P(x,y)$ that informally corresponded to "$f$ is defined at $x$ and $f(x)=y$". "Zeroed-at-one" would then be the assertion that $P(1,0)$ holds. This is also effectively what happens if you want to consider this as working in set theory. That is, $f(1)=0$ is often viewed as being short-hand for $(1,0)in f$ in a set theoretic context. Using the set theoretic view, if $1$ is not in the domain of $f$, then $(1,0)in f$ is certainly false and so $f$ would not be "zeroed-at-one". There is never an "undefined" value.
Ok, this answers my question about how to deal with an undefined part of a definition. As you might have gathered, I really know nothing about FOL. I thought that the conclusion might be that the given silly example definition is ill-formed. Looking at it in terms of whether $(1,0)in f$ or not makes it much more tractable, and eliminates the issue of being undefined; it's just a question of set membership which can be easily answered yes or no.
– jdods
Nov 28 at 22:59
add a comment |
It depends on what logical framework you're working in. If, as your tags suggest, $f$ is a function symbol in a first-order theory with $1$ and $0$ being constants, then $f$ can't not be defined at $1$. Either you're working in a single-sorted FOL, and thus every function symbol is applicable to every term (there is only one "domain"), or you're working in a multi-sorted FOL and either $1$ is of the appropriate sort to be an input to $f$ and so $f$ is defined at $1$, or it's not and your definition itself is just syntactically ill-formed.
If you want to talk about functions that are partially defined, you would typically model them as predicates in FOL. You'd have a predicate $P(x,y)$ that informally corresponded to "$f$ is defined at $x$ and $f(x)=y$". "Zeroed-at-one" would then be the assertion that $P(1,0)$ holds. This is also effectively what happens if you want to consider this as working in set theory. That is, $f(1)=0$ is often viewed as being short-hand for $(1,0)in f$ in a set theoretic context. Using the set theoretic view, if $1$ is not in the domain of $f$, then $(1,0)in f$ is certainly false and so $f$ would not be "zeroed-at-one". There is never an "undefined" value.
Ok, this answers my question about how to deal with an undefined part of a definition. As you might have gathered, I really know nothing about FOL. I thought that the conclusion might be that the given silly example definition is ill-formed. Looking at it in terms of whether $(1,0)in f$ or not makes it much more tractable, and eliminates the issue of being undefined; it's just a question of set membership which can be easily answered yes or no.
– jdods
Nov 28 at 22:59
add a comment |
It depends on what logical framework you're working in. If, as your tags suggest, $f$ is a function symbol in a first-order theory with $1$ and $0$ being constants, then $f$ can't not be defined at $1$. Either you're working in a single-sorted FOL, and thus every function symbol is applicable to every term (there is only one "domain"), or you're working in a multi-sorted FOL and either $1$ is of the appropriate sort to be an input to $f$ and so $f$ is defined at $1$, or it's not and your definition itself is just syntactically ill-formed.
If you want to talk about functions that are partially defined, you would typically model them as predicates in FOL. You'd have a predicate $P(x,y)$ that informally corresponded to "$f$ is defined at $x$ and $f(x)=y$". "Zeroed-at-one" would then be the assertion that $P(1,0)$ holds. This is also effectively what happens if you want to consider this as working in set theory. That is, $f(1)=0$ is often viewed as being short-hand for $(1,0)in f$ in a set theoretic context. Using the set theoretic view, if $1$ is not in the domain of $f$, then $(1,0)in f$ is certainly false and so $f$ would not be "zeroed-at-one". There is never an "undefined" value.
It depends on what logical framework you're working in. If, as your tags suggest, $f$ is a function symbol in a first-order theory with $1$ and $0$ being constants, then $f$ can't not be defined at $1$. Either you're working in a single-sorted FOL, and thus every function symbol is applicable to every term (there is only one "domain"), or you're working in a multi-sorted FOL and either $1$ is of the appropriate sort to be an input to $f$ and so $f$ is defined at $1$, or it's not and your definition itself is just syntactically ill-formed.
If you want to talk about functions that are partially defined, you would typically model them as predicates in FOL. You'd have a predicate $P(x,y)$ that informally corresponded to "$f$ is defined at $x$ and $f(x)=y$". "Zeroed-at-one" would then be the assertion that $P(1,0)$ holds. This is also effectively what happens if you want to consider this as working in set theory. That is, $f(1)=0$ is often viewed as being short-hand for $(1,0)in f$ in a set theoretic context. Using the set theoretic view, if $1$ is not in the domain of $f$, then $(1,0)in f$ is certainly false and so $f$ would not be "zeroed-at-one". There is never an "undefined" value.
answered Nov 28 at 21:23
Derek Elkins
16k11337
16k11337
Ok, this answers my question about how to deal with an undefined part of a definition. As you might have gathered, I really know nothing about FOL. I thought that the conclusion might be that the given silly example definition is ill-formed. Looking at it in terms of whether $(1,0)in f$ or not makes it much more tractable, and eliminates the issue of being undefined; it's just a question of set membership which can be easily answered yes or no.
– jdods
Nov 28 at 22:59
add a comment |
Ok, this answers my question about how to deal with an undefined part of a definition. As you might have gathered, I really know nothing about FOL. I thought that the conclusion might be that the given silly example definition is ill-formed. Looking at it in terms of whether $(1,0)in f$ or not makes it much more tractable, and eliminates the issue of being undefined; it's just a question of set membership which can be easily answered yes or no.
– jdods
Nov 28 at 22:59
Ok, this answers my question about how to deal with an undefined part of a definition. As you might have gathered, I really know nothing about FOL. I thought that the conclusion might be that the given silly example definition is ill-formed. Looking at it in terms of whether $(1,0)in f$ or not makes it much more tractable, and eliminates the issue of being undefined; it's just a question of set membership which can be easily answered yes or no.
– jdods
Nov 28 at 22:59
Ok, this answers my question about how to deal with an undefined part of a definition. As you might have gathered, I really know nothing about FOL. I thought that the conclusion might be that the given silly example definition is ill-formed. Looking at it in terms of whether $(1,0)in f$ or not makes it much more tractable, and eliminates the issue of being undefined; it's just a question of set membership which can be easily answered yes or no.
– jdods
Nov 28 at 22:59
add a comment |
The answer by Derek Elkins explains how this is treated in first-order logic: we use relations instead of functions when the functions may not be total, or we use set theory so that we can ask explicitly whether elements are in the domain of the function.
There is an alternative: we can change to a different "free logic" in which there can be terms (such as "f(0)") that do not actually denote anything. These are called "singular terms".
Free logic is unlike first-order logic where all terms must denote, but more like English where "the 12th king of the United States" is a well formed noun phrase that does not denote any person. For this reason, free logic is more heavily studied in linguistics and philosophy than in mathematical logic.
In free logic, there are several ways of defining the truth of formulas when they may have singular terms. Generally, in free logics that require every formula to be true or false in each interpretation, if $f(0)$ is a singular term then $f(0) = 1$ is teated as false provided that the term $1$ does denote something. In other words, a singular term cannot be equal to a denoting term in these logics, and a claim that they are equal evaluates to false.
There are many more details about free logic in the link above, so I will not try to go much further here, but they do provide an established basis for reasoning in the presence of singular terms.
Thank you, this is helpful as well, and provides another way to address the issue of undefined terms.
– jdods
Nov 29 at 1:01
add a comment |
The answer by Derek Elkins explains how this is treated in first-order logic: we use relations instead of functions when the functions may not be total, or we use set theory so that we can ask explicitly whether elements are in the domain of the function.
There is an alternative: we can change to a different "free logic" in which there can be terms (such as "f(0)") that do not actually denote anything. These are called "singular terms".
Free logic is unlike first-order logic where all terms must denote, but more like English where "the 12th king of the United States" is a well formed noun phrase that does not denote any person. For this reason, free logic is more heavily studied in linguistics and philosophy than in mathematical logic.
In free logic, there are several ways of defining the truth of formulas when they may have singular terms. Generally, in free logics that require every formula to be true or false in each interpretation, if $f(0)$ is a singular term then $f(0) = 1$ is teated as false provided that the term $1$ does denote something. In other words, a singular term cannot be equal to a denoting term in these logics, and a claim that they are equal evaluates to false.
There are many more details about free logic in the link above, so I will not try to go much further here, but they do provide an established basis for reasoning in the presence of singular terms.
Thank you, this is helpful as well, and provides another way to address the issue of undefined terms.
– jdods
Nov 29 at 1:01
add a comment |
The answer by Derek Elkins explains how this is treated in first-order logic: we use relations instead of functions when the functions may not be total, or we use set theory so that we can ask explicitly whether elements are in the domain of the function.
There is an alternative: we can change to a different "free logic" in which there can be terms (such as "f(0)") that do not actually denote anything. These are called "singular terms".
Free logic is unlike first-order logic where all terms must denote, but more like English where "the 12th king of the United States" is a well formed noun phrase that does not denote any person. For this reason, free logic is more heavily studied in linguistics and philosophy than in mathematical logic.
In free logic, there are several ways of defining the truth of formulas when they may have singular terms. Generally, in free logics that require every formula to be true or false in each interpretation, if $f(0)$ is a singular term then $f(0) = 1$ is teated as false provided that the term $1$ does denote something. In other words, a singular term cannot be equal to a denoting term in these logics, and a claim that they are equal evaluates to false.
There are many more details about free logic in the link above, so I will not try to go much further here, but they do provide an established basis for reasoning in the presence of singular terms.
The answer by Derek Elkins explains how this is treated in first-order logic: we use relations instead of functions when the functions may not be total, or we use set theory so that we can ask explicitly whether elements are in the domain of the function.
There is an alternative: we can change to a different "free logic" in which there can be terms (such as "f(0)") that do not actually denote anything. These are called "singular terms".
Free logic is unlike first-order logic where all terms must denote, but more like English where "the 12th king of the United States" is a well formed noun phrase that does not denote any person. For this reason, free logic is more heavily studied in linguistics and philosophy than in mathematical logic.
In free logic, there are several ways of defining the truth of formulas when they may have singular terms. Generally, in free logics that require every formula to be true or false in each interpretation, if $f(0)$ is a singular term then $f(0) = 1$ is teated as false provided that the term $1$ does denote something. In other words, a singular term cannot be equal to a denoting term in these logics, and a claim that they are equal evaluates to false.
There are many more details about free logic in the link above, so I will not try to go much further here, but they do provide an established basis for reasoning in the presence of singular terms.
answered Nov 29 at 0:01
Carl Mummert
66k7131246
66k7131246
Thank you, this is helpful as well, and provides another way to address the issue of undefined terms.
– jdods
Nov 29 at 1:01
add a comment |
Thank you, this is helpful as well, and provides another way to address the issue of undefined terms.
– jdods
Nov 29 at 1:01
Thank you, this is helpful as well, and provides another way to address the issue of undefined terms.
– jdods
Nov 29 at 1:01
Thank you, this is helpful as well, and provides another way to address the issue of undefined terms.
– jdods
Nov 29 at 1:01
add a comment |
I believe as you have it written, part of the definition of being zeroed-at-one requires that $1$ be in the domain and $0$ be in the codomain. If either of those conditions are not met, you have no chance to be zeroed-at-one, and so you would say that the statement "$f$ is zeroed-at-one" is false. Basically, your definition is not explicit enough, and I think that any reasonable mathematician would assume what I have about the implict requirements.
add a comment |
I believe as you have it written, part of the definition of being zeroed-at-one requires that $1$ be in the domain and $0$ be in the codomain. If either of those conditions are not met, you have no chance to be zeroed-at-one, and so you would say that the statement "$f$ is zeroed-at-one" is false. Basically, your definition is not explicit enough, and I think that any reasonable mathematician would assume what I have about the implict requirements.
add a comment |
I believe as you have it written, part of the definition of being zeroed-at-one requires that $1$ be in the domain and $0$ be in the codomain. If either of those conditions are not met, you have no chance to be zeroed-at-one, and so you would say that the statement "$f$ is zeroed-at-one" is false. Basically, your definition is not explicit enough, and I think that any reasonable mathematician would assume what I have about the implict requirements.
I believe as you have it written, part of the definition of being zeroed-at-one requires that $1$ be in the domain and $0$ be in the codomain. If either of those conditions are not met, you have no chance to be zeroed-at-one, and so you would say that the statement "$f$ is zeroed-at-one" is false. Basically, your definition is not explicit enough, and I think that any reasonable mathematician would assume what I have about the implict requirements.
answered Nov 28 at 19:55
JDMan4444
23514
23514
add a comment |
add a comment |
Consider the definition of continuity of a function for comparison:
The function $f$ is continuous at some point $c$ of its domain if the limit of $f(x)$, as $x$ approaches $c$ through the domain of $f$, exists and is equal to $f(c)$.
As you can see, there's a slight difference with your definition. In this case the definition includes that $c$ must be in the domain. Therefore both continuous and discontinuous are not defined at a point $c$ that is not in the domain of the function.
Since you did not include the domain-condition in your definition, we must assume that not-zeroed-at-one means that either $f(1)$ is undefined, or $f(1)ne 0$ as JDMan already pointed out.
Edit: There is a certain abuse of definition where discontinuity is concerned when talking about a removable discontinuity.
The term removable discontinuity is an abuse of terminology for cases in which the limits in both directions exist and are equal, while the function is undefined at the point $c$. This use is abusive because continuity and discontinuity of a function are concepts defined only for points in the function's domain. Such a point not in the domain is properly named a removable singularity.
Continuity is one of the actual examples I had in mind. This leads to the problem where a function like $f(x)=frac1{x^2}$ or a constant function will a hole punched out at $0$ are then neither continuous nor discontinuous at $x=0$, but many books will say they are discontinuous there. Of course, they don't address the fact that $sqrt x$ is then discontinuous at all negative numbers.
– jdods
Nov 28 at 20:38
1
I've extended my answer to address what is called a removable discontinuity @jdods.
– I like Serena
Nov 28 at 23:30
Neat, I hadn't heard it phrased as removable singularity before, but that is so much more palatable! I supposed a removable discontinuity is only for the case where the function is already defined there.
– jdods
Nov 28 at 23:56
add a comment |
Consider the definition of continuity of a function for comparison:
The function $f$ is continuous at some point $c$ of its domain if the limit of $f(x)$, as $x$ approaches $c$ through the domain of $f$, exists and is equal to $f(c)$.
As you can see, there's a slight difference with your definition. In this case the definition includes that $c$ must be in the domain. Therefore both continuous and discontinuous are not defined at a point $c$ that is not in the domain of the function.
Since you did not include the domain-condition in your definition, we must assume that not-zeroed-at-one means that either $f(1)$ is undefined, or $f(1)ne 0$ as JDMan already pointed out.
Edit: There is a certain abuse of definition where discontinuity is concerned when talking about a removable discontinuity.
The term removable discontinuity is an abuse of terminology for cases in which the limits in both directions exist and are equal, while the function is undefined at the point $c$. This use is abusive because continuity and discontinuity of a function are concepts defined only for points in the function's domain. Such a point not in the domain is properly named a removable singularity.
Continuity is one of the actual examples I had in mind. This leads to the problem where a function like $f(x)=frac1{x^2}$ or a constant function will a hole punched out at $0$ are then neither continuous nor discontinuous at $x=0$, but many books will say they are discontinuous there. Of course, they don't address the fact that $sqrt x$ is then discontinuous at all negative numbers.
– jdods
Nov 28 at 20:38
1
I've extended my answer to address what is called a removable discontinuity @jdods.
– I like Serena
Nov 28 at 23:30
Neat, I hadn't heard it phrased as removable singularity before, but that is so much more palatable! I supposed a removable discontinuity is only for the case where the function is already defined there.
– jdods
Nov 28 at 23:56
add a comment |
Consider the definition of continuity of a function for comparison:
The function $f$ is continuous at some point $c$ of its domain if the limit of $f(x)$, as $x$ approaches $c$ through the domain of $f$, exists and is equal to $f(c)$.
As you can see, there's a slight difference with your definition. In this case the definition includes that $c$ must be in the domain. Therefore both continuous and discontinuous are not defined at a point $c$ that is not in the domain of the function.
Since you did not include the domain-condition in your definition, we must assume that not-zeroed-at-one means that either $f(1)$ is undefined, or $f(1)ne 0$ as JDMan already pointed out.
Edit: There is a certain abuse of definition where discontinuity is concerned when talking about a removable discontinuity.
The term removable discontinuity is an abuse of terminology for cases in which the limits in both directions exist and are equal, while the function is undefined at the point $c$. This use is abusive because continuity and discontinuity of a function are concepts defined only for points in the function's domain. Such a point not in the domain is properly named a removable singularity.
Consider the definition of continuity of a function for comparison:
The function $f$ is continuous at some point $c$ of its domain if the limit of $f(x)$, as $x$ approaches $c$ through the domain of $f$, exists and is equal to $f(c)$.
As you can see, there's a slight difference with your definition. In this case the definition includes that $c$ must be in the domain. Therefore both continuous and discontinuous are not defined at a point $c$ that is not in the domain of the function.
Since you did not include the domain-condition in your definition, we must assume that not-zeroed-at-one means that either $f(1)$ is undefined, or $f(1)ne 0$ as JDMan already pointed out.
Edit: There is a certain abuse of definition where discontinuity is concerned when talking about a removable discontinuity.
The term removable discontinuity is an abuse of terminology for cases in which the limits in both directions exist and are equal, while the function is undefined at the point $c$. This use is abusive because continuity and discontinuity of a function are concepts defined only for points in the function's domain. Such a point not in the domain is properly named a removable singularity.
edited Nov 28 at 23:29
answered Nov 28 at 20:14
I like Serena
3,6571718
3,6571718
Continuity is one of the actual examples I had in mind. This leads to the problem where a function like $f(x)=frac1{x^2}$ or a constant function will a hole punched out at $0$ are then neither continuous nor discontinuous at $x=0$, but many books will say they are discontinuous there. Of course, they don't address the fact that $sqrt x$ is then discontinuous at all negative numbers.
– jdods
Nov 28 at 20:38
1
I've extended my answer to address what is called a removable discontinuity @jdods.
– I like Serena
Nov 28 at 23:30
Neat, I hadn't heard it phrased as removable singularity before, but that is so much more palatable! I supposed a removable discontinuity is only for the case where the function is already defined there.
– jdods
Nov 28 at 23:56
add a comment |
Continuity is one of the actual examples I had in mind. This leads to the problem where a function like $f(x)=frac1{x^2}$ or a constant function will a hole punched out at $0$ are then neither continuous nor discontinuous at $x=0$, but many books will say they are discontinuous there. Of course, they don't address the fact that $sqrt x$ is then discontinuous at all negative numbers.
– jdods
Nov 28 at 20:38
1
I've extended my answer to address what is called a removable discontinuity @jdods.
– I like Serena
Nov 28 at 23:30
Neat, I hadn't heard it phrased as removable singularity before, but that is so much more palatable! I supposed a removable discontinuity is only for the case where the function is already defined there.
– jdods
Nov 28 at 23:56
Continuity is one of the actual examples I had in mind. This leads to the problem where a function like $f(x)=frac1{x^2}$ or a constant function will a hole punched out at $0$ are then neither continuous nor discontinuous at $x=0$, but many books will say they are discontinuous there. Of course, they don't address the fact that $sqrt x$ is then discontinuous at all negative numbers.
– jdods
Nov 28 at 20:38
Continuity is one of the actual examples I had in mind. This leads to the problem where a function like $f(x)=frac1{x^2}$ or a constant function will a hole punched out at $0$ are then neither continuous nor discontinuous at $x=0$, but many books will say they are discontinuous there. Of course, they don't address the fact that $sqrt x$ is then discontinuous at all negative numbers.
– jdods
Nov 28 at 20:38
1
1
I've extended my answer to address what is called a removable discontinuity @jdods.
– I like Serena
Nov 28 at 23:30
I've extended my answer to address what is called a removable discontinuity @jdods.
– I like Serena
Nov 28 at 23:30
Neat, I hadn't heard it phrased as removable singularity before, but that is so much more palatable! I supposed a removable discontinuity is only for the case where the function is already defined there.
– jdods
Nov 28 at 23:56
Neat, I hadn't heard it phrased as removable singularity before, but that is so much more palatable! I supposed a removable discontinuity is only for the case where the function is already defined there.
– jdods
Nov 28 at 23:56
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.
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.
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%2f3017606%2fevaluating-a-proposition-that-is-empty%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
Yes, definitions introduce equivalences, but are traditionally formulated with "if" only.
– Hagen von Eitzen
Nov 28 at 19:54