A stability transfer theorem in d-Tame Metric Abstract Elementary Classes Pedro Zambrano Universidad Nacional de Colombia Bogota - Colombia

XV SLALM, Bogota, Colombia June 4th, 2012

Pedro Zambrano (Univ. Nacional)

A stability transfer theorem in MAECs

June 4th, 2012

1 / 20

Outline

1

Motivation

2

Definition of MAEC

3

d-Tameness and independence in MAEC

4

Stability transfer theorems

Pedro Zambrano (Univ. Nacional)

A stability transfer theorem in MAECs

June 4th, 2012

2 / 20

Motivation

Discrete tame AEC are a special kind of AEC which have a categoricity transfer theorem (due to Grossberg and VanDieren) and a nice stability transfer theorem (due to Baldwin, Kueker and VanDieren), by using ω-locality. MAEC corresponds to a kind of amalgam between AEC and Continuous Logic Elementary Classes. In this work, we study a version of tameness in this setting and prove a stability transfer theorem, removing the ω-locality assumption and assuming local character of a suitable well-behaved notion of independence.

Pedro Zambrano (Univ. Nacional)

A stability transfer theorem in MAECs

June 4th, 2012

3 / 20

A map of discrete and metric structures classes

non-compactness

compactness

??? continuous logic

f.o.

Pedro Zambrano (Univ. Nacional)

AEC

A stability transfer theorem in MAECs

June 4th, 2012

4 / 20

Definition (MAEC)

Definition Let K be a class of L-structures (in the setting of Continuous Logic, but the function symbols need not be uniformly continuous). and let ≺K be a binary relation defined on K. We say that (K, ≺K ) is a Metric Abstract Elementary Class (for short, MAEC) iff: (1) K and ≺K are closed under ≅ (2) ≺K is a partial order in K. (3) If M ≺K N then M ⊆ N .

Pedro Zambrano (Univ. Nacional)

A stability transfer theorem in MAECs

June 4th, 2012

5 / 20

Definition (MAEC)

(4) (Tarski-Vaught chains) If (Mi ∶ i < λ) is an increasing and continuous ≺K -chain, then the function symbols in L can be uniquely interpreted in the completion of ⋃i<λ Mi such that ⋃i<λ Mi ∈ K for all j < λ , Mj ≺K ⋃i<λ Mi if for every Mi ∈ K ≺K N , then ⋃i<λ Mi ≺K N .

(5) (coherence) If M1 ⊆ M2 ≺K M3 and M1 ≺K M3 , then M1 ≺K M2 . (6) (DLS) There is a cardinality LS(K ) (which is called Löwenheim-Skolem number of K ) such that if M ∈ K and A ⊆ M, then there exists N ∈ K such that dc(N ) ≤ dc(A) + LS(K ) and A ⊆ N ≺K M.

Pedro Zambrano (Univ. Nacional)

A stability transfer theorem in MAECs

June 4th, 2012

6 / 20

Examples of MAECs

1

The class of Banach spaces

2

The subclass of complete models in an elementary class of a positive bounded theory (W. Henson - J. Iovino).

3

Compact Abstract Theories (I. Ben-Yaacov). (Mod (T ), ≺), T a (first order) theory in Continuous Logic:

4

1 2 5

Hilbert spaces with unitary operators (C. Argoty - A. Berenstein) Nakano spaces with compact essential rank (P. Poitevin).

AECs (with the discrete metric)

Pedro Zambrano (Univ. Nacional)

A stability transfer theorem in MAECs

June 4th, 2012

7 / 20

Remark Under AP+JEP+existence of large enough models, we can work in a homogeneous monster model M ∈ K.

Definition ga − tp(a/M) is defined as the orbit of the element a under automorphisms of M which fix M pointwise.

Definition ga-S(M) ∶= {ga-tp(a/M) ∶ a ∈ M}

Pedro Zambrano (Univ. Nacional)

A stability transfer theorem in MAECs

June 4th, 2012

8 / 20

Some preliminary results

Definition Let p, q ∈ ga-S(M) (M ∈ K). d (p, q) ∶= inf{d (a, b) ∶ a ⊧ p, b ⊧ q}.

Definition We say that a MAEC satisfies the continuity property (for short,CP) iff (an ) → b and ga-tp(a0 /M) = ga-tp(an /M) for every n < ω implies that ga-tp(b/M) = ga-tp(a0 /M).

Fact (Hirvonen-Hyttinen) d is a metric in ga-S(M) (M ∈ K) iff K satisfies the CP.

Pedro Zambrano (Univ. Nacional)

A stability transfer theorem in MAECs

June 4th, 2012

9 / 20

Cofinal stability

Definition We say that a MAEC K is µ-d-stable iff for every M ∈ K of density character µ we have that dc(ga-S(M)) ≤ µ.

Cofinal d-stability Let K be an MAEC with AP and JEP and LS(K) ≤ λ < κ. We say that K is [λ, κ)-cofinally d-stable iff given θ ∈ [λ, κ) there exists θ ′ ≥ θ in [λ, κ) such that K is θ ′ -d-stable.

Pedro Zambrano (Univ. Nacional)

A stability transfer theorem in MAECs

June 4th, 2012

10 / 20

d-Tameness Tameness (discrete AEC) Let K be an AEC and µ ≥ LS(K). We say that K is µ-tame iff for any M ∈ K of cardinality ≥ µ, if p ≠ q where p, q ∈ ga-S(M), then there exists N ≺K M of cardinality µ such that p ↾ N ≠ q ↾ N.

Pedro Zambrano (Univ. Nacional)

A stability transfer theorem in MAECs

June 4th, 2012

11 / 20

d-Tameness Tameness (discrete AEC)

d-Tameness

Let K be an AEC and µ ≥ LS(K). We say that K is µ-tame iff for any M ∈ K of cardinality ≥ µ, if p ≠ q where p, q ∈ ga-S(M), then there exists N ≺K M of cardinality µ such that p ↾ N ≠ q ↾ N.

Let K be a MAEC and µ ≥ LS(K). We say that K is µ-d-tame iff for every ε > 0 there exists δε > 0 such that if for any M ∈ K of dc ≥ µ we have that d(p, q) ≥ ε where p, q ∈ ga-S(M), then there exists N ≺K M of dc µ such that d(p ↾ N, q ↾ N) ≥ δε .

Pedro Zambrano (Univ. Nacional)

A stability transfer theorem in MAECs

June 4th, 2012

11 / 20

d-Tameness Tameness (discrete AEC)

d-Tameness

Let K be an AEC and µ ≥ LS(K). We say that K is µ-tame iff for any M ∈ K of cardinality ≥ µ, if p ≠ q where p, q ∈ ga-S(M), then there exists N ≺K M of cardinality µ such that p ↾ N ≠ q ↾ N.

Let K be a MAEC and µ ≥ LS(K). We say that K is µ-d-tame iff for every ε > 0 there exists δε > 0 such that if for any M ∈ K of dc ≥ µ we have that d(p, q) ≥ ε where p, q ∈ ga-S(M), then there exists N ≺K M of dc µ such that d(p ↾ N, q ↾ N) ≥ δε .

Some assumptions (*) We assume K is a µ-d-tame (µ < κ) and [LS(K), κ)-cofinally-d-stable. Define λ ∶= min{µ < χ < κ ∶ K is χ-d-stable} ζ ∶= min{χ ∶ 2χ > λ} and ζ ∗ ∶= max{µ+ , ζ}. We also require that cf (κ) ≥ ζ ∗ and κ > ζ ∗ . Pedro Zambrano (Univ. Nacional)

A stability transfer theorem in MAECs

June 4th, 2012

11 / 20

Independence in tame MAEC

Definition (Splitting, AEC) Let N ≺K M. We say that ga-tp(a/M) splits over N iff there exist N1 and N2 such that N ≺K N1 , N2 ≺K M and h ∶ N1 ≅N N2 such that ga-tp(a/N2 ) ≠ h(ga-tp(a/N1 ).

Pedro Zambrano (Univ. Nacional)

A stability transfer theorem in MAECs

June 4th, 2012

12 / 20

Independence in tame MAEC

Definition (Splitting, AEC)

Definition (ε-splitting)

Let N ≺K M. We say that ga-tp(a/M) splits over N iff there exist N1 and N2 such that N ≺K N1 , N2 ≺K M and h ∶ N1 ≅N N2 such that ga-tp(a/N2 ) ≠ h(ga-tp(a/N1 ).

Let N ≺K M and ε > 0. We say that ga-tp(a/M) ζ ∗ -ε-splits over N iff for every N ∗ ≺K N of dc < ζ ∗ there exist N1 and N2 of dc < ζ ∗ such that N ∗ ≺K N1 , N2 ≺K M and h ∶ N1 ≅N ∗ N2 such that d(ga-tp(a/N2 ), h(ga-tp(a/N1 )) ≥ ε. If ga-tp(a/M) does not tame-ε-split over N, we denote that by a ⫝εN M.

Pedro Zambrano (Univ. Nacional)

A stability transfer theorem in MAECs

June 4th, 2012

12 / 20

Independence in tame MAEC ga-tp(a/N2 ) M N2

N1 h b

a N

ε

N∗ h(ga-tp(a/N1 ))

Definition Let N ≺K M. We say that a is ζ ∗ -independent from M over N iff for every ε > 0 a ⫝εN M. Pedro Zambrano (Univ. Nacional)

A stability transfer theorem in MAECs

June 4th, 2012

13 / 20

Some properties of ε-independence Some properties 1

(Local character I) For every M, a and every ε > 0 there exists N ≺K M of density character < ζ ∗ such that a ⫝εN M.

2

(Weak stationarity) For every ε > 0 there exists δ such that for every N0 ≺K N1 ≺K N2 and every a, b, if N1 is universal over N0 , a, b ⫝δN0 N2 and d(ga-tp(a/N1 ), ga-tp(b/N1 )) < δ, therefore d(ga-tp(a/N2 ), ga-tp(b/N2 )) < ε.

More assumptions (**) -local character IIFor every tuple a, every ε > 0 and every increasing and continuous ≺K -chain of models ⟨Mi ∶ i < σ⟩, there exists j < σ such that a ⫝εMj ⋃i<σ Mi .

Pedro Zambrano (Univ. Nacional)

A stability transfer theorem in MAECs

June 4th, 2012

14 / 20

Stability transfer theorems

Assumption (*) We assume K is µ-d-tame (µ < κ) and [LS(K), κ)-cofinally-d-stable. Define λ ∶= min{µ < χ < κ ∶ K is χ-d-stable} ζ ∶= min{χ ∶ 2χ > λ} and ζ ∗ ∶= max{µ+ , ζ}. We also require that cf (κ) ≥ ζ ∗ and κ > ζ ∗ .

Theorem (♯) Let K be an MAEC satisfying assumption (∗). Then K is κ-d-stable.

Idea of the proof. By RA, using local character I, cf (κ) ≥ ζ ∗ and pigeon-hole principle, ◻ contradicting cofinal stability.

Pedro Zambrano (Univ. Nacional)

A stability transfer theorem in MAECs

June 4th, 2012

15 / 20

Remark If µ = ℵ0 and λ = ℵ1 , then ζ ∶= min{χ ∶ 2χ > λ} ≤ ℵ1 and < ζ ∗ = ℵ0 .

Corollary Let K be an ℵ0 -d-tame MAEC. Suppose that K is ℵ0 -d -stable and ℵ1 -d-stable. Then K is ℵn -d-stable for all n < ω

Corollary (♯ ♯) Let K be an ℵ0 -d-tame MAEC. Suppose that K is ℵ0 -d -stable and ℵ1 -d-stable. Then K is ℵω -d-stable.

Idea of the proof By RA, use local character II, ℵ0 -d-tameness and pigeon-hole principle ◻ to contradict ℵn -d-stability.

Pedro Zambrano (Univ. Nacional)

A stability transfer theorem in MAECs

June 4th, 2012

16 / 20

Proposition Let K be an ℵ0 -d-tame, ℵ0 -d-stable and ℵ1 -d-stable MAEC, which also satisfies assumption (**). Then K is κ-d -stable for every cardinality κ.

Idea of the proof. If cf (κ) ≥ ζ ∗ = ω1 , use theorem ♯. If cf (κ) = ω, use a similar argument as in corollary (♯ ♯)

Pedro Zambrano (Univ. Nacional)

A stability transfer theorem in MAECs

June 4th, 2012

17 / 20

Adknowledgment

I thank Andrés Villaveces, Tapani Hyttinen and John Baldwin for the nice discussions and suggestions to improve this work.

Pedro Zambrano (Univ. Nacional)

A stability transfer theorem in MAECs

June 4th, 2012

18 / 20

References

Å. Hirvonen, T. Hyttinen, Categoricity in homogeneous complete metric spaces, Arch. Math. Logic 48, pp. 269–322, 2009. J. Baldwin, D. Kueker, M. Vandieren, Upward stability transfer theorem in tame AECs, Notre Dame J. Formal Logic vol 47 n. 2, pp. 291–298, 2006. P. Zambrano, Around superstability in metric abstract elementary classes, Ph.D. thesis (U. Nacional de Colombia), 2011. P. Zambrano, A stability transfer theorem in d-tame metric abstract elementary classes, accepted at Math. Logic Quarterly, 2012

Pedro Zambrano (Univ. Nacional)

A stability transfer theorem in MAECs

June 4th, 2012

19 / 20

THANKS!

View from Colpatria tower - Bogotá. Pedro Zambrano (Univ. Nacional)

A stability transfer theorem in MAECs

June 4th, 2012

20 / 20

A stability transfer theorem in d-Tame Metric Abstract ...

Jun 4, 2012 - A map of discrete and metric structures classes continuous ... Definition. Let K be a class of L-structures (in the setting of Continuous Logic, but.

838KB Sizes 0 Downloads 164 Views

Recommend Documents

Maximum Power Transfer Theorem
from the power source to the load is when the resistance ... Function generator on the Velleman oscilloscope that is used in a ... Th . http://www.vellemanusa.com ...

An abstract factorization theorem for explicit substitutions
We show how to recover standardization by levels, we model both call-by-name and ... submitted to 23rd International Conference on Rewriting Techniques and ...

A STRUCTURE THEOREM FOR RATIONALIZABILITY IN ... - STICERD
We show that in any game that is continuous at infinity, if a plan of action ai is rationalizable ... Following Chen, we will use the notation customary in incomplete ...

A STRUCTURE THEOREM FOR RATIONALIZABILITY IN ... - STICERD
particular, there, we have extensively discussed the meaning of perturbing interim ..... assumption that Bi (h), the set of moves each period, is finite restricts the ...

A trichotomy theorem in natural models of AD
The argument can be seen in a natural way as proving two dichotomy theorems, ..... holding not in the universe V of all sets but rather in particular inner models, such as L(R). ..... any tree T on R with no end nodes has an infinite branch.

A trichotomy theorem in natural models of AD - CiteSeerX
although our results apply to a slightly larger class of models. The special form .... Theorem 1.2; and Hugh Woodin, for developing the beautiful theory of AD+, for.

A nonsmooth Robinson's inverse function theorem in ...
Jan 24, 2014 - function whose domain is a neighborhood of ¯x, we say that this localization is .... may be difficult to check in the general case considered.

A Structure Theorem for Rationalizability in Infinite ...
For any type t1 in this game, consider a rationalizable plan of action ... This is because a plan of action cannot be strictly ... However, continuity at infinity turns out ...

A trichotomy theorem in natural models of AD - CiteSeerX
The best understood models of AD+ come from a construction due to Woodin, the ...... The proofs of Theorems 1.2–1.4 are further illustrations of this idea. 4.1.2.

Roth's theorem in the primes
I. Schrödinger equations, Geom. Funct. Anal. 3 (1993), 107–156. [6] ———, On triples in arithmetic progression, Geom. Funct. Anal. 9 (1999), 968–984. [7]. H. Davenport, Multiplicative Number Theory, Third edition, Grad. Texts Math. 74. Springer-Verlag

Abstract
Location: Biogeografía de Medios Litorales: Dinámicas y conservación (2014), ISBN 978-84-617-. 1068-3, pages 185-188. Language: Spanish. Near the town of ...

A Make Abstract Machine - gsf
has been used to abstract both oldmake (System V, BSD, GNU) and nmake. .... The rule and variable definition instructions support static makefile descriptions.

harmonic oscillations, stability and chaos control in a ...
2 Jan 2002 - advantage of non-linear responses of the model in manufacturing processes. 2.2. FORCED ... w. (ii). Figure2. Analytical (+) and numerical (} В }) frequency–response curves A(w), with the parameters .... a stability boundary in the (w,

A Make Abstract Machine - gsf
has been used to abstract both oldmake (System V, BSD, GNU) and nmake. make ..... state consists of 2 files; mamfile.ml contains the list of all rules and ...

A STRUCTURE THEOREM FOR RATIONALIZABILITY ...
under which rti (ai) is a best reply for ti and margΘXT−i. (πti,rti (ai)) = κti . Define a mapping φti,rti (ai),m : Θ* → Θ* between the payoff functions by setting. (A.5).

Download PDF A First Course in Abstract Algebra
Stunning that it took this may people to make A First Course in Abstract Algebra an ... Your Account Sales Terms & Conditions Privacy Policy Free Shipping Policy. ... Abstract Algebra cities. gov is the official website for A First Course in ... FIEL

52399477-A-First-Course-in-Abstract-Algebra-JB ...
Page 1 of 520. Instructor's Preface Vll. Student's Preface xi. Dependence Chart Xlll. o Sets and Relations 1. GROUPS AND SUBGROUPS. 1 Introduction and Examples 11. 2 Binary Operations 20. 3 Isomorphic Binary Structures 28. 4 Groups 36. 5 Subgroups 49

Robust Stability in Matching Markets
Aug 14, 2010 - A matching problem is tuple (S, C, P,≻,q). S and C are finite and disjoint sets of students and schools. For each student s ∈ S, Ps is a strict ...

Chain Stability in Trading Networks - Scott Kominers
Apr 1, 2015 - We show that in general trading networks with bilateral contracts, a suitably .... economy are fully substitutable (see Definition 1 in Section 2.1), chain stable ..... vertical environments, with a flow of goods and services from the .

A Theorem on Orthology Centers
Sep 15, 2004 - bx x+z . In the notations of John H. Conway, the pedal A∗ of Oa on BC has homogeneous barycentric coordinates (0 : uSC + a2v : uSB + a2w).

A Nonstandard Standardization Theorem
Rσ(k). → s with respect to an order ≺ (typically the left-to-right order). ... Reduce the leftmost redex at each step ... Dynamically: small-step operational semantics.

A Nonstandard Standardization Theorem
used to prove a left-to-right standardization theorem for the cal- culus with ES .... affect the final result nor the length of evaluation sequences (tech- nically, LHR ...