Dedekind cut for 1/x
I’m kind of new to this concept and trying to get my head over it.
How do you construct a dedekind cut for $frac{1}{x}$ where $x$ is a positive real number?
elementary-number-theory
add a comment |
I’m kind of new to this concept and trying to get my head over it.
How do you construct a dedekind cut for $frac{1}{x}$ where $x$ is a positive real number?
elementary-number-theory
add a comment |
I’m kind of new to this concept and trying to get my head over it.
How do you construct a dedekind cut for $frac{1}{x}$ where $x$ is a positive real number?
elementary-number-theory
I’m kind of new to this concept and trying to get my head over it.
How do you construct a dedekind cut for $frac{1}{x}$ where $x$ is a positive real number?
elementary-number-theory
elementary-number-theory
asked Nov 27 '18 at 21:54
sdkvsdkv
31
31
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$newcommand{Q}{mathbb{Q}}$ A Dedekind cut is a partition of $Q$ satisfying certain additional nice properties. So, one way you could do this (somewhat trivially) is by taking $A = {a in Q mid a < frac{1}{x} }$ and $B = {b in Q mid b geq frac{1}{x} }$. Of course, this relies on the assumption that you already have $x$ defined.
Okay, I think I get this! But what if I have a DC for x (something like $S= { r in mathbb{Q} |r<x }$, I guess?) and then try to construct a DC using $S$? I thought of something like $S'= { r in mathbb{Q} |rle 0$ or $frac{1}{r}<frac{1}{x}}$ but I'm not sure whether it works
– sdkv
Nov 28 '18 at 7:00
Sure, if you wanted to use $S$, I think $S' = { r in mathbb{Q} mid r leq 0 text{ or } forall s in S, s > 0 implies r < frac{1}{s}}$ should work.
– platty
Nov 28 '18 at 7:08
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%2f3016351%2fdedekind-cut-for-1-x%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$newcommand{Q}{mathbb{Q}}$ A Dedekind cut is a partition of $Q$ satisfying certain additional nice properties. So, one way you could do this (somewhat trivially) is by taking $A = {a in Q mid a < frac{1}{x} }$ and $B = {b in Q mid b geq frac{1}{x} }$. Of course, this relies on the assumption that you already have $x$ defined.
Okay, I think I get this! But what if I have a DC for x (something like $S= { r in mathbb{Q} |r<x }$, I guess?) and then try to construct a DC using $S$? I thought of something like $S'= { r in mathbb{Q} |rle 0$ or $frac{1}{r}<frac{1}{x}}$ but I'm not sure whether it works
– sdkv
Nov 28 '18 at 7:00
Sure, if you wanted to use $S$, I think $S' = { r in mathbb{Q} mid r leq 0 text{ or } forall s in S, s > 0 implies r < frac{1}{s}}$ should work.
– platty
Nov 28 '18 at 7:08
add a comment |
$newcommand{Q}{mathbb{Q}}$ A Dedekind cut is a partition of $Q$ satisfying certain additional nice properties. So, one way you could do this (somewhat trivially) is by taking $A = {a in Q mid a < frac{1}{x} }$ and $B = {b in Q mid b geq frac{1}{x} }$. Of course, this relies on the assumption that you already have $x$ defined.
Okay, I think I get this! But what if I have a DC for x (something like $S= { r in mathbb{Q} |r<x }$, I guess?) and then try to construct a DC using $S$? I thought of something like $S'= { r in mathbb{Q} |rle 0$ or $frac{1}{r}<frac{1}{x}}$ but I'm not sure whether it works
– sdkv
Nov 28 '18 at 7:00
Sure, if you wanted to use $S$, I think $S' = { r in mathbb{Q} mid r leq 0 text{ or } forall s in S, s > 0 implies r < frac{1}{s}}$ should work.
– platty
Nov 28 '18 at 7:08
add a comment |
$newcommand{Q}{mathbb{Q}}$ A Dedekind cut is a partition of $Q$ satisfying certain additional nice properties. So, one way you could do this (somewhat trivially) is by taking $A = {a in Q mid a < frac{1}{x} }$ and $B = {b in Q mid b geq frac{1}{x} }$. Of course, this relies on the assumption that you already have $x$ defined.
$newcommand{Q}{mathbb{Q}}$ A Dedekind cut is a partition of $Q$ satisfying certain additional nice properties. So, one way you could do this (somewhat trivially) is by taking $A = {a in Q mid a < frac{1}{x} }$ and $B = {b in Q mid b geq frac{1}{x} }$. Of course, this relies on the assumption that you already have $x$ defined.
answered Nov 27 '18 at 22:09
plattyplatty
3,370320
3,370320
Okay, I think I get this! But what if I have a DC for x (something like $S= { r in mathbb{Q} |r<x }$, I guess?) and then try to construct a DC using $S$? I thought of something like $S'= { r in mathbb{Q} |rle 0$ or $frac{1}{r}<frac{1}{x}}$ but I'm not sure whether it works
– sdkv
Nov 28 '18 at 7:00
Sure, if you wanted to use $S$, I think $S' = { r in mathbb{Q} mid r leq 0 text{ or } forall s in S, s > 0 implies r < frac{1}{s}}$ should work.
– platty
Nov 28 '18 at 7:08
add a comment |
Okay, I think I get this! But what if I have a DC for x (something like $S= { r in mathbb{Q} |r<x }$, I guess?) and then try to construct a DC using $S$? I thought of something like $S'= { r in mathbb{Q} |rle 0$ or $frac{1}{r}<frac{1}{x}}$ but I'm not sure whether it works
– sdkv
Nov 28 '18 at 7:00
Sure, if you wanted to use $S$, I think $S' = { r in mathbb{Q} mid r leq 0 text{ or } forall s in S, s > 0 implies r < frac{1}{s}}$ should work.
– platty
Nov 28 '18 at 7:08
Okay, I think I get this! But what if I have a DC for x (something like $S= { r in mathbb{Q} |r<x }$, I guess?) and then try to construct a DC using $S$? I thought of something like $S'= { r in mathbb{Q} |rle 0$ or $frac{1}{r}<frac{1}{x}}$ but I'm not sure whether it works
– sdkv
Nov 28 '18 at 7:00
Okay, I think I get this! But what if I have a DC for x (something like $S= { r in mathbb{Q} |r<x }$, I guess?) and then try to construct a DC using $S$? I thought of something like $S'= { r in mathbb{Q} |rle 0$ or $frac{1}{r}<frac{1}{x}}$ but I'm not sure whether it works
– sdkv
Nov 28 '18 at 7:00
Sure, if you wanted to use $S$, I think $S' = { r in mathbb{Q} mid r leq 0 text{ or } forall s in S, s > 0 implies r < frac{1}{s}}$ should work.
– platty
Nov 28 '18 at 7:08
Sure, if you wanted to use $S$, I think $S' = { r in mathbb{Q} mid r leq 0 text{ or } forall s in S, s > 0 implies r < frac{1}{s}}$ should work.
– platty
Nov 28 '18 at 7:08
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%2f3016351%2fdedekind-cut-for-1-x%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