reduce to the case $[0,1]$ in equidistribution modulo $1$Weyl Equidistribution Theorem and a LimitEquidistribution of $xi_n$ where $xi_n = <nfracpq>$ $p,q$ rel. primeProving a sum is finite using EquidistributionTwo questions about pseudo equidistributed sequences modulo 1Equidistribution of rational numbersEquidistribution of $big(frac1+ sqrt52big)^n$ in $[0,1]$Is it true that almost all sequences on [0,1] are equidistributed? and almost none are uniformly equidistributed?Equidistribution modulo $1$ of certain exponential functionsA property related to equidistribution of sequencesExhibit a countable subset $Esubset [0,1]$ so that $J_*(E)=1$ where $m_*(E)=0$

Replacing matching entries in one column of a file by another column from a different file

What's that red-plus icon near a text?

What's the output of a record needle playing an out-of-speed record

Approximately how much travel time was saved by the opening of the Suez Canal in 1869?

Is it inappropriate for a student to attend their mentor's dissertation defense?

Modeling an IP Address

Important Resources for Dark Age Civilizations?

How old can references or sources in a thesis be?

What's the point of deactivating Num Lock on login screens?

Accidentally leaked the solution to an assignment, what to do now? (I'm the prof)

Alternative to sending password over mail?

Why "Having chlorophyll without photosynthesis is actually very dangerous" and "like living with a bomb"?

Languages that we cannot (dis)prove to be Context-Free

What are these boxed doors outside store fronts in New York?

Are astronomers waiting to see something in an image from a gravitational lens that they've already seen in an adjacent image?

High voltage LED indicator 40-1000 VDC without additional power supply

meaning of に in 本当に?

Can an x86 CPU running in real mode be considered to be basically an 8086 CPU?

Why can't I see bouncing of a switch on an oscilloscope?

Can I ask the recruiters in my resume to put the reason why I am rejected?

How much of data wrangling is a data scientist's job?

What typically incentivizes a professor to change jobs to a lower ranking university?

What does it mean to describe someone as a butt steak?

A case of the sniffles



reduce to the case $[0,1]$ in equidistribution modulo $1$


Weyl Equidistribution Theorem and a LimitEquidistribution of $xi_n$ where $xi_n = <nfracpq>$ $p,q$ rel. primeProving a sum is finite using EquidistributionTwo questions about pseudo equidistributed sequences modulo 1Equidistribution of rational numbersEquidistribution of $big(frac1+ sqrt52big)^n$ in $[0,1]$Is it true that almost all sequences on [0,1] are equidistributed? and almost none are uniformly equidistributed?Equidistribution modulo $1$ of certain exponential functionsA property related to equidistribution of sequencesExhibit a countable subset $Esubset [0,1]$ so that $J_*(E)=1$ where $m_*(E)=0$













3












$begingroup$


I am trying to prove a theorem using an optimal solution. Given $(y_n)_n in mathbbN^*$ such that $exists delta > 0, forall n in mathbbN^* y_n+1 - y_n geq delta$ then for almost every $xi in mathbbR$ (Lebesgue) the sequence $(xi y_n)_n in mathbbN^*$ is equidistributed modulo $1$.



I found a proof considering an arbitrary interval $[a,b]$ but some people told me it's sufficient to prove the result for almost every $xi in [0,1]$ but I am not convinced. In fact, if we prove the result just for almost every $xi in [0,1]$ the sequence $xi y_n$ does not cover all the interval $xi in [0,1]$.



I am trying to find a counterexample, if we have a sequence $ frac116 leq y_n leq frac12$ then multiplying by $xi in [0,1]$ gives us $ 0 leq xi y_n leq frac12$ and if we take $xi in [1,2]$ we got $ 0 leq xi y_n leq 1$. Do you see what I mean? I think that the argument reducing to $[0,1]$ is not always true.



Thanks in advance !










share|cite|improve this question











$endgroup$
















    3












    $begingroup$


    I am trying to prove a theorem using an optimal solution. Given $(y_n)_n in mathbbN^*$ such that $exists delta > 0, forall n in mathbbN^* y_n+1 - y_n geq delta$ then for almost every $xi in mathbbR$ (Lebesgue) the sequence $(xi y_n)_n in mathbbN^*$ is equidistributed modulo $1$.



    I found a proof considering an arbitrary interval $[a,b]$ but some people told me it's sufficient to prove the result for almost every $xi in [0,1]$ but I am not convinced. In fact, if we prove the result just for almost every $xi in [0,1]$ the sequence $xi y_n$ does not cover all the interval $xi in [0,1]$.



    I am trying to find a counterexample, if we have a sequence $ frac116 leq y_n leq frac12$ then multiplying by $xi in [0,1]$ gives us $ 0 leq xi y_n leq frac12$ and if we take $xi in [1,2]$ we got $ 0 leq xi y_n leq 1$. Do you see what I mean? I think that the argument reducing to $[0,1]$ is not always true.



    Thanks in advance !










    share|cite|improve this question











    $endgroup$














      3












      3








      3





      $begingroup$


      I am trying to prove a theorem using an optimal solution. Given $(y_n)_n in mathbbN^*$ such that $exists delta > 0, forall n in mathbbN^* y_n+1 - y_n geq delta$ then for almost every $xi in mathbbR$ (Lebesgue) the sequence $(xi y_n)_n in mathbbN^*$ is equidistributed modulo $1$.



      I found a proof considering an arbitrary interval $[a,b]$ but some people told me it's sufficient to prove the result for almost every $xi in [0,1]$ but I am not convinced. In fact, if we prove the result just for almost every $xi in [0,1]$ the sequence $xi y_n$ does not cover all the interval $xi in [0,1]$.



      I am trying to find a counterexample, if we have a sequence $ frac116 leq y_n leq frac12$ then multiplying by $xi in [0,1]$ gives us $ 0 leq xi y_n leq frac12$ and if we take $xi in [1,2]$ we got $ 0 leq xi y_n leq 1$. Do you see what I mean? I think that the argument reducing to $[0,1]$ is not always true.



      Thanks in advance !










      share|cite|improve this question











      $endgroup$




      I am trying to prove a theorem using an optimal solution. Given $(y_n)_n in mathbbN^*$ such that $exists delta > 0, forall n in mathbbN^* y_n+1 - y_n geq delta$ then for almost every $xi in mathbbR$ (Lebesgue) the sequence $(xi y_n)_n in mathbbN^*$ is equidistributed modulo $1$.



      I found a proof considering an arbitrary interval $[a,b]$ but some people told me it's sufficient to prove the result for almost every $xi in [0,1]$ but I am not convinced. In fact, if we prove the result just for almost every $xi in [0,1]$ the sequence $xi y_n$ does not cover all the interval $xi in [0,1]$.



      I am trying to find a counterexample, if we have a sequence $ frac116 leq y_n leq frac12$ then multiplying by $xi in [0,1]$ gives us $ 0 leq xi y_n leq frac12$ and if we take $xi in [1,2]$ we got $ 0 leq xi y_n leq 1$. Do you see what I mean? I think that the argument reducing to $[0,1]$ is not always true.



      Thanks in advance !







      real-analysis proof-verification equidistribution






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Mar 29 at 10:55









      gt6989b

      35.5k22557




      35.5k22557










      asked Mar 29 at 10:54









      bsmbsm

      261




      261




















          0






          active

          oldest

          votes












          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%2f3167004%2freduce-to-the-case-0-1-in-equidistribution-modulo-1%23new-answer', 'question_page');

          );

          Post as a guest















          Required, but never shown

























          0






          active

          oldest

          votes








          0






          active

          oldest

          votes









          active

          oldest

          votes






          active

          oldest

          votes















          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%2f3167004%2freduce-to-the-case-0-1-in-equidistribution-modulo-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

          Triangular numbers and gcdProving sum of a set is $0 pmod n$ if $n$ is odd, or $fracn2 pmod n$ if $n$ is even?Is greatest common divisor of two numbers really their smallest linear combination?GCD, LCM RelationshipProve a set of nonnegative integers with greatest common divisor 1 and closed under addition has all but finite many nonnegative integers.all pairs of a and b in an equation containing gcdTriangular Numbers Modulo $k$ - Hit All Values?Understanding the Existence and Uniqueness of the GCDGCD and LCM with logical symbolsThe greatest common divisor of two positive integers less than 100 is equal to 3. Their least common multiple is twelve times one of the integers.Suppose that for all integers $x$, $x|a$ and $x|b$ if and only if $x|c$. Then $c = gcd(a,b)$Which is the gcd of 2 numbers which are multiplied and the result is 600000?

          Ingelân Ynhâld Etymology | Geografy | Skiednis | Polityk en bestjoer | Ekonomy | Demografy | Kultuer | Klimaat | Sjoch ek | Keppelings om utens | Boarnen, noaten en referinsjes Navigaasjemenuwww.gov.ukOffisjele webside fan it regear fan it Feriene KeninkrykOffisjele webside fan it Britske FerkearsburoNederlânsktalige ynformaasje fan it Britske FerkearsburoOffisjele webside fan English Heritage, de organisaasje dy't him ynset foar it behâld fan it Ingelske kultuergoedYnwennertallen fan alle Britske stêden út 'e folkstelling fan 2011Notes en References, op dizze sideEngland

          Հադիս Բովանդակություն Անվանում և նշանակություն | Դասակարգում | Աղբյուրներ | Նավարկման ցանկ