Characterization of the inclusion $a + mathbb N cdot b subseteq bigcup_{i=1}^n c_i + mathbb N cdot d_i$











up vote
1
down vote

favorite
1












Let $a,b,c,d in mathbb N$, where $mathbb N = {0,1,2,ldots}$. Then we have
$$
a + mathbb N cdot b subseteq c + mathbb N cdot d
$$

iff $a - c$ and $b$ are dividable by $d$.



Proof. Suppose we have $a + mathbb N cdot b subseteq c + mathbb N cdot d$, then $a - c in mathbb Ncdot d$, hence $d$ divides $a-c$. Then choose some $n$ not dividable by $d$ and the equality $a - c + ncdot b in mathbb Ncdot d$ implies that $b$ must be dividable by $d$. $square$



So now generalize this in the following manner, if we have $2n$ numbers $c_1, ldots, c_n$ and $d_1,ldots, d_n$. Exactly when do we have
$$
a + mathbb N cdot b subseteq bigcup_{i=1}^n c_i + mathbb N cdot d_i.
$$

and the selection of those numbers is minimal in the sense that if we take some $c_j, d_j$
away, then $a + mathbb Ncdot b$ is no longer in the union of the remaining ones, i.e. every number is mandatory. Is there any easy criterion like the one above in terms of these numbers?










share|cite|improve this question




























    up vote
    1
    down vote

    favorite
    1












    Let $a,b,c,d in mathbb N$, where $mathbb N = {0,1,2,ldots}$. Then we have
    $$
    a + mathbb N cdot b subseteq c + mathbb N cdot d
    $$

    iff $a - c$ and $b$ are dividable by $d$.



    Proof. Suppose we have $a + mathbb N cdot b subseteq c + mathbb N cdot d$, then $a - c in mathbb Ncdot d$, hence $d$ divides $a-c$. Then choose some $n$ not dividable by $d$ and the equality $a - c + ncdot b in mathbb Ncdot d$ implies that $b$ must be dividable by $d$. $square$



    So now generalize this in the following manner, if we have $2n$ numbers $c_1, ldots, c_n$ and $d_1,ldots, d_n$. Exactly when do we have
    $$
    a + mathbb N cdot b subseteq bigcup_{i=1}^n c_i + mathbb N cdot d_i.
    $$

    and the selection of those numbers is minimal in the sense that if we take some $c_j, d_j$
    away, then $a + mathbb Ncdot b$ is no longer in the union of the remaining ones, i.e. every number is mandatory. Is there any easy criterion like the one above in terms of these numbers?










    share|cite|improve this question


























      up vote
      1
      down vote

      favorite
      1









      up vote
      1
      down vote

      favorite
      1






      1





      Let $a,b,c,d in mathbb N$, where $mathbb N = {0,1,2,ldots}$. Then we have
      $$
      a + mathbb N cdot b subseteq c + mathbb N cdot d
      $$

      iff $a - c$ and $b$ are dividable by $d$.



      Proof. Suppose we have $a + mathbb N cdot b subseteq c + mathbb N cdot d$, then $a - c in mathbb Ncdot d$, hence $d$ divides $a-c$. Then choose some $n$ not dividable by $d$ and the equality $a - c + ncdot b in mathbb Ncdot d$ implies that $b$ must be dividable by $d$. $square$



      So now generalize this in the following manner, if we have $2n$ numbers $c_1, ldots, c_n$ and $d_1,ldots, d_n$. Exactly when do we have
      $$
      a + mathbb N cdot b subseteq bigcup_{i=1}^n c_i + mathbb N cdot d_i.
      $$

      and the selection of those numbers is minimal in the sense that if we take some $c_j, d_j$
      away, then $a + mathbb Ncdot b$ is no longer in the union of the remaining ones, i.e. every number is mandatory. Is there any easy criterion like the one above in terms of these numbers?










      share|cite|improve this question















      Let $a,b,c,d in mathbb N$, where $mathbb N = {0,1,2,ldots}$. Then we have
      $$
      a + mathbb N cdot b subseteq c + mathbb N cdot d
      $$

      iff $a - c$ and $b$ are dividable by $d$.



      Proof. Suppose we have $a + mathbb N cdot b subseteq c + mathbb N cdot d$, then $a - c in mathbb Ncdot d$, hence $d$ divides $a-c$. Then choose some $n$ not dividable by $d$ and the equality $a - c + ncdot b in mathbb Ncdot d$ implies that $b$ must be dividable by $d$. $square$



      So now generalize this in the following manner, if we have $2n$ numbers $c_1, ldots, c_n$ and $d_1,ldots, d_n$. Exactly when do we have
      $$
      a + mathbb N cdot b subseteq bigcup_{i=1}^n c_i + mathbb N cdot d_i.
      $$

      and the selection of those numbers is minimal in the sense that if we take some $c_j, d_j$
      away, then $a + mathbb Ncdot b$ is no longer in the union of the remaining ones, i.e. every number is mandatory. Is there any easy criterion like the one above in terms of these numbers?







      abstract-algebra number-theory elementary-set-theory






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Nov 21 at 12:50

























      asked Nov 20 at 15:57









      StefanH

      8,05552161




      8,05552161






















          1 Answer
          1






          active

          oldest

          votes

















          up vote
          1
          down vote













          I don't understand what did you mean with "easy criterion" but when we have $2n$ numbers $c_1, dots, c_n$ and $d_1, dots, d_n$ and $$ a+ mathbb{N}cdot b subseteq cup_{i=1}^{n}c_i+ mathbb{N}cdot d_i$$ and then we add 1 more $(c_{n+1},d_{n+1})$ which doesn't "relate" to $a$ and $b$ but it's still $$ a+ mathbb{N}cdot b subseteq cup_{i=1}^{n+1}c_i+ mathbb{N}cdot d_i$$ It means if you add more $(c,d)$ in the problem then it makes the problem more "weak". I think it will be more accurate when $$ a+ mathbb{N}cdot b subseteq cap_{i=1}^{n}c_i+ mathbb{N}cdot d_i$$






          share|cite|improve this answer





















          • No, I meant union. The elements of $a + mathbb N cdot b$ could be distributed among the sets from the union. Different wording, when is it the case that we can always find some $x = a + nb$ which is not in any of the $c_i + mathbb N cdot d_i$. Concerning your objection, yes they must be "minimal" in the sense that taking one away will destroy the inclusion relation. Thanks for that, I will update my question. Hope that makes more sense then.
            – StefanH
            Nov 21 at 12:48













          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',
          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
          });


          }
          });














          draft saved

          draft discarded


















          StackExchange.ready(
          function () {
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3006493%2fcharacterization-of-the-inclusion-a-mathbb-n-cdot-b-subseteq-bigcup-i-1%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








          up vote
          1
          down vote













          I don't understand what did you mean with "easy criterion" but when we have $2n$ numbers $c_1, dots, c_n$ and $d_1, dots, d_n$ and $$ a+ mathbb{N}cdot b subseteq cup_{i=1}^{n}c_i+ mathbb{N}cdot d_i$$ and then we add 1 more $(c_{n+1},d_{n+1})$ which doesn't "relate" to $a$ and $b$ but it's still $$ a+ mathbb{N}cdot b subseteq cup_{i=1}^{n+1}c_i+ mathbb{N}cdot d_i$$ It means if you add more $(c,d)$ in the problem then it makes the problem more "weak". I think it will be more accurate when $$ a+ mathbb{N}cdot b subseteq cap_{i=1}^{n}c_i+ mathbb{N}cdot d_i$$






          share|cite|improve this answer





















          • No, I meant union. The elements of $a + mathbb N cdot b$ could be distributed among the sets from the union. Different wording, when is it the case that we can always find some $x = a + nb$ which is not in any of the $c_i + mathbb N cdot d_i$. Concerning your objection, yes they must be "minimal" in the sense that taking one away will destroy the inclusion relation. Thanks for that, I will update my question. Hope that makes more sense then.
            – StefanH
            Nov 21 at 12:48

















          up vote
          1
          down vote













          I don't understand what did you mean with "easy criterion" but when we have $2n$ numbers $c_1, dots, c_n$ and $d_1, dots, d_n$ and $$ a+ mathbb{N}cdot b subseteq cup_{i=1}^{n}c_i+ mathbb{N}cdot d_i$$ and then we add 1 more $(c_{n+1},d_{n+1})$ which doesn't "relate" to $a$ and $b$ but it's still $$ a+ mathbb{N}cdot b subseteq cup_{i=1}^{n+1}c_i+ mathbb{N}cdot d_i$$ It means if you add more $(c,d)$ in the problem then it makes the problem more "weak". I think it will be more accurate when $$ a+ mathbb{N}cdot b subseteq cap_{i=1}^{n}c_i+ mathbb{N}cdot d_i$$






          share|cite|improve this answer





















          • No, I meant union. The elements of $a + mathbb N cdot b$ could be distributed among the sets from the union. Different wording, when is it the case that we can always find some $x = a + nb$ which is not in any of the $c_i + mathbb N cdot d_i$. Concerning your objection, yes they must be "minimal" in the sense that taking one away will destroy the inclusion relation. Thanks for that, I will update my question. Hope that makes more sense then.
            – StefanH
            Nov 21 at 12:48















          up vote
          1
          down vote










          up vote
          1
          down vote









          I don't understand what did you mean with "easy criterion" but when we have $2n$ numbers $c_1, dots, c_n$ and $d_1, dots, d_n$ and $$ a+ mathbb{N}cdot b subseteq cup_{i=1}^{n}c_i+ mathbb{N}cdot d_i$$ and then we add 1 more $(c_{n+1},d_{n+1})$ which doesn't "relate" to $a$ and $b$ but it's still $$ a+ mathbb{N}cdot b subseteq cup_{i=1}^{n+1}c_i+ mathbb{N}cdot d_i$$ It means if you add more $(c,d)$ in the problem then it makes the problem more "weak". I think it will be more accurate when $$ a+ mathbb{N}cdot b subseteq cap_{i=1}^{n}c_i+ mathbb{N}cdot d_i$$






          share|cite|improve this answer












          I don't understand what did you mean with "easy criterion" but when we have $2n$ numbers $c_1, dots, c_n$ and $d_1, dots, d_n$ and $$ a+ mathbb{N}cdot b subseteq cup_{i=1}^{n}c_i+ mathbb{N}cdot d_i$$ and then we add 1 more $(c_{n+1},d_{n+1})$ which doesn't "relate" to $a$ and $b$ but it's still $$ a+ mathbb{N}cdot b subseteq cup_{i=1}^{n+1}c_i+ mathbb{N}cdot d_i$$ It means if you add more $(c,d)$ in the problem then it makes the problem more "weak". I think it will be more accurate when $$ a+ mathbb{N}cdot b subseteq cap_{i=1}^{n}c_i+ mathbb{N}cdot d_i$$







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered Nov 21 at 10:02









          Tung N. Dinh

          111




          111












          • No, I meant union. The elements of $a + mathbb N cdot b$ could be distributed among the sets from the union. Different wording, when is it the case that we can always find some $x = a + nb$ which is not in any of the $c_i + mathbb N cdot d_i$. Concerning your objection, yes they must be "minimal" in the sense that taking one away will destroy the inclusion relation. Thanks for that, I will update my question. Hope that makes more sense then.
            – StefanH
            Nov 21 at 12:48




















          • No, I meant union. The elements of $a + mathbb N cdot b$ could be distributed among the sets from the union. Different wording, when is it the case that we can always find some $x = a + nb$ which is not in any of the $c_i + mathbb N cdot d_i$. Concerning your objection, yes they must be "minimal" in the sense that taking one away will destroy the inclusion relation. Thanks for that, I will update my question. Hope that makes more sense then.
            – StefanH
            Nov 21 at 12:48


















          No, I meant union. The elements of $a + mathbb N cdot b$ could be distributed among the sets from the union. Different wording, when is it the case that we can always find some $x = a + nb$ which is not in any of the $c_i + mathbb N cdot d_i$. Concerning your objection, yes they must be "minimal" in the sense that taking one away will destroy the inclusion relation. Thanks for that, I will update my question. Hope that makes more sense then.
          – StefanH
          Nov 21 at 12:48






          No, I meant union. The elements of $a + mathbb N cdot b$ could be distributed among the sets from the union. Different wording, when is it the case that we can always find some $x = a + nb$ which is not in any of the $c_i + mathbb N cdot d_i$. Concerning your objection, yes they must be "minimal" in the sense that taking one away will destroy the inclusion relation. Thanks for that, I will update my question. Hope that makes more sense then.
          – StefanH
          Nov 21 at 12:48




















          draft saved

          draft discarded




















































          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.




          draft saved


          draft discarded














          StackExchange.ready(
          function () {
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3006493%2fcharacterization-of-the-inclusion-a-mathbb-n-cdot-b-subseteq-bigcup-i-1%23new-answer', 'question_page');
          }
          );

          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







          Popular posts from this blog

          Plaza Victoria

          Puebla de Zaragoza

          Musa