Relation between primeness and co-primeness of integersRelation between residues and primitive roots modulo...

Define, (actually define) the "stability" and "energy" of a compound

Meaning of "SEVERA INDEOVI VAS" from 3rd Century slab

Why did it take so long to abandon sail after steamships were demonstrated?

Making a sword in the stone, in a medieval world without magic

How to answer questions about my characters?

How to make healing in an exploration game interesting

Why are there 40 737 Max planes in flight when they have been grounded as not airworthy?

Why are the outputs of printf and std::cout different

How do I interpret this "sky cover" chart?

It's a yearly task, alright

Unreachable code, but reachable with exception

When do we add an hyphen (-) to a complex adjective word?

What are some nice/clever ways to introduce the tonic's dominant seventh chord?

Possible Leak In Concrete

Instead of Universal Basic Income, why not Universal Basic NEEDS?

Sword in the Stone story where the sword was held in place by electromagnets

How do I hide Chekhov's Gun?

How could a female member of a species produce eggs unto death?

Does this property of comaximal ideals always holds?

Latest web browser compatible with Windows 98

Distribution of Maximum Likelihood Estimator

Make a transparent 448*448 image

Is it possible that AIC = BIC?

How to write cleanly even if my character uses expletive language?



Relation between primeness and co-primeness of integers


Relation between residues and primitive roots modulo $p$Interesting pairs of properties and relations in ring theoryTriangle Requirements based of triangle InequalityIs there a logic of sufficiency? Or goals?Using rules of inference (Leibniz) to prove theorems.Complicated FOL Formula {∃a,c(a≠c) ∧ ∀a,c[(a≠c)⇒(h(a,c)⟺ ¬h(c,a))] ∧ ∀a,c[h(a,c) ⇒ ∃b(h(a,b)∧h(b,c)∧b≠c)]} ⇒ ¬{∃a∀b[b≠a⇒ h(a,b)]}What is the method to solve these kind of questions?True Sentence in Calculus of Classes: Individual Domain and CardinalityShow $alpha leftrightarrow psi$ is a tautology if and only if $alpha approx psi$How to prove axiom of pairs from power set axiom and replacement?Prove or give counter example: $forall x exists y(Q(y)wedge P(x))vDash exists yforall x(Q(y)wedge P(x))$Interesting pairs of properties and relations in ring theory













7












$begingroup$


I wonder what this stunning formal analogy between the definitions of being co-prime (for two integers) and being prime (for one integer) might reveal – and how:




$alpha, beta$ are co-prime iff



$$(forall x) alpha|x wedge beta|x leftrightarrow alphabeta|x$$



$alpha$ is prime iff



$$(forall xy) alpha|x vee alpha|y leftrightarrow alpha|xy$$




Note that and how the two definitions are equivalent modulo swapping




  • $wedge$ and $vee$ on the left side


  • constants and variables on the right side together with


  • the direction of divisibility $|$ with respect to the product [thanks to user Wojowu]


  • the direction of inference $rightarrow$ [thanks to user Roll up and smoke Adjoint]











share|cite|improve this question











$endgroup$








  • 1




    $begingroup$
    Note you also swap the direction of divisibility. This is an interesting observation, but I don't think there is any "stunning" meaning behind it.
    $endgroup$
    – Wojowu
    Nov 2 '18 at 19:28










  • $begingroup$
    Note that you can also replace $rightarrow$ with $leftrightarrow$ since each of those propositions on either side are in isomorphism with one another.
    $endgroup$
    – BananaCats
    Nov 3 '18 at 3:29












  • $begingroup$
    There is most likely a nice interpretation in the language of lattices/filters.
    $endgroup$
    – Slade
    Nov 3 '18 at 9:05










  • $begingroup$
    In the poset category for integers dividing one another $text{Hom}(X,Y)$ consists of a single point or is empty. Let $(X mid Y)$ denote the nonempty hom-set. Notice that multiplication by an element $alpha in Bbb{Z}$ is a functor from the poset category to itself since $(X mid Y) implies (alpha X mid alpha Y)$ and so on proves the functoriality of multiplication.
    $endgroup$
    – BananaCats
    Nov 4 '18 at 6:34


















7












$begingroup$


I wonder what this stunning formal analogy between the definitions of being co-prime (for two integers) and being prime (for one integer) might reveal – and how:




$alpha, beta$ are co-prime iff



$$(forall x) alpha|x wedge beta|x leftrightarrow alphabeta|x$$



$alpha$ is prime iff



$$(forall xy) alpha|x vee alpha|y leftrightarrow alpha|xy$$




Note that and how the two definitions are equivalent modulo swapping




  • $wedge$ and $vee$ on the left side


  • constants and variables on the right side together with


  • the direction of divisibility $|$ with respect to the product [thanks to user Wojowu]


  • the direction of inference $rightarrow$ [thanks to user Roll up and smoke Adjoint]











share|cite|improve this question











$endgroup$








  • 1




    $begingroup$
    Note you also swap the direction of divisibility. This is an interesting observation, but I don't think there is any "stunning" meaning behind it.
    $endgroup$
    – Wojowu
    Nov 2 '18 at 19:28










  • $begingroup$
    Note that you can also replace $rightarrow$ with $leftrightarrow$ since each of those propositions on either side are in isomorphism with one another.
    $endgroup$
    – BananaCats
    Nov 3 '18 at 3:29












  • $begingroup$
    There is most likely a nice interpretation in the language of lattices/filters.
    $endgroup$
    – Slade
    Nov 3 '18 at 9:05










  • $begingroup$
    In the poset category for integers dividing one another $text{Hom}(X,Y)$ consists of a single point or is empty. Let $(X mid Y)$ denote the nonempty hom-set. Notice that multiplication by an element $alpha in Bbb{Z}$ is a functor from the poset category to itself since $(X mid Y) implies (alpha X mid alpha Y)$ and so on proves the functoriality of multiplication.
    $endgroup$
    – BananaCats
    Nov 4 '18 at 6:34
















7












7








7


4



$begingroup$


I wonder what this stunning formal analogy between the definitions of being co-prime (for two integers) and being prime (for one integer) might reveal – and how:




$alpha, beta$ are co-prime iff



$$(forall x) alpha|x wedge beta|x leftrightarrow alphabeta|x$$



$alpha$ is prime iff



$$(forall xy) alpha|x vee alpha|y leftrightarrow alpha|xy$$




Note that and how the two definitions are equivalent modulo swapping




  • $wedge$ and $vee$ on the left side


  • constants and variables on the right side together with


  • the direction of divisibility $|$ with respect to the product [thanks to user Wojowu]


  • the direction of inference $rightarrow$ [thanks to user Roll up and smoke Adjoint]











share|cite|improve this question











$endgroup$




I wonder what this stunning formal analogy between the definitions of being co-prime (for two integers) and being prime (for one integer) might reveal – and how:




$alpha, beta$ are co-prime iff



$$(forall x) alpha|x wedge beta|x leftrightarrow alphabeta|x$$



$alpha$ is prime iff



$$(forall xy) alpha|x vee alpha|y leftrightarrow alpha|xy$$




Note that and how the two definitions are equivalent modulo swapping




  • $wedge$ and $vee$ on the left side


  • constants and variables on the right side together with


  • the direction of divisibility $|$ with respect to the product [thanks to user Wojowu]


  • the direction of inference $rightarrow$ [thanks to user Roll up and smoke Adjoint]








number-theory logic prime-numbers integers coprime






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Nov 3 '18 at 9:18







Hans Stricker

















asked Nov 2 '18 at 19:10









Hans StrickerHans Stricker

6,47943994




6,47943994








  • 1




    $begingroup$
    Note you also swap the direction of divisibility. This is an interesting observation, but I don't think there is any "stunning" meaning behind it.
    $endgroup$
    – Wojowu
    Nov 2 '18 at 19:28










  • $begingroup$
    Note that you can also replace $rightarrow$ with $leftrightarrow$ since each of those propositions on either side are in isomorphism with one another.
    $endgroup$
    – BananaCats
    Nov 3 '18 at 3:29












  • $begingroup$
    There is most likely a nice interpretation in the language of lattices/filters.
    $endgroup$
    – Slade
    Nov 3 '18 at 9:05










  • $begingroup$
    In the poset category for integers dividing one another $text{Hom}(X,Y)$ consists of a single point or is empty. Let $(X mid Y)$ denote the nonempty hom-set. Notice that multiplication by an element $alpha in Bbb{Z}$ is a functor from the poset category to itself since $(X mid Y) implies (alpha X mid alpha Y)$ and so on proves the functoriality of multiplication.
    $endgroup$
    – BananaCats
    Nov 4 '18 at 6:34
















  • 1




    $begingroup$
    Note you also swap the direction of divisibility. This is an interesting observation, but I don't think there is any "stunning" meaning behind it.
    $endgroup$
    – Wojowu
    Nov 2 '18 at 19:28










  • $begingroup$
    Note that you can also replace $rightarrow$ with $leftrightarrow$ since each of those propositions on either side are in isomorphism with one another.
    $endgroup$
    – BananaCats
    Nov 3 '18 at 3:29












  • $begingroup$
    There is most likely a nice interpretation in the language of lattices/filters.
    $endgroup$
    – Slade
    Nov 3 '18 at 9:05










  • $begingroup$
    In the poset category for integers dividing one another $text{Hom}(X,Y)$ consists of a single point or is empty. Let $(X mid Y)$ denote the nonempty hom-set. Notice that multiplication by an element $alpha in Bbb{Z}$ is a functor from the poset category to itself since $(X mid Y) implies (alpha X mid alpha Y)$ and so on proves the functoriality of multiplication.
    $endgroup$
    – BananaCats
    Nov 4 '18 at 6:34










1




1




$begingroup$
Note you also swap the direction of divisibility. This is an interesting observation, but I don't think there is any "stunning" meaning behind it.
$endgroup$
– Wojowu
Nov 2 '18 at 19:28




$begingroup$
Note you also swap the direction of divisibility. This is an interesting observation, but I don't think there is any "stunning" meaning behind it.
$endgroup$
– Wojowu
Nov 2 '18 at 19:28












$begingroup$
Note that you can also replace $rightarrow$ with $leftrightarrow$ since each of those propositions on either side are in isomorphism with one another.
$endgroup$
– BananaCats
Nov 3 '18 at 3:29






$begingroup$
Note that you can also replace $rightarrow$ with $leftrightarrow$ since each of those propositions on either side are in isomorphism with one another.
$endgroup$
– BananaCats
Nov 3 '18 at 3:29














$begingroup$
There is most likely a nice interpretation in the language of lattices/filters.
$endgroup$
– Slade
Nov 3 '18 at 9:05




$begingroup$
There is most likely a nice interpretation in the language of lattices/filters.
$endgroup$
– Slade
Nov 3 '18 at 9:05












$begingroup$
In the poset category for integers dividing one another $text{Hom}(X,Y)$ consists of a single point or is empty. Let $(X mid Y)$ denote the nonempty hom-set. Notice that multiplication by an element $alpha in Bbb{Z}$ is a functor from the poset category to itself since $(X mid Y) implies (alpha X mid alpha Y)$ and so on proves the functoriality of multiplication.
$endgroup$
– BananaCats
Nov 4 '18 at 6:34






$begingroup$
In the poset category for integers dividing one another $text{Hom}(X,Y)$ consists of a single point or is empty. Let $(X mid Y)$ denote the nonempty hom-set. Notice that multiplication by an element $alpha in Bbb{Z}$ is a functor from the poset category to itself since $(X mid Y) implies (alpha X mid alpha Y)$ and so on proves the functoriality of multiplication.
$endgroup$
– BananaCats
Nov 4 '18 at 6:34












2 Answers
2






active

oldest

votes


















1












$begingroup$

In the poset category of integers dividing one another we write sometimes write $alpha to x$ instead of $alpha mid x$.



The "product" $alpha beta$ of two coprime objects $alpha, beta$ is such that $alpha to alpha beta leftarrow beta$ and for any object $x$ such that $alpha to x leftarrow beta$ then there is a unique arrow $alpha beta to x$. That is precisely the definition of coproduct in a general category.



Thus when $alpha, beta$ are coprime, then the category definitely has a coproduct for them.



Thus $wedge$ is encoded in the fact that $alpha to x leftarrow beta$, ie. both morphisms exist simultaneously. I believe product is $gcd(alpha, beta)$.





Actually, it turns out that the coproduct exists for any two integers and it's $text{lcm}(alpha, beta)$.





Primality is difficult because of the $vee$. So create a new definition. An arrow into a coproduct is prime when there exists a morphism into at least one of the coproduct's components such tha the relevant triangle commutes.



Notice we used coproduct here which is $text{lcm}(alpha, beta)$ since the definition of prime is equivalent to $p mid text{lcm}(alpha, beta) implies p mid alpha vee p mid beta$.





So take the contrapositive of that. $p nmid alpha wedge p nmid beta implies p nmid text{lcm}(alpha, beta)$.



Form the "negated" poset category of integers not dividing one another. It's formed by mapping each hom-set to $varnothing$ when it's nonempty and vise-versa, so it's not a functor from the original category.






share|cite|improve this answer











$endgroup$





















    0












    $begingroup$

    The second can become:$$(forall xy)alphamid xytoalphamid xloralphamid y$$ The first is: $$(forall x)alphabetanmid x to alphanmid x lor betanmid x lor alphabeta gt xlor(alpha,beta)^2nmid x$$ Not sure it reveals much though.






    share|cite|improve this answer









    $endgroup$













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


      }
      });














      draft saved

      draft discarded


















      StackExchange.ready(
      function () {
      StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2982124%2frelation-between-primeness-and-co-primeness-of-integers%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









      1












      $begingroup$

      In the poset category of integers dividing one another we write sometimes write $alpha to x$ instead of $alpha mid x$.



      The "product" $alpha beta$ of two coprime objects $alpha, beta$ is such that $alpha to alpha beta leftarrow beta$ and for any object $x$ such that $alpha to x leftarrow beta$ then there is a unique arrow $alpha beta to x$. That is precisely the definition of coproduct in a general category.



      Thus when $alpha, beta$ are coprime, then the category definitely has a coproduct for them.



      Thus $wedge$ is encoded in the fact that $alpha to x leftarrow beta$, ie. both morphisms exist simultaneously. I believe product is $gcd(alpha, beta)$.





      Actually, it turns out that the coproduct exists for any two integers and it's $text{lcm}(alpha, beta)$.





      Primality is difficult because of the $vee$. So create a new definition. An arrow into a coproduct is prime when there exists a morphism into at least one of the coproduct's components such tha the relevant triangle commutes.



      Notice we used coproduct here which is $text{lcm}(alpha, beta)$ since the definition of prime is equivalent to $p mid text{lcm}(alpha, beta) implies p mid alpha vee p mid beta$.





      So take the contrapositive of that. $p nmid alpha wedge p nmid beta implies p nmid text{lcm}(alpha, beta)$.



      Form the "negated" poset category of integers not dividing one another. It's formed by mapping each hom-set to $varnothing$ when it's nonempty and vise-versa, so it's not a functor from the original category.






      share|cite|improve this answer











      $endgroup$


















        1












        $begingroup$

        In the poset category of integers dividing one another we write sometimes write $alpha to x$ instead of $alpha mid x$.



        The "product" $alpha beta$ of two coprime objects $alpha, beta$ is such that $alpha to alpha beta leftarrow beta$ and for any object $x$ such that $alpha to x leftarrow beta$ then there is a unique arrow $alpha beta to x$. That is precisely the definition of coproduct in a general category.



        Thus when $alpha, beta$ are coprime, then the category definitely has a coproduct for them.



        Thus $wedge$ is encoded in the fact that $alpha to x leftarrow beta$, ie. both morphisms exist simultaneously. I believe product is $gcd(alpha, beta)$.





        Actually, it turns out that the coproduct exists for any two integers and it's $text{lcm}(alpha, beta)$.





        Primality is difficult because of the $vee$. So create a new definition. An arrow into a coproduct is prime when there exists a morphism into at least one of the coproduct's components such tha the relevant triangle commutes.



        Notice we used coproduct here which is $text{lcm}(alpha, beta)$ since the definition of prime is equivalent to $p mid text{lcm}(alpha, beta) implies p mid alpha vee p mid beta$.





        So take the contrapositive of that. $p nmid alpha wedge p nmid beta implies p nmid text{lcm}(alpha, beta)$.



        Form the "negated" poset category of integers not dividing one another. It's formed by mapping each hom-set to $varnothing$ when it's nonempty and vise-versa, so it's not a functor from the original category.






        share|cite|improve this answer











        $endgroup$
















          1












          1








          1





          $begingroup$

          In the poset category of integers dividing one another we write sometimes write $alpha to x$ instead of $alpha mid x$.



          The "product" $alpha beta$ of two coprime objects $alpha, beta$ is such that $alpha to alpha beta leftarrow beta$ and for any object $x$ such that $alpha to x leftarrow beta$ then there is a unique arrow $alpha beta to x$. That is precisely the definition of coproduct in a general category.



          Thus when $alpha, beta$ are coprime, then the category definitely has a coproduct for them.



          Thus $wedge$ is encoded in the fact that $alpha to x leftarrow beta$, ie. both morphisms exist simultaneously. I believe product is $gcd(alpha, beta)$.





          Actually, it turns out that the coproduct exists for any two integers and it's $text{lcm}(alpha, beta)$.





          Primality is difficult because of the $vee$. So create a new definition. An arrow into a coproduct is prime when there exists a morphism into at least one of the coproduct's components such tha the relevant triangle commutes.



          Notice we used coproduct here which is $text{lcm}(alpha, beta)$ since the definition of prime is equivalent to $p mid text{lcm}(alpha, beta) implies p mid alpha vee p mid beta$.





          So take the contrapositive of that. $p nmid alpha wedge p nmid beta implies p nmid text{lcm}(alpha, beta)$.



          Form the "negated" poset category of integers not dividing one another. It's formed by mapping each hom-set to $varnothing$ when it's nonempty and vise-versa, so it's not a functor from the original category.






          share|cite|improve this answer











          $endgroup$



          In the poset category of integers dividing one another we write sometimes write $alpha to x$ instead of $alpha mid x$.



          The "product" $alpha beta$ of two coprime objects $alpha, beta$ is such that $alpha to alpha beta leftarrow beta$ and for any object $x$ such that $alpha to x leftarrow beta$ then there is a unique arrow $alpha beta to x$. That is precisely the definition of coproduct in a general category.



          Thus when $alpha, beta$ are coprime, then the category definitely has a coproduct for them.



          Thus $wedge$ is encoded in the fact that $alpha to x leftarrow beta$, ie. both morphisms exist simultaneously. I believe product is $gcd(alpha, beta)$.





          Actually, it turns out that the coproduct exists for any two integers and it's $text{lcm}(alpha, beta)$.





          Primality is difficult because of the $vee$. So create a new definition. An arrow into a coproduct is prime when there exists a morphism into at least one of the coproduct's components such tha the relevant triangle commutes.



          Notice we used coproduct here which is $text{lcm}(alpha, beta)$ since the definition of prime is equivalent to $p mid text{lcm}(alpha, beta) implies p mid alpha vee p mid beta$.





          So take the contrapositive of that. $p nmid alpha wedge p nmid beta implies p nmid text{lcm}(alpha, beta)$.



          Form the "negated" poset category of integers not dividing one another. It's formed by mapping each hom-set to $varnothing$ when it's nonempty and vise-versa, so it's not a functor from the original category.







          share|cite|improve this answer














          share|cite|improve this answer



          share|cite|improve this answer








          edited Nov 4 '18 at 7:48

























          answered Nov 4 '18 at 6:52









          BananaCatsBananaCats

          9,26452659




          9,26452659























              0












              $begingroup$

              The second can become:$$(forall xy)alphamid xytoalphamid xloralphamid y$$ The first is: $$(forall x)alphabetanmid x to alphanmid x lor betanmid x lor alphabeta gt xlor(alpha,beta)^2nmid x$$ Not sure it reveals much though.






              share|cite|improve this answer









              $endgroup$


















                0












                $begingroup$

                The second can become:$$(forall xy)alphamid xytoalphamid xloralphamid y$$ The first is: $$(forall x)alphabetanmid x to alphanmid x lor betanmid x lor alphabeta gt xlor(alpha,beta)^2nmid x$$ Not sure it reveals much though.






                share|cite|improve this answer









                $endgroup$
















                  0












                  0








                  0





                  $begingroup$

                  The second can become:$$(forall xy)alphamid xytoalphamid xloralphamid y$$ The first is: $$(forall x)alphabetanmid x to alphanmid x lor betanmid x lor alphabeta gt xlor(alpha,beta)^2nmid x$$ Not sure it reveals much though.






                  share|cite|improve this answer









                  $endgroup$



                  The second can become:$$(forall xy)alphamid xytoalphamid xloralphamid y$$ The first is: $$(forall x)alphabetanmid x to alphanmid x lor betanmid x lor alphabeta gt xlor(alpha,beta)^2nmid x$$ Not sure it reveals much though.







                  share|cite|improve this answer












                  share|cite|improve this answer



                  share|cite|improve this answer










                  answered Mar 10 at 14:00









                  Roddy MacPheeRoddy MacPhee

                  30716




                  30716






























                      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.




                      draft saved


                      draft discarded














                      StackExchange.ready(
                      function () {
                      StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2982124%2frelation-between-primeness-and-co-primeness-of-integers%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

                      Nidaros erkebispedøme

                      Birsay

                      Where did Arya get these scars? Unicorn Meta Zoo #1: Why another podcast? Announcing the arrival of Valued Associate #679: Cesar Manara Favourite questions and answers from the 1st quarter of 2019Why did Arya refuse to end it?Has the pronunciation of Arya Stark's name changed?Has Arya forgiven people?Why did Arya Stark lose her vision?Why can Arya still use the faces?Has the Narrow Sea become narrower?Does Arya Stark know how to make poisons outside of the House of Black and White?Why did Nymeria leave Arya?Why did Arya not kill the Lannister soldiers she encountered in the Riverlands?What is the current canonical age of Sansa, Bran and Arya Stark?