Distinct Volume Subsets: The Uncountable Case

Similar documents
Equations and Infinite Colorings Exposition by Stephen Fenner and William Gasarch

William Gasarch-U of MD, Sam Zbarsky- Mont. Blair. HS. Applications of the Erdös-Rado Canonical Ramsey Theorem to

Distinct volume subsets

Ultrafilters and Set Theory. Andreas Blass University of Michigan Ann Arbor, MI

Ramsey theory of homogeneous structures

The universal triangle-free graph has finite big Ramsey degrees

Tutorial 1.3: Combinatorial Set Theory. Jean A. Larson (University of Florida) ESSLLI in Ljubljana, Slovenia, August 4, 2011

The extent of the failure of Ramsey s theorem at successor cardinals

Applications of model theory in extremal graph combinatorics

Classical Theory of Cardinal Characteristics

Introduction to Model Theory

SELF-DUAL UNIFORM MATROIDS ON INFINITE SETS

The axiom of choice and two-point sets in the plane

Infinite Combinatorics, Definability, and Forcing

Ramsey theory, trees, and ultrafilters

Ordering functions. Raphaël Carroy. Hejnice, Czech Republic January 27th, Universität Münster 1/21

Jónsson Properties for Non-Ordinal Sets Under the Axiom of Determinacy

Mekler s construction and generalized stability

AMS regional meeting Bloomington, IN April 1, 2017

MATH 3300 Test 1. Name: Student Id:

REU 2007 Transfinite Combinatorics Lecture 9

A NEW LINDELOF SPACE WITH POINTS G δ

On the Length of Borel Hierarchies

COMPLETE NORMALITY AND COUNTABLE COMPACTNESS

TEST GROUPS FOR WHITEHEAD GROUPS

An introduction to OCA

Slow P -point Ultrafilters

Erdös-Rado without choice

Definable Graphs and Dominating Reals

Discrete Mathematics 2007: Lecture 5 Infinite sets

Ultrafilters with property (s)

A Descriptive View of Combinatorial Group Theory

On the Length of Borel Hierarchies

INTRODUCTION TO CARDINAL NUMBERS

arxiv: v1 [math.lo] 12 Apr 2017

Three Proofs of the Hypergraph Ramsey Theorem (An. Exposition)

Canonical models for fragments of the Axiom of Choice

Introduction to Model Theory

Open covers and a polarized partition relation

Combinatorial dichotomies and cardinal invariants

Section 7.5: Cardinality

CANONICALIZATION BY ABSOLUTENESS

Chain Conditions of Horn and Tarski

Set Theory and Models of Arithmetic ALI ENAYAT. First European Set Theory Meeting

D, such that f(u) = f(v) whenever u = v, has a multiplicative refinement g : [λ] <ℵ 0

SOME USES OF SET THEORY IN ALGEBRA. Stanford Logic Seminar February 10, 2009

Violating the Singular Cardinals Hypothesis Without Large Cardinals

Annals of Pure and Applied Logic

Set Theory and the Foundation of Mathematics. June 19, 2018

SHELAH S SINGULAR COMPACTNESS THEOREM

More Model Theory Notes

Strong theories, burden, and weight

Large Sets in Boolean and Non-Boolean Groups and Topology

TOPOLOGICAL RAMSEY SPACES DENSE IN FORCINGS

HOW DO ULTRAFILTERS ACT ON THEORIES? THE CUT SPECTRUM AND TREETOPS

Jónsson posets and unary Jónsson algebras

Simple homogeneous structures

Automorphism Groups of Homogeneous Structures

ON A QUESTION OF SIERPIŃSKI

arxiv: v1 [math.lo] 14 Jul 2017

The random graph. Peter J. Cameron University of St Andrews Encontro Nacional da SPM Caparica, 14 da julho 2014

I-Indexed Indiscernible Sets and Trees

Löwenheim-Skolem Theorems, Countable Approximations, and L ω. David W. Kueker (Lecture Notes, Fall 2007)

SMALL SUBSETS OF THE REALS AND TREE FORCING NOTIONS

THE UNIVERSAL HOMOGENEOUS TRIANGLE-FREE GRAPH HAS FINITE BIG RAMSEY DEGREES

FROM COHERENT TO FINITENESS SPACES

Regularity and Definability

Trees and generic absoluteness

RINGS ISOMORPHIC TO THEIR NONTRIVIAL SUBRINGS

Irredundant Generators

20 Ordinals. Definition A set α is an ordinal iff: (i) α is transitive; and. (ii) α is linearly ordered by. Example 20.2.

PCF THEORY AND CARDINAL INVARIANTS OF THE REALS

Computability theory and uncountable structures

Every Linear Order Isomorphic to Its Cube is Isomorphic to Its Square

VC-dimension in model theory and other subjects

March 3, The large and small in model theory: What are the amalgamation spectra of. infinitary classes? John T. Baldwin

Partition Relation Perspectives. Jean A. Larson

Diamond, non-saturation, and weak square principles

Diagonalize This. Iian Smythe. Department of Mathematics Cornell University. Olivetti Club November 26, 2013

Topological Ramsey spaces from Fraïssé classes, Ramsey-classification theorems, and initial structures in the Tukey types of p-points

Disjoint n-amalgamation

Generalizing Gödel s Constructible Universe:

Stat 451: Solutions to Assignment #1

Description of the book Set Theory

A product of γ-sets which is not Menger.

The Proper Forcing Axiom: a tutorial

Borel cardinals and Ramsey ultrafilters (draft of Sections 1-3)

The Rocky Romance of Model Theory and Set Theory University of Helsinki

Set Theory and Indiscernibles. Ali Enayat. IPM Logic Conference

October 12, Complexity and Absoluteness in L ω1,ω. John T. Baldwin. Measuring complexity. Complexity of. concepts. to first order.

TOPOLOGY PROCEEDINGS Volume 28, No. 1, 2004 Pages

TRANSFERING SATURATION, THE FINITE COVER PROPERTY, AND STABILITY

A Vaught s conjecture toolbox

THE UNIVERSAL HOMOGENEOUS TRIANGLE-FREE GRAPH HAS FINITE RAMSEY DEGREES

COMPACT SPACES WITH HEREDITARILY NORMAL SQUARES

Social welfare relations and descriptive set theory


SETS AND FUNCTIONS JOSHUA BALLEW

Section 0.7. The Axiom of Choice, Order, and Zorn s Lemma

Homework 3, Morally Due Tue Feb 20, 2018 COURSE WEBSITE: gasarch/858/s18.html (The symbol before gasarch is a tilde.

Transcription:

Distinct Volume Subsets: The Uncountable Case Douglas Ulrich 1 William Gasarch 2 1 University of California, Irvine ds ulrich@hotmail.com 2 University of Maryland at College Park gasarch@cs.umd.edu July 20, 2018 D. Ulrich and W. Gasarch (UMCP and UCI) Distinct Volume Subsets July 20, 2018 1 / 12

Paul Erdös. Some remarks on set theory. Proceedings of the American Mathematical Society, 1:127 141, 1950. D. Ulrich and W. Gasarch (UMCP and UCI) Distinct Volume Subsets July 20, 2018 2 / 12

Paul Erdös. Some remarks on set theory. Proceedings of the American Mathematical Society, 1:127 141, 1950. David Conlon, Jacob Fox, William Gasarch, David G. Harris, Douglas Ulrich, and Samuel Zbarsky. Distinct Volume Subsets, SIAM J. Discrete Math. 29(1), 472-480. D. Ulrich and W. Gasarch (UMCP and UCI) Distinct Volume Subsets July 20, 2018 2 / 12

Paul Erdös. Some remarks on set theory. Proceedings of the American Mathematical Society, 1:127 141, 1950. David Conlon, Jacob Fox, William Gasarch, David G. Harris, Douglas Ulrich, and Samuel Zbarsky. Distinct Volume Subsets, SIAM J. Discrete Math. 29(1), 472-480. Douglas Ulrich and William Gasarch. Distinct Volume Subsets via Indiscernibles, Archive for Mathematical Logic (to appear). D. Ulrich and W. Gasarch (UMCP and UCI) Distinct Volume Subsets July 20, 2018 2 / 12

A Theorem of Erdös D. Ulrich and W. Gasarch (UMCP and UCI) Distinct Volume Subsets July 20, 2018 3 / 12

A Theorem of Erdös Theorem (Erdös) Suppose X R d is infinite. Then there is Y X with Y = X, such that all pairs of points from Y have distinct distances. D. Ulrich and W. Gasarch (UMCP and UCI) Distinct Volume Subsets July 20, 2018 3 / 12

A Theorem of Erdös Theorem (Erdös) Suppose X R d is infinite. Then there is Y X with Y = X, such that all pairs of points from Y have distinct distances. Proof when X is countable. D. Ulrich and W. Gasarch (UMCP and UCI) Distinct Volume Subsets July 20, 2018 3 / 12

A Theorem of Erdös Theorem (Erdös) Suppose X R d is infinite. Then there is Y X with Y = X, such that all pairs of points from Y have distinct distances. Proof when X is countable. 1 Enumerate X = {a n : n < ω}. Define f : ( N 2) R via f ({n, m}) = a n a m. D. Ulrich and W. Gasarch (UMCP and UCI) Distinct Volume Subsets July 20, 2018 3 / 12

A Theorem of Erdös Theorem (Erdös) Suppose X R d is infinite. Then there is Y X with Y = X, such that all pairs of points from Y have distinct distances. Proof when X is countable. 1 Enumerate X = {a n : n < ω}. Define f : ( N 2) R via f ({n, m}) = a n a m. 2 Apply the canonical Ramsey theorem to f to get some infinite Y X on which f is either homogeneous, or min-homogeneous, or max-homogeneous, or rainbow (injective). D. Ulrich and W. Gasarch (UMCP and UCI) Distinct Volume Subsets July 20, 2018 3 / 12

A Theorem of Erdös Theorem (Erdös) Suppose X R d is infinite. Then there is Y X with Y = X, such that all pairs of points from Y have distinct distances. Proof when X is countable. 1 Enumerate X = {a n : n < ω}. Define f : ( N 2) R via f ({n, m}) = a n a m. 2 Apply the canonical Ramsey theorem to f to get some infinite Y X on which f is either homogeneous, or min-homogeneous, or max-homogeneous, or rainbow (injective). 3 If we get a rainbow set, then we are done. Otherwise, get a contradiction to Hilbert s basis theorem. D. Ulrich and W. Gasarch (UMCP and UCI) Distinct Volume Subsets July 20, 2018 3 / 12

A Theorem of Erdös Theorem (Erdös) Suppose X R d is infinite. Then there is Y X with Y = X, such that all pairs of points from Y have distinct distances. Proof when X is countable. 1 Enumerate X = {a n : n < ω}. Define f : ( N 2) R via f ({n, m}) = a n a m. 2 Apply the canonical Ramsey theorem to f to get some infinite Y X on which f is either homogeneous, or min-homogeneous, or max-homogeneous, or rainbow (injective). 3 If we get a rainbow set, then we are done. Otherwise, get a contradiction to Hilbert s basis theorem. For example, if f is min-homogeneous, look at V n := {x C d : i<d (x(i) a m (i)) 2 = i<d (a n (i) a m (i)) 2 for all m < n}. D. Ulrich and W. Gasarch (UMCP and UCI) Distinct Volume Subsets July 20, 2018 3 / 12

Cardinals D. Ulrich and W. Gasarch (UMCP and UCI) Distinct Volume Subsets July 20, 2018 4 / 12

Cardinals We work in ZFC. D. Ulrich and W. Gasarch (UMCP and UCI) Distinct Volume Subsets July 20, 2018 4 / 12

Cardinals We work in ZFC. The cardinal numbers are well-ordered: 0, 1, 2,..., D. Ulrich and W. Gasarch (UMCP and UCI) Distinct Volume Subsets July 20, 2018 4 / 12

Cardinals We work in ZFC. The cardinal numbers are well-ordered: 0, 1, 2,..., ℵ 0, ℵ 1, ℵ 2,..., D. Ulrich and W. Gasarch (UMCP and UCI) Distinct Volume Subsets July 20, 2018 4 / 12

Cardinals We work in ZFC. The cardinal numbers are well-ordered: 0, 1, 2,..., ℵ 0, ℵ 1, ℵ 2,..., ℵ ω, ℵ ω+1, ℵ ω+2,..., D. Ulrich and W. Gasarch (UMCP and UCI) Distinct Volume Subsets July 20, 2018 4 / 12

Cardinals We work in ZFC. The cardinal numbers are well-ordered: 0, 1, 2,..., ℵ 0, ℵ 1, ℵ 2,..., ℵ ω, ℵ ω+1, ℵ ω+2,..., ℵ ω1, ℵ ω1 +1,... D. Ulrich and W. Gasarch (UMCP and UCI) Distinct Volume Subsets July 20, 2018 4 / 12

Cardinals We work in ZFC. The cardinal numbers are well-ordered: 0, 1, 2,..., ℵ 0, ℵ 1, ℵ 2,..., ℵ ω, ℵ ω+1, ℵ ω+2,..., ℵ ω1, ℵ ω1 +1,..., Definition Suppose κ is an infinite cardinal. Let X be a set of cardinality κ. D. Ulrich and W. Gasarch (UMCP and UCI) Distinct Volume Subsets July 20, 2018 4 / 12

Cardinals We work in ZFC. The cardinal numbers are well-ordered: 0, 1, 2,..., ℵ 0, ℵ 1, ℵ 2,..., ℵ ω, ℵ ω+1, ℵ ω+2,..., ℵ ω1, ℵ ω1 +1,..., Definition Suppose κ is an infinite cardinal. Let X be a set of cardinality κ. κ is singular if X can be split into fewer than κ pieces, each of size less than κ. D. Ulrich and W. Gasarch (UMCP and UCI) Distinct Volume Subsets July 20, 2018 4 / 12

Cardinals We work in ZFC. The cardinal numbers are well-ordered: 0, 1, 2,..., ℵ 0, ℵ 1, ℵ 2,..., ℵ ω, ℵ ω+1, ℵ ω+2,..., ℵ ω1, ℵ ω1 +1,..., Definition Suppose κ is an infinite cardinal. Let X be a set of cardinality κ. κ is singular if X can be split into fewer than κ pieces, each of size less than κ. Otherwise, κ is regular. D. Ulrich and W. Gasarch (UMCP and UCI) Distinct Volume Subsets July 20, 2018 4 / 12

Cardinals We work in ZFC. The cardinal numbers are well-ordered: 0, 1, 2,..., ℵ 0, ℵ 1, ℵ 2,..., ℵ ω, ℵ ω+1, ℵ ω+2,..., ℵ ω1, ℵ ω1 +1,..., Definition Suppose κ is an infinite cardinal. Let X be a set of cardinality κ. κ is singular if X can be split into fewer than κ pieces, each of size less than κ. Otherwise, κ is regular. 2 ℵ 0, the cardinality of the continuum, fits somewhere among the ℵ s. D. Ulrich and W. Gasarch (UMCP and UCI) Distinct Volume Subsets July 20, 2018 4 / 12

Higher arity What Erdös Proved D. Ulrich and W. Gasarch (UMCP and UCI) Distinct Volume Subsets July 20, 2018 5 / 12

Higher arity What Erdös Proved Definition Suppose X R d and 2 a d + 1. Then say that X is a-rainbow if for all u, v ( X a), if u and v both have non-zero volume, then they have distinct volumes. D. Ulrich and W. Gasarch (UMCP and UCI) Distinct Volume Subsets July 20, 2018 5 / 12

Higher arity What Erdös Proved Definition Suppose X R d and 2 a d + 1. Then say that X is a-rainbow if for all u, v ( X a), if u and v both have non-zero volume, then they have distinct volumes. Theorem (Erdös) Suppose X R d is infinite, and X is regular, and 2 a d + 1. Then there is Y X with Y = X, such that Y is a-rainbow. D. Ulrich and W. Gasarch (UMCP and UCI) Distinct Volume Subsets July 20, 2018 5 / 12

Higher arity What Erdös Proved Definition Suppose X R d and 2 a d + 1. Then say that X is a-rainbow if for all u, v ( X a), if u and v both have non-zero volume, then they have distinct volumes. Theorem (Erdös) Suppose X R d is infinite, and X is regular, and 2 a d + 1. Then there is Y X with Y = X, such that Y is a-rainbow. Theorem (Erdös) Suppose κ 2 ℵ 0 is singular. Then there is X R d of size κ, such that whenever Y X has size κ, then Y is not 3-rainbow. D. Ulrich and W. Gasarch (UMCP and UCI) Distinct Volume Subsets July 20, 2018 5 / 12

Gameplan D. Ulrich and W. Gasarch (UMCP and UCI) Distinct Volume Subsets July 20, 2018 6 / 12

Gameplan We want to control degenerate simplices, and we want to understand what happens at singular cardinals. D. Ulrich and W. Gasarch (UMCP and UCI) Distinct Volume Subsets July 20, 2018 6 / 12

Gameplan We want to control degenerate simplices, and we want to understand what happens at singular cardinals. Given X R d, choose a finite coloring f : X 2d+2 c such that f (w) encodes the set of all subsets of w of zero volume, and the set of all pairs of subsets of w of equal volume. D. Ulrich and W. Gasarch (UMCP and UCI) Distinct Volume Subsets July 20, 2018 6 / 12

Gameplan We want to control degenerate simplices, and we want to understand what happens at singular cardinals. Given X R d, choose a finite coloring f : X 2d+2 c such that f (w) encodes the set of all subsets of w of zero volume, and the set of all pairs of subsets of w of equal volume. Our goal is to find some Y X such that f behaves canonically on Y. D. Ulrich and W. Gasarch (UMCP and UCI) Distinct Volume Subsets July 20, 2018 6 / 12

Gameplan We want to control degenerate simplices, and we want to understand what happens at singular cardinals. Given X R d, choose a finite coloring f : X 2d+2 c such that f (w) encodes the set of all subsets of w of zero volume, and the set of all pairs of subsets of w of equal volume. Our goal is to find some Y X such that f behaves canonically on Y. If f were some arbitrary coloring, we would need to first fix an ordering of X. We would then apply the Erdös-Rado theorem to get some Y X such that f is constant on increasing tuples from Y ; typically Y << X. D. Ulrich and W. Gasarch (UMCP and UCI) Distinct Volume Subsets July 20, 2018 6 / 12

Gameplan We want to control degenerate simplices, and we want to understand what happens at singular cardinals. Given X R d, choose a finite coloring f : X 2d+2 c such that f (w) encodes the set of all subsets of w of zero volume, and the set of all pairs of subsets of w of equal volume. Our goal is to find some Y X such that f behaves canonically on Y. If f were some arbitrary coloring, we would need to first fix an ordering of X. We would then apply the Erdös-Rado theorem to get some Y X such that f is constant on increasing tuples from Y ; typically Y << X. But note that our coloring f is definable in (C, +,, 0, 1), a stable structure. This gives us added leverage. D. Ulrich and W. Gasarch (UMCP and UCI) Distinct Volume Subsets July 20, 2018 6 / 12

Stability Definition Suppose M is a structure. Then M is stable if: for all N M, for all d < ω, and for all definable X N d N d, X does not contain an infinite half-graph. D. Ulrich and W. Gasarch (UMCP and UCI) Distinct Volume Subsets July 20, 2018 7 / 12

Stability Definition Suppose M is a structure. Then M is stable if: for all N M, for all d < ω, and for all definable X N d N d, X does not contain an infinite half-graph. In more words, there is no sequence (a n : n < ω) from N d such that for all n, m < ω, (a n, a m ) X if and only if n < m. D. Ulrich and W. Gasarch (UMCP and UCI) Distinct Volume Subsets July 20, 2018 7 / 12

Stability Definition Suppose M is a structure. Then M is stable if: for all N M, for all d < ω, and for all definable X N d N d, X does not contain an infinite half-graph. In more words, there is no sequence (a n : n < ω) from N d such that for all n, m < ω, (a n, a m ) X if and only if n < m. Example (C, +,, 0, 1) is a stable structure. D. Ulrich and W. Gasarch (UMCP and UCI) Distinct Volume Subsets July 20, 2018 7 / 12

Stability Definition Suppose M is a structure. Then M is stable if: for all N M, for all d < ω, and for all definable X N d N d, X does not contain an infinite half-graph. In more words, there is no sequence (a n : n < ω) from N d such that for all n, m < ω, (a n, a m ) X if and only if n < m. Example (C, +,, 0, 1) is a stable structure. Note: the volume of a simplex in R d is the square root of a certain polynomial (the Cayley-Menger determinant) in the coefficients of the vertices. Thus the coloring f on the previous slide really is definable in (C, +,, 0, 1). D. Ulrich and W. Gasarch (UMCP and UCI) Distinct Volume Subsets July 20, 2018 7 / 12

Canonization for regular κ D. Ulrich and W. Gasarch (UMCP and UCI) Distinct Volume Subsets July 20, 2018 8 / 12

Canonization for regular κ Theorem (Shelah) Suppose M is a stable structure, X M has regular cardinality, and f : M n c is a definable coloring. Then there is Y X with Y = X such that f is constant on tuples of distinct elements from Y. D. Ulrich and W. Gasarch (UMCP and UCI) Distinct Volume Subsets July 20, 2018 8 / 12

Canonization for regular κ Theorem (Shelah) Suppose M is a stable structure, X M has regular cardinality, and f : M n c is a definable coloring. Then there is Y X with Y = X such that f is constant on tuples of distinct elements from Y. Definition Suppose X R d and 2 a d + 1. Then say that X is strongly a-rainbow if for all distinct u, v ( X a), the volumes of u and v are distinct and nonzero. D. Ulrich and W. Gasarch (UMCP and UCI) Distinct Volume Subsets July 20, 2018 8 / 12

Canonization for regular κ Theorem (Shelah) Suppose M is a stable structure, X M has regular cardinality, and f : M n c is a definable coloring. Then there is Y X with Y = X such that f is constant on tuples of distinct elements from Y. Definition Suppose X R d and 2 a d + 1. Then say that X is strongly a-rainbow if for all distinct u, v ( X a), the volumes of u and v are distinct and nonzero. Say that X is strictly a-rainbow if X is strongly a -rainbow for all a a, and the volume of every a + 1-element subset of X is 0 (i.e., X is a subset of an a 1-dimensional hyperplane). D. Ulrich and W. Gasarch (UMCP and UCI) Distinct Volume Subsets July 20, 2018 8 / 12

Canonization for regular κ Theorem (Shelah) Suppose M is a stable structure, X M has regular cardinality, and f : M n c is a definable coloring. Then there is Y X with Y = X such that f is constant on tuples of distinct elements from Y. Definition Suppose X R d and 2 a d + 1. Then say that X is strongly a-rainbow if for all distinct u, v ( X a), the volumes of u and v are distinct and nonzero. Say that X is strictly a-rainbow if X is strongly a -rainbow for all a a, and the volume of every a + 1-element subset of X is 0 (i.e., X is a subset of an a 1-dimensional hyperplane). Theorem (U., G.) Suppose X R d is infinite, with X regular. Then there is Y X with Y = X, such that for some 2 a d + 1, Y is strictly a-rainbow. D. Ulrich and W. Gasarch (UMCP and UCI) Distinct Volume Subsets July 20, 2018 8 / 12

Singular κ D. Ulrich and W. Gasarch (UMCP and UCI) Distinct Volume Subsets July 20, 2018 9 / 12

Singular κ Theorem (U., G.) Suppose M is a stable structure, and X M has singular cardinality κ, and f : M n c is definable. D. Ulrich and W. Gasarch (UMCP and UCI) Distinct Volume Subsets July 20, 2018 9 / 12

Singular κ Theorem (U., G.) Suppose M is a stable structure, and X M has singular cardinality κ, and f : M n c is definable. Let E be any equivalence relation on X with fewer than κ classes, each of size less than κ. D. Ulrich and W. Gasarch (UMCP and UCI) Distinct Volume Subsets July 20, 2018 9 / 12

Singular κ Theorem (U., G.) Suppose M is a stable structure, and X M has singular cardinality κ, and f : M n c is definable. Let E be any equivalence relation on X with fewer than κ classes, each of size less than κ. Then there is Y X with Y = X, such that for all a X n, f (a) depends only on the isomorphism type of (range(a), E). D. Ulrich and W. Gasarch (UMCP and UCI) Distinct Volume Subsets July 20, 2018 9 / 12

Singular κ Theorem (U., G.) Suppose M is a stable structure, and X M has singular cardinality κ, and f : M n c is definable. Let E be any equivalence relation on X with fewer than κ classes, each of size less than κ. Then there is Y X with Y = X, such that for all a X n, f (a) depends only on the isomorphism type of (range(a), E). Theorem (U., G.) Suppose κ 2 ℵ 0 is infinite. Then there is a finite list (C i : i < i ) of subsets of R d of size κ, such that whenever X R d has size κ, there is some i < i and some injection F : C i X, which preserves the relations u is a degenerate simplex and u, v have the same volume, for all tuples u, v of length 2 a d + 1. D. Ulrich and W. Gasarch (UMCP and UCI) Distinct Volume Subsets July 20, 2018 9 / 12

Definable subsets of R d D. Ulrich and W. Gasarch (UMCP and UCI) Distinct Volume Subsets July 20, 2018 10 / 12

Definable subsets of R d Definition Suppose X is a topological space. Then P X is perfect is P is closed and has no nonisolated points. D. Ulrich and W. Gasarch (UMCP and UCI) Distinct Volume Subsets July 20, 2018 10 / 12

Definable subsets of R d Definition Suppose X is a topological space. Then P X is perfect is P is closed and has no nonisolated points. Any reasonably definable subset of R d (for instance, any Borel subset) is either countable or else has a perfect subset. D. Ulrich and W. Gasarch (UMCP and UCI) Distinct Volume Subsets July 20, 2018 10 / 12

Definable subsets of R d Definition Suppose X is a topological space. Then P X is perfect is P is closed and has no nonisolated points. Any reasonably definable subset of R d (for instance, any Borel subset) is either countable or else has a perfect subset. Theorem (Blass) Suppose f : ( ) ( 2 N n c partitions 2 N) n into finitely many pieces, each with the property of Baire. Then there is some perfect P 2 N on which f takes on one of (n 1)! canonical behaviors. D. Ulrich and W. Gasarch (UMCP and UCI) Distinct Volume Subsets July 20, 2018 10 / 12

Definable subsets of R d Definition Suppose X is a topological space. Then P X is perfect is P is closed and has no nonisolated points. Any reasonably definable subset of R d (for instance, any Borel subset) is either countable or else has a perfect subset. Theorem (Blass) Suppose f : ( ) ( 2 N n c partitions 2 N) n into finitely many pieces, each with the property of Baire. Then there is some perfect P 2 N on which f takes on one of (n 1)! canonical behaviors. Theorem (U., G.) Suppose P R d is perfect. Then there is Q P perfect and some 2 a d + 1, such that Q is strictly a-rainbow. D. Ulrich and W. Gasarch (UMCP and UCI) Distinct Volume Subsets July 20, 2018 10 / 12

A Relative Consistency Result D. Ulrich and W. Gasarch (UMCP and UCI) Distinct Volume Subsets July 20, 2018 11 / 12

A Relative Consistency Result By Erdös s theorem and our perfect set theorem, the following holds in ZFC as well as ZF + antichoice principles: D. Ulrich and W. Gasarch (UMCP and UCI) Distinct Volume Subsets July 20, 2018 11 / 12

A Relative Consistency Result By Erdös s theorem and our perfect set theorem, the following holds in ZFC as well as ZF + antichoice principles: Theorem Given X R d infinite, there is Y X with Y = X, such that Y is 2-rainbow. D. Ulrich and W. Gasarch (UMCP and UCI) Distinct Volume Subsets July 20, 2018 11 / 12

A Relative Consistency Result By Erdös s theorem and our perfect set theorem, the following holds in ZFC as well as ZF + antichoice principles: Theorem Given X R d infinite, there is Y X with Y = X, such that Y is 2-rainbow. Nonetheless D. Ulrich and W. Gasarch (UMCP and UCI) Distinct Volume Subsets July 20, 2018 11 / 12

A Relative Consistency Result By Erdös s theorem and our perfect set theorem, the following holds in ZFC as well as ZF + antichoice principles: Theorem Given X R d infinite, there is Y X with Y = X, such that Y is 2-rainbow. Nonetheless Theorem (U., G.) It is consistent with ZF that there is some uncountable X R d which has no uncountable 2-rainbow subset. D. Ulrich and W. Gasarch (UMCP and UCI) Distinct Volume Subsets July 20, 2018 11 / 12

Thank you D. Ulrich and W. Gasarch (UMCP and UCI) Distinct Volume Subsets July 20, 2018 12 / 12