Canada Spends Logo

Explorez notre analyse du budget 2026

Grant: Discovery Grants Program - Individual

University of Toronto

$50,000.00

Basis problems in set theory

EF 2010-11

Résumé
We propose a continuation of our long term project concentrated on the development of a rough classification theory of set-theoretical structures that is suited for applications not only in set theory and logic but also to some other areas of mathematics. Some of our rough-classification results (dichotomies) such as the Open Coloring Axiom and the P-Ideal Dichotomy have seen in recent years a considerable sucess in applications to such diverse areas of mathematics such as the theory of C*-algebras or the theory surrounding the von Neumman problem about characterising Boolean algebras carrying strictly positive measures. However the proper set-theoretical study of these dichotomies is yet to be completed. In particular, we would like to examine whether any of these two dichotomies imply that the second uncountable cardinal is un upper bound on cardinality of the continuum. We would also like to work on rough classification problem in other areas of mathematics which seem to require set-theorectical tools. One particular such problem is the rough-classification problem of compact Hausdorff spaces where the conjectured dichotomy says that a compact Hausdorff space either contains an uncountable discrete subspace r it admits an at most 2-to-1 continuous map ontu a metric space. Finally, we would also like to work towards a similar rough classification theory in the context of Decsriptive Set Theory. It is well known that this field of mathematics is already rich with dichotomies of this sort. What we would like to develop is a rough classification theory of analytic graphs that are countably cromatic in the Borel sense, or in other words Borel graphs that admit countable good Borel coloring. Specific problem in this area whose solution is likely to contribute considerably to the development of such a theory is a dichoromy involving the shift graph on the family of infinite sets of integers. This has an obvious connection with the infinite-dimensional Ramsey theory an area of mathematics that was originaly motivated by efforts towards building a rich rough classification theory of mathematical structures
Programme
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
Ontario, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data

Tel que publié

Application id
122013-2009
Name nom
Todorcevic, Stevo
Department département
Mathematics
Organization id
31
Institution établissement
University of Toronto
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2010
Competition year année de concours
2009
Award amount
50000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
336
Committee name en
Pure & Applied Maths - A
Committee name fr
Maths pures et appliquées - A
Area of application code
1200
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Advancement of knowledge
Area of application fr
Avancement des connaissances
Research subject code
2911
Research subject group en
Pure mathematics
Research subject group fr
Mathématiques pures
Research subject en
Set theory and general topology
Research subject fr
Théorie des ensembles et topologie générale
Partie
2
Nb partie
5
Application title
Basis problems in set theory
Keyword
NSERC
Application summary
We propose a continuation of our long term project concentrated on the development of a rough classification theory of set-theoretical structures that is suited for applications not only in set theory and logic but also to some other areas of mathematics. Some of our rough-classification results (dichotomies) such as the Open Coloring Axiom and the P-Ideal Dichotomy have seen in recent years a considerable sucess in applications to such diverse areas of mathematics such as the theory of C*-algebras or the theory surrounding the von Neumman problem about characterising Boolean algebras carrying strictly positive measures. However the proper set-theoretical study of these dichotomies is yet to be completed. In particular, we would like to examine whether any of these two dichotomies imply that the second uncountable cardinal is un upper bound on cardinality of the continuum. We would also like to work on rough classification problem in other areas of mathematics which seem to require set-theorectical tools. One particular such problem is the rough-classification problem of compact Hausdorff spaces where the conjectured dichotomy says that a compact Hausdorff space either contains an uncountable discrete subspace r it admits an at most 2-to-1 continuous map ontu a metric space. Finally, we would also like to work towards a similar rough classification theory in the context of Decsriptive Set Theory. It is well known that this field of mathematics is already rich with dichotomies of this sort. What we would like to develop is a rough classification theory of analytic graphs that are countably cromatic in the Borel sense, or in other words Borel graphs that admit countable good Borel coloring. Specific problem in this area whose solution is likely to contribute considerably to the development of such a theory is a dichoromy involving the shift graph on the family of infinite sets of integers. This has an obvious connection with the infinite-dimensional Ramsey theory an area of mathematics that was originaly motivated by efforts towards building a rich rough classification theory of mathematical structures