An independent collection, where the pairwise products are also independent












0












$begingroup$


Can you give me a non-trivial example of a sequence ${X_k}_{k=1}^n$ of independent, and identically distributed random variables, such that, the pairwise products, ${X_kX_{ell}}_{1leq k<ell leq n}$ are all independent?



Of course, if ${k,ell}cap {k',ell'}=varnothing$, we automatically have this, and since $(k,ell)neq {k',ell'}$, it boils down to giving an example where $X_kX_ell$ and $X_kX_{ell'}$ are always independent, whenever $ellneq ell'$ and $ell,ell'neq k$.






probability probability-theory probability-distributions independence conditional-probability







share|cite|improve this question









$endgroup$








  • 1




    $begingroup$
    When you ask for the pairwise products to be independent, do you mean to ask for the pairwise products be jointly independent or only pair-wise independent? Your "boils down" statement makes it sound like the latter.
    $endgroup$
    – kimchi lover
    Dec 5 '18 at 20:44










  • $begingroup$
    kimchi lover, I means pairwise. However, even the other direction seems interesting.
    $endgroup$
    – Aaron
    Dec 5 '18 at 22:35
















0












$begingroup$


Can you give me a non-trivial example of a sequence ${X_k}_{k=1}^n$ of independent, and identically distributed random variables, such that, the pairwise products, ${X_kX_{ell}}_{1leq k<ell leq n}$ are all independent?



Of course, if ${k,ell}cap {k',ell'}=varnothing$, we automatically have this, and since $(k,ell)neq {k',ell'}$, it boils down to giving an example where $X_kX_ell$ and $X_kX_{ell'}$ are always independent, whenever $ellneq ell'$ and $ell,ell'neq k$.






probability probability-theory probability-distributions independence conditional-probability







share|cite|improve this question









$endgroup$








  • 1




    $begingroup$
    When you ask for the pairwise products to be independent, do you mean to ask for the pairwise products be jointly independent or only pair-wise independent? Your "boils down" statement makes it sound like the latter.
    $endgroup$
    – kimchi lover
    Dec 5 '18 at 20:44










  • $begingroup$
    kimchi lover, I means pairwise. However, even the other direction seems interesting.
    $endgroup$
    – Aaron
    Dec 5 '18 at 22:35














0












0








0





$begingroup$


Can you give me a non-trivial example of a sequence ${X_k}_{k=1}^n$ of independent, and identically distributed random variables, such that, the pairwise products, ${X_kX_{ell}}_{1leq k<ell leq n}$ are all independent?



Of course, if ${k,ell}cap {k',ell'}=varnothing$, we automatically have this, and since $(k,ell)neq {k',ell'}$, it boils down to giving an example where $X_kX_ell$ and $X_kX_{ell'}$ are always independent, whenever $ellneq ell'$ and $ell,ell'neq k$.






probability probability-theory probability-distributions independence conditional-probability







share|cite|improve this question









$endgroup$




Can you give me a non-trivial example of a sequence ${X_k}_{k=1}^n$ of independent, and identically distributed random variables, such that, the pairwise products, ${X_kX_{ell}}_{1leq k<ell leq n}$ are all independent?



Of course, if ${k,ell}cap {k',ell'}=varnothing$, we automatically have this, and since $(k,ell)neq {k',ell'}$, it boils down to giving an example where $X_kX_ell$ and $X_kX_{ell'}$ are always independent, whenever $ellneq ell'$ and $ell,ell'neq k$.






probability probability-theory probability-distributions independence conditional-probability




probability probability-theory probability-distributions independence conditional-probability






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Dec 5 '18 at 20:31









AaronAaron

1,828415




1,828415








  • 1




    $begingroup$
    When you ask for the pairwise products to be independent, do you mean to ask for the pairwise products be jointly independent or only pair-wise independent? Your "boils down" statement makes it sound like the latter.
    $endgroup$
    – kimchi lover
    Dec 5 '18 at 20:44










  • $begingroup$
    kimchi lover, I means pairwise. However, even the other direction seems interesting.
    $endgroup$
    – Aaron
    Dec 5 '18 at 22:35














  • 1




    $begingroup$
    When you ask for the pairwise products to be independent, do you mean to ask for the pairwise products be jointly independent or only pair-wise independent? Your "boils down" statement makes it sound like the latter.
    $endgroup$
    – kimchi lover
    Dec 5 '18 at 20:44










  • $begingroup$
    kimchi lover, I means pairwise. However, even the other direction seems interesting.
    $endgroup$
    – Aaron
    Dec 5 '18 at 22:35








1




1




$begingroup$
When you ask for the pairwise products to be independent, do you mean to ask for the pairwise products be jointly independent or only pair-wise independent? Your "boils down" statement makes it sound like the latter.
$endgroup$
– kimchi lover
Dec 5 '18 at 20:44




$begingroup$
When you ask for the pairwise products to be independent, do you mean to ask for the pairwise products be jointly independent or only pair-wise independent? Your "boils down" statement makes it sound like the latter.
$endgroup$
– kimchi lover
Dec 5 '18 at 20:44












$begingroup$
kimchi lover, I means pairwise. However, even the other direction seems interesting.
$endgroup$
– Aaron
Dec 5 '18 at 22:35




$begingroup$
kimchi lover, I means pairwise. However, even the other direction seems interesting.
$endgroup$
– Aaron
Dec 5 '18 at 22:35










2 Answers
2






active

oldest

votes


















0












$begingroup$

I don't know what you mean by non-trivial but consider this example:
$P(X = 1) = P(X = -1) = frac 1 2$



Knowing that the product is -1 or 1 doesn't change the probability for other products. $P(X_i = 1|X_i.X_j = 1) = frac 1 2$ and $P(X_i = -1|X_i.X_j = 1) = frac 1 2$ because 1*1 and -1*-1 happen with the same probability.



Then we can write
$$P(X_i.X_k = 1|X_i.X_j = 1) = P(X_k = 1|X_i.X_j = 1, X_i=1 ).P(X_i = 1|X_i.X_j = 1) + P(X_k = -1|X_i.X_j = 1, X_i=-1 ).P(X_i = -1|X_i.X_j = 1) = frac 1 2 $$



$$P(X_i.X_k = 1|X_i.X_j = -1) = P(X_k = 1|X_i.X_j = -1, X_i=1 ).P(X_i = 1|X_i.X_j = -1) + P(X_k = -1|X_i.X_j = -1, X_i=-1 ).P(X_i = -1|X_i.X_j = -1) = frac 1 2 $$



$$P(X_i.X_k = 1) = P(X_k = 1| X_i=1 ).P(X_i = 1) + P(X_k = -1|X_i=-1 ).P(X_i = -1) = frac 1 2 $$



Since the conditional probability is the same as unconditional, you can say they are independent.



Hope it helps






share|cite|improve this answer









$endgroup$





















    0












    $begingroup$

    @Ofya, thanks for your answer, I was seeking for something where I can control the support, and I guess, I've found my answer.



    EDIT (Extra question) Suppose that, $X_i$ are independent, standard normal random variables. Is it true that, $(X_iX_j)_{1leq i <jleq n}$ forms an independent collection of random variables?



    Take $X_isim {rm Unif}{1,2,dots,p-1}$ with $p$ being a prime, and consider $X_iX_j$ as $X_iX_jpmod{p}$. We have,
    $$
    mathbb{P}(X_iX_j = k,X_iX_kell)=sum_{t=1}^{p-1}mathbb{P}(X_iX_j=k,X_iX_k=ell|X_i=t)mathbb{P}(X_i=t)=sum_{t=1}^{p-1}mathbb{P}(X_j=t^{-1}k,X_k=t^{-1}ell)mathbb{P}(X_i=t),
    $$
    which evaluates as, $frac{1}{(p-1)^2}$. Finally, it is easy to see that, for any pair $(i ,j)$ and any $kin{1,2,dots,p-1}$, $mathbb{P}(X_iX_j=k)=frac{1}{p-1}$, proving the independence.






    share|cite|improve this answer











    $endgroup$













    • $begingroup$
      As for your extra credit problem: take the product of $X_1X_2, X_2X_3,$ and $X_3X_1.$ The product is positive with probability 1, so the 3 pairwise products cannot be jointly independent.
      $endgroup$
      – kimchi lover
      Dec 5 '18 at 22:46












    • $begingroup$
      How about pairwise independence of pairwise products?
      $endgroup$
      – Aaron
      Dec 5 '18 at 23:53










    • $begingroup$
      In general, Ofya's answer puts paid to that one. In the gaussian case, I think one can show that $XY$ and $YZ$ are not independent, if $X,Y,Z$ are iid $N(0,1)$ rv.s.
      $endgroup$
      – kimchi lover
      Dec 6 '18 at 0:17











    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%2f3027608%2fan-independent-collection-where-the-pairwise-products-are-also-independent%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









    0












    $begingroup$

    I don't know what you mean by non-trivial but consider this example:
    $P(X = 1) = P(X = -1) = frac 1 2$



    Knowing that the product is -1 or 1 doesn't change the probability for other products. $P(X_i = 1|X_i.X_j = 1) = frac 1 2$ and $P(X_i = -1|X_i.X_j = 1) = frac 1 2$ because 1*1 and -1*-1 happen with the same probability.



    Then we can write
    $$P(X_i.X_k = 1|X_i.X_j = 1) = P(X_k = 1|X_i.X_j = 1, X_i=1 ).P(X_i = 1|X_i.X_j = 1) + P(X_k = -1|X_i.X_j = 1, X_i=-1 ).P(X_i = -1|X_i.X_j = 1) = frac 1 2 $$



    $$P(X_i.X_k = 1|X_i.X_j = -1) = P(X_k = 1|X_i.X_j = -1, X_i=1 ).P(X_i = 1|X_i.X_j = -1) + P(X_k = -1|X_i.X_j = -1, X_i=-1 ).P(X_i = -1|X_i.X_j = -1) = frac 1 2 $$



    $$P(X_i.X_k = 1) = P(X_k = 1| X_i=1 ).P(X_i = 1) + P(X_k = -1|X_i=-1 ).P(X_i = -1) = frac 1 2 $$



    Since the conditional probability is the same as unconditional, you can say they are independent.



    Hope it helps






    share|cite|improve this answer









    $endgroup$


















      0












      $begingroup$

      I don't know what you mean by non-trivial but consider this example:
      $P(X = 1) = P(X = -1) = frac 1 2$



      Knowing that the product is -1 or 1 doesn't change the probability for other products. $P(X_i = 1|X_i.X_j = 1) = frac 1 2$ and $P(X_i = -1|X_i.X_j = 1) = frac 1 2$ because 1*1 and -1*-1 happen with the same probability.



      Then we can write
      $$P(X_i.X_k = 1|X_i.X_j = 1) = P(X_k = 1|X_i.X_j = 1, X_i=1 ).P(X_i = 1|X_i.X_j = 1) + P(X_k = -1|X_i.X_j = 1, X_i=-1 ).P(X_i = -1|X_i.X_j = 1) = frac 1 2 $$



      $$P(X_i.X_k = 1|X_i.X_j = -1) = P(X_k = 1|X_i.X_j = -1, X_i=1 ).P(X_i = 1|X_i.X_j = -1) + P(X_k = -1|X_i.X_j = -1, X_i=-1 ).P(X_i = -1|X_i.X_j = -1) = frac 1 2 $$



      $$P(X_i.X_k = 1) = P(X_k = 1| X_i=1 ).P(X_i = 1) + P(X_k = -1|X_i=-1 ).P(X_i = -1) = frac 1 2 $$



      Since the conditional probability is the same as unconditional, you can say they are independent.



      Hope it helps






      share|cite|improve this answer









      $endgroup$
















        0












        0








        0





        $begingroup$

        I don't know what you mean by non-trivial but consider this example:
        $P(X = 1) = P(X = -1) = frac 1 2$



        Knowing that the product is -1 or 1 doesn't change the probability for other products. $P(X_i = 1|X_i.X_j = 1) = frac 1 2$ and $P(X_i = -1|X_i.X_j = 1) = frac 1 2$ because 1*1 and -1*-1 happen with the same probability.



        Then we can write
        $$P(X_i.X_k = 1|X_i.X_j = 1) = P(X_k = 1|X_i.X_j = 1, X_i=1 ).P(X_i = 1|X_i.X_j = 1) + P(X_k = -1|X_i.X_j = 1, X_i=-1 ).P(X_i = -1|X_i.X_j = 1) = frac 1 2 $$



        $$P(X_i.X_k = 1|X_i.X_j = -1) = P(X_k = 1|X_i.X_j = -1, X_i=1 ).P(X_i = 1|X_i.X_j = -1) + P(X_k = -1|X_i.X_j = -1, X_i=-1 ).P(X_i = -1|X_i.X_j = -1) = frac 1 2 $$



        $$P(X_i.X_k = 1) = P(X_k = 1| X_i=1 ).P(X_i = 1) + P(X_k = -1|X_i=-1 ).P(X_i = -1) = frac 1 2 $$



        Since the conditional probability is the same as unconditional, you can say they are independent.



        Hope it helps






        share|cite|improve this answer









        $endgroup$



        I don't know what you mean by non-trivial but consider this example:
        $P(X = 1) = P(X = -1) = frac 1 2$



        Knowing that the product is -1 or 1 doesn't change the probability for other products. $P(X_i = 1|X_i.X_j = 1) = frac 1 2$ and $P(X_i = -1|X_i.X_j = 1) = frac 1 2$ because 1*1 and -1*-1 happen with the same probability.



        Then we can write
        $$P(X_i.X_k = 1|X_i.X_j = 1) = P(X_k = 1|X_i.X_j = 1, X_i=1 ).P(X_i = 1|X_i.X_j = 1) + P(X_k = -1|X_i.X_j = 1, X_i=-1 ).P(X_i = -1|X_i.X_j = 1) = frac 1 2 $$



        $$P(X_i.X_k = 1|X_i.X_j = -1) = P(X_k = 1|X_i.X_j = -1, X_i=1 ).P(X_i = 1|X_i.X_j = -1) + P(X_k = -1|X_i.X_j = -1, X_i=-1 ).P(X_i = -1|X_i.X_j = -1) = frac 1 2 $$



        $$P(X_i.X_k = 1) = P(X_k = 1| X_i=1 ).P(X_i = 1) + P(X_k = -1|X_i=-1 ).P(X_i = -1) = frac 1 2 $$



        Since the conditional probability is the same as unconditional, you can say they are independent.



        Hope it helps







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Dec 5 '18 at 20:46









        OfyaOfya

        5048




        5048























            0












            $begingroup$

            @Ofya, thanks for your answer, I was seeking for something where I can control the support, and I guess, I've found my answer.



            EDIT (Extra question) Suppose that, $X_i$ are independent, standard normal random variables. Is it true that, $(X_iX_j)_{1leq i <jleq n}$ forms an independent collection of random variables?



            Take $X_isim {rm Unif}{1,2,dots,p-1}$ with $p$ being a prime, and consider $X_iX_j$ as $X_iX_jpmod{p}$. We have,
            $$
            mathbb{P}(X_iX_j = k,X_iX_kell)=sum_{t=1}^{p-1}mathbb{P}(X_iX_j=k,X_iX_k=ell|X_i=t)mathbb{P}(X_i=t)=sum_{t=1}^{p-1}mathbb{P}(X_j=t^{-1}k,X_k=t^{-1}ell)mathbb{P}(X_i=t),
            $$
            which evaluates as, $frac{1}{(p-1)^2}$. Finally, it is easy to see that, for any pair $(i ,j)$ and any $kin{1,2,dots,p-1}$, $mathbb{P}(X_iX_j=k)=frac{1}{p-1}$, proving the independence.






            share|cite|improve this answer











            $endgroup$













            • $begingroup$
              As for your extra credit problem: take the product of $X_1X_2, X_2X_3,$ and $X_3X_1.$ The product is positive with probability 1, so the 3 pairwise products cannot be jointly independent.
              $endgroup$
              – kimchi lover
              Dec 5 '18 at 22:46












            • $begingroup$
              How about pairwise independence of pairwise products?
              $endgroup$
              – Aaron
              Dec 5 '18 at 23:53










            • $begingroup$
              In general, Ofya's answer puts paid to that one. In the gaussian case, I think one can show that $XY$ and $YZ$ are not independent, if $X,Y,Z$ are iid $N(0,1)$ rv.s.
              $endgroup$
              – kimchi lover
              Dec 6 '18 at 0:17
















            0












            $begingroup$

            @Ofya, thanks for your answer, I was seeking for something where I can control the support, and I guess, I've found my answer.



            EDIT (Extra question) Suppose that, $X_i$ are independent, standard normal random variables. Is it true that, $(X_iX_j)_{1leq i <jleq n}$ forms an independent collection of random variables?



            Take $X_isim {rm Unif}{1,2,dots,p-1}$ with $p$ being a prime, and consider $X_iX_j$ as $X_iX_jpmod{p}$. We have,
            $$
            mathbb{P}(X_iX_j = k,X_iX_kell)=sum_{t=1}^{p-1}mathbb{P}(X_iX_j=k,X_iX_k=ell|X_i=t)mathbb{P}(X_i=t)=sum_{t=1}^{p-1}mathbb{P}(X_j=t^{-1}k,X_k=t^{-1}ell)mathbb{P}(X_i=t),
            $$
            which evaluates as, $frac{1}{(p-1)^2}$. Finally, it is easy to see that, for any pair $(i ,j)$ and any $kin{1,2,dots,p-1}$, $mathbb{P}(X_iX_j=k)=frac{1}{p-1}$, proving the independence.






            share|cite|improve this answer











            $endgroup$













            • $begingroup$
              As for your extra credit problem: take the product of $X_1X_2, X_2X_3,$ and $X_3X_1.$ The product is positive with probability 1, so the 3 pairwise products cannot be jointly independent.
              $endgroup$
              – kimchi lover
              Dec 5 '18 at 22:46












            • $begingroup$
              How about pairwise independence of pairwise products?
              $endgroup$
              – Aaron
              Dec 5 '18 at 23:53










            • $begingroup$
              In general, Ofya's answer puts paid to that one. In the gaussian case, I think one can show that $XY$ and $YZ$ are not independent, if $X,Y,Z$ are iid $N(0,1)$ rv.s.
              $endgroup$
              – kimchi lover
              Dec 6 '18 at 0:17














            0












            0








            0





            $begingroup$

            @Ofya, thanks for your answer, I was seeking for something where I can control the support, and I guess, I've found my answer.



            EDIT (Extra question) Suppose that, $X_i$ are independent, standard normal random variables. Is it true that, $(X_iX_j)_{1leq i <jleq n}$ forms an independent collection of random variables?



            Take $X_isim {rm Unif}{1,2,dots,p-1}$ with $p$ being a prime, and consider $X_iX_j$ as $X_iX_jpmod{p}$. We have,
            $$
            mathbb{P}(X_iX_j = k,X_iX_kell)=sum_{t=1}^{p-1}mathbb{P}(X_iX_j=k,X_iX_k=ell|X_i=t)mathbb{P}(X_i=t)=sum_{t=1}^{p-1}mathbb{P}(X_j=t^{-1}k,X_k=t^{-1}ell)mathbb{P}(X_i=t),
            $$
            which evaluates as, $frac{1}{(p-1)^2}$. Finally, it is easy to see that, for any pair $(i ,j)$ and any $kin{1,2,dots,p-1}$, $mathbb{P}(X_iX_j=k)=frac{1}{p-1}$, proving the independence.






            share|cite|improve this answer











            $endgroup$



            @Ofya, thanks for your answer, I was seeking for something where I can control the support, and I guess, I've found my answer.



            EDIT (Extra question) Suppose that, $X_i$ are independent, standard normal random variables. Is it true that, $(X_iX_j)_{1leq i <jleq n}$ forms an independent collection of random variables?



            Take $X_isim {rm Unif}{1,2,dots,p-1}$ with $p$ being a prime, and consider $X_iX_j$ as $X_iX_jpmod{p}$. We have,
            $$
            mathbb{P}(X_iX_j = k,X_iX_kell)=sum_{t=1}^{p-1}mathbb{P}(X_iX_j=k,X_iX_k=ell|X_i=t)mathbb{P}(X_i=t)=sum_{t=1}^{p-1}mathbb{P}(X_j=t^{-1}k,X_k=t^{-1}ell)mathbb{P}(X_i=t),
            $$
            which evaluates as, $frac{1}{(p-1)^2}$. Finally, it is easy to see that, for any pair $(i ,j)$ and any $kin{1,2,dots,p-1}$, $mathbb{P}(X_iX_j=k)=frac{1}{p-1}$, proving the independence.







            share|cite|improve this answer














            share|cite|improve this answer



            share|cite|improve this answer








            edited Dec 5 '18 at 22:40

























            answered Dec 5 '18 at 21:55









            AaronAaron

            1,828415




            1,828415












            • $begingroup$
              As for your extra credit problem: take the product of $X_1X_2, X_2X_3,$ and $X_3X_1.$ The product is positive with probability 1, so the 3 pairwise products cannot be jointly independent.
              $endgroup$
              – kimchi lover
              Dec 5 '18 at 22:46












            • $begingroup$
              How about pairwise independence of pairwise products?
              $endgroup$
              – Aaron
              Dec 5 '18 at 23:53










            • $begingroup$
              In general, Ofya's answer puts paid to that one. In the gaussian case, I think one can show that $XY$ and $YZ$ are not independent, if $X,Y,Z$ are iid $N(0,1)$ rv.s.
              $endgroup$
              – kimchi lover
              Dec 6 '18 at 0:17


















            • $begingroup$
              As for your extra credit problem: take the product of $X_1X_2, X_2X_3,$ and $X_3X_1.$ The product is positive with probability 1, so the 3 pairwise products cannot be jointly independent.
              $endgroup$
              – kimchi lover
              Dec 5 '18 at 22:46












            • $begingroup$
              How about pairwise independence of pairwise products?
              $endgroup$
              – Aaron
              Dec 5 '18 at 23:53










            • $begingroup$
              In general, Ofya's answer puts paid to that one. In the gaussian case, I think one can show that $XY$ and $YZ$ are not independent, if $X,Y,Z$ are iid $N(0,1)$ rv.s.
              $endgroup$
              – kimchi lover
              Dec 6 '18 at 0:17
















            $begingroup$
            As for your extra credit problem: take the product of $X_1X_2, X_2X_3,$ and $X_3X_1.$ The product is positive with probability 1, so the 3 pairwise products cannot be jointly independent.
            $endgroup$
            – kimchi lover
            Dec 5 '18 at 22:46






            $begingroup$
            As for your extra credit problem: take the product of $X_1X_2, X_2X_3,$ and $X_3X_1.$ The product is positive with probability 1, so the 3 pairwise products cannot be jointly independent.
            $endgroup$
            – kimchi lover
            Dec 5 '18 at 22:46














            $begingroup$
            How about pairwise independence of pairwise products?
            $endgroup$
            – Aaron
            Dec 5 '18 at 23:53




            $begingroup$
            How about pairwise independence of pairwise products?
            $endgroup$
            – Aaron
            Dec 5 '18 at 23:53












            $begingroup$
            In general, Ofya's answer puts paid to that one. In the gaussian case, I think one can show that $XY$ and $YZ$ are not independent, if $X,Y,Z$ are iid $N(0,1)$ rv.s.
            $endgroup$
            – kimchi lover
            Dec 6 '18 at 0:17




            $begingroup$
            In general, Ofya's answer puts paid to that one. In the gaussian case, I think one can show that $XY$ and $YZ$ are not independent, if $X,Y,Z$ are iid $N(0,1)$ rv.s.
            $endgroup$
            – kimchi lover
            Dec 6 '18 at 0:17


















            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%2f3027608%2fan-independent-collection-where-the-pairwise-products-are-also-independent%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

            How do I know what Microsoft account the skydrive app is syncing to?

            Image
            up vote 4 down vote favorite 1 Some time ago, I set up skydrive for my wife on her mac. But now she wants to access the files online, I cannot remember what Microsoft account I setup and linked her skydive app to and nor can I see anything in the skydrive app settings to tell me either? How can I see the name of the Microsoft account the skydive app is currently linked to? I would like to know this for skydrive app for Mac and PC onedrive share | improve this question asked Feb 25 '13 at 4:52 Gary Barrett 260 2 5 12
            Read more

            When does type information flow backwards in C++?

            Image
            up vote 62 down vote favorite 19 I just watched Stephan T. Lavavej talk at CppCon 2018 on "Class Template Argument Deduction", where at some point he incidentally says: In C++ type information almost never flows backwards ... I had to say "almost" because there's one or two cases, possibly more but very few . Despite trying to figure out which cases he might be referring to, I couldn't come up with anything. Hence the question: In which cases the C++17 standard mandates that type information propagate backwards? c++ language-lawyer c++17 share | improve this question edited 7 hours ago scohe0
            Read more

            Grease: Live!

            Image
            A tradução deste artigo está abaixo da qualidade média aceitável. É possível que tenha sido feita por um tradutor automático ou por alguém que não conhece bem o português ou a língua original do texto. Caso queira colaborar com a Wikipédia, tente encontrar a página original e melhore este verbete conforme o guia de tradução. Grease: Live! Grease: Live!  (PRT/BRA)  Estados Unidos 2016 •   cor •   130 min. min   Direção Thomas Kail Alex Rudzinski Produção Marc Platt Adam Siegel Roteiro Allan Carr Robert Cary Warren Casey Jim Jacobs Jonathan Tolins Bronte Woodard Baseado em Grease (musical) Grease (filme) Elenco Julianne Hough Aaron Tveit Vanessa Hudgens Carlos Pena Jr. Keke Palmer Carly Rae Jepsen Kether Donohue Jordan Fisher David Del Rio Andrew Call Gênero Musical Música Tom Kitt Figurino William Ivey Long Companhia(s) produtora(s) Warner Bros. Studios Distribuição Fox Lançamento 31 de Janei
            Read more