the theorem of copeland and erd os on normal numbers
play

The Theorem of Copeland and Erd os on Normal Numbers Jordan Velich - PowerPoint PPT Presentation

The Theorem of Copeland and Erd os on Normal Numbers Jordan Velich University of Newcastle February 3, 2015 Jordan Velich The Theorem of Copeland and Erd os on Normal Numbers Review Of Normality Definition A number is normal with


  1. The Theorem of Copeland and Erd˝ os on Normal Numbers Jordan Velich University of Newcastle February 3, 2015 Jordan Velich The Theorem of Copeland and Erd˝ os on Normal Numbers

  2. Review Of Normality Definition A number α is normal with respect to the base β , provided each of the digits 0 , 1 , 2 , . . . , β − 1 occurs with a limiting relative frequency of 1 /β , and each of the β k sequences of k digits occurs with the relative frequency 1 /β k . Definition The natural density of the subset A ⊂ N , denoted d ( A ), is defined as N ( x ) d ( A ) = lim x x →∞ where N ( x ) := # { a : a ∈ A , a � x } . Example The natural density of the even numbers is 1/2. Jordan Velich The Theorem of Copeland and Erd˝ os on Normal Numbers

  3. Review Of Normality Definition A number α is normal with respect to the base β , provided each of the digits 0 , 1 , 2 , . . . , β − 1 occurs with a limiting relative frequency of 1 /β , and each of the β k sequences of k digits occurs with the relative frequency 1 /β k . Definition The natural density of the subset A ⊂ N , denoted d ( A ), is defined as N ( x ) d ( A ) = lim x x →∞ where N ( x ) := # { a : a ∈ A , a � x } . Example The natural density of the even numbers is 1/2. Jordan Velich The Theorem of Copeland and Erd˝ os on Normal Numbers

  4. Review Of Normality Definition A number α is normal with respect to the base β , provided each of the digits 0 , 1 , 2 , . . . , β − 1 occurs with a limiting relative frequency of 1 /β , and each of the β k sequences of k digits occurs with the relative frequency 1 /β k . Definition The natural density of the subset A ⊂ N , denoted d ( A ), is defined as N ( x ) d ( A ) = lim x x →∞ where N ( x ) := # { a : a ∈ A , a � x } . Example The natural density of the even numbers is 1/2. Jordan Velich The Theorem of Copeland and Erd˝ os on Normal Numbers

  5. Outline Normality: The Known and Unkown Copeland-Erd˝ os Theorem Questions of Strong Normality Jordan Velich The Theorem of Copeland and Erd˝ os on Normal Numbers

  6. Normality Normality: The Known and Unkown Jordan Velich The Theorem of Copeland and Erd˝ os on Normal Numbers

  7. Borel’s Conjecture Definition A number α is normal with respect to the base β , provided each of the digits 0 , 1 , 2 , . . . , β − 1 occurs with a limiting relative frequency of 1 /β , and each of the β k sequences of k digits occurs with the relative frequency 1 /β k . With this definition in mind, we begin with the unknown: Conjecture (Borel, 1950) All real irrational algebraic numbers are normal. Jordan Velich The Theorem of Copeland and Erd˝ os on Normal Numbers

  8. Borel’s Conjecture Definition A number α is normal with respect to the base β , provided each of the digits 0 , 1 , 2 , . . . , β − 1 occurs with a limiting relative frequency of 1 /β , and each of the β k sequences of k digits occurs with the relative frequency 1 /β k . With this definition in mind, we begin with the unknown: Conjecture (Borel, 1950) All real irrational algebraic numbers are normal. Jordan Velich The Theorem of Copeland and Erd˝ os on Normal Numbers

  9. Borel’s Conjecture Definition A number α is normal with respect to the base β , provided each of the digits 0 , 1 , 2 , . . . , β − 1 occurs with a limiting relative frequency of 1 /β , and each of the β k sequences of k digits occurs with the relative frequency 1 /β k . With this definition in mind, we begin with the unknown: Conjecture (Borel, 1950) All real irrational algebraic numbers are normal. Jordan Velich The Theorem of Copeland and Erd˝ os on Normal Numbers

  10. Normal Numbers Some of the most well-known normal numbers discovered so far include: 1933 0 . 123456789 . . . Champernowne’s Number 1946 0 . 23571113 . . . Copeland-Erd˝ os Number 1956 0 . f (1) f (2) f (3) . . . Davenport-Erd˝ os Numbers ∞ 1 1973 � Stoneham Numbers b ck c k k =1 Jordan Velich The Theorem of Copeland and Erd˝ os on Normal Numbers

  11. Copeland-Erd˝ os Number Some of the most well-known normal numbers discovered so far include: 1933 0 . 123456789 . . . Champernowne’s Number 1946 0 . 23571113 . . . Copeland-Erd˝ os Number 1956 0 . f (1) f (2) f (3) . . . Davenport-Erd˝ os Numbers ∞ 1 1973 � Stoneham Numbers b ck c k k =1 Jordan Velich The Theorem of Copeland and Erd˝ os on Normal Numbers

  12. Copeland-Erd˝ os Theorem Copeland-Erd˝ os Theorem Jordan Velich The Theorem of Copeland and Erd˝ os on Normal Numbers

  13. Copeland-Erd˝ os Theorem Theorem (Copeland-Erd˝ os, 1946) If a 1 , a 2 , a 3 , . . . is an increasing sequence of integers such that for every θ < 1 the number of a i ’s up to N exceeds N θ provided N is sufficiently large, then the infinite decimal 0 . a 1 a 2 a 3 . . . is normal with respect to the base β in which these integers are expressed. Jordan Velich The Theorem of Copeland and Erd˝ os on Normal Numbers

  14. An Important Lemma Lemma (Copeland-Erd˝ os, 1946) The number of integers up to N ( N sufficiently large) which are not ( ε, k ) normal with respect to a given base β is less than N δ where δ = δ ( ε, k , β ) < 1 . To understand this lemma, we must first be familiar with ( ε, k ) normality: Definition A number α (in the base β ) is said to be ( ε, k ) normal if any combination of k digits appears consecutively among the digits of α with a relative frequency between β − k − ε and β − k + ε . Jordan Velich The Theorem of Copeland and Erd˝ os on Normal Numbers

  15. An Important Lemma Lemma (Copeland-Erd˝ os, 1946) The number of integers up to N ( N sufficiently large) which are not ( ε, k ) normal with respect to a given base β is less than N δ where δ = δ ( ε, k , β ) < 1 . To understand this lemma, we must first be familiar with ( ε, k ) normality: Definition A number α (in the base β ) is said to be ( ε, k ) normal if any combination of k digits appears consecutively among the digits of α with a relative frequency between β − k − ε and β − k + ε . Jordan Velich The Theorem of Copeland and Erd˝ os on Normal Numbers

  16. An Important Lemma Lemma (Copeland-Erd˝ os, 1946) The number of integers up to N ( N sufficiently large) which are not ( ε, k ) normal with respect to a given base β is less than N δ where δ = δ ( ε, k , β ) < 1 . To understand this lemma, we must first be familiar with ( ε, k ) normality: Definition A number α (in the base β ) is said to be ( ε, k ) normal if any combination of k digits appears consecutively among the digits of α with a relative frequency between β − k − ε and β − k + ε . Jordan Velich The Theorem of Copeland and Erd˝ os on Normal Numbers

  17. Proof Of Lemma – ( ε, 1) normality Let x be such that β x − 1 � N < β x , where β x refers to a number (base − β ) consisting of x digits. We introduce the notation β j = ( β − 1) x − j � x � , where β j counts the j number of numbers (up to N ) which have a single digit, for instance 0, occurring a total of j times amongst their x digits. Since a given base β has β digits, and since β j counts the occurrences of only a single digit, there are at most   � � β β j + β j     j < x (1 − ε ) /β j > x (1+ ε ) /β numbers up to N which have less than x (1 − ε ) /β or more than x (1 + ε ) /β 0’s,1’s, . . . ,( β − 1)’s. Jordan Velich The Theorem of Copeland and Erd˝ os on Normal Numbers

  18. Proof Of Lemma – ( ε, 1) normality Let x be such that β x − 1 � N < β x , where β x refers to a number (base − β ) consisting of x digits. We introduce the notation β j = ( β − 1) x − j � x � , where β j counts the j number of numbers (up to N ) which have a single digit, for instance 0, occurring a total of j times amongst their x digits. Since a given base β has β digits, and since β j counts the occurrences of only a single digit, there are at most   � � β β j + β j     j < x (1 − ε ) /β j > x (1+ ε ) /β numbers up to N which have less than x (1 − ε ) /β or more than x (1 + ε ) /β 0’s,1’s, . . . ,( β − 1)’s. Jordan Velich The Theorem of Copeland and Erd˝ os on Normal Numbers

  19. Proof Of Lemma – ( ε, 1) normality Let x be such that β x − 1 � N < β x , where β x refers to a number (base − β ) consisting of x digits. We introduce the notation β j = ( β − 1) x − j � x � , where β j counts the j number of numbers (up to N ) which have a single digit, for instance 0, occurring a total of j times amongst their x digits. Since a given base β has β digits, and since β j counts the occurrences of only a single digit, there are at most   � � β β j + β j     j < x (1 − ε ) /β j > x (1+ ε ) /β numbers up to N which have less than x (1 − ε ) /β or more than x (1 + ε ) /β 0’s,1’s, . . . ,( β − 1)’s. Jordan Velich The Theorem of Copeland and Erd˝ os on Normal Numbers

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend