mutually exclusive sets closed under addition The 2019 Stack Overflow Developer Survey Results Are In Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 17/18, 2019 at 00:00UTC (8:00pm US/Eastern)Closed under finite union and Closed under countable unionRelation: pairwise and mutuallyThe set of all natural numbers is closed under additionSuppose that $F : X longrightarrow Y$ is a function and $A$, $B$ are subsets of $Y$. Prove or disprove the following:If two sets (including A) are mutually exclusive, then A is the union of the sets.Sets of real numbers closed under additionWhat are the general forms of mutually prime numbers?Proving we can partition $Bbb R^+$ into two sets which are closed under addition and Zorn's lemmaMutually exclusive probabilitiesDoes closed under unions of chains imply closed under unions of upward directed families of sets?
What is the padding with red substance inside of steak packaging?
Is there a way to generate uniformly distributed points on a sphere from a fixed amount of random real numbers per point?
What force causes entropy to increase?
Would an alien lifeform be able to achieve space travel if lacking in vision?
Can we generate random numbers using irrational numbers like π and e?
My body leaves; my core can stay
Was credit for the black hole image misappropriated?
Intergalactic human space ship encounters another ship, character gets shunted off beyond known universe, reality starts collapsing
Are there continuous functions who are the same in an interval but differ in at least one other point?
Example of compact Riemannian manifold with only one geodesic.
One-dimensional Japanese puzzle
"... to apply for a visa" or "... and applied for a visa"?
Can a flute soloist sit?
What do I do when my TA workload is more than expected?
How do I design a circuit to convert a 100 mV and 50 Hz sine wave to a square wave?
Does Parliament hold absolute power in the UK?
Do I have Disadvantage attacking with an off-hand weapon?
Working through the single responsibility principle (SRP) in Python when calls are expensive
Is an up-to-date browser secure on an out-of-date OS?
Mortgage adviser recommends a longer term than necessary combined with overpayments
Huge performance difference of the command find with and without using %M option to show permissions
Do ℕ, mathbbN, BbbN, symbbN effectively differ, and is there a "canonical" specification of the naturals?
Is it ok to offer lower paid work as a trial period before negotiating for a full-time job?
What happens to a Warlock's expended Spell Slots when they gain a Level?
mutually exclusive sets closed under addition
The 2019 Stack Overflow Developer Survey Results Are In
Announcing the arrival of Valued Associate #679: Cesar Manara
Planned maintenance scheduled April 17/18, 2019 at 00:00UTC (8:00pm US/Eastern)Closed under finite union and Closed under countable unionRelation: pairwise and mutuallyThe set of all natural numbers is closed under additionSuppose that $F : X longrightarrow Y$ is a function and $A$, $B$ are subsets of $Y$. Prove or disprove the following:If two sets (including A) are mutually exclusive, then A is the union of the sets.Sets of real numbers closed under additionWhat are the general forms of mutually prime numbers?Proving we can partition $Bbb R^+$ into two sets which are closed under addition and Zorn's lemmaMutually exclusive probabilitiesDoes closed under unions of chains imply closed under unions of upward directed families of sets?
$begingroup$
I was wondering if it is possible to find, or prove the existence of two sets S and S', both subsets of the natural numbers, that are mutually exclusive and respectively closed under addition. An example would be the trivial solution 0, and all other numbers that are not zero. These sets are mutually exclusive and closed under addition.
Can anyone prove the existence/provide an example of/ disprove the existence of two nontrivial, mutually exclusive subsets of the natural numbers, or lead me to resources that help me further my knowledge?
Thanks!
elementary-set-theory arithmetic
$endgroup$
add a comment |
$begingroup$
I was wondering if it is possible to find, or prove the existence of two sets S and S', both subsets of the natural numbers, that are mutually exclusive and respectively closed under addition. An example would be the trivial solution 0, and all other numbers that are not zero. These sets are mutually exclusive and closed under addition.
Can anyone prove the existence/provide an example of/ disprove the existence of two nontrivial, mutually exclusive subsets of the natural numbers, or lead me to resources that help me further my knowledge?
Thanks!
elementary-set-theory arithmetic
$endgroup$
$begingroup$
Hint: Assume $S$ contains a positive integer $m$ and $S'$ contains a positive integer $n$. Show that (using closure under addition) $S$ and $S'$ have a common element.
$endgroup$
– hardmath
Mar 24 at 17:38
$begingroup$
@MauroALLEGRANZA: The problem does not require that $1$ belongs to either $S$ or $S'$.
$endgroup$
– hardmath
Mar 24 at 17:39
$begingroup$
@hardmath I had considered letting the sets be multiples of two relatively prime numbers a and b respectively, only to realize that ab belongs to both sets. Now I see, thanks to the answer how to generalize this to all possible sets. Thanks!
$endgroup$
– Confused Soul
Mar 24 at 17:52
$begingroup$
If you don't explicitly exclude the empty set, then the problem is trivial. Currenly you have not excluded this case.
$endgroup$
– Somos
Mar 24 at 19:02
$begingroup$
I did not exclude trivial cases in the problems. However the question explicitly ("nontrivial mutually exclusive") asks for nontrivial solutions to the problem. I hope this clarifies
$endgroup$
– Confused Soul
Mar 24 at 19:06
add a comment |
$begingroup$
I was wondering if it is possible to find, or prove the existence of two sets S and S', both subsets of the natural numbers, that are mutually exclusive and respectively closed under addition. An example would be the trivial solution 0, and all other numbers that are not zero. These sets are mutually exclusive and closed under addition.
Can anyone prove the existence/provide an example of/ disprove the existence of two nontrivial, mutually exclusive subsets of the natural numbers, or lead me to resources that help me further my knowledge?
Thanks!
elementary-set-theory arithmetic
$endgroup$
I was wondering if it is possible to find, or prove the existence of two sets S and S', both subsets of the natural numbers, that are mutually exclusive and respectively closed under addition. An example would be the trivial solution 0, and all other numbers that are not zero. These sets are mutually exclusive and closed under addition.
Can anyone prove the existence/provide an example of/ disprove the existence of two nontrivial, mutually exclusive subsets of the natural numbers, or lead me to resources that help me further my knowledge?
Thanks!
elementary-set-theory arithmetic
elementary-set-theory arithmetic
asked Mar 24 at 17:34
Confused SoulConfused Soul
1084
1084
$begingroup$
Hint: Assume $S$ contains a positive integer $m$ and $S'$ contains a positive integer $n$. Show that (using closure under addition) $S$ and $S'$ have a common element.
$endgroup$
– hardmath
Mar 24 at 17:38
$begingroup$
@MauroALLEGRANZA: The problem does not require that $1$ belongs to either $S$ or $S'$.
$endgroup$
– hardmath
Mar 24 at 17:39
$begingroup$
@hardmath I had considered letting the sets be multiples of two relatively prime numbers a and b respectively, only to realize that ab belongs to both sets. Now I see, thanks to the answer how to generalize this to all possible sets. Thanks!
$endgroup$
– Confused Soul
Mar 24 at 17:52
$begingroup$
If you don't explicitly exclude the empty set, then the problem is trivial. Currenly you have not excluded this case.
$endgroup$
– Somos
Mar 24 at 19:02
$begingroup$
I did not exclude trivial cases in the problems. However the question explicitly ("nontrivial mutually exclusive") asks for nontrivial solutions to the problem. I hope this clarifies
$endgroup$
– Confused Soul
Mar 24 at 19:06
add a comment |
$begingroup$
Hint: Assume $S$ contains a positive integer $m$ and $S'$ contains a positive integer $n$. Show that (using closure under addition) $S$ and $S'$ have a common element.
$endgroup$
– hardmath
Mar 24 at 17:38
$begingroup$
@MauroALLEGRANZA: The problem does not require that $1$ belongs to either $S$ or $S'$.
$endgroup$
– hardmath
Mar 24 at 17:39
$begingroup$
@hardmath I had considered letting the sets be multiples of two relatively prime numbers a and b respectively, only to realize that ab belongs to both sets. Now I see, thanks to the answer how to generalize this to all possible sets. Thanks!
$endgroup$
– Confused Soul
Mar 24 at 17:52
$begingroup$
If you don't explicitly exclude the empty set, then the problem is trivial. Currenly you have not excluded this case.
$endgroup$
– Somos
Mar 24 at 19:02
$begingroup$
I did not exclude trivial cases in the problems. However the question explicitly ("nontrivial mutually exclusive") asks for nontrivial solutions to the problem. I hope this clarifies
$endgroup$
– Confused Soul
Mar 24 at 19:06
$begingroup$
Hint: Assume $S$ contains a positive integer $m$ and $S'$ contains a positive integer $n$. Show that (using closure under addition) $S$ and $S'$ have a common element.
$endgroup$
– hardmath
Mar 24 at 17:38
$begingroup$
Hint: Assume $S$ contains a positive integer $m$ and $S'$ contains a positive integer $n$. Show that (using closure under addition) $S$ and $S'$ have a common element.
$endgroup$
– hardmath
Mar 24 at 17:38
$begingroup$
@MauroALLEGRANZA: The problem does not require that $1$ belongs to either $S$ or $S'$.
$endgroup$
– hardmath
Mar 24 at 17:39
$begingroup$
@MauroALLEGRANZA: The problem does not require that $1$ belongs to either $S$ or $S'$.
$endgroup$
– hardmath
Mar 24 at 17:39
$begingroup$
@hardmath I had considered letting the sets be multiples of two relatively prime numbers a and b respectively, only to realize that ab belongs to both sets. Now I see, thanks to the answer how to generalize this to all possible sets. Thanks!
$endgroup$
– Confused Soul
Mar 24 at 17:52
$begingroup$
@hardmath I had considered letting the sets be multiples of two relatively prime numbers a and b respectively, only to realize that ab belongs to both sets. Now I see, thanks to the answer how to generalize this to all possible sets. Thanks!
$endgroup$
– Confused Soul
Mar 24 at 17:52
$begingroup$
If you don't explicitly exclude the empty set, then the problem is trivial. Currenly you have not excluded this case.
$endgroup$
– Somos
Mar 24 at 19:02
$begingroup$
If you don't explicitly exclude the empty set, then the problem is trivial. Currenly you have not excluded this case.
$endgroup$
– Somos
Mar 24 at 19:02
$begingroup$
I did not exclude trivial cases in the problems. However the question explicitly ("nontrivial mutually exclusive") asks for nontrivial solutions to the problem. I hope this clarifies
$endgroup$
– Confused Soul
Mar 24 at 19:06
$begingroup$
I did not exclude trivial cases in the problems. However the question explicitly ("nontrivial mutually exclusive") asks for nontrivial solutions to the problem. I hope this clarifies
$endgroup$
– Confused Soul
Mar 24 at 19:06
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Assuming that both subset don't have $0$. Because the two subsets $S_1,S_2$ are closed under addition, we have that they contain all products of their minimal elements. Let $a$ be the smallest element in $S_1$ and $b$ be the smallest element in $S_2$ then $aN=a,2a,3a... subset S_1$ and $bN=b,2b,3b,... subset S_2$. So then $S_1,S_2$ must both have $ab$.
$endgroup$
add a comment |
Your Answer
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%2f3160812%2fmutually-exclusive-sets-closed-under-addition%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
$begingroup$
Assuming that both subset don't have $0$. Because the two subsets $S_1,S_2$ are closed under addition, we have that they contain all products of their minimal elements. Let $a$ be the smallest element in $S_1$ and $b$ be the smallest element in $S_2$ then $aN=a,2a,3a... subset S_1$ and $bN=b,2b,3b,... subset S_2$. So then $S_1,S_2$ must both have $ab$.
$endgroup$
add a comment |
$begingroup$
Assuming that both subset don't have $0$. Because the two subsets $S_1,S_2$ are closed under addition, we have that they contain all products of their minimal elements. Let $a$ be the smallest element in $S_1$ and $b$ be the smallest element in $S_2$ then $aN=a,2a,3a... subset S_1$ and $bN=b,2b,3b,... subset S_2$. So then $S_1,S_2$ must both have $ab$.
$endgroup$
add a comment |
$begingroup$
Assuming that both subset don't have $0$. Because the two subsets $S_1,S_2$ are closed under addition, we have that they contain all products of their minimal elements. Let $a$ be the smallest element in $S_1$ and $b$ be the smallest element in $S_2$ then $aN=a,2a,3a... subset S_1$ and $bN=b,2b,3b,... subset S_2$. So then $S_1,S_2$ must both have $ab$.
$endgroup$
Assuming that both subset don't have $0$. Because the two subsets $S_1,S_2$ are closed under addition, we have that they contain all products of their minimal elements. Let $a$ be the smallest element in $S_1$ and $b$ be the smallest element in $S_2$ then $aN=a,2a,3a... subset S_1$ and $bN=b,2b,3b,... subset S_2$. So then $S_1,S_2$ must both have $ab$.
answered Mar 24 at 17:42
mathpadawanmathpadawan
2,021422
2,021422
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%2f3160812%2fmutually-exclusive-sets-closed-under-addition%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$
Hint: Assume $S$ contains a positive integer $m$ and $S'$ contains a positive integer $n$. Show that (using closure under addition) $S$ and $S'$ have a common element.
$endgroup$
– hardmath
Mar 24 at 17:38
$begingroup$
@MauroALLEGRANZA: The problem does not require that $1$ belongs to either $S$ or $S'$.
$endgroup$
– hardmath
Mar 24 at 17:39
$begingroup$
@hardmath I had considered letting the sets be multiples of two relatively prime numbers a and b respectively, only to realize that ab belongs to both sets. Now I see, thanks to the answer how to generalize this to all possible sets. Thanks!
$endgroup$
– Confused Soul
Mar 24 at 17:52
$begingroup$
If you don't explicitly exclude the empty set, then the problem is trivial. Currenly you have not excluded this case.
$endgroup$
– Somos
Mar 24 at 19:02
$begingroup$
I did not exclude trivial cases in the problems. However the question explicitly ("nontrivial mutually exclusive") asks for nontrivial solutions to the problem. I hope this clarifies
$endgroup$
– Confused Soul
Mar 24 at 19:06