A ZERO ENTROPY T SUCH THAT THE [T,ID] ENDOMORPHISM IS NONSTANDARD
|
|
- Leslie Ronald Shepherd
- 5 years ago
- Views:
Transcription
1 A ZERO ENTROPY T SUCH THAT THE [T,ID] ENDOMORPHISM IS NONSTANDARD CHRISTOPHER HOFFMAN Abstract. We present an example of an ergodic transformation T, a variant of a zero entropy non loosely Bernoulli map of Feldman [1], such that the sequence of random variables generated by the [T,Id] endomorphism is nonstandard. 1. Introduction Any sequence of random variables, Y 0, Y 1, Y 2,..., defined on the space Y produces a decreasing sequence of σ-algebras F n. These are defined by F n = σ(y n, Y n+1,...). The sequence Y i is called exact if F n =. An isomorphism between two such sequences F n and G n is a 1-1, invertible, measure preserving map φ : F 0 G 0 such that φ(f n ) = G n n. A sequence of random variables Y i is called standard if there exists an independent sequence of random variables X i producing an isomorphic sequence of σ-algebras. An equivalent definition is that there exists a sequence of independent partitions I n such that F n = i=n I i. An endomorphism is said to be standard if the sequence of random variables produced by the endomorphism and a generating partition is standard. Let T be any 1-1 map on (Y, C, ν). Let S be the shift on (X, B, µ) = ({0, 1} N, Borel σ-algebra, product measure ( 1, 1 )). Define [T,Id] on 2 2 (X Y, F, µ ν) where F = B C by [T,Id](x, y) = (Sx, T x 0 y). [T,Id] is 2-1, since any point (x, y) has the preimages (0x, y) and (1x, T 1 y). Meilijson proved that [T,Id] is exact whenever T is ergodic [6]. This paper gives an example of a zero entropy T, which is a variant of a zero entropy non-loosely Bernoulli transformation of J. Feldman [1]. The corresponding [T,Id] endomorphism is nonstandard. The arguments in this paper can be easily be modified to show that for this T the [T, T 1 ] endomorphism is nonstandard Mathematics Subject Classification. Primary 28D99; Secondary 60A10. Key words and phrases. Decreasing sequences of σ-algebras, standard. 1
2 2 CHRISTOPHER HOFFMAN In [4] Heicklen and Hoffman proved that whenever T has positive entropy then the [T, T 1 ] endomorphism, which has an analogous definition to the [T,Id] endomorphism, is nonstandard. Feldman and Rudolph proved in [2] that whenever T is rank 1 then [T,Id] is standard. This argument can easily be modified to show that if T is rank 1 and T 2 is ergodic then the [T, T 1 ] endomorphism is standard. The present paper shows that T having positive entropy is not the only obstruction for [T, T 1 ] being standard. In [5] Heicklen, Hoffman, and Rudolph showed a connection between between the f metric, which is involved in the definition of loosely Bernoulli, and the v metric, which is involved in the criteria for standardness. By using a non loosely Bernoulli transformation to create a nonstandard [T,Id] endomorphism, the present paper strengthens this connection. 2. Standardness Criteria In this section we introduce the terminology necessary to state the standardness criteria. An n branch is an element of {0, 1} n. An n tree is a binary tree of height n consisting of 2 n branches. The top level is b 0 and the bottom level is b. Let A n be the set of automorphisms of an n tree. For m n an m tree inside an n tree is a tree with 2 m branches such that the first n m coordinates all agree and the last m coordinates vary over all possibilities. A labeled n tree for a partition P over a point y Y assigns to each branch b the label P (T b i y). The Hamming metric on labeled n trees is given by d n (W, W ) = # of branches where the labels of W and W disagree 2 n. Fix P and let W and W be labeled n trees over y and y respectively. Define v P n (y, y ) = inf a A n d n (aw, W ). In the case that F n comes from [T,Id], Vershik s standardness criterion is the following. Theorem 2.1. [Vershik] [7] F n is standard if and only if for every finite partition P, v P n (y, y )d(ν ν) 0. Remark 2.1. A possibly more accessible proof of this can be found in [3]. We also present some terminology used in the proof. A branch b in the tree over y lands at a point z if z = T b i y. A subtree of height
3 A NONSTANDARD T,ID ENDOMORPHISM 3 k in the n tree over y lies over a point z if for any branch b in the subtree z = T n k 1 0 b i y. 3. Description of T As we said in the introduction the transformation T will be a variant of one constructed by J. Feldman [1]. His example showed that there are ergodic transformations which are not loosely Bernoulli. The ergodic transformation presented below is also not loosely Bernoulli. The proof of this is the same as the proof for Feldman s transformation. Our space is a subset of Ω = {a 1, a 2,..., a 100 } Z which is defined by a cutting and stacking procedure. The partition P is the partition into 100 sets depending on the symbol y 0. There exist 100 different 1 blocks, each of length 1, with B1 i = a i. For every n each n block has the same measure. Now suppose we have n 1 blocks, B, 1 B, 2..., B N(). We construct N(n) = n 10 different n blocks in the following way. B 1 n = B 2 n = B i n = B N(n) n = [ (B ) ( ) )] (n 1 B 2... (B N() 10 ) (n10 ) [ (B ) 1 n 10 ( ) ) B 2 n (B ] n N() 10 (n 10 ) (n10 1) [ (B 1 (n ) 10 ) i 1 ( ( B) 2 (n 10 ) i 1... B N() [ (B ) 1 (n 10 ) (n10 1) ( ) B 2 (n 10 ) (n10 1)... (B N() ) (n 10 ) i 1] (n 10 ) (n10 i+1) ) (n 10 ) (n10 1)] (n 10 ) Thus at stage n we have N(n) = n 10 different n blocks, each of length l(n) = l(n 1)N(n 1)(n 10 ) (n10). T is the shift. We will make one definition about the block structure of T which is important in the next section. An n region in n block B i n is a maximal subword in the n block which consists of one block repeated many times. The length of an n region in an n block B i n is l(n 1)(n 10 ) i [T,Id] is Nonstandard The proof is by induction. Excluding small sets the argument is as follows. We will define a sequence of heights h n increasing to infinity and a sequence ɛ n which converges down to ɛ > 0. We will show that for y in n block B i j, y in n block B j n with j > i then v n (y, y ) > ɛ n. This statement will be enough to show that [T,Id] is nonstandard. We
4 4 CHRISTOPHER HOFFMAN show this by defining a height k n = kn i,j so that h subtrees of a k n subtree of the h n tree over y lie over many different n 1 blocks. But h subtrees of a k n subtree over y lie over only one n 1 block. A tree automorphism must take k n subtrees to k n subtrees, and h subtrees to h subtrees. By the inductive hypothesis the v h distance between most of the h subtrees paired by a tree automorphism is greater than ɛ so the v hn distance between the h n trees is greater than ɛ n. In order to do the base case of the induction we need the following lemma. Lemma 4.1. For any y = y 0,..., y h 1, such that y is not of period 2, then the only other point y such that v h (y, y ) = 0 is y i = y h 1 i. Proof. A proof of this lemma is contained in [4]. At various times we will use the following fact about binomial distributions. Lemma 4.2. Given n and k, define p i = j=i mod k ( n j). Then k 1 p i 2 1 n k 2k. n i=0 Proof. The binomial n distribution and another copy of it translated by k differ by at most k2n n, because the binomial coefficients are less than 2n n. Take the i for which p i is the lowest. Define the distribution D(j) = ( n l) where l is the greatest integer j and l = i mod k. This distribution lies in between the two distributions mentioned above. Thus the sum of absolute value of the terms which are negative is at most k n. A similar argument bounds the sum of the positive terms. Before we get to the main part of the induction we must choose our parameters and make another definition. Choose h n so that hn = (l(n 1))(n 10 ) (n10 1), the length of the longest n region. Define ɛ 2 = 1/(2 h 2 + 1) and ɛ n = ɛ (1 100n 2 ). As 100n 2 <, lim ɛ n = ɛ > 0. There is one last definition that we will use heavily. We say that a tree of height h over a point y falls mostly in an n block (or n region) if the interval (h/2 n h, h/2 + n h) is entirely in one n block (region) in y. If an h subtree of the h n tree over y or y falls mostly in B m, for some m, then label that subtree m. An application of lemma 4.2 shows that most h subtrees of a k n subtree over any
5 A NONSTANDARD T,ID ENDOMORPHISM 5 point fall mostly in one n 1 block and thus receive a label. fraction is at least 1 Now choose k i,j n 2l(n 1) kn 2n h l(n 1) = k n so that kn = l(n 1)(n 10 ) i 1/2. > 1 4n 2. This This length k n is between the length of the n regions in B i n and the length of the n region in B j n. This will imply that most k n subtrees in the h n tree over y have many different labels on their h subtrees. But most k n subtrees in the h n tree over y have essentially only one type of labeled h subtree. The next lemma will prove the first of these assertions and the second lemma will prove the latter. The combination of the two will form the heart of the inductive step. Lemma 4.3. If the h n tree over y falls mostly over n block B i n, then for a fraction 1 2n 2 of the k n subtrees in the h n tree over y, and for any given label, a fraction at most 3n 2 of the h subtrees have that label. Proof. We will use an estimate on the binomial coefficients to show that k n subtrees of the h n tree over y which fall mostly in n block B i n have many different labels on their h subtrees. None of these labels have a large fraction of the h subtrees with that label. First we show that only a small fraction of the branches of a k n tree land in any given n 1 region in n block B i n. Then we use that to show that only a small fraction of h blocks in a k n tree can have the same label. No binomial coefficient is larger than 2 n / n. So the number of branches of a k n tree that land in a given h region is at most 2 kn / k n multiplied by the length of an n region in block B i n. Since kn is much larger than l(n 1)(n 10 ) i 1, the length of an n region in block B i n, the fraction of branches that land in a given h region is less than n 2. The distance between two h regions in block B i n that are made out of the same n 1 block is l(n 1)(n 10 ) i 1 (n 10 1). Since this is far larger than k n a Chebychev estimate shows that if the number of branches in one h region has close to the bound then the number of branches that land in all other h regions that are made out of the same n 1 block is miniscule. So the fraction of branches that land in a given h block is less than 2n 2. The fraction of h subtrees with a given label is then less than 3n 2. Finally a Chebychev estimate shows that the fraction of k n subtrees to which the preceding argument
6 6 CHRISTOPHER HOFFMAN applies, those which fall mostly in n block Bn, i is at least 1 2n 2 of all the k n subtrees. For the k n subtrees over y the picture is completely different. Most k n subtrees of the h n tree over y have the same label on almost all of their h subtrees. Lemma 4.4. If the h n tree over y falls mostly over n block B j n then for a fraction 1 6n 2 of the k n subtrees in the h n tree over y a fraction at least 1 2n 2 of the h subtrees in one of these k n subtrees have the same label. Proof. As in the last lemma the k n subtrees which fall mostly in n block B j n, is at least 1 2n 2 of all the k n subtrees. Of these subtrees, lemma 4.2 implies those that do fall mostly in an n region in block B j n make up a fraction at least 1 2n k n l(n 1)(n 10 ) j 1 2l(n 1)(n10 ) j 1 hn > 1 4n 2. In such a k n subtree, a Chebychev estimate shows that a fraction at least 1 2n 2 of the h subtrees have the same label. Thus in 1 6n 2 of the k n subtrees in the big tree over y a fraction at least 1 2n 2 of the h subtrees have the same label. Theorem 4.1. The [T,Id] endomorphism is nonstandard. Proof. We will prove the following inductive statement. If the h n tree over y falls mostly in n block Bn, i the h n tree over y falls mostly in n block Bn, j and i j then v hn (y, y ) > ɛ n. This will complete the proof because 2n h n is much smaller than l(n) so most points y have the h n over y tree falling mostly in one n block. In addition h n, and ɛ n ɛ > 0. Thus these facts, the induction, and theorem 2.1 will imply that [T,Id] is nonstandard. Case n = 2: Since ɛ 2 = 1/(2 h 2 +1) the two trees must match perfectly after some tree isomorphism. No word of length h 2 in one 2 block is identical to a word of length h 2 or its reflection in a different 2 block, or is of period 2, so lemma 4.1 shows the base case is true. Case n: Assume the lemma is true for n 1 and i < j, are given. A tree automorphism must take k n subtrees to k n subtrees, and h subtrees to h subtrees. By lemma 4.4 the k n subtrees over y have essentially only one type of labeled h subtree. But by lemma 4.3 the k n subtrees over y have many different labels. Since most h subtrees are labeled, most h subtrees must be mapped to an h subtree with a different label. On these h subtrees the inductive hypothesis applies. Thus for any automorphism of the tree over y we
7 A NONSTANDARD T,ID ENDOMORPHISM 7 can apply the inductive hypothesis to a fraction at least 1 100n 2 of the h subtrees. As ɛ n = ɛ (1 100n 2 ) the inductive step is true. This completes the proof. References [1] J. Feldman. New K-automorphisms and a problem of Kakutani. Israel J. Math. 24 (1976), no. 1, [2] J. Feldman, D. Rudolph. Standardness of the decreasing sequences of σ-fields given by certain dyadic endomorphisms. in preparation [3] D. Heicklen. Bernoullis are standard when entropy is not an obstruction. to appear Israel J. Math. [4] D. Heicklen, C. Hoffman. T,T 1 is not standard. to appear ETDS. [5] D. Heicklen, C. Hoffman, D. Rudolph. Entropy and dyadic equivalence of random walks on a random scenery. preprint. [6] I. Meilijson. Mixing properties of a class of skew-products. Israel J. Math. 19 (1974), [7] A. M. Vershik. Decreasing sequences of measurable partitions and their applications. Dokl. Akad. Nauk SSSR 193 no. 4 (1970), The Hebrew University, Institute of Mathematics, Jerusalem, Israel Current address: Department of Mathematics, University of Maryland, College Park, MD, address: hoffman@math.umd.edu
If the [T, Id] automorphism is Bernoulli then the [T, Id] endomorphism is standard
If the [T, Id] automorphism is Bernoulli then the [T, Id] endomorphism is standard Christopher Hoffman Daniel Rudolph September 27, 2002 Abstract For any - measure preserving map T of a probability space
More informationA dyadic endomorphism which is Bernoulli but not standard
A dyadic endomorphism which is Bernoulli but not standard Christopher Hoffman Daniel Rudolph November 4, 2005 Abstract Any measure preserving endomorphism generates both a decreasing sequence of σ-algebras
More informationA loosely Bernoulli counterexample machine
A loosely Bernoulli counterexample machine Christopher Hoffman September 7, 00 Abstract In Rudolph s paper on minimal self joinings [7] he proves that a rank one mixing transformation constructed by Ornstein
More informationTHREE ZUTOT ELI GLASNER AND BENJAMIN WEISS
THREE ZUTOT ELI GLASNER AND BENJAMIN WEISS Abstract. Three topics in dynamical systems are discussed. In the first two sections we solve some open problems concerning, respectively, Furstenberg entropy
More informationTHE MEASURE-THEORETIC ENTROPY OF LINEAR CELLULAR AUTOMATA WITH RESPECT TO A MARKOV MEASURE. 1. Introduction
THE MEASURE-THEORETIC ENTROPY OF LINEAR CELLULAR AUTOMATA WITH RESPECT TO A MARKOV MEASURE HASAN AKIN Abstract. The purpose of this short paper is to compute the measure-theoretic entropy of the onedimensional
More informationEntropy dimensions and a class of constructive examples
Entropy dimensions and a class of constructive examples Sébastien Ferenczi Institut de Mathématiques de Luminy CNRS - UMR 6206 Case 907, 63 av. de Luminy F3288 Marseille Cedex 9 (France) and Fédération
More informationIRRATIONAL ROTATION OF THE CIRCLE AND THE BINARY ODOMETER ARE FINITARILY ORBIT EQUIVALENT
IRRATIONAL ROTATION OF THE CIRCLE AND THE BINARY ODOMETER ARE FINITARILY ORBIT EQUIVALENT MRINAL KANTI ROYCHOWDHURY Abstract. Two invertible dynamical systems (X, A, µ, T ) and (Y, B, ν, S) where X, Y
More informationINTRODUCTION TO FURSTENBERG S 2 3 CONJECTURE
INTRODUCTION TO FURSTENBERG S 2 3 CONJECTURE BEN CALL Abstract. In this paper, we introduce the rudiments of ergodic theory and entropy necessary to study Rudolph s partial solution to the 2 3 problem
More informationarxiv: v1 [math.co] 5 Apr 2019
arxiv:1904.02924v1 [math.co] 5 Apr 2019 The asymptotics of the partition of the cube into Weyl simplices, and an encoding of a Bernoulli scheme A. M. Vershik 02.02.2019 Abstract We suggest a combinatorial
More informationNonamenable Products are not Treeable
Version of 30 July 1999 Nonamenable Products are not Treeable by Robin Pemantle and Yuval Peres Abstract. Let X and Y be infinite graphs, such that the automorphism group of X is nonamenable, and the automorphism
More informationA topological semigroup structure on the space of actions modulo weak equivalence.
A topological semigroup structure on the space of actions modulo wea equivalence. Peter Burton January 8, 08 Abstract We introduce a topology on the space of actions modulo wea equivalence finer than the
More informationMath 564 Homework 1. Solutions.
Math 564 Homework 1. Solutions. Problem 1. Prove Proposition 0.2.2. A guide to this problem: start with the open set S = (a, b), for example. First assume that a >, and show that the number a has the properties
More informationMEASURE-THEORETIC ENTROPY
MEASURE-THEORETIC ENTROPY Abstract. We introduce measure-theoretic entropy 1. Some motivation for the formula and the logs We want to define a function I : [0, 1] R which measures how suprised we are or
More informationJónsson posets and unary Jónsson algebras
Jónsson posets and unary Jónsson algebras Keith A. Kearnes and Greg Oman Abstract. We show that if P is an infinite poset whose proper order ideals have cardinality strictly less than P, and κ is a cardinal
More informationA product of γ-sets which is not Menger.
A product of γ-sets which is not Menger. A. Miller Dec 2009 Theorem. Assume CH. Then there exists γ-sets A 0, A 1 2 ω such that A 0 A 1 is not Menger. We use perfect sets determined by Silver forcing (see
More informationA. S. Kechris: Classical Descriptive Set Theory; Corrections and Updates (October 1, 2018)
A. S. Kechris: Classical Descriptive Set Theory; Corrections and Updates (October 1, 2018) Page 3, line 9-: add after spaces,with d i < 1, Page 8, line 11: D ϕ D(ϕ) Page 22, line 6: x 0 e x e Page 22:
More informationA BOOLEAN ACTION OF C(M, U(1)) WITHOUT A SPATIAL MODEL AND A RE-EXAMINATION OF THE CAMERON MARTIN THEOREM
A BOOLEAN ACTION OF C(M, U(1)) WITHOUT A SPATIAL MODEL AND A RE-EXAMINATION OF THE CAMERON MARTIN THEOREM JUSTIN TATCH MOORE AND S LAWOMIR SOLECKI Abstract. We will demonstrate that if M is an uncountable
More informationREVERSALS ON SFT S. 1. Introduction and preliminaries
Trends in Mathematics Information Center for Mathematical Sciences Volume 7, Number 2, December, 2004, Pages 119 125 REVERSALS ON SFT S JUNGSEOB LEE Abstract. Reversals of topological dynamical systems
More informationSpectral Continuity Properties of Graph Laplacians
Spectral Continuity Properties of Graph Laplacians David Jekel May 24, 2017 Overview Spectral invariants of the graph Laplacian depend continuously on the graph. We consider triples (G, x, T ), where G
More informationDefining the Integral
Defining the Integral In these notes we provide a careful definition of the Lebesgue integral and we prove each of the three main convergence theorems. For the duration of these notes, let (, M, µ) be
More informationAutomata on linear orderings
Automata on linear orderings Véronique Bruyère Institut d Informatique Université de Mons-Hainaut Olivier Carton LIAFA Université Paris 7 September 25, 2006 Abstract We consider words indexed by linear
More informationDan s Thesis. Every flow can be represented as a flow built under a function
Dan s Thesis Every flow can be represented as a flow built under a function Dan function that takes 2 values 2 Ergodic Theory Year 1975 1976 Hebrew University, Jerusalem S. Foguel H. Furstenberg S. Goldstein
More informationMath 324 Summer 2012 Elementary Number Theory Notes on Mathematical Induction
Math 4 Summer 01 Elementary Number Theory Notes on Mathematical Induction Principle of Mathematical Induction Recall the following axiom for the set of integers. Well-Ordering Axiom for the Integers If
More informationMARKOV PARTITIONS FOR HYPERBOLIC SETS
MARKOV PARTITIONS FOR HYPERBOLIC SETS TODD FISHER, HIMAL RATHNAKUMARA Abstract. We show that if f is a diffeomorphism of a manifold to itself, Λ is a mixing (or transitive) hyperbolic set, and V is a neighborhood
More informationOn the Effectiveness of Symmetry Breaking
On the Effectiveness of Symmetry Breaking Russell Miller 1, Reed Solomon 2, and Rebecca M Steiner 3 1 Queens College and the Graduate Center of the City University of New York Flushing NY 11367 2 University
More informationCHAPTER I THE RIESZ REPRESENTATION THEOREM
CHAPTER I THE RIESZ REPRESENTATION THEOREM We begin our study by identifying certain special kinds of linear functionals on certain special vector spaces of functions. We describe these linear functionals
More informationSYNCHRONOUS RECURRENCE. Contents
SYNCHRONOUS RECURRENCE KAMEL HADDAD, WILLIAM OTT, AND RONNIE PAVLOV Abstract. Auslander and Furstenberg asked the following question in [1]: If (x, y) is recurrent for all uniformly recurrent points y,
More informationThe theory of Bernoulli Shifts
The theory of Bernoulli Shifts by Paul C. Shields Professor Emeritus of Mathematics University of Toledo, Toledo, OH 4366 Send corrections to bshifts@earthlink.net Web Edition 1.1 Reprint of 1973 University
More informationA NOTE ON MIXING PROPERTIES OF INVERTIBLE EXTENSIONS. 1. Invertible Extensions
Acta Math. Univ. Comenianae Vol. LXVI, 21997, pp. 307 311 307 A NOTE ON MIXING PROPERTIES OF INVERTIBLE EXTENSIONS G. MORRIS T. WARD Abstract. The natural invertible extension T of an N d -action T has
More informationDIRECTIONAL ERGODICITY AND MIXING FOR ACTIONS OF Z d
DIRECTIONAL ERGODICITY AND MIXING FOR ACTIONS OF Z d E. ARTHUR ROBINSON JR, JOSEPH ROSENBLATT, AND AYŞE A. ŞAHİN 1. Introduction In this paper we define directional ergodicity and directional weak mixing
More informationNoetherian property of infinite EI categories
Noetherian property of infinite EI categories Wee Liang Gan and Liping Li Abstract. It is known that finitely generated FI-modules over a field of characteristic 0 are Noetherian. We generalize this result
More informationStrong theories, burden, and weight
Strong theories, burden, and weight Hans Adler 13th March 2007 Abstract We introduce the notion of the burden of a partial type in a complete first-order theory and call a theory strong if all types have
More informationA UNIVERSAL HYPERCYCLIC REPRESENTATION
A UNIVERSAL HYPERCYCLIC REPRESENTATION ELI GLASNER AND BENJAMIN WEISS Abstract. For any countable group, and also for any locally compact second countable, compactly generated topological group, G, we
More informationarxiv: v1 [math.co] 3 Nov 2014
SPARSE MATRICES DESCRIBING ITERATIONS OF INTEGER-VALUED FUNCTIONS BERND C. KELLNER arxiv:1411.0590v1 [math.co] 3 Nov 014 Abstract. We consider iterations of integer-valued functions φ, which have no fixed
More information1 Fields and vector spaces
1 Fields and vector spaces In this section we revise some algebraic preliminaries and establish notation. 1.1 Division rings and fields A division ring, or skew field, is a structure F with two binary
More informationarxiv: v2 [math.co] 3 Jan 2019
IS THE SYMMETRIC GROUP SPERNER? arxiv:90.0097v2 [math.co] 3 Jan 209 LARRY H. HARPER AND GENE B. KIM Abstract. An antichain A in a poset P is a subset of P in which no two elements are comparable. Sperner
More informationIndependent generating sets and geometries for symmetric groups
Independent generating sets and geometries for symmetric groups Peter J. Cameron School of Mathematical Sciences Queen Mary, University of London Mile End Road London E1 4NS UK Philippe Cara Department
More informationERGODIC DYNAMICAL SYSTEMS CONJUGATE TO THEIR COMPOSITION SQUARES. 0. Introduction
Acta Math. Univ. Comenianae Vol. LXXI, 2(2002), pp. 201 210 201 ERGODIC DYNAMICAL SYSTEMS CONJUGATE TO THEIR COMPOSITION SQUARES G. R. GOODSON Abstract. We investigate the question of when an ergodic automorphism
More informationProbability and Measure
Part II Year 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2018 84 Paper 4, Section II 26J Let (X, A) be a measurable space. Let T : X X be a measurable map, and µ a probability
More information4. Ergodicity and mixing
4. Ergodicity and mixing 4. Introduction In the previous lecture we defined what is meant by an invariant measure. In this lecture, we define what is meant by an ergodic measure. The primary motivation
More informationTAIL FIELDS GENERATED BY SYMBOL COUNTS IN MEASURE-PRESERVING SYSTEMS
TAIL FIELDS GENERATED BY SYMBOL COUNTS IN MEASURE-PRESERVING SYSTEMS KARL PETERSEN AND JEAN-PAUL THOUVENOT In memory of Anzelm Iwanik Abstract. A finite-state stationary process is called (one or twosided)
More informationErgodic Theorems. Samy Tindel. Purdue University. Probability Theory 2 - MA 539. Taken from Probability: Theory and examples by R.
Ergodic Theorems Samy Tindel Purdue University Probability Theory 2 - MA 539 Taken from Probability: Theory and examples by R. Durrett Samy T. Ergodic theorems Probability Theory 1 / 92 Outline 1 Definitions
More informationarxiv:math/ v1 [math.ra] 18 Mar 2004
arxiv:math/0403314v1 [math.ra] 18 Mar 2004 WEIGHT AND RANK OF MATRICES OVER FINITE FIELDS THERESA MIGLER, KENT E. MORRISON, AND MITCHELL OGLE Abstract. Define the weight of a matrix to be the number of
More informationWeak disjointness of measure preserving dynamical systems
Weak disjointness of measure preserving dynamical systems Emmanuel Lesigne, Benoît Rittaud, Thierry De La Rue To cite this version: Emmanuel Lesigne, Benoît Rittaud, Thierry De La Rue. Weak disjointness
More informationarxiv:math/ v1 [math.oa] 10 Feb 2000
On the K-property of quantized Arnold cat maps arxiv:math/0002080v [math.oa] 0 Feb 2000 I S.V. Neshveyev Abstract We prove that some quantized Arnold cat maps are entropic K-systems. his result was formulated
More informationSOME DESIGNS AND CODES FROM L 2 (q) Communicated by Alireza Abdollahi
Transactions on Combinatorics ISSN (print): 2251-8657, ISSN (on-line): 2251-8665 Vol. 3 No. 1 (2014), pp. 15-28. c 2014 University of Isfahan www.combinatorics.ir www.ui.ac.ir SOME DESIGNS AND CODES FROM
More informationMEAN DIMENSION AND AN EMBEDDING PROBLEM: AN EXAMPLE
MEAN DIMENSION AND AN EMBEDDING PROBLEM: AN EXAMPLE ELON LINDENSTRAUSS, MASAKI TSUKAMOTO Abstract. For any positive integer D, we construct a minimal dynamical system with mean dimension equal to D/2 that
More informationDivisibility in the Fibonacci Numbers. Stefan Erickson Colorado College January 27, 2006
Divisibility in the Fibonacci Numbers Stefan Erickson Colorado College January 27, 2006 Fibonacci Numbers F n+2 = F n+1 + F n n 1 2 3 4 6 7 8 9 10 11 12 F n 1 1 2 3 8 13 21 34 89 144 n 13 14 1 16 17 18
More informationMATH39001 Generating functions. 1 Ordinary power series generating functions
MATH3900 Generating functions The reference for this part of the course is generatingfunctionology by Herbert Wilf. The 2nd edition is downloadable free from http://www.math.upenn. edu/~wilf/downldgf.html,
More informationAsymptotic theory of path spaces of graded graphs and its applications
arxiv:1604.03022v1 [math.ds] 11 Apr 2016 Asymptotic theory of path spaces of graded graphs and its applications A. M. Vershik April 12, 2016 A version of Takagi Lectures (27 28 June 2015, Tohoku University,
More informationSystems of distinct representatives/1
Systems of distinct representatives 1 SDRs and Hall s Theorem Let (X 1,...,X n ) be a family of subsets of a set A, indexed by the first n natural numbers. (We allow some of the sets to be equal.) A system
More informationOn sofic groups. arxiv:math/ v1 [math.gr] 25 May 2003
On sofic groups arxiv:math/0305352v1 [math.gr] 25 May 2003 Gábor Elek and Endre Szabó Mathematical Institute of the Hungarian Academy of Sciences P.O. Box 127, H-1364 Budapest, Hungary elek@renyi.hu endre@renyi.hu
More information1 i<j k (g ih j g j h i ) 0.
CONSECUTIVE PRIMES IN TUPLES WILLIAM D. BANKS, TRISTAN FREIBERG, AND CAROLINE L. TURNAGE-BUTTERBAUGH Abstract. In a stunning new advance towards the Prime k-tuple Conjecture, Maynard and Tao have shown
More informationMATH41011/MATH61011: FOURIER SERIES AND LEBESGUE INTEGRATION. Extra Reading Material for Level 4 and Level 6
MATH41011/MATH61011: FOURIER SERIES AND LEBESGUE INTEGRATION Extra Reading Material for Level 4 and Level 6 Part A: Construction of Lebesgue Measure The first part the extra material consists of the construction
More informationA Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits
A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits Ran Raz Amir Shpilka Amir Yehudayoff Abstract We construct an explicit polynomial f(x 1,..., x n ), with coefficients in {0,
More informationTopological groups with dense compactly generated subgroups
Applied General Topology c Universidad Politécnica de Valencia Volume 3, No. 1, 2002 pp. 85 89 Topological groups with dense compactly generated subgroups Hiroshi Fujita and Dmitri Shakhmatov Abstract.
More informationKLEIN-FOUR COVERS OF THE PROJECTIVE LINE IN CHARACTERISTIC TWO
ALBANIAN JOURNAL OF MATHEMATICS Volume 1, Number 1, Pages 3 11 ISSN 1930-135(electronic version) KLEIN-FOUR COVERS OF THE PROJECTIVE LINE IN CHARACTERISTIC TWO DARREN GLASS (Communicated by T. Shaska)
More informationUniform mixing and completely positive sofic entropy
Uniform mixing and completely positive sofic entropy Tim Austin and Peter Burton October 3, 206 Abstract Let G be a countable discrete sofic group. We define a concept of uniform mixing for measurepreserving
More informationTOPOLOGICAL COMPLEXITY OF 2-TORSION LENS SPACES AND ku-(co)homology
TOPOLOGICAL COMPLEXITY OF 2-TORSION LENS SPACES AND ku-(co)homology DONALD M. DAVIS Abstract. We use ku-cohomology to determine lower bounds for the topological complexity of mod-2 e lens spaces. In the
More informationCHAPTER 3: THE INTEGERS Z
CHAPTER 3: THE INTEGERS Z MATH 378, CSUSM. SPRING 2009. AITKEN 1. Introduction The natural numbers are designed for measuring the size of finite sets, but what if you want to compare the sizes of two sets?
More informationTT-FUNCTIONALS AND MARTIN-LÖF RANDOMNESS FOR BERNOULLI MEASURES
TT-FUNCTIONALS AND MARTIN-LÖF RANDOMNESS FOR BERNOULLI MEASURES LOGAN AXON Abstract. For r [0, 1], the Bernoulli measure µ r on the Cantor space {0, 1} N assigns measure r to the set of sequences with
More informationCombinatorial Proof of the Hot Spot Theorem
Combinatorial Proof of the Hot Spot Theorem Ernie Croot May 30, 2006 1 Introduction A problem which has perplexed mathematicians for a long time, is to decide whether the digits of π are random-looking,
More informationErgodic Theory. Constantine Caramanis. May 6, 1999
Ergodic Theory Constantine Caramanis ay 6, 1999 1 Introduction Ergodic theory involves the study of transformations on measure spaces. Interchanging the words measurable function and probability density
More informationErgodicity of the adic transformation on the Euler graph
Under consideration for publication in Math. Proc. Camb. Phil. Soc. Ergodicity of the adic transformation on the Euler graph By SARAH BAILEY Department of Mathematics, CB 250, Phillips Hall, University
More informationDIMENSION OF SLICES THROUGH THE SIERPINSKI CARPET
DIMENSION OF SLICES THROUGH THE SIERPINSKI CARPET ANTHONY MANNING AND KÁROLY SIMON Abstract For Lebesgue typical (θ, a), the intersection of the Sierpinski carpet F with a line y = x tan θ + a has (if
More informationClassification of root systems
Classification of root systems September 8, 2017 1 Introduction These notes are an approximate outline of some of the material to be covered on Thursday, April 9; Tuesday, April 14; and Thursday, April
More informationLimits of cubes E1 4NS, U.K.
Limits of cubes Peter J. Cameron a Sam Tarzi a a School of Mathematical Sciences, Queen Mary, University of London, London E1 4NS, U.K. Abstract The celebrated Urysohn space is the completion of a countable
More informationRearrangements of convergence sums at infinity
Rearrangements of convergence sums at infinity Chelton D. Evans and William K. Pattinson Abstract Convergence sums theory is concerned with monotonic series testing. On face value, this may seem a limitation
More informationProbability and Measure
Probability and Measure Robert L. Wolpert Institute of Statistics and Decision Sciences Duke University, Durham, NC, USA Convergence of Random Variables 1. Convergence Concepts 1.1. Convergence of Real
More informationIsomorphism of free G-subflows (preliminary draft)
Isomorphism of free G-subflows (preliminary draft) John D. Clemens August 3, 21 Abstract We show that for G a countable group which is not locally finite, the isomorphism of free G-subflows is bi-reducible
More informationarxiv:math.cv/ v1 23 Dec 2003
EXPONENTIAL GELFOND-KHOVANSKII FORMULA IN DIMENSION ONE arxiv:math.cv/0312433 v1 23 Dec 2003 EVGENIA SOPRUNOVA Abstract. Gelfond and Khovanskii found a formula for the sum of the values of a Laurent polynomial
More informationAsymptotic redundancy and prolixity
Asymptotic redundancy and prolixity Yuval Dagan, Yuval Filmus, and Shay Moran April 6, 2017 Abstract Gallager (1978) considered the worst-case redundancy of Huffman codes as the maximum probability tends
More informationAn Asymptotic Property of Schachermayer s Space under Renorming
Journal of Mathematical Analysis and Applications 50, 670 680 000) doi:10.1006/jmaa.000.7104, available online at http://www.idealibrary.com on An Asymptotic Property of Schachermayer s Space under Renorming
More informationSOME PROPERTIES OF ESSENTIAL SPECTRA OF A POSITIVE OPERATOR
SOME PROPERTIES OF ESSENTIAL SPECTRA OF A POSITIVE OPERATOR E. A. ALEKHNO (Belarus, Minsk) Abstract. Let E be a Banach lattice, T be a bounded operator on E. The Weyl essential spectrum σ ew (T ) of the
More informationGroups and Symmetries
Groups and Symmetries Definition: Symmetry A symmetry of a shape is a rigid motion that takes vertices to vertices, edges to edges. Note: A rigid motion preserves angles and distances. Definition: Group
More informationMath 117: Infinite Sequences
Math 7: Infinite Sequences John Douglas Moore November, 008 The three main theorems in the theory of infinite sequences are the Monotone Convergence Theorem, the Cauchy Sequence Theorem and the Subsequence
More informationA note on a construction of J. F. Feinstein
STUDIA MATHEMATICA 169 (1) (2005) A note on a construction of J. F. Feinstein by M. J. Heath (Nottingham) Abstract. In [6] J. F. Feinstein constructed a compact plane set X such that R(X), the uniform
More information1 Kaplanski conjectures
Kaplanski conjectures. Group algebras and the statements of Kaplanski s conjectures Suppose that is a group and K is a eld. The group algebra K is the K-algebra of formal nite linear combinations k + :
More informationAsymptotically optimal induced universal graphs
Asymptotically optimal induced universal graphs Noga Alon Abstract We prove that the minimum number of vertices of a graph that contains every graph on vertices as an induced subgraph is (1 + o(1))2 (
More informationBoolean Inner-Product Spaces and Boolean Matrices
Boolean Inner-Product Spaces and Boolean Matrices Stan Gudder Department of Mathematics, University of Denver, Denver CO 80208 Frédéric Latrémolière Department of Mathematics, University of Denver, Denver
More informationDISTINGUISHING PARTITIONS AND ASYMMETRIC UNIFORM HYPERGRAPHS
DISTINGUISHING PARTITIONS AND ASYMMETRIC UNIFORM HYPERGRAPHS M. N. ELLINGHAM AND JUSTIN Z. SCHROEDER In memory of Mike Albertson. Abstract. A distinguishing partition for an action of a group Γ on a set
More informationFactorization of unitary representations of adele groups Paul Garrett garrett/
(February 19, 2005) Factorization of unitary representations of adele groups Paul Garrett garrett@math.umn.edu http://www.math.umn.edu/ garrett/ The result sketched here is of fundamental importance in
More informationBERNOULLI ACTIONS AND INFINITE ENTROPY
BERNOULLI ACTIONS AND INFINITE ENTROPY DAVID KERR AND HANFENG LI Abstract. We show that, for countable sofic groups, a Bernoulli action with infinite entropy base has infinite entropy with respect to every
More informationREPRESENTING HOMOLOGY AUTOMORPHISMS OF NONORIENTABLE SURFACES
REPRESENTING HOMOLOGY AUTOMORPHISMS OF NONORIENTABLE SURFACES JOHN D. MCCARTHY AND ULRICH PINKALL Abstract. In this paper, we prove that every automorphism of the first homology group of a closed, connected,
More informationODD PARTITIONS IN YOUNG S LATTICE
Séminaire Lotharingien de Combinatoire 75 (2016), Article B75g ODD PARTITIONS IN YOUNG S LATTICE ARVIND AYYER, AMRITANSHU PRASAD, AND STEVEN SPALLONE Abstract. We show that the subgraph induced in Young
More informationLinear Algebra and Vector Analysis MATH 1120
Faculty of Engineering Mechanical Engineering Department Linear Algebra and Vector Analysis MATH 1120 : Instructor Dr. O. Philips Agboola Determinants and Cramer s Rule Determinants If a matrix is square
More informationLIMITING CASES OF BOARDMAN S FIVE HALVES THEOREM
Proceedings of the Edinburgh Mathematical Society Submitted Paper Paper 14 June 2011 LIMITING CASES OF BOARDMAN S FIVE HALVES THEOREM MICHAEL C. CRABB AND PEDRO L. Q. PERGHER Institute of Mathematics,
More informationJOININGS, FACTORS, AND BAIRE CATEGORY
JOININGS, FACTORS, AND BAIRE CATEGORY Abstract. We discuss the Burton-Rothstein approach to Ornstein theory. 1. Weak convergence Let (X, B) be a metric space and B be the Borel sigma-algebra generated
More informationMATH 101: ALGEBRA I WORKSHEET, DAY #1. We review the prerequisites for the course in set theory and beginning a first pass on group. 1.
MATH 101: ALGEBRA I WORKSHEET, DAY #1 We review the prerequisites for the course in set theory and beginning a first pass on group theory. Fill in the blanks as we go along. 1. Sets A set is a collection
More informationWhat you learned in Math 28. Rosa C. Orellana
What you learned in Math 28 Rosa C. Orellana Chapter 1 - Basic Counting Techniques Sum Principle If we have a partition of a finite set S, then the size of S is the sum of the sizes of the blocks of the
More informationPERIODIC POINTS FOR ONTO CELLULAR AUTOMATA
PERIODIC POINTS FOR ONTO CELLULAR AUTOMATA MIKE BOYLE AND BRUCE KITCHENS Summary. Let ϕ be a one-dimensional surjective cellular automaton map. We prove that if ϕ is a closing map, then the configurations
More informationAn example of a convex body without symmetric projections.
An example of a convex body without symmetric projections. E. D. Gluskin A. E. Litvak N. Tomczak-Jaegermann Abstract Many crucial results of the asymptotic theory of symmetric convex bodies were extended
More informationCROSS SECTIONS OF BOREL FLOWS WITH RESTRICTIONS ON THE DISTANCE SET
CROSS SECTIONS OF BOREL FLOWS WITH RESTRICTIONS ON THE DISTANCE SET KONSTANTIN SLUTSKY Abstract. Given a set of positive reals, we provide a necessary and sufficient condition for a free Borel flow to
More informationERGODIC AVERAGES FOR INDEPENDENT POLYNOMIALS AND APPLICATIONS
ERGODIC AVERAGES FOR INDEPENDENT POLYNOMIALS AND APPLICATIONS NIKOS FRANTZIKINAKIS AND BRYNA KRA Abstract. Szemerédi s Theorem states that a set of integers with positive upper density contains arbitrarily
More informationUNIVERSAL DERIVED EQUIVALENCES OF POSETS
UNIVERSAL DERIVED EQUIVALENCES OF POSETS SEFI LADKANI Abstract. By using only combinatorial data on two posets X and Y, we construct a set of so-called formulas. A formula produces simultaneously, for
More informationRadical Endomorphisms of Decomposable Modules
Radical Endomorphisms of Decomposable Modules Julius M. Zelmanowitz University of California, Oakland, CA 94607 USA Abstract An element of the Jacobson radical of the endomorphism ring of a decomposable
More informationReverse mathematics of some topics from algorithmic graph theory
F U N D A M E N T A MATHEMATICAE 157 (1998) Reverse mathematics of some topics from algorithmic graph theory by Peter G. C l o t e (Chestnut Hill, Mass.) and Jeffry L. H i r s t (Boone, N.C.) Abstract.
More informationINDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS
INDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS STEVEN P. LALLEY AND ANDREW NOBEL Abstract. It is shown that there are no consistent decision rules for the hypothesis testing problem
More informationDefinitions. Notations. Injective, Surjective and Bijective. Divides. Cartesian Product. Relations. Equivalence Relations
Page 1 Definitions Tuesday, May 8, 2018 12:23 AM Notations " " means "equals, by definition" the set of all real numbers the set of integers Denote a function from a set to a set by Denote the image of
More informationLocating-Total Dominating Sets in Twin-Free Graphs: a Conjecture
Locating-Total Dominating Sets in Twin-Free Graphs: a Conjecture Florent Foucaud Michael A. Henning Department of Pure and Applied Mathematics University of Johannesburg Auckland Park, 2006, South Africa
More information