ON SUPERSIMPLICITY AND LOVELY PAIRS OF CATS
15 pages
English

Découvre YouScribe en t'inscrivant gratuitement

Je m'inscris

ON SUPERSIMPLICITY AND LOVELY PAIRS OF CATS

Découvre YouScribe en t'inscrivant gratuitement

Je m'inscris
Obtenez un accès à la bibliothèque pour le consulter en ligne
En savoir plus
15 pages
English
Obtenez un accès à la bibliothèque pour le consulter en ligne
En savoir plus

Description

ON SUPERSIMPLICITY AND LOVELY PAIRS OF CATS ITAY BEN-YAACOV Abstract. We prove that the definition of supersimplicity in metric structures from [Ben05b] is equivalent to an a priori stronger variant. This stronger variant is then used to prove that if T is a supersimple Hausdorff cat then so is its theory of lovely pairs. Introduction A superstable first order theory is one which is stable in every large enough cardinality, or equivalently, one which is stable (in some cardinality), and in which the type of every finite tuple over arbitrary sets does not divide over a finite subset. In more modern terms we would say that a first order theory is superstable if and only if it is stable and supersimple. Stability and simplicity were extended to various non-first-order settings by various people. Stability in the setting of large homogeneous structures goes back a long time (see [She75]), and some aspects of simplicity theory were also shown to hold in this setting in [BL03]. The setting of compact abstract theories, or cats, was introduced in [Ben03b] with the intention, among others, to provide a better non-first-order setting for the development of simplicity theory, which was done in [Ben03c], and under the additional assumption of thickness (with better results) in [Ben03d].

  • finitely many

  • over

  • virtual tuples

  • finite tuple

  • thus identified

  • metric

  • come up


Sujets

Informations

Publié par
Nombre de lectures 29
Langue English

Extrait

ONSUPERSIMPLICITYANDLOVELYPAIRSOFCATSITAYBEN-YAACOVAbstract.Weprovethatthedefinitionofsupersimplicityinmetricstructuresfrom[Ben05b]isequivalenttoanaprioristrongervariant.ThisstrongervariantisthenusedtoprovethatifTisasupersimpleHausdorffcatthensoisitstheoryoflovelypairs.IntroductionAsuperstablefirstordertheoryisonewhichisstableineverylargeenoughcardinality,orequivalently,onewhichisstable(insomecardinality),andinwhichthetypeofeveryfinitetupleoverarbitrarysetsdoesnotdivideoverafinitesubset.Inmoremoderntermswewouldsaythatafirstordertheoryissuperstableifandonlyifitisstableandsupersimple.Stabilityandsimplicitywereextendedtovariousnon-first-ordersettingsbyvariouspeople.Stabilityinthesettingoflargehomogeneousstructuresgoesbackalongtime(see[She75]),andsomeaspectsofsimplicitytheorywerealsoshowntoholdinthissettingin[BL03].Thesettingofcompactabstracttheories,orcats,wasintroducedin[Ben03b]withtheintention,amongothers,toprovideabetternon-first-ordersettingforthedevelopmentofsimplicitytheory,whichwasdonein[Ben03c],andundertheadditionalassumptionofthickness(withbetterresults)in[Ben03d].HausdorffcatsareoneswhosetypespacesareHausdorff.ManyclassesofmetricstructuresarisinginanalysiscanbeviewedasHausdorffcats(e.g.,theclassofproba-bilitymeasurealgebras[Ben],elementaryclassesofBanachspacestructuresinthesenseofHenson’slogic,etc.)Conversely,aHausdorffcatinacountablelanguageadmitsadefinablemetriconitshomesortwhichisuniqueuptouniformequivalenceofmetrics[Ben05b](andevenifthelanguageisuncountablethisresultremainsessentiallytrue).ThusHausdorffcatsformanaturalsettingforthestudyofmetricstructures.Thereislittledoubtaboutthedefinitionsofstabilityandsimplicityinthecaseof(metric)Hausdorffcats:alltheapproachesmentionedabove,andothers,agreeandgiveessentiallythesametheoryasinfirstorderlogic.Manynaturalexamplesareindeedstable.Unfortunately,nometricstructurecanbesuperstableorsupersimpleaccordingDate:April24,2006.2000MathematicsSubjectClassification.03C45,03C90,03C95.Keywordsandphrases.beautifulpairs,lovelypairs,supersimplicity,superstability,Hausdorffcats,metricstructures.1
  • Univers Univers
  • Ebooks Ebooks
  • Livres audio Livres audio
  • Presse Presse
  • Podcasts Podcasts
  • BD BD
  • Documents Documents