Continuous and Borel Dynamics of Countable Borel Equivalence Relations
|
|
- Shona Garrison
- 5 years ago
- Views:
Transcription
1 Continuous and Borel Dynamics of Countable Borel Equivalence Relations S. Jackson (joint with S. Gao, E. Krohne, and B. Seward) Department of Mathematics University of North Texas June 9, 2015 BLAST 2015, UNT
2 In recent years there has been progress in the theory of countable Borel equivalence relations. In particular, there has been an infusion of new techniques from several different areas. New techniques involve ideas from logic, set theory, recursion theory, and dynamics. This has resulted in the solution to several problems that had been around for a while, and points to possible future progress.
3 Some examples: Adams and Kechris build on the Zimmer superrigidity theory to construct many new examples of complicated structure within the context of countable Borel equivalence relations. These arguments were extended and simplified by Hjorth, Kechris, and Miller. A. Marks uses methods relating to Borel determinacy to prove new results about actions of free products of groups. These methods answered several open combinatorial questions about these actions. Kechris and Marks have developed a theory of these group actions.
4 S. Thomas has used Martin s conjecture on the degrees to obtain new fundamental results about some basic equivalence relations such as T. Marks, Slaman, Steel have used methods from recursion theory to about arithmetic equivalence and restricted form of universality. The current authors have introduced new dynamical methods and methods from logic (forcing) to answer questions about actions of abelian groups (and some more generally).
5 Basic Concepts If X is a Polish space, E an equivalence relation on X: We say E is Borel if E X X is Borel. We say E is countable if each E-class is countable. [x] E = {y : xey} If Γ X is an action of Γ on X, the orbit equivalence relation is defined by E Γ X = {(x, y) X X : g Γ (g x = y)}
6 By Feldman-Moore every countable Borel equivalence relation E on X is of the form E = E Γ for some countable group Γ. X Thus, we can view the theory as the study of continuous or Borel actions of countable groups Γ. It makes sense to study them group-by-group. Even for the simplest groups, e.g. Γ = Z n, there are many interesting problems, and only recently have some of them been approachable. On the other hand, some of the recent results of Marks and Kechris-Marks have interesting parallels to these results in the case Γ = F n.
7 The basic notion in the theory is that of a reduction of one relation (X, E) to another (Y, F). This can be viewed as saying the effective cardinality of the quotient space X/E is less than or equal to that of Y/F. Definition If E is on X and F is on Y, we say ϕ: X Y is a reduction of E to F if: x E y ϕ(x) F ϕ(y). We write E F. If E F and F E we say E, F are bi-reducible and write E F. We write E F if the reduction from E to F is one-to-one. Note that if E F then X/E and Y/F are in bijection by a Borel function.
8 Some terminology concerning group actions Γ X denotes a (continuous or Borel) action of Γ on X. If Γ X, Γ Y, we say ϕ: X Y is a Γ-equivariant map if ϕ(g x) = g ϕ(x). If ϕ is also one-to-one we say it is an equivariant embedding or a Γ-embedding. The action Γ X is free if for all g 1 Γ, g x x for all x X.
9 The (left) shift-action of Γ on 2 Γ is the action: (g x)(h) = x(g 1 h) The shift action of Γ on 2 Γ is important because it is essentially universal. Theorem (Becker-Kechris) The action Γ 2 Γ ω given by (g x)(h, n) = x(g 1 h, n) is a universal Borel Γ-action. That is, every Γ action Borel equivariantly embeds into the shift action. If X is 0-dimensional and the action is continuous, then the embedding is continuous.
10 hyperfiniteness The simplest case is Γ = Z. Definition E is hyperfinite if E = n E n, an increasing union, with each E n finite. Theorem (Slaman-Steel) E is hyperfinite iff E is induced by a Borel action of Z. For x, y 2 ω, let xe 0 y n m n (x(m) = y(m)) Then E is hyperfinite iff E E 0. All non-smooth hyperfinite E are bi-reducible with E 0.
11 New Methods Three new methods have been developed recently which have been used to answer questions about continuous and Borel action of Γ = Z n, Γ abelian, and in some cases general Γ. New dynamical methods for introducing marker structures in actions by Γ, in particular the orthogonal marker construction. The development of certain combinatorial constructions on groups, in particular the notion of a 2-coloring of a group Γ. The use of certain forcing constructions to prove results about general Borel actions of certain groups. The three techniques are inter-related. Working together, they can sometimes obtain the sharpest positive and negative results for a particular problem.
12 Orthogonal Markers Introduction A marker set M X refers to a Borel complete, co-complete section of X, that is, [x] M and [x] M c for all x X. Usually we are interested in marker sets M or sequences of marker sets M n with a regular structure or prescribed behavior. Theorem (Kechris-Miller) For any countable aperiodic Borel equivalence relation E on X, there is a sequence M n of Borel markers such that n M n =. We call these Slaman-Steel Markers.
13 Marker sequences are frequently used to do positive continuous or Borel constructions. One application is to the hyperfiniteness problem. Question (Kechris) Is the Borel action of every amenable group hyperfinite? Some Results: Slaman-Steel proof that 2 Z is hyperfinite uses markers M n with n M n =. Weiss proof that 2 Zn is hyperfinite uses markers M n with bounded geometry. Gao-J proof that all abelian actions are hyperfinite uses orthogonal markers. Seward-Schneider showed that all nilpotent actions are hyperfinite using a generalization of orthogonal markers.
14 Some related applications: (Boykin-J) There is a continuous embedding of 2 Zn into E 0. This extends (Gao-J) to the free part of 2 Z<ω. (Gao-J) There is a continuous 4-coloring of F(2 Zn ). The last result is an instance of the chromatic number problem. Problem Let Γ = x 1,..., x m R 1, R 2,... be a finitely generated group. Determine the continuous and Borel chromatic numbers of the actions Γ X. In particular, determine the continuous and Borel chromatic numbers χ c (F(2 Γ )), χ b (F(2 Γ )) of F(2 Γ ).
15 Marker Regions By marker regions R we mean a subequivalence relation of E with finite classes. We say the regions are clopen if the relation is clopen. A(x, g) g x R x Question What kinds of marker regions can we get for 2 Γ?
16 We can define the shape of a marker region (an equivalence class of a subset of Γ under translation). Namely, if x is in the marker region R, then the shape S x of R relative to x is {g Γ: g x R x}. If g 0 x R x, then the shape relative to g 0 x is S x g 1 0. If G is an abelian group, it makes sense to speak of the geometrical shape of a marker region, e.g., being a rectangle, etc. Seward-Schneider use the fact that if G is nilpotent then we can speak of the approximate shape of certain marker regions.
17 Many fundamental problems in the theory of marker structures are illustrated in the case of G = Z n. The following is the basic marker lemma. Fact For any d > 0 there is a relatively clopen M d F(2 Zn ) satisfying: 1. For any x y M d, ρ(x, y) > d. 2. For any x F(2 Zd ), there is a y M d with ρ(x, y) d. Given d 1 < d 2 <, we can get a sequence M d1 M d2 of relatively clopen marker sets in F(2 Zn ) satisfying the above with d i (1 ɛ) and d i (1 + ɛ).
18 On each class [x] we have [x] i M di 1. We can modify these markers in a Borel way to get i M di =, that is, to get a Borel set of Slaman-Steel markers. This can be used to get the Slaman-Steel result that there is a Borel embedding of 2 Z into E 0. The corrresponding marker regions (Voronoi regions) were usde by Weiss to show that 2 Zn is Hyperfinite.
19 We can improve the marker regions to have a more regular geometric shape. Theorem (Gao-J) For any d > 1 there is a clopen rectangular marker structure R on F(2 Zn ) such that each R class R is a rectangle with side lengths in {d, d + 1}. Gao-J used this to get an upper-bound for the continuous chromatic number (for n = 1 the exact number is easily 3): χ c (F(2 Zn )) 4
20 Orthogonal Markers Introduction There are limitations to what the basic rectangular marker regions can do. Fact A clopen decreasing marker sequence in F(2 Z ) cannot be a Slaman-Steel marker sequence, so cannot directly witness hyperfiniteness as in the Slaman-Steel proof. Fact There does not exists a Borel sequence of rectangular marker regions in F(2 Zn ) with bounded geometry and such that lim n ρ(x, R n ) =.
21 Fix d 1 d 2 d 3. Theorem (Orthogonal Markers) There is a clopen sequence of marker regions M i F(2 Zn ) satisfying the following. 1. Each R M i is a rectangle on scale d i. For j < i, each R M i on scale d j is a rectangular polyhedron with edge lengths d j. 2. For i 1, i 2 j and R 1 M i1, R 2 M i2, if e 1 is an edge of R 1 at scale d j, and e 2 an edge of R 2 at scale d j, and e 1 is parallel to e 2, then ρ(e 1, e 2 ) > c n d j for some positive constant c n. Remark So at scale d j, if an edge e 1 from R i1 and e 2 from R i2 intersect, they must be orthogonal.
22 Figure: Adjusting from R j+1 i to R j i
23 Figure: Adjusting from R j+1 i to R j i
24 It follows that if R i are orthogonal marker regions, then lim n ρ(x, R i ) = for all x F(2 Zn ). This gives a continuous embedding from 2 Zn into E 0. This is the basis for the proof of the hyperfiniteness of abelian group actions. B. Seward found ways to extend the orthogonal marker arguments. Theorem The is a Borel chromatic 3-coloring of F(2 Zn ). Theorem There is a Borel perfect matching of F(2 Zn ), n 2.
25 Let Γ X. Definition An element x X is hyperaperiodic if [x] F(X). That is, x is hyperaperiodic if x is contained in a subflow (closed, invariant set) contained in the free part F(X). When X = 2 Γ, then [x] is compact when x is hyperaperiodic.
26 Definition x 2 Γ is a 2-coloring if for all nonidentity s Γ there is a T Γ <ω such that: g Γ t T (x(gt) x(gst)) Fact (GJ) x 2 Γ is hyperaperiodic iff x is a 2-coloring. Theorem (GJS) For every countable group Γ there is a 2-coloring x 2 Γ.
27 Corollary There does not exist a clopen set of Slaman-Steel markers for F(2 Zn ). By constructing the 2-coloring more carefully, we can rule out various continuous structures. E. Krohne was able to use these techniques to get the following. Theorem For n 2, there is no continuous 3-coloring of F(2 Zn ). Corollary χ b (2 Z ) = χ c (2 Z ) = 3 3 = χ b (2 Zn ) < χ c (2 Zn ) = 4 for n 2
28 Another application: Theorem There does not exists a continuous perfect matching of F(2 Zn ). Remark E. Krohne has developed an exact condition for there to be a continuous graph homomorphism from F(2 Zn ) to a graph G. The condition is that for all sufficiently large co-prime p, q that there are homomorphisms from 12 tiles T p,q 1,..., T p,q to G. 12
29 sketch of proof Construct a 2-coloring x F(2 Z2 ) with the following structure. p 2 p 1 Figure: A special 2-coloring, the p i are odd
30 Let K = [x] F(2 Z2 ), so K is compact. Let n be such that for y K, y [ n, n] 2 determines the point y is matched with. Let p i n. Then on [x] we have a p i p i square which is perfectly matched. This is a contradiction as p 2 is odd. i
31 Continuous homomorphisms to graphs Using a special case of the 12 tiles theorem (for the negative direction) and the orthgonal marker construction (for the positive direction) we get positive and negative conditions. Let Γ be a graph. Let H = H v (Γ) be the homotopy group of Γ with base point v V(Γ). Let be the normal subgroup of H generated by the 4-cycles in Γ. Let G = G(Γ) = H/.
32 Negative Condition Introduction Let γ be a countable group, G = G(Γ) = H/. Negative Condition: co-prime p, q p cycles γ in Γ [γ q is not a p power in G(Γ)] (p, q not necessarily primes here). Weighting Condition: homomorphism ϕ: G(Γ) A torsion-free abelian, p p-cycles γ in Γ [ϕ(γ) is not a p power in A]
33 Positive Condition Introduction Positive Condition: odd γ G(Γ) of finite order in G(Γ)
34 Figure: Satisfies weighting condition using ±1.
35 i j a k b c h g f d e Figure: Grötzsch graph, satisfies the positive condition.
36 Proof of positive condition: Let γ = (a, e, i, c, g, a), a 5-cycle in the Grötzsch graph Γ. We have γ 2 = e in G(Γ) as follows. (abcdea) (agcdea) (agciea) = γ 1. (abcdea) (ajihgfea) (aeihgfea) (aeicgfea) (aeicgaea) (aeicga) = γ. So, γ = γ 1 in G(Γ).
37 Orbit Forcing First we extend the methods to the Borel context. The compactness arguments using are replaced by various forcing and minimality arguments. Definition (Orbit forcing) Let Γ X, and x X. Conditions in the orbit-forcing P x are non-empty open sets U X with U [x]. These are ordered by inclusion: U V iff U V.
38 As an abstract forcing, P x is isomorphic to Cohen forcing, but the nature of x plays a large role in the properties of the forcing vis-à-vis the equivalence relation. Theorem Let Γ be a countable group, X a compact Polish space, and Γ X a continuous action giving rise to the orbit equivalence relation E. Let A n be finite subsets of Γ such that every finite subset of Γ is contained in some A n. Let {S n } be a sequence of Borel complete sections of E. Then there is an x X such that for infinitely many n we have A n x S n. Remark In practice, we usually apply this to K = [x] where x is a 2-coloring in 2 Γ (perhaps with extra properties).
39 Corollary Let f : ω ω be such that lim sup n f(n) = +. Let {S n } be a sequence of Borel complete sections of F(2 Zd ). Then there is an x F(2 Zd ) such that for infinitely many n we have ρ(x, S n ) < f(n). Corollary There does not exist a Borel layered toast structure on F(2 Z2 ).
40 Figure: (a) layered toast (b) general toast
CONTINUOUS COMBINATORICS OF ABELIAN GROUP ACTIONS
CONTINUOUS COMBINATORICS OF ABELIAN GROUP ACTIONS SU GAO, STEVE JACKSON, EDWARD KROHNE, AND BRANDON SEWARD Abstract. This paper develops techniques which are used to answer a number of questions in the
More informationGroup Colorings and Bernoulli Subflows. Su Gao Steve Jackson Brandon Seward
Group Colorings and Bernoulli Subflows Su Gao Steve Jackson Brandon Seward Author address: Department of Mathematics, University of North Texas, 1155 Union Circle #311430, Denton, TX 76203-5017 E-mail
More informationBorel circle squaring
Borel circle squaring Andrew Marks, joint with Spencer Unger UCLA Tarski s circle squaring problem The theory of amenability can be used to show that Lebesgue measure on R 2 can be extended to a finitely
More informationCOUNTABLE BOREL QUASI-ORDERS
COUNTABLE BOREL QUASI-ORDERS BY JAY WILLIAMS A dissertation submitted to the Graduate School New Brunswick Rutgers, The State University of New Jersey in partial fulfillment of the requirements for the
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 informationUniformity, Universality, and Computability Theory
Uniformity, Universality, and Computability Theory Andrew S. Marks March 22, 2017 Abstract We prove a number of results motivated by global questions of uniformity in computability theory, and universality
More informationTopological conjugacy relation. minimal G-subshifts
The topological conjugacy relation for free minimal G-subshifts Toronto, April 2, 2015 A Borel equivalence relation on a standard Borel space is countable if it has countable classes. A Borel equivalence
More informationA Descriptive View of Combinatorial Group Theory
A Descriptive View of Combinatorial Group Theory Simon Thomas Rutgers University May 12th 2014 Introduction The Basic Theme: Descriptive set theory provides a framework for explaining the inevitable non-uniformity
More informationCOUNTABLE BOREL EQUIVALENCE RELATIONS
COUNTABLE BOREL EQUIVALENCE RELATIONS SCOTT SCHNEIDER AND SIMON THOMAS Introduction. These notes are an account of a day-long lecture workshop presented by Simon Thomas of Rutgers University at the University
More informationQuasi-invariant measures for continuous group actions
Contemporary Mathematics Quasi-invariant measures for continuous group actions Alexander S. Kechris Dedicated to Simon Thomas on his 60th birthday Abstract. The class of ergodic, invariant probability
More informationA BRIEF INTRODUCTION TO AMENABLE EQUIVALENCE RELATIONS
A BRIEF INTRODUCTION TO AMENABLE EQUIVALENCE RELATIONS JUSTIN TATCH MOORE 1. Introduction The notion of an amenable equivalence relation was introduced by Zimmer in the course of his analysis of orbit
More informationMeasurable chromatic and independence numbers for ergodic graphs and group actions
Measurable chromatic and independence numbers for ergodic graphs and group actions Clinton T. Conley and Alexander S. Kechris July 9, 2010 0 Introduction We study in this paper some combinatorial invariants
More informationDescriptive graph combinatorics
Prague; July 2016 Introduction This talk is about a relatively new subject, developed in the last two decades or so, which is at the interface of descriptive set theory and graph theory but also has interesting
More informationSTATIONARY PROBABILITY MEASURES AND TOPOLOGICAL REALIZATIONS
STATIONARY PROBABILITY MASURS AND TOPOLOGICAL RALIZATIONS CLINTON T. CONLY, ALXANDR S. KCHRIS, AND BNJAMIN D. MILLR Abstract. We establish the generic inexistence of stationary Borel probability measures
More informationA DETERMINACY APPROACH TO BOREL COMBINATORICS
A DETERMINACY APPROACH TO BOREL COMBINATORICS ANDREW S. MARKS Abstract. We introduce a new method, involving infinite games and Borel determinacy, which we use to answer several well-known questions in
More informationSTATIONARY PROBABILITY MEASURES AND TOPOLOGICAL REALIZATIONS
ISRAL JOURNAL OF MATHMATICS?? (2013), 1 14 DOI: 10.1007/s??????-??????-?????? STATIONARY PROBABILITY MASURS AND TOPOLOGICAL RALIZATIONS BY Clinton T. Conley 584 Malott Hall Cornell University Ithaca, NY
More informationBorel complexity and automorphisms of C*-algebras
Martino Lupini York University Toronto, Canada January 15th, 2013 Table of Contents 1 Auto-homeomorphisms of compact metrizable spaces 2 Measure preserving automorphisms of probability spaces 3 Automorphisms
More informationMEASURABLE PERFECT MATCHINGS FOR ACYCLIC LOCALLY COUNTABLE BOREL GRAPHS
MEASURABLE PERFECT MATCHINGS FOR ACYCLIC LOCALLY COUNTABLE BOREL GRAPHS CLINTON T. CONLEY AND BENJAMIN D. MILLER Abstract. We characterize the structural impediments to the existence of Borel perfect matchings
More informationCountable Borel Equivalence Relations
Countable Borel Equivalence Relations S. Jackson, A.S. Kechris, and A. Louveau This paper is a contribution to a new direction in descriptive set theory that is being extensively pursued over the last
More informationA SHORT PROOF OF THE CONNES-FELDMAN-WEISS THEOREM
A SHORT PROOF OF THE CONNES-FELDMAN-WEISS THEOREM ANDREW MARKS Abstract. In this note, we give a short proof of the theorem due to Connes, Feldman, and Weiss that a countable orel equivalence relation
More informationThe classification of torsion-free abelian groups up to isomorphism and quasi-isomorphism
The classification of torsion-free abelian groups up to isomorphism and quasi-isomorphism Samuel Coskey Rutgers University Joint Meetings, 2008 Torsion-free abelian groups of finite rank A concise and
More informationSIMULTANEOUS REDUCIBILITY OF PAIRS OF BOREL EQUIVALENCE RELATIONS
SIMULTANEOUS REDUCIBILITY OF PAIRS OF BOREL EQUIVALENCE RELATIONS SCOTT SCHNEIDER Abstract. Let E F and E F be Borel equivalence relations on the standard Borel spaces X and Y, respectively. The pair (E,
More informationLocally definable groups and lattices
Locally definable groups and lattices Kobi Peterzil (Based on work (with, of) Eleftheriou, work of Berarducci-Edmundo-Mamino) Department of Mathematics University of Haifa Ravello 2013 Kobi Peterzil (University
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 informationTurbulence, representations, and trace-preserving actions
Turbulence, representations, and trace-preserving actions Hanfeng Li SUNY at Buffalo June 6, 2009 GPOTS-Boulder Joint work with David Kerr and Mikaël Pichot 1 / 24 Type of questions to consider: Question
More informationHYPERFINITENESS AND BOREL COMBINATORICS
HYPERFINITENESS AND BOREL COMBINATORICS CLINTON T. CONLEY, STEVE JACKSON, ANDREW S. MARKS, BRANDON SEWARD, AND ROBIN D. TUCKER-DROB Abstract. We study the relationship between hyperfiniteness and problems
More informationMEASURABLE CHROMATIC NUMBERS
The Journal of Symbolic Logic Volume 00, Number 0, XXX 0000 MEASURABLE CHROMATIC NUMBERS BENJAMIN D. MILLER Abstract. We show that if add(null) = c, then the globally Baire and universally measurable chromatic
More informationCayley Graphs of Finitely Generated Groups
Cayley Graphs of Finitely Generated Groups Simon Thomas Rutgers University 13th May 2014 Cayley graphs of finitely generated groups Definition Let G be a f.g. group and let S G { 1 } be a finite generating
More informationTreeable equivalence relations
Treeable Treeable equivalence relations Greg Hjorth December 22, 2008 Abstract There are continuum many B-incomparable equivalence relations induced by a free, Borel action of a countable non-abelian free
More informationMargulis Superrigidity I & II
Margulis Superrigidity I & II Alastair Litterick 1,2 and Yuri Santos Rego 1 Universität Bielefeld 1 and Ruhr-Universität Bochum 2 Block seminar on arithmetic groups and rigidity Universität Bielefeld 22nd
More informationJónsson Properties for Non-Ordinal Sets Under the Axiom of Determinacy
Jónsson Properties for Non-Ordinal Sets Under the Axiom of Determinacy Fifth NY Graduate Student Logic Conference The Jónsson Property For κ a cardinal and n ω, [κ] n = {(α 1,, α n ) κ n : α 1 < < α n
More informationUniquely Universal Sets
Uniquely Universal Sets 1 Uniquely Universal Sets Abstract 1 Arnold W. Miller We say that X Y satisfies the Uniquely Universal property (UU) iff there exists an open set U X Y such that for every open
More informationLópez-Escobar s theorem and metric structures
López-Escobar s theorem and metric structures Descriptive set theory and its applications AMS Western section meeting Salt Lake, April 2016 Samuel Coskey Boise State University Presenting joint work with
More informationTHE SMOOTH IDEAL JOHN D. CLEMENS, CLINTON T. CONLEY, AND BENJAMIN D. MILLER
THE SMOOTH IDEAL JOHN D. CLEMENS, CLINTON T. CONLEY, AND BENJAMIN D. MILLER Abstract. We give a classical proof of the generalization of the characterization of smoothness to quotients of Polish spaces
More informationORTHOGONAL MEASURES AND ERGODICITY. By Clinton T. Conley Cornell University and. By Benjamin D. Miller Universität Münster
Submitted to the Annals of Probability ORTHOGONAL MEASURES AND ERGODICITY By Clinton T. Conley Cornell University and By Benjamin D. Miller Universität Münster We establish a strengthening of the E 0 dichotomy
More informationTame definable topological dynamics
Tame definable topological dynamics Artem Chernikov (Paris 7) Géométrie et Théorie des Modèles, 4 Oct 2013, ENS, Paris Joint work with Pierre Simon, continues previous work with Anand Pillay and Pierre
More informationMEASURABLE 3-COLORINGS OF ACYCLIC GRAPHS CLINTON T. CONLEY AND BENJAMIN D. MILLER
MEASURABLE 3-COLORINGS OF ACYCLIC GRAPHS CLINTON T. CONLEY AND BENJAMIN D. MILLER Abstract. This is the first of two lectures on measurable chromatic numbers given in June 2010 at the University of Barcelona.
More information3 (Due ). Let A X consist of points (x, y) such that either x or y is a rational number. Is A measurable? What is its Lebesgue measure?
MA 645-4A (Real Analysis), Dr. Chernov Homework assignment 1 (Due ). Show that the open disk x 2 + y 2 < 1 is a countable union of planar elementary sets. Show that the closed disk x 2 + y 2 1 is a countable
More informationKrieger s finite generator theorem for ergodic actions of countable groups
Krieger s finite generator theorem for ergodic actions of countable groups Brandon Seward University of Michigan UNT RTG Conference Logic, Dynamics, and Their Interactions II June 6, 2014 Brandon Seward
More informationClassification Problems in Mathematics. Greg Hjorth. University of Melbourne
Classification Problems in Mathematics Greg Hjorth greg.hjorth@gmail.com University of Melbourne Tarski Lectures University of California, Berkeley April 7, 2010 1 1 Recall Definition The cardinality of
More informationMekler s construction and generalized stability
Mekler s construction and generalized stability Artem Chernikov UCLA Automorphism Groups, Differential Galois Theory and Model Theory Barcelona, June 26, 2017 Joint work with Nadja Hempel (UCLA). Mekler
More informationProblem Set 2: Solutions Math 201A: Fall 2016
Problem Set 2: s Math 201A: Fall 2016 Problem 1. (a) Prove that a closed subset of a complete metric space is complete. (b) Prove that a closed subset of a compact metric space is compact. (c) Prove that
More information2 (Bonus). Let A X consist of points (x, y) such that either x or y is a rational number. Is A measurable? What is its Lebesgue measure?
MA 645-4A (Real Analysis), Dr. Chernov Homework assignment 1 (Due 9/5). Prove that every countable set A is measurable and µ(a) = 0. 2 (Bonus). Let A consist of points (x, y) such that either x or y is
More informationSMALL SUBSETS OF THE REALS AND TREE FORCING NOTIONS
SMALL SUBSETS OF THE REALS AND TREE FORCING NOTIONS MARCIN KYSIAK AND TOMASZ WEISS Abstract. We discuss the question which properties of smallness in the sense of measure and category (e.g. being a universally
More informationOn Martin s Conjecture
On Martin s Conjecture Theodore A. Slaman University of California, Berkeley April 2001 1 The Hierarchy of Definability We are all familiar with the hierarchies of definability which appear in recursion
More informationMath 6510 Homework 11
2.2 Problems 40 Problem. From the long exact sequence of homology groups associted to the short exact sequence of chain complexes n 0 C i (X) C i (X) C i (X; Z n ) 0, deduce immediately that there are
More informationDefinably amenable groups in NIP
Definably amenable groups in NIP Artem Chernikov (Paris 7) Lyon, 21 Nov 2013 Joint work with Pierre Simon. Setting T is a complete first-order theory in a language L, countable for simplicity. M = T a
More informationCombinatorial Variants of Lebesgue s Density Theorem
Combinatorial Variants of Lebesgue s Density Theorem Philipp Schlicht joint with David Schrittesser, Sandra Uhlenbrock and Thilo Weinert September 6, 2017 Philipp Schlicht Variants of Lebesgue s Density
More informationDescriptive Graph Combinatorics
Descriptive Graph Combinatorics Alexander S. Kechris and Andrew S. Marks (Preliminary version; December 17, 2015) Introduction In this article we survey the emerging field of descriptive graph combinatorics.
More informationTopology. Xiaolong Han. Department of Mathematics, California State University, Northridge, CA 91330, USA address:
Topology Xiaolong Han Department of Mathematics, California State University, Northridge, CA 91330, USA E-mail address: Xiaolong.Han@csun.edu Remark. You are entitled to a reward of 1 point toward a homework
More informationCountable Borel equivalence relations. Konstantin Slutsky
Countable Borel equivalence relations Konstantin Slutsky Chapter 1 First contact 1.1 Hi, my name is Cber. Definition 1.1.1. An equivalence relation on a set X is a set E X X such that for all x, y, z X
More informationProblem set 1, Real Analysis I, Spring, 2015.
Problem set 1, Real Analysis I, Spring, 015. (1) Let f n : D R be a sequence of functions with domain D R n. Recall that f n f uniformly if and only if for all ɛ > 0, there is an N = N(ɛ) so that if n
More informationThe Metamathematics of Randomness
The Metamathematics of Randomness Jan Reimann January 26, 2007 (Original) Motivation Effective extraction of randomness In my PhD-thesis I studied the computational power of reals effectively random for
More informationNotes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr.
Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr. Chapter : Logic Topics:. Statements, Negation, and Compound Statements.2 Truth Tables and Logical Equivalences.3
More informationDefinable Graphs and Dominating Reals
May 13, 2016 Graphs A graph on X is a symmetric, irreflexive G X 2. A graph G on a Polish space X is Borel if it is a Borel subset of X 2 \ {(x, x) : x X }. A X is an anticlique (G-free, independent) if
More informationCantor Groups, Haar Measure and Lebesgue Measure on [0, 1]
Cantor Groups, Haar Measure and Lebesgue Measure on [0, 1] Michael Mislove Tulane University Domains XI Paris Tuesday, 9 September 2014 Joint work with Will Brian Work Supported by US NSF & US AFOSR Lebesgue
More informationTREE AND GRID FACTORS FOR GENERAL POINT PROCESSES
Elect. Comm. in Probab. 9 (2004) 53 59 ELECTRONIC COMMUNICATIONS in PROBABILITY TREE AND GRID FACTORS FOR GENERAL POINT PROCESSES ÁDÁM TIMÁR1 Department of Mathematics, Indiana University, Bloomington,
More informationIsomorphism of finitely generated solvable groups is weakly universal
Isomorphism of finitely generated solvable groups is weakly universal Jay Williams 1, Department of Mathematics California Institute of Technology Pasadena, CA 91125 Abstract We show that the isomorphism
More informationSTRUCTURES WITH MINIMAL TURING DEGREES AND GAMES, A RESEARCH PROPOSAL
STRUCTURES WITH MINIMAL TURING DEGREES AND GAMES, A RESEARCH PROPOSAL ZHENHAO LI 1. Structures whose degree spectrum contain minimal elements/turing degrees 1.1. Background. Richter showed in [Ric81] that
More informationPart II. Algebraic Topology. Year
Part II Year 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2017 Paper 3, Section II 18I The n-torus is the product of n circles: 5 T n = } S 1. {{.. S } 1. n times For all n 1 and 0
More informationINVERSE LIMITS AND PROFINITE GROUPS
INVERSE LIMITS AND PROFINITE GROUPS BRIAN OSSERMAN We discuss the inverse limit construction, and consider the special case of inverse limits of finite groups, which should best be considered as topological
More informationProof: The coding of T (x) is the left shift of the coding of x. φ(t x) n = L if T n+1 (x) L
Lecture 24: Defn: Topological conjugacy: Given Z + d (resp, Zd ), actions T, S a topological conjugacy from T to S is a homeomorphism φ : M N s.t. φ T = S φ i.e., φ T n = S n φ for all n Z + d (resp, Zd
More informationOn Mordell-Lang in Algebraic Groups of Unipotent Rank 1
On Mordell-Lang in Algebraic Groups of Unipotent Rank 1 Paul Vojta University of California, Berkeley and ICERM (work in progress) Abstract. In the previous ICERM workshop, Tom Scanlon raised the question
More informationGroups Subgroups Normal subgroups Quotient groups Homomorphisms Cyclic groups Permutation groups Cayley s theorem Class equations Sylow theorems
Group Theory Groups Subgroups Normal subgroups Quotient groups Homomorphisms Cyclic groups Permutation groups Cayley s theorem Class equations Sylow theorems Groups Definition : A non-empty set ( G,*)
More informationPart IA Numbers and Sets
Part IA Numbers and Sets Definitions Based on lectures by A. G. Thomason Notes taken by Dexter Chua Michaelmas 2014 These notes are not endorsed by the lecturers, and I have modified them (often significantly)
More informationHypergraphs and proper forcing
Hypergraphs and proper forcing Jindřich Zapletal University of Florida November 23, 2017 Abstract Given a Polish space X and a countable collection of analytic hypergraphs on X, I consider the σ-ideal
More information1 MONOTONE COMPLETE C*-ALGEBRAS AND GENERIC DYNAMICS
1 MONOTONE COMPLETE C*-ALGEBRAS AND GENERIC DYNAMICS JDM Wright (University of Aberdeen) This talk is on joint work with Kazuyuki SAITÔ. I shall begin by talking about Monotone Complete C*-algebras. Then
More informationAbstract Algebra II Groups ( )
Abstract Algebra II Groups ( ) Melchior Grützmann / melchiorgfreehostingcom/algebra October 15, 2012 Outline Group homomorphisms Free groups, free products, and presentations Free products ( ) Definition
More information(2) E M = E C = X\E M
10 RICHARD B. MELROSE 2. Measures and σ-algebras An outer measure such as µ is a rather crude object since, even if the A i are disjoint, there is generally strict inequality in (1.14). It turns out to
More informationNON-ISOMORPHISM INVARIANT BOREL QUANTIFIERS
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 00, Number 0, Pages 000 000 S 0002-9939(XX)0000-0 NON-ISOMORPHISM INVARIANT BOREL QUANTIFIERS FREDRIK ENGSTRÖM AND PHILIPP SCHLICHT Abstract. Every
More informationJUMP OPERATIONS FOR BOREL GRAPHS
JUMP OPERATIONS FOR BOREL GRAPHS ADAM R. DAY AND ANDREW S. MARKS Abstract. We investigate the class of bipartite Borel graphs organized by the order of Borel homomorphism. We show that this class is unbounded
More informationPart V. 17 Introduction: What are measures and why measurable sets. Lebesgue Integration Theory
Part V 7 Introduction: What are measures and why measurable sets Lebesgue Integration Theory Definition 7. (Preliminary). A measure on a set is a function :2 [ ] such that. () = 2. If { } = is a finite
More informationLarge Sets in Boolean and Non-Boolean Groups and Topology
axioms Article Large Sets in Boolean and Non-Boolean Groups and Topology Ol ga V. Sipacheva ID Department of General Topology and Geometry, Lomonosov Moscow State University, Leninskie Gory 1, Moscow 119991,
More informationDynamics of Group Actions and Minimal Sets
University of Illinois at Chicago www.math.uic.edu/ hurder First Joint Meeting of the Sociedad de Matemática de Chile American Mathematical Society Special Session on Group Actions: Probability and Dynamics
More informationUltraproducts of measure preserving actions and graph combinatorics
Ultraproducts of measure preserving actions and graph combinatorics Clinton T. Conley, Alexander S. Kechris, and Robin D. Tucker-Drob 0 Introduction In this paper we apply the method of ultraproducts to
More informationINDEPENDENCE, RELATIVE RANDOMNESS, AND PA DEGREES
INDEPENDENCE, RELATIVE RANDOMNESS, AND PA DEGREES ADAM R. DAY AND JAN REIMANN Abstract. We study pairs of reals that are mutually Martin-Löf random with respect to a common, not necessarily computable
More informationOn the Baum-Connes conjecture for Gromov monster groups
On the Baum-Connes conjecture for Gromov monster groups Martin Finn-Sell Fakultät für Mathematik, Oskar-Morgenstern-Platz 1, 1090 Wien martin.finn-sell@univie.ac.at June 2015 Abstract We present a geometric
More informationAxioms for Set Theory
Axioms for Set Theory The following is a subset of the Zermelo-Fraenkel axioms for set theory. In this setting, all objects are sets which are denoted by letters, e.g. x, y, X, Y. Equality is logical identity:
More informationPlaying with forcing
Winterschool, 2 February 2009 Idealized forcings Many forcing notions arise as quotient Boolean algebras of the form P I = Bor(X )/I, where X is a Polish space and I is an ideal of Borel sets. Idealized
More informationFrom Haar to Lebesgue via Domain Theory
From Haar to Lebesgue via Domain Theory Michael Mislove Tulane University Topology Seminar CUNY Queensboro Thursday, October 15, 2015 Joint work with Will Brian Work Supported by US NSF & US AFOSR Lebesgue
More informationRIGIDITY OF GROUP ACTIONS. II. Orbit Equivalence in Ergodic Theory
RIGIDITY OF GROUP ACTIONS II. Orbit Equivalence in Ergodic Theory Alex Furman (University of Illinois at Chicago) March 1, 2007 Ergodic Theory of II 1 Group Actions II 1 Systems: Γ discrete countable group
More informationLebesgue Measure on R n
CHAPTER 2 Lebesgue Measure on R n Our goal is to construct a notion of the volume, or Lebesgue measure, of rather general subsets of R n that reduces to the usual volume of elementary geometrical sets
More informationOctober 12, Complexity and Absoluteness in L ω1,ω. John T. Baldwin. Measuring complexity. Complexity of. concepts. to first order.
October 12, 2010 Sacks Dicta... the central notions of model theory are absolute absoluteness, unlike cardinality, is a logical concept. That is why model theory does not founder on that rock of undecidability,
More informationON THE UNIQUENESS OF POLISH GROUP TOPOLOGIES. by Bojana Pejić MA, University of Pittsburgh, 2006 MMath, University of Oxford, 2002
ON THE UNIQUENESS OF POLISH GROUP TOPOLOGIES by Bojana Pejić MA, University of Pittsburgh, 2006 MMath, University of Oxford, 2002 Submitted to the Graduate Faculty of the Department of Mathematics in partial
More informationJune 7, 2007 THE ISOMORPHISM PROBLEM FOR TORSION-FREE ABELIAN GROUPS IS ANALYTIC COMPLETE.
June 7, 2007 THE ISOMORPHISM PROBLEM FOR TORSION-FREE ABELIAN GROUPS IS ANALYTIC COMPLETE. ROD DOWNEY AND ANTONIO MONTALBÁN Abstract. We prove that the isomorphism problem for torsion-free Abelian groups
More informationUnsolvable problems, the Continuum Hypothesis, and the nature of infinity
Unsolvable problems, the Continuum Hypothesis, and the nature of infinity W. Hugh Woodin Harvard University January 9, 2017 V : The Universe of Sets The power set Suppose X is a set. The powerset of X
More informationBROOKS S THEOREM FOR MEASURABLE COLORINGS
BROOKS S THEOREM FOR MEASURABLE COLORINGS CLINTON T. CONLEY, ANDREW S. MARKS, AND ROBIN D. TUCKER-DROB Abstract. We generalize Brooks s theorem to show that if G is a Borel graph on a standard Borel space
More informationDynamical properties of the Automorphism Groups of the Random Poset and Random Distributive Lattice
Dynamical properties of the Automorphism Groups of the Random Poset and Random Distributive Lattice Alexander S. Kechris and Miodrag Sokić Abstract: A method is developed for proving non-amenability of
More informationEntropy, mixing, and independence
Entropy, mixing, and independence David Kerr Texas A&M University Joint work with Hanfeng Li Let (X, µ) be a probability space. Two sets A, B X are independent if µ(a B) = µ(a)µ(b). Suppose that we have
More informationCS 468: Computational Topology Group Theory Fall b c b a b a c b a c b c c b a
Q: What s purple and commutes? A: An abelian grape! Anonymous Group Theory Last lecture, we learned about a combinatorial method for characterizing spaces: using simplicial complexes as triangulations
More informationOn surjectively universal Polish groups
Available online at www.sciencedirect.com Advances in Mathematics 231 (2012) 2557 2572 www.elsevier.com/locate/aim On surjectively universal Polish groups Longyun Ding School of Mathematical Sciences and
More informationShort notes on Axioms of set theory, Well orderings and Ordinal Numbers
Short notes on Axioms of set theory, Well orderings and Ordinal Numbers August 29, 2013 1 Logic and Notation Any formula in Mathematics can be stated using the symbols and the variables,,,, =, (, ) v j
More informationTree-adjoined spaces and the Hawaiian earring
Tree-adjoined spaces and the Hawaiian earring W. Hojka (TU Wien) Workshop on Fractals and Tilings 2009 July 6-10, 2009, Strobl (Austria) W. Hojka (TU Wien) () Tree-adjoined spaces and the Hawaiian earring
More informationThe axiom of choice and two-point sets in the plane
A.Miller AC and 2-point sets The axiom of choice and two-point sets in the plane Abstract Arnold W. Miller In this paper we prove that it consistent to have a two-point set in a model of ZF in which the
More informationThe complexity of classification problem of nuclear C*-algebras
The complexity of classification problem of nuclear C*-algebras Ilijas Farah (joint work with Andrew Toms and Asger Törnquist) Nottingham, September 6, 2010 C*-algebras H: a complex Hilbert space (B(H),
More informationNOTES ON WELL ORDERING AND ORDINAL NUMBERS. 1. Logic and Notation Any formula in Mathematics can be stated using the symbols
NOTES ON WELL ORDERING AND ORDINAL NUMBERS TH. SCHLUMPRECHT 1. Logic and Notation Any formula in Mathematics can be stated using the symbols,,,, =, (, ) and the variables v j : where j is a natural number.
More informationQualifying Exam Logic August 2005
Instructions: Qualifying Exam Logic August 2005 If you signed up for Computability Theory, do two E and two C problems. If you signed up for Model Theory, do two E and two M problems. If you signed up
More informationint cl int cl A = int cl A.
BAIRE CATEGORY CHRISTIAN ROSENDAL 1. THE BAIRE CATEGORY THEOREM Theorem 1 (The Baire category theorem. Let (D n n N be a countable family of dense open subsets of a Polish space X. Then n N D n is dense
More informationVARIATIONS ON TOPOLOGICAL RECURRENCE
VARIATIONS ON TOPOLOGICAL RECURRENCE BERNARD HOST, BRYNA KRA, AND ALEJANDRO MAASS Abstract. Recurrence properties of systems and associated sets of integers that suffice for recurrence are classical objects
More informationTuring Degrees and Definability of the Jump. Theodore A. Slaman. University of California, Berkeley. CJuly, 2005
Turing Degrees and Definability of the Jump Theodore A. Slaman University of California, Berkeley CJuly, 2005 Outline Lecture 1 Forcing in arithmetic Coding and decoding theorems Automorphisms of countable
More information