Keywords: results reproducibility, reproducibility of study, study reproducibility, reproducible research, reproducible finding, or reproducible result

1. An overview of the "reproducibility crisis": awareness in 2016

1. An overview of the "reproducibility crisis": not a binary phenomenon

1. An overview of the "reproducibility crisis": research tasks have moved

Inadequate methodologies

A result is all the more likely to be false when: -effect sizes are small -there is a greater number and lesser preselection of tested relationships -there is greater flexibility in designs, definitions, outcomes, and analytical modes -there is greater financial and other interest and prejudice + the propensity of journals to publish only positive results + the "publish or perish" culture for researchers Source

1 .

 1 Massive data production / reuse 2. Organize (store, document, annotate) 3. Analyze (extract information) 4. Share information 1. An overview of the "reproducibility crisis": alarm in 2005 Ioannidis (2005) Why most published research findings are false. PLoS Med 2(8): e124 DOI: 10.1371/journal.pmed.0020124

  In practice, you can often work with a popular closed format and convert it to an open format. But you need to check whether the conversion alters the information, and take compensatory measures if necessary. Example: XLSX -> CSV conversion loses formatting.

1 .

 1 experimental design reporting, 2. image acquisition reporting, 3. preprocessing reporting, 4. statistical modeling, 5. results reporting, 6. data sharing, 7. reproducibility For each of 7 areas of a study, a tabular listing of over 100 items to help plan, execute, report, and share research in the most transparent fashion is provided. eCOBIDAS checklist https://remi-gau.github.io/eCobidas/ • Most studies do not present all results of their analysis, hiding subthreshold ones. • Hiding results negatively affects the interpretation and understanding of the study. • Neuroimagers should present all results of their study, highlighting key ones. Thresholds hide interesting effects! "We need to see each. Showing more results helps with quality control (QC) evaluation. Become more confident in (or appropriately worried about!) your data." Paul Taylor & other times, thresholds hide artifacts and badness.

2 .

 2 General tips to help with reproducibility: results of fMRI data Maumet. Different analysis pipelines, different results... How to deal with analytical variability? 20th IEEE International Symposium on Biomedical Imaging (ISBI 2023), Cartagena (Colombia). ffhal-04073419f Lambin et al. Radiother. Oncol. 2013 doi: 10.1016/j.radonc.2013.07.007 "My hope is that others will be able to reproduce some of our core findings and extend them in interesting new directions." -Pr. James R. Booth https://lab.vanderbilt.edu/boothlab/datasets/

1. An overview of the "reproducibility crisis": awareness in 2016

		Multidisciplinary
		Arts & Humanities
		Social Sciences
		Psychology & Psychiatry
		Economics & Business
		Agricultural sciences
		Environment & Ecology
		Plant & Animal sciences
		Neurobiology & Behavior
		Clinical Medicine
		Pharmacology & Toxicology
		Microbiology
		Molecular Biology
		Biology & Biochemistry
		Chemistry
		Physics
		Space science
		Engineering
		Computer Sciences
	Query on Scopus:	Mathematics
	same keywords as Goodman et al. but restricted
	Conclusion: "any scientific field, require a clear
	specification of the kind of reproducibility being
	discussed (methods, results, or inferences)"

to Neuroscience only 0 20 40 60 80 100 120 140 1981 1991 2001 2011 2021

	Legend
	Blue: An idealized version of the hypothetico-deductive model of the scientific method
	Pink: threats to this model

Munafò et al. A manifesto for reproducible science. Nat Hum Behav 1, 0021 (2017). https://doi-org.insb.bib.cnrs.fr/10.1038/s41562-016-0021 2.

General tips to help with reproducibility: methods 2. General tips to help with reproducibility: methods

Botvinik-Nezer & Wager. Reproducibility in Neuroimaging Analysis: Challenges and Solutions. Biological Psychiatry: Cognitive Neuroscience and Neuroimaging (2022) https://doi.org/10.1016/j.bpsc.2022.12.006

2. General tips to help with reproducibility: methods

Source

Organizational principles: 1. Put each project in its own project directory 2. Keep together what needs to be kept together 3. Keep the source data 4. Make file names human-readable 5. Make file names machine-readable 6. Make file names easy to sort 7. Back up your data XNAT @ CRNL (see wiki for details) 2.

General tips to help with reproducibility: methods Documentation principles

: 8. Create an overview of your project 9. Make software dependencies explicit 10. Describe variables in a codebook 11. Document your code and its use 12. Give meaningful names to functions and variables 13. Keep track of how each result was produced Organizational principles: 1. Put each project in its own project directory 2. Keep together what needs to be kept together 3. Keep the source data 4. Make file names human-readable 5. Make file names machine-readable 6. Make file names easy to sort 7. Back up your data Source 2.

General tips to help with reproducibility: methods

Source

GitLab @ CRNL (see wiki for details)

or https://gitlab.in2p3.

fr/ 2. General tips to help with reproducibility: methods Source 2. General tips to help with reproducibility: methods

	2.
	Organizational principles: 1. Put each project in its own project directory 2. Keep together what needs to be kept together 3. Keep the source data 4. Make file names human-readable 5. Make file names machine-readable 6. Make file names easy to sort 7. Back up your data	Principles of automation : 14. Avoid manual data manipulation steps 15. Modularize code rather than copy and paste 16. Reuse code rather than rewrite it 17. Don't comment or uncomment code sections to control program behavior 18. Add assertions to programs to check their operation 19. Save the random number generator seed 20. Record all intermediate results

Source

Documentation principles: 8. Create an overview of your project 9. Make software dependencies explicit 10. Describe variables in a codebook 11. Document your code and its use 12. Give meaningful names to functions and variables 13. Keep track of how each result was produced

General tips to help with reproducibility: methods 2. General tips to help with reproducibility: methods

	fMRIPrep workflow Organizational principles: 1. Put each project in its own project directory 2. Keep together what needs to be kept together 3. Keep the source data 4. Make file names human-readable 5. Make file names machine-readable 6. Make file names easy to sort 7. Back up your data	Principles of automation : 14. Avoid manual data manipulation steps 15. Modularize code rather than copy and paste 16. Reuse code rather than rewrite it 17. Don't comment or uncomment code sections to control program behavior 18. Add assertions to programs to check their operation 19. Save the random number generator seed 20. Record all intermediate results

Documentation principles: 8. Create an overview of your project 9. Make software dependencies explicit 10. Describe variables in a codebook 11. Document your code and its use 12. Give meaningful names to functions and variables 13. Keep track of how each result was produced Source Distribution principles: 21. Store data in open formats 22. Process data with open software 23. Eliminate hard-coded paths in your code 24. Link text statements to underlying results 25. Submit code and data to a DOI-issuing repository and reference it in your article 26. Make the license of code and data explicit

General tips to help with reproducibility: methodsSource

General tips to help with reproducibility: methods Botvinik-Nezer & Wager. Reproducibility in Neuroimaging Analysis: Challenges and Solutions. Biological Psychiatry: Cognitive Neuroscience and Neuroimaging (2022) https://doi.org/10.1016/j.bpsc.2022.12.006

Source & further reading: Gorgolewski et al. Sci Data, 2016, http://bids.neuroimaging.io2. General tips to help with reproducibility: methods

General tips to help with reproducibility: results of fMRI data Taylor & al. Highlight results, don't hide them: Enhance interpretation, reduce biases and improve reproducibility. NeuroImage (2023)

Taylor & al. Highlight results, don't hide them: Enhance interpretation, reduce biases and improve reproducibility. NeuroImage (2023) 2. General tips to help with reproducibility: results of fMRI data

Maumet. Different analysis pipelines, different results... How to deal with analytical variability? 20th IEEE International Symposium on Biomedical Imaging (ISBI 2023), Cartagena (Colombia). ffhal-04073419f2. General tips to help with reproducibility: results of fMRI data

The Neuroimaging Analysis Replication and Prediction Study www.narps.info


DEFINABILITY OF GROUPS IN ℵ 0 -STABLE METRIC STRUCTURES ITA Ï BEN YAACOV

Keywords: 2000 Mathematics Subject Classification. 03C45, 03C90 continuous logic, definable set, definable group, definable metric, ℵ 0 -stability

We prove that in a continuous ℵ 0 -stable theory every type-definable group is definable. The two main ingredients in the proof are:

(i) Results concerning Morley ranks (i.e., Cantor-Bendixson ranks) from [Ben08], allowing us to prove the theorem in case the metric is invariant under the group action; and (ii) Results concerning the existence of translation-invariant definable metrics on type-definable groups and the extension of partial definable metrics to total ones.

Introduction

Definable sets, as well as more complex definable objects (e.g., groups) play a central and essential role in classical model theory. These are (usually) subsets of the ambient structure which are defined by a single formula of classical first order logic.

Continuous first order logic was proposed in [BU] as an extension of classical first order logic, obtained by replacing the two-element set of truth values {T, F } with the compact interval [0, 1]. It allows to consider various classes of complete metric structures as elementary classes and to study definability therein. However, some things do become more complicated in continuous logic, and in particular the classical notion of a definable set splits in two. First, a set is a predicate, and a definable set is a definable predicate, i.e., a definable function into the set {T, F } (or {0, 1}). As such, the correct analogue is a definable continuous predicate, i.e., a definable function to [0, 1] -it is definable in the sense that it is given by a continuous first order formula, or, at the very least, by a uniform limit of such. But when thinking of definable objects, such as groups, there is an essential asymmetry between what is inside (which interests us) and what is outside (about which we could hardly care less, especially if the set is stably embedded). The same asymmetry arises when we wish to quantify over a definable set. In that case the notion of a definable predicate is inadequate and we are led to the notion of a definable set in continuous logic: this is a closed set the distance to which is a definable predicate, or equivalently, over which we may quantify (see Fact 1.7 below).

The class of definable set in a continuous structure is far less well-behaved than in classical logic. For example, the family of all definable subsets of M n does not form a Boolean algebra, as it is not always closed under complement or intersection. Worse still, non trivial definable sets need not always even exist. In particular, there exist theories which do not admit enough definable sets, i.e., where definable sets do not suffice to separate types.

Example 0.1. Let us consider the theory T = Th(Q, 0, 1, +, ≤). Like any other classical theory, it may be viewed as a continuous theory by identifying the truth values T and F with 0 and 1, respectively. Specifically, we add an axiom sup xy d(x, y) ∧ ¬d(x, y) = 0 asserting that the distance (i.e., equality) predicate takes values in {0, 1}, and similarly for the predicate ≤.

We now define a continuous predicate P (x) = st (x ∧ 1) ∨ 0 , namely the standard part of x truncated at 0 from below and at 1 from above. Notice that in any model of T and for every r ∈ [0, 1], the conditions P (x) ≥ r and P (x) ≤ r are type-definable: P (x) ≥ r ⇐⇒ {nx ≥ m : n, m ∈ N, nr > m}, P (x) ≤ r ⇐⇒ {nx ≤ m : n, m ∈ N, nr < m}.

It follows that P is a definable predicate in T .

Let us now consider the continuous theory T P = Th(Q, 0, m q , +, P ) q∈Q where m q denotes multiplication by q. This is a reduct of T , and we leave it as an easy exercise to the reader to check that it admits quantifier elimination as well. For a member a of a model of T P consider the following two values r + = inf{q ∈ Q >0 : P (r/q) < 1}, r -= inf{q ∈ Q >0 : P (-r/q) < 1}.

Notice that either P (a) = 0 or P (-a) = 0, so at least one of r + and r -is zero and we may define

r = r + -r -∈ [-∞, ∞].
For every number q ∈ Q we have:

P (qa) =      1 qr ≥ 1, rq 0 ≤ qr ≤ 1, 0 qr ≤ 0.
(where 0 • ∞ = 0)

Thus r determines the type of a. We obtain a bijection S 1 (T P ) → [-∞, ∞] which is easily checked to be continuous and therefore a homeomorphism. On the other hand, a model of T P carries the discrete 0/1 metric. Thus, if X is a definable set, then its complement is definable as well: d(x, X c ) = ¬d(x, X). If X is definable without parameters then the corresponding closed set [X] ⊆ S 1 (T P ) must be clopen, i.e., either ∅ or all of S 1 (T P ).

We conclude that a model of T P admits no non trivial ∅-definable sets (in 1-space), so T P does not have enough definable sets. Since all known examples of this pathology are unstable it makes sense to ask whether all stable continuous theories admit enough definable sets.

One of the beautiful aspects of stable group theory in classical logic is the proof that there are also "enough definable groups", namely, that every type-definable group is the intersection of definable subgroups of a definable group. In the case of an ℵ 0 -stable theory, chain conditions along with the previous general fact yield that every type-definable group is definable. In continuous logic we can prove adequate analogues of the chain conditions for sequences of definable (or type-definable) groups for ℵ 0 -stable theories, but we do not know how to prove enough definable groups exist in stable theories.

In the present paper we give a direct proof of the fact that in an ℵ 0 -stable theory every type-definable group is definable, leaving open the question of the existence of definable groups in general stable theories. In the special case of the theory of probability algebras this has already been proved by Alexander Berenstein [START_REF] Berenstein | Definable subgroups of measure algebras[END_REF].

In Section 1 we discuss various definability classes of sets and functions.

In Section 2 we prove the main theorem using some technical results concerning Morley ranks (i.e., Cantor-Bendixson ranks) from [START_REF]Topometric spaces and perturbations of metric structures[END_REF]. We do this under the assumption of the invariance of the metric under the group operation (Theorem 2.11). The rest of the paper aims towards the removal of this assumption.

In Section 3 we study definable metrics other than the standard one. In particular, we study when and how partial definable metrics (on a definable or type-definable set) can be extended to total ones.

In Section 4 we prove the full version of main theorem and give some corollaries.

In Section 5 we use several earlier results to prove some chain conditions for (type-)definable groups in stable and ℵ 0 -stable theories.

We assume familiarity with the development of continuous logic as developed in the first half of [BU]. We shall also use facts regarding general stability and stable groups from the second half of [BU] and from [Ben], as well as regarding ℵ 0 -stability and topometric Cantor-Bendixson ranks from [START_REF]Topometric spaces and perturbations of metric structures[END_REF].

Definability properties

This section consists mostly of definitions and relatively easy facts. Some of the facts presented here also appear in [BBHU08, Section 9]. (i) A type-definable set X is the set of realisations of an arbitrary set of conditions {ϕ i (x) = 0 : i < λ}. (ii) A zero set X is the set of realisations of a single condition ψ(x) = 0, where ψ(x) is a definable predicate. We then say that X is the zero set of ψ. (iii) A definable set X is a closed set for which d(x, X) is a definable predicate. We say that X is definable over a parameter set A, or that it is A-definable, if d(x, X) definable over A. Type-definable sets and zero sets will only be considered in sufficiently saturated structures, while definable sets make sense in an arbitrary structure.

Clearly, every zero set is type-definable, and every definable set X is the zero set of d(x, X). In terms of types, we know that a type-definable set X corresponds to closed sets of types [X] ⊆ S n (A) where A contains all the parameters appearing in the definition of X.

Definition 1.2. Let X and Y be two type-definable sets. We say that Y is a logical neighbourhood of X, in symbols X < Y , if there is a set of parameters A over which both X and Y are defined such that

[X] ⊆ [Y ] • in S n (A).
Notice that the interior of [Y ] does depend on A (i.e., if A ′ ⊇ A then [Y ] • calculated in S n (A ′ ) may be larger than the pullback of the interior of [Y ] in S n (A)). We may nonetheless choose any parameter set we wish: Lemma 1.3. Assume that X is type-definable with parameters in B, Y type-definable possibly with additional parameters not in B. Then:

(i) If X < Y then [X] ⊆ [Y ]
• in S n (A) for any set A over which both X and Y are defined.

(ii) If X < Y then there is an intermediate logical neighbourhood X < Z < Y , which can moreover be taken to be the zero set of a formula with parameters in B.

(iii) If Y ∩ X = ∅ then there is a logical neighbourhood Z > X such that Z ∩ Y = ∅. Moreover, we
may take Z to be a zero set defined over B.

Proof. Assume X < Y , where X is type-definable over B, and Y over A ⊇ B. Let Φ consist of all formulae ϕ(x) over B which are zero on X. If ϕ, ψ ∈ Φ then ϕ ∨ ψ ∈ Φ, and X is defined by the partial type p(x) = {ϕ(x) ≤ r : ϕ ∈ Φ, r > 0}. By compactness in S n (A) there is a condition ϕ(x) ≤ r in p(x) which already implies x ∈ Y . Let Z be the zero set of the formula ϕ(x) -. r ′ where 0

< r ′ = k 2 -m < r. Then in S n (A) we have [X] ⊆ [ϕ(x) < r ′ ] ⊆ [ϕ(x) ≤ r ′ ] ⊆ [ϕ(r) < r] ⊆ [Y ], i.e., [X] ⊆ [Z] • ⊆ [Z] ⊆ [Y ]
• , proving the first two items. The third item now follows from the fact that S n (A) is a normal topological space.

1.3 Lemma 1.4. A type-definable set X is a zero set if and only if [X] is a (closed) G δ set.
Proof. This is just a topological statement, saying that in a compact Hausdorff space Y , a closed subset K ⊆ Y is the zero set of some f ∈ C(Y, [0, 1]) if and only if it is a G δ set. This is in fact true in an arbitrary normal space: left to right is immediate, while right to left involves a straightforward construction using ω applications Urysohn's Lemma.

1.4

It follows that finite unions and countable intersections of zero sets are zero sets. In particular, a set X which is type-definable by a countable set of conditions is a zero set.

Later on we shall use the following result:

Lemma 1.5. Let X = i<n X mi i be a type-definable set, (so each X i is one) and Y ⊇ X a zero set. Then there are zero sets

Y i ⊇ X i such that Y ⊇ i<n Y mi i . Proof. We only show that if X × X ′ is a type-definable set and Y ⊇ X × X ′ is a zero set then there is a zero set Y ′ ⊇ X ′ such that Y ⊇ X × Y ′ .
The result then follows since the intersection of finitely (or even countably) many zero sets is a zero set.

Let ϕ(x, y) = 0 define Y . For n < ω consider the partial type

{x ∈ X} ∪ {y ∈ X ′ } ∪ {ϕ(x, y) ≥ 2 -n }. As it is inconsistent Y admits a logical neighbourhood Y n > X ′ such that {x ∈ X}∪{y ∈ Y n }∪{ϕ(x, y) ≥ 2 -n } is inconsistent. Moreover, choosing the sets Y n by induction on n we may arrange that Y n > Y n+1 . Let Y ′ = Y n . Then [Y ′ ] = [Y n ] is a closed G δ set, and Y ⊇ X × Y ′ . 1.5
In many situations we may wish do show that if a condition holds on a type-definable set then it holds on some zero set containing it. This is (tautologically) the case if the condition itself is a zero set. It is still true if the condition in question is a containment (i.e., implication) of zero sets.

Lemma 1.6. Let ϕ(x) and ψ(x) be two definable predicates, X a type-definable set, and assume that for all x ∈ X: ϕ(x) = 0 =⇒ ψ(x) = 0. Then there exist a zero set Y ⊇ X on which ϕ(x) = 0 =⇒ ψ(x) = 0 holds as well.

Proof. For every ε > 0 there is δ(ε) > 0 such that for all x ∈ X: ϕ(x) < δ(ε) =⇒ ψ(x) ≤ ε. Indeed, if not, then we can obtain a contradiction to our assumption using compactness. We can therefore take Y to be the zero set of:

χ(x) = n<ω 2 -n-1 (δ(2 -n ) -. ϕ(x)) ∧ (ψ(x) -. 2 -n ) . 1.6
Finally, when it comes to definable sets, there are several important equivalent characterisations. For a structure M, a subset X ⊆ M n , a definable predicate ϕ(x, ȳ) (possibly with parameters in M (where sup ∅ = 0)

Thus sup x∈X ϕ(x, ȳ) is a [0, 1]-valued predicate on M m which need not be definable.

Fact 1.7. Let M be a structure, X ⊆ M n closed subset. Let also A ⊆ M be a set of parameters. Then the following are equivalent:

(i) X is definable in M over A.
(ii) X is the zero set in M of an A-definable predicate ψ(x), and d(x, X) ≤ ϕ(x) on M n . (iii) For every ε > 0 there exists a formula ψ ε (x) (with parameters in A) such that:

X ⊆ ā ∈ M n : ψ ε (ā) = 0 ⊆ ā ∈ M n : ψ ε (ā) < 1 ⊆ B(X, ε).
(iv) For every A-definable predicate ϕ(x, ȳ), the predicate sup x∈X ϕ(x, ȳ) is definable in M over A.

(v) For every formula ϕ(x, ȳ), the predicate

sup x∈X ϕ(x, ȳ) is definable in M over A. If M is (|A| + ℵ 0 ) + -
saturated and X is type-definable in M over A then these conditions are further equivalent to:

(vi) For every ε > 0, the set B(X, ε) (which is necessarily type-definable over A) is a logical neighbourhood of X.

Proof.

(i) =⇒ (ii). Take ψ(x) = d(x, X).

(ii) =⇒ (iii). Take ψ ε = kψ = (kψ) ∧ 1, where k > 1/ε. (iii) =⇒ (iv). It will be enough to show that sup x∈X ϕ(x, ȳ) admits arbitrarily good uniform approximations by A-definable predicates.

Given ε > 0 there exist δ > 0 and k ∈ N such that

d(x, x′ ) < δ =⇒ |ϕ(x, ȳ) -ϕ(x ′ , ȳ)| ≤ ε. Let ζ(x, ȳ) = ϕ(x, ȳ) -. ψ δ (x), and let us fix b ∈ M m . For ā ∈ X we have ζ(ā, b) = ϕ(ā, b). For arbitrary ā in M n , if ζ(ā, b) > 0 then necessarily ψ δ (ā) < 1, so there is ā′ ∈ X, d(ā, ā′ ) < δ, whereby ζ(ā, b) ≤ ϕ(x, ȳ) ≤ sup x∈X ϕ(x, b) + ε.
We obtain the desired approximation

sup x∈X ϕ(x, b) ≤ sup x ζ(x, ȳ) ≤ sup x∈X ϕ(x, b) + ε. (iv) =⇒ (v). Immediate. (v) =⇒ (i). d(x, X) = inf ȳ∈X d(x, ȳ).
(iii) ⇐⇒ (vi). An easy application of Urysohn's Lemma (and of density of formulae among definable predicates) in S n (A).

1.7

If a definable predicate ψ(x) defines the distance to a definable set X then ψ is 1-Lipschitz and ψ(x) ≥ d(x, X), where X is necessarily the zero set of ψ. It is also not difficult to see that these are sufficient conditions. Now let c denote the parameter for the definable predicate ψ(x), which we may re-write as ψ(x, c). The 1-Lipschitz condition is easily expressed as a property of c in continuous logic by D1 below. The condition that ψ(x) ≥ d(x, X) can be written as ∀x ∃ȳ ψ(ȳ, c) = 0 & d(x, ȳ) ≤ ψ(x, c) , which in continuous logic can only be expressed approximately, as in D2. Proposition 1.8. Let Σ ψ (z) consist of conditions D1 and D2. Let M be any structure, c ∈ M (possibly in an imaginary sort -for example the sort of canonical parameters for instances of ψ) and let X c ⊆ M n be the zero set of ψ(x, c).

Then ψ(x, c) = d(x, X c ) in M if and only if M Σ ψ (c).
Moreover, the quantification in Fact 1.7 uniform, meaning that for any definable predicate ϕ(x, ȳ, z) there is a definable predicate χ ψ,ϕ (ȳ, z) (both without parameters), such that for every structure M and every c ∈ M :

Σ ψ (c) =⇒ sup x∈Xc ϕ(x, ȳ, c) = χ ψ,ϕ (ȳ, c).
Proof. Left to right is clear, so we prove right to left. By D1, ψ(x, c) is 1-Lipschitz, so ψ(x, c) ≤ d(x, X c ).

For the other inequality, let ā ∈ M n and let ε > 0. By D2 there exists ā0 such that

ψ(ā 0 , c) < ε, d(ā, ā0 ) < ψ(ā, c) + ε.
Proceeding by induction we construct a sequence {ā n } in M verifying

ψ(ā n+1 , c) < 2 -n-1 ε, d(ā n , ān+1 ) < ψ(ā n , c) + 2 -n-1 ε < 3 • 2 -n-1 ε
This sequence is Cauchy and converges in M to some b. Then ψ( b, c) = 0 by continuity of ψ(x, c) and

d(x, X c ) ≤ d(ā, b) < ψ(ā, c) + ε + 3ε 2 -n-1 < ψ(ā, c) + 4ε.
Thus d(ā, X c ) ≤ ψ(ā, c), as desired. The moreover part is by inspection of the proof of Fact 1.7.

1.8

It follows definable sets, as well as quantification over definable sets, are respected by elementary extensions and restrictions.

Corollary 1.9.

Assume A ⊆ M N . If X 1 ⊆ M n is A-definable then there is a unique A-definable subset X 2 ⊆ N n such that X 1 = X 2 ∩ M n . Conversely, if X 2 ⊆ N n is A-definable in N then X 1 = X 2 ∩ M n is A-definable in M.
Moreover, assume this is the case, and let ϕ(x, ȳ) be an A-definable predicate, so sup x∈X1 ϕ(x, ȳ) and sup x∈X2 ϕ(x, ȳ) are A-definable in M and in N , respectively. Then the latter is the unique interpretation in N of the former. In particular, d(x, X 2 ) is the unique interpretation of d(x, X 1 ) in N .

Proof. Immediate from Proposition 1.8 and the fact that two A-definable predicates which agree on M, also agree on N .

1.9

We may therefore refer to a definable set X or to the definable predicates d(x, X) and sup x∈X ϕ(x, X) without specifying the ambient structure explicitly (it just has to contain all the required parameters). In the situation described above we may then write X 1 = X(M), d(x, X 1 ) = d(x, X) M , and so on. It is also worthwhile to notice that every definable set X admits an imaginary canonical parameter, or code, namely an imaginary element which is fixed precisely by those automorphisms of a large homogeneous ambient structure which fix X set-wise. Indeed, the canonical parameter of d(x, X) will do.

Lemma 1.10. The product and union of two definable sets are definable.

Proof. If X and Y are definable then d((x, y), X × Y ) = d(x, X) ∨ d(y, Y
), where we equip the product sort with the maximum metric. If they are in the same sort then

d(x, X ∪ Y ) = d(x, X) ∧ d(x, Y ).

1.10

A finite intersection of definable sets needs not be definable in general. When it comes to infinite unions, we propose two results.

Lemma 1.11. Let X be a type-definable set, and assume X = i<α X i where {X i : i < α} is a possibly infinite (yet bounded) family of definable sets. Then X is definable.

Proof. By Fact 1.7 all we need to check is that for every ε > 0 the set B(X, ε) is a logical neighbourhood of X. Indeed:

B(X, ε) ⊇ B(X, ε) = i<α B(X i , ε) ⊇ i<α B(X i , ε/2), whereby: [ B(X, ε)] • ⊇ i<α [ B(X i , ε/2)] • ⊇ i<α [X i ] = [X]. 1.11
Similarly, a definable union of definable sets is definable: Lemma 1.12. Let X ā be a family of uniformly definable sets with parameters in a definable set Y . That is to say that there is a definable predicate ϕ(x, ȳ) such that d(x, Xā ) = ϕ(x, ā) for every ā ∈ Y . Then Z = ā∈Y X ā is definable.

Proof. First, Z is a closed set by a simple compactness argument. Then we have:

d(x, Z) = inf ȳ∈Y d(x, X ȳ) = inf ȳ∈Y ϕ(x, ȳ).
1.12 1.2. Partial definable predicates and functions. We shall consider objects such as predicates and functions which are only defined on some type-definable set.

Definition 1.13. Let X be a type-definable set.

(i) A partial type-definable predicate ψ(x) on X, is given by a continuous mapping ψ :

[X] → [0, 1],
where [X] is the closed set of complete types corresponding to X. We call X the domain of ψ, denoted dom(ψ), and for ā ∈ X we denote by ψ(ā) the truth value ψ(tp(ā)). (ii) It is definable on X if it is the restriction of a definable predicate to X. (iii) A partial type-definable function f (x) on X is one whose graph is given by a partial type

G f (x, y). That is to say that G f (x, y) ∪ G f (x, z) y = z and that dom(f ) = X is defined by the partial type ∃y G f (x, y).
With a slight abuse of notation we may write it as f : X → M or f : X(M ) → M , although the model M (and even its complete theory) may vary.

(iv) It is definable on X if the predicate d(f (x), y) is definable on X × M .
We may allow parameters in the definitions by naming them in the language. Also, when explicitly specifying the domain we shall usually drop the qualifier "partial".

It is a straightforward exercise to verify that every partial definable predicate or function is typedefinable. We wish to prove the converse.

We start with a fact from general topology concerning the extensions of continuous functions.

Fact 1.14 (Tietze's Extension Theorem). Let X be a normal space, C ⊆ X closed, and let f : C → [0, 1] be a continuous function. Then f admits an extension to a continuous function f :

X → [0, 1].
Lemma 1.15. Let ψ(x <n , y) be a definable predicate, and f : X → M a type-definable partial n-ary function. Then ψ(x, f (x)) is a partial type-definable predicate on X.

Proof. Assume everything is defined without parameters, and let K = [X] ⊆ S n (T ). Then f induces a continuous function f : K → S n+1 (T ) sending tp(ā) → tp(ā, f (ā)), and ψ(x, f (x)) is given by the composition ψ • f : K → [0, 1].

1.15

Proposition 1.16. Every partial type-definable predicate or function is definable.

Proof. For predicates, this is just Tietze's Extension Theorem. For functions, assume that f :

X → M is a type-definable function. Then f ′ : X × M → M defined by f ′ (x, y) = f (x) is type-definable as well. Let ψ(x, y, z) = d(y, z). Then ψ(x, y, f ′ (x, y)) = d(y, f (x)
) is a type-definable, and therefore definable, predicate on X × M .

1.16

This means that of the notions defined above we only need to retain those of partial definable functions and predicates. Moreover, while partial definable predicates are not entirely superfluous, most of the time we shall avoid them, replacing any such partial predicate with an (arbitrary) total definable predicate extending it.

Notation 1.17. By the notation ϕ(x) ⊒ ψ(x) we mean that ϕ(x) is a definable predicate extending a partial definable predicate ψ(x).

Remark 1.18. One can add to the language a sort S [0,1] for the interval [0, 1], along with the tautological predicate id [0,1] : S [0,1] → [0, 1] (such a sort usually exists in L eq ). Then a partial predicate on a typedefinable set X is definable if and only if factors through a definable function to

S [0,1] . If Y ⊆ X are type-definable, we may say that Y is definable relative to X if d(x, Y ) is a partial definable predicate on X. Lemma 1.19. If X is definable and Y ⊆ X is definable relative to X then Y is definable. Proof. Let ϕ(x) ⊒ d(x, Y ) (where d(x, Y ) is defined on X). Then for all x: d(x, Y ) = inf y∈X d(x, y) ∔ ϕ(y) .

1.19

Since we do not always know how to extend a partial definable function to a total one, it is worthwhile to notice the following fact: Lemma 1.20. Let X be a definable set and let f be a partial definable function whose domain contains X. Then f (X) is definable as well.

Proof. Let ϕ(x, y) ⊒ d(x, f (y)). Then d(x, f (X)) = inf y∈X ϕ(x, y), which is a definable predicate since X is definable, whereby f (X) is. 1.20
It is usually fairly easy to reduce questions about arbitrary type-definable sets to questions about zero sets. For example, while it is not always possible to extend a partial definable function to a total one, one can always extend it to a zero set containing its domain:

Lemma 1.21. Let X be a type-definable set, f : X → M a definable function on X. Then there is a zero set Y ⊇ X such that f extends to a definable function on Y .

Moreover, for every choice of ϕ(x, y) ⊒ d(f (x), y) there is a zero set Y ⊇ X such that ϕ↾ Y ×M defines the graph of a partial definable function f ′ : Y → M (which extends f ).

Proof. Let ϕ(x, y) ⊒ d(f (x), y), and let:

ψ(x, y, z) = d(y, z) -. ϕ(x, y) -. ϕ(x, z) ∨ ϕ(x, y) -. d(y, z) -. ϕ(x, z) ∨ inf t ϕ(x, t)
Then ψ is zero on X × M 2 , and by Lemma 1.5 there is a zero set Y ⊇ X such that ψ is zero on Y × M 2 as well. This means that for all x ∈ Y there is y 0 such that ϕ(x, y 0 ) = 0, and that for any other y one has ϕ(x, y) = d(y, y 0 ). Thus ϕ(x, y) = d(f ′ (x), y) for some function f ′ : Y → M extending f .

1.21

If the original type-definable set is closed under the function(s) we wish to extend, we can make sure that so is the extension: Proposition 1.22. Assume that we are given:

(i) For each i < n sets X i ⊆ Y i where X i is type-definable and Y i is a zero set.
(ii) An ordinal α ≤ ω, and for each j < α a partial definable function

f j : i<n X mi,j i → X ℓj .
Then there are zero sets Y i ⊇ Z i ⊇ X i and partial definable functions

g j : i<n Z mi,j i → Z ℓj extending f j .
Moreover, if we are given definable predicate ϕ j (x j , ȳj ) ⊒ d(f j (x j ), y j ) then we can arrange that ϕ j (x j , y j ) ⊒ d(g j (x j ), y j ) as well.

Proof. For simplicity of notation we shall consider the special case of a single function f : X m → X ⊆ M , as the general case is identical (but with a lot more indexes).

Let ϕ(x, y) ⊒ d(f (x), y) be given (or just choose one). By Lemma 1.21, and possibly replacing the given zero set Y ⊇ X with a smaller zero set, we may assume there is a partial definable function

g : Y m → M such that ϕ(x, y) ⊒ g(f (x), y). Let Y 0 = Y . Given a zero set Y k satisfying Y ⊇ Y k ⊇ X let W k = g -1 (Y k ) ∩ Y m k . Then W k ⊇ X m is a zero set and by Lemma 1.5 we can find a zero set Y k+1 ⊇ X such that W ⊇ Y m k+1 , i.e., such that Y k+1 ⊆ Y k and g(Y m k+1 ) ⊆ Y k . In this manner we construct a countable decreasing sequence of zero sets Y = Y 0 ⊇ Y 1 ⊇ . . . ⊇ Y k ⊇ . . . ⊇ X such that g(Y m k+1 ) ⊆ Y k . Then Z = k Y k is a zero set, Y ⊇ Z ⊇ X and g(Z m
) ⊆ Z, as desired.

1.22

On the other hand, in later section we shall have to consider logical neighbourhoods of domains of partial definable functions (specifically: logical neighbourhoods of type-definable groups, on which the group law is a partial definable function). While the function does not necessarily extend as such, we can extend it as a multi-valued function, which is in addition approximately well-defined on small enough neighbourhoods of the original domain.

Lemma 1.23. Let X be a type-definable set, f : X → M a partial definable function. Then there is a definable predicate ϕ f (x, y) ⊒ d(f (x), y) satisfying in addition sup x inf y ϕ f (x, y) = 0. Letting f (x) = {y : ϕ f (x, y) = 0} we have:

(i) For all x: f (x) = ∅; (ii) If x ∈ X then f (x) = {f (x)}; (iii) For every ε > 0 there is a logical neighbourhood Y > X such that for all x ∈ Y : diam( f (x)) ≤ ε.
Proof. First choose any ϕ f,0 (x, y) ⊒ d(f (x), y). Then define:

ϕ f (x, y) = ϕ f,0 (x, y) -inf z ϕ f,0 (x, z).
As x ∈ X implies inf z ϕ f,0 (x, z) = 0 we still have ϕ f (x, y) ⊒ d(f (x), y) whence the second item. On the other hand sup x inf y ϕ f (x, y) = 0 follows from the definition and implies the first item.

Finally, let Σ(x, y, z) denote the partial type saying that {y, z ∈ f (x)} ∪ {d(y, z) ≥ ε}. Then Σ ∪ {x ∈ X} is inconsistent by the second item, and by compactness Σ ∪ {x ∈ Y } is inconsistent for some logical neighbourhood Y > X.

1.23

In classical logic every partial definable function on a type-definable set X can be extended to a definable set containing X. Whether this is true in continuous logic is still open, but we can show this up to an extension of the sort on which the function acts via an isometric embedding in a larger sort.

Lemma 1.24. Let S 1 and S 2 be two (imaginary) sorts, X ⊆ S 1 type-definable, and f : X → S 2 a partial definable function (usually we would have S 1 = M n and S 2 = M m being powers of the home sort). Then:

(i) We can find ϕ(x, y) ⊒ d(f (x), y) satisfying:

ϕ(x, y)ϕ(x, y ′ ) ≤ d(y, y ′ ) ≤ ϕ(x, y) + ϕ(x, y ′ ). (1) (ii) There exists an imaginary sort S 3 , a definable isometric embedding θ : S 2 ֒→ S 3 , and a total definable function f : S 1 → S 3 extending θ • f , such that moreover ϕ(x, y) = d( f (x), θ(y)).

Proof. Choose ϕ 0 (x, y) ⊒ d(f (x), y) and let ϕ(x, y) = sup z |ϕ 0 (x, z)d(z, y)|. Notice that for x ∈ X we have ϕ(x, y) = sup z |d(f (x), z)d(z, y)| = d(f (x), y), i.e., ϕ(x, y) ⊒ d(f (x), y) as well.

Let χ(t) be a formula for which 0 and 1 are possible truth values, and let

ψ(z, xyt) = χ(t) ∧ ϕ 0 (x, z) + (¬χ(t)) ∧ d(y, z).
Let S 3 = {[xyt] : x, t ∈ S 1 , y ∈ S 2 } be the sort of canonical parameters of instances of ψ(z, xyt). We recall that the metric on it is given by: d

([xyt], [x ′ y ′ t ′ ]) = sup z |ψ(z, xyt) -ψ(z, x ′ y ′ t ′ )|.
The embedding θ : S 2 ֒→ S 3 is given by y → [x 0 y 0] where χ( 0) = 0 and x 0 ∈ S 1 is arbitrary. This is indeed isometric and does not depend on the choice of either 0 or x 0 as ψ(z, x 0 y 0) = d(y, z). Thus

d(θ(y), θ(y ′ )) = sup z |d(y, z) -d(y ′ , z)| = d(y, z).
Similarly we define f : S 1 → S 3 by x → [xy 0 1] where χ( 1) = 1, obtaining ψ(z, xy 0 1) = ϕ 0 (x, z). In particular for x ∈ S 1 and y ∈ S 2 we have d( f (x), θ(y)) = ϕ(x, y) as desired, from which follows (1).

Finally

, if x ∈ X then d(θ • f (x), θ(y)) = d(f (x), y) = ϕ(x, y) = d( f (x), θ(y))
, so f extends θ • f and the proof is complete.

1.24

Question 1.25. Given a type-definable set X and a partial definable function f : X → M , can one find a definable set Y ⊇ X such that f extends to a definable f : Y → M ? This is true in classical logic.

The main theorem (first approximation)

Once we have defined (type-)definable sets and functions we automatically have corresponding notions for more complex algebraic structures. For example: Definition 2.1. By a type-definable group we mean a type-definable set G equipped with a definable function • : G 2 → G defining a group law on G.

It is definable if the set G is definable.

Notice that if G, • is a type-definable group with parameters in A then its identity e G belongs to dcl(A): indeed, every automorphism of the universal domain fixing A would fix e G . Similarly, the function x → x -1 is definable on G with parameters in A, its graph given by G

x -1 (x, y) = G • (x, y, e G ).
The main goal of this article is to give some sufficient conditions under which type-definable groups are definable. For example, we have already essentially proved: Proposition 2.2. Let G be a type-definable group, H ≤ G a subgroup of bounded index, and assume H is definable. Then so is G.

Proof. Say G/H = {g i H : i < λ}. Each coset g i H is definable as the image of H under the partial definable function x → g i x (Lemma 1.20). Then by Lemma 1.11 G = i<λ g i H implies that G is definable.

2.2

2.1. Invariant metrics. The main theorem states that in an ℵ 0 -stable theory, every type-definable group is definable. As a first approximation, we prove this under the assumption that the metric is invariant under the group operation:

Definition 2.3. A metric defined on a type-definable group is left-invariant (right-invariant ) if it is invariant under left (right) translation. It is invariant if it is both left-and right-invariant. It is inverse- invariant if it is invariant under x → x -1 .
Clearly if the metric is left-invariant (or right-invariant) and inverse-invariant then it is right-invariant (or left-invariant) and therefore invariant. Conversely, if the metric is invariant then it is in particular inverse-invariant, as we have:

d(x -1 , y -1 ) = d(x -1 y, e) = d(y, x) = d(x, y).
In classical first order logic it is an easy consequence of compactness that on every type-definable group, the group law and inverse can be extended to be well-defined (and make some sense) on some definable set containing the group, i.e., on some logical neighbourhood of the group. In the continuous sense things are trickier, and the best we can hope for is a logical neighbourhood on which an approximate product is approximately well-defined and (in case the metric on the group is invariant) approximately isometric.

Lemma 2.4. Let G be a type-definable group on which the metric is invariant. Let ϕ • (x, y, z) ⊒ d(xy, z) be as in Lemma 1.23, x• y = {z : ϕ . (x, y, z) = 0}.

Then for every ε > 0 and logical neighbourhood X > G there is an intermediate logical neighbourhood

X > Y > G such that Y • Y ⊆ X,
and multiplication is almost isometric in the sense that for all x, y, y ′ ∈ Y and for all z

∈ x• y, z ′ ∈ x• y ′ (or z ∈ y • x, z ′ ∈ y ′ • x): |d(y, y ′ ) -d(z, z ′ )| ≤ ε.
Proof. Since X > G we can find a formula χ G,X (x) which is equal to 0 on G and to 1 outside X. Then all the following partial types are contradictory:

x, y ∈ G, z ∈ x• y, χ G,X (z) = 1, x, y, y ′ ∈ G, z ∈ x• y, z ′ ∈ x• y ′ , |d(y, y ′ ) -d(z, z ′ )| ≥ ε, x, y, y ′ ∈ G, z ∈ y • x, z ′ ∈ y ′ • x, |d(y, y ′ ) -d(z, z ′ )| ≥ ε.
By compactness there exist a logical neighbourhood X > Y > G such that they are still contradictory when G is replaced everywhere with Y , and this Y will do.

2.4

2.2. Cantor-Bendixson and Morley ranks. We shall use ℵ 0 -stability via Morley ranks, i.e., Cantor-Bendixson ranks in S n (M ) where M is a sufficiently saturated model. Such ranks were studied in detail in [START_REF]Topometric spaces and perturbations of metric structures[END_REF] in the general setting of topometric spaces. In fact, that paper discusses several possible notions of Cantor-Bendixson ranks, of which we use one.

Notation 2.5. In this paper, CB ε will denote what is denoted in [START_REF]Topometric spaces and perturbations of metric structures[END_REF] by CB f,ε , i.e., the Cantor-Bendixson rank based on the removal of open ε-finite sets.

Definition 2.6. Let X be a type-definable set of n-tuples. We define the ε-Morley rank of X as RM ε (X) = CB Sn(M) ε (X), where M is any sufficiently saturated model containing the parameters needed for X (this does not depend on the choice of M).

If α = RM ε (X) then [X] ∩ S n (M ) (α) ε is ε-finite, i.e.,
ε-k-finite for some k, and we define the ε-Morley degree of X to be dM ε (X) = k.

Lemma 2.7. Let X be a type-definable set. For all r > 0 there are 0 < ε < r ′ < r such that RM r ′ (X) = RM r ′ -ε (X).

Proof. For n < ω define r n = r(1 -2 -n-1 ). Then (r n : n < ω) is an increasing sequence, whereby RM rn (X) is a decreasing sequence of ordinals and therefore stabilises from some point onwards. Thus we may take r ′ = r n+1 and ε = r n+1r n for any n large enough.

2.7

We recall some definitions and the main result we use from [Ben08, Section 3.3].

Notation 2.8. Let X, Y be two compact spaces, R ⊆ X × Y a closed relation. For x ∈ X and A ⊆ Y we define:

R x = {y ∈ Y : (x, y) ∈ R}, R ∀A = {x ∈ X : R x ⊆ A}, R ∃A = {x ∈ X : R x ∩ A = ∅}.
Fact 2.9. Let X, Y be two compact topometric spaces, R ⊆ X × Y a closed relation, and ε, δ > 0 such that for all (x, y),

(x ′ , y ′ ) ∈ R: if d Y (y, y ′ ) ≤ δ then d X (x, x ′ ) ≤ ε. Let K ⊆ X and F ⊆ Y be closed sets such that K ⊆ (R ∃Y ) • ∩ R ∀F . Then CB X ε (K) ≤ CB Y δ (F ).
Proof. [Ben08, Theorem 3.23].

2.9

The following result contains the technical core of the proof of the (first approximation of the) main theorem. Given a logical neighbourhood of G on which product is well-behaved and a point in that neighbourhood (outside G), we can approximately translate G by that element, obtaining an approximately isometric copy of G. Using the Fact cited above we can compare the Morley ranks of G and of this approximate copy. In addition, if the element we translate by is far enough from G, then so will be the entire copy.

Lemma 2.10. Let G be a group on which the metric is invariant.

Then for every ε > 0 and logical neighbourhood X > G there exists an intermediary logical neighbourhood X > Y > G such that for all r > ε either Y ⊆ B(G, r) or there is a type-definable subset Z ⊆ X such that d(Z, G) > rε and RM r-ε (Z) ≥ RM r (G).

Proof. Apply Lemma 2.4 to X > G and ε > 0 to obtain X > Y > G. If Y ⊆ B(G, r) then we are done, so assume the contrary, i.e., that there exists y 0 ∈ Y such that d(y 0 , G) > r.

Set Z = y 0 • G ⊆ X, which is type-definable. To see that d(G, Z) > r -ε, let g ∈ G and z ∈ Z. Then z ∈ y 0 • h for some h ∈ G. Let g ′ = gh -1 ∈ G, so d(y 0 , g ′ ) > r. Since y 0 , g ′ , h ∈ Y we have |d(z, g) -d(y 0 , g ′ )| ≤ ε, whereby d(z, g) > r -ε. By a compactness argument it follows that d(G, Z) > r -ε.
Let M be a fairly saturated model containing all necessary parameters, including y 0 , and let S = S(M ). Set

R = {(tp(u/M ), tp(v/M )) : u ∈ Y, v ∈ y 0 • u}. Then R ⊆ S 2 is a closed relation, [Y ] = R ∃S and [G] ⊆ R ∀[Z] , so [G] ⊆ (R ∃S ) • ∩ R ∀[Z] . On the other, if (p, q), (p ′ q ′ ) ∈ R then |d(p, p ′ ) -d(q, q ′ )| ≤ ε, so d(q, q ′ ) ≤ r -ε =⇒ d(p, p ′ ) ≤ r. Applying Fact 2.9 we get: RM r (G) = CB S r ([G]) ≤ CB S r-ε ([Z]) = RM r-ε (Z).
2.10 2.3. The definability proof. Notice that we have not yet used the assumption of ℵ 0 -stability (the ranks in Lemma 2.10 may well be infinite).

Theorem 2.11. Let G be a type-definable group in an ℵ 0 -stable theory on which the metric is invariant. Then G is definable.

Proof. Let r > 0, and we shall show that B(G, r) > G. There is no harm if we decrease r, so by Lemma 2.7 we may assume that RM r (G) = RM r-ε (G) for some 0 < ε < r. By compactness we can find X > G such that RM r-ε (G) = RM r-ε (X) and dM r-ε (G) = dM r-ε (X). Apply Lemma 2.10 to find X > Y > G such that either Y ⊆ B(G, r) or there is Z ⊆ Y such that d(G, Z) > rε and RM r-ε (Z) ≥ RM r (G) = RM r-ε (G).

In the second case we have RM r-ε (G) = RM r-ε (Z) = RM r-ε (X), so from d(G, Z) > rε we obtain:

dM r-ε (G) = dM r-ε (X) ≥ dM r-ε (G ∪ Z) ≥ dM r-ε (G) + dM r-ε (Z) > dM r-ε (G).
This is impossible, so B(G, r) ⊇ Y > G, as desired.

2.11

2.4. Further facts. We prove here some additional facts regarding Morley ranks and groups in an ℵ 0 -stable theory T . It was shown in [BU] that for a stable formula ϕ, the non forking extensions of ϕ-types can be characterised as those having maximal local Cantor-Bendixson ranks. We shall show here that in an ℵ 0 -stable theory the same holds for global Cantor-Bendixson ranks, i.e., for Morley ranks.

Proposition 2.12. Assume T is ℵ 0 -stable, A ⊆ B, q ∈ S n (B), p = q↾ A ∈ S n (A). Then the following are equivalent:

(i) The type q is a non forking extension of p.

(ii) For all ε > 0: RM ε (p) = RM ε (q). (iii) For all ε > ε ′ > 0: RM ε (p) ≤ RM ε ′ (q). (iv) For arbitrarily small ε > 0: RM ε (p) = RM ε (q).
Proof. There is no harm in assuming that B = M. Let ε > 0. For an ordinal α recall that S n (M)

(α) ε
denotes the αth ε-Cantor-Bendixson derivative of S n (M) (i.e., (ε, f )-Cantor-Bendixson derivative in the terminology of [START_REF]Topometric spaces and perturbations of metric structures[END_REF]. Let α ε = RM ε (p), i.e., the maximal α such that S n (M) . This cover admits a finite sub-cover so X ε is ε-finite itself.

(α) ε ∩ [p] = ∅. So let X ε = S n (M) (αε) ε ∩ [p],
(i) =⇒ (ii). Observe that each X ε is invariant under the action of automorphisms of M which fix A, and thus contains a non forking extension of p. As all non forking extensions of p are conjugate over A they all belong to X ε , i.e., they all satisfy RM ε (q

) = α ε = RM ε (p). (ii) =⇒ (iii). As ε > ε ′ =⇒ RM ε (p) ≤ RM ε ′ (p) = RM ε ′ (q).
(iii) =⇒ (iv). By Lemma 2.7 there are arbitrarily small pairs ε > ε ′ > 0 such that RM ε (q) = RM ε ′ (q), whereby RM ε (p) ≤ RM ε (q). The inverse inequality is immediate.

(iv) =⇒ (i). Let E = {ε > 0 : RM ε (p) = RM ε (q)}, so inf E = 0. Let X = ε∈E X ε ⊆ [p] ⊆ S n (M
). On the one hand X is compact and therefore metrically complete (see [START_REF]Topometric spaces and perturbations of metric structures[END_REF]). On the other hand it is ε-finite for every ε, i.e., totally bounded. Thus X is metrically compact. It follows that for every ϕ(x, ȳ), the image of X in S ϕ (M) is metrically compact (since ϕ is uniformly continuous), so each q ∈ X is definable over acl eq (A). Thus every q ∈ X is a non forking extension of p.

2.12

Notice in passing that we showed that in a continuous ℵ 0 -stable theory every type has "metrically compact multiplicity", in analogy with the finite multiplicity of types in a classical ℵ 0 -stable theory.

Lemma 2.13. Let f : X → Y be a definable isometry between type-definable sets, and let A be a set containing all the relevant parameters. Then RM ε (a/A) ≤ RM ε ′ (f (a)/A) ≤ RM ε ′′ (a/A) for all a ∈ X and all for all ε > ε ′ > ε ′′ > 0.

Proof. Proved using similar tools to those used to prove Lemma 2.10.

2.13

In the special case where f is an isometric bijection between entire sorts it induces an isometric homeomorphism of the corresponding topometric type spaces and the ranks are equal by a direct argument. It is not obvious that the ranks should be equal even in the spacial case where X is a definable set (and Y its image, and therefore definable as well). The ranks would be equal if we had a positive answer for the following: Question 2.14. Let X be a definable set in M, say over ∅. Then the induced structure on X is closed under quantification, so we may view X as a structure of its own right, and if M is ℵ 0 -stable then so is X.

In classical logic, types in the structure X have the same Morley ranks as the corresponding types in M. Is it true in continuous logic? Theorem 2.15. Assume G, S is a type-definable transitive group action with an invariant metric in an ℵ 0 -stable continuous theory T , p ∈ S S (A). Then p is generic if and only if RM ε ′ (p) ≥ RM ε (S) for all ε > ε ′ > 0. If S occupies an entire sort then this is further equivalent to RM ε (p) = RM ε (S) for all ε > 0.

Proof. Along the same lines as the proof of [START_REF] Ben | Stability and stable groups in continuous logic[END_REF]Theorem 6.17], using Proposition 2.12 and Lemma 2.13. We leave the details to the reader.

2.15

If the answer to Question 2.14 is positive then the assumption that S occupies an entire sort is superfluous (since in any case S is definable).

Definable metrics

3.1. Extensions of partial definable metrics. Metrics and pseudo-metrics are a special (and distinguished) kind of predicates. Definition 3.1.

(i) A definable (pseudo-)metric is a definable predicate defining a (pseudo-)metric. (ii) Let X be a type-definable set. A partial definable (pseudo-)metric on X is a definable partial predicate on X × X defining a (pseudo-)metric there. Again, when specifying the domain we drop the "partial". On the other hand, when wishing to make explicit that a definable metric is not partial, we say it is total.

All type-definable metrics on a set X are essentially the same. This has first been proved in [START_REF]Uncountable dense categoricity in cats[END_REF], but since the setting is somewhat different and the proof is short we repeat it. Lemma 3.2. Let d 1 and d 2 be two definable metrics on a type-definable set X. Then they are uniformly equivalent.

Proof. Indeed, Let ε > 0, and consider the partial type

{x, y ∈ X} ∪ {d 1 (x, y) ≥ ε} ∪ {d 2 (x, y) ≤ 2 -n : n < ω}.
Since d 2 is a metric this partial type is inconsistent, and by compactness there exists n < ω such that d 2 (x, y) ≤ 2 -n =⇒ d 1 (x, y) < ε for all x, y ∈ X. Since this works for all ε > 0, and when exchanging the roles of d 1 and d 2 , they are uniformly equivalent.

3.2

Lemma 3.3. Let M be a structure and d 1 a total definable metric on M. Let M ′ be the structure obtained from M by letting the standard metric on M ′ be d 1 and relegating the original metric on M to a new, non distinguished symbol d 2 :

d M ′ = d M 1 , d M ′ 2 = d M .
Then M and M ′ have the same definable sets and predicates.

Proof. Clearly, the two structures have the same definable predicates. The characterisation of definable sets via quantification in Fact 1.7 does not depend on the metric.

3.3

While we know that every partial definable metric, say on X, extends to a total definable predicate, it is not clear whether it can extend to a total definable metric. We give some partial results in this direction.

The best result is under the assumption that X is definable. We start with a few lemmas that allow us to reduce the case of a metric to the case of a pseudo-metric. In fact the reduction step holds more generally for zero sets.

Lemma 3.4. Let X be any set of points, d 1 and d 2 two pseudo-metrics on X. Then

d 1 ∨ d 2 is a pseudo-metric on X. Proof. Let d 3 = d 1 ∨ d 2 . Clearly d 3 (x, x) = 0 and d 3 (x, y) = d 3 (y, x).
For the triangle inequality, given x, y, z ∈ X we may assume that

d 3 (x, y) = d 1 (x, y) in which case d 3 (x, y) ≤ d 1 (x, z) + d 1 (y, z) ≤ d 3 (x, z) + d 3 (y, z).

3.4

Lemma 3.5. Let X be a zero set. Then there exists a definable pseudo-metric d 1 with the following properties:

(i) For all x, y ∈ X:

d 1 (x, y) = 0. (ii) If x = y and x / ∈ X then d 1 (x, y) > 0.
It follows that if d 2 is a definable pseudo-metric whose restriction to X is a metric then d 1 ∨ d 2 is a definable metric which agrees with d 2 on X.

Proof. Let X be the zero set of ϕ(x). Define:

d 1 (x, y) = sup z |ϕ(x) ∧ d(x, z) -ϕ(y) ∧ d(y, z)| .
Clearly, d 1 is a definable pseudo-metric and x, y ∈ X =⇒ d 1 (x, y) = 0. On the other hand, if x = y and x / ∈ X then

d 1 (x, y) ≥ ϕ(x) ∧ d(x, y) > 0.
Finally, assume that d 2 is a definable pseudo-metric which is a metric on X. By Lemma 3.4, d 1 ∨ d 2 is a (definable) pseudo-metric. The hypotheses now imply it is a metric and agrees with d 2 on X.

3.5

Proposition 3.6. Let X be a definable set, d 1 a definable (pseudo-)metric on X. Then d 1 extends to a definable (pseudo-)metric.

Proof. Choose ψ 1 (x, y) ⊒ d 1 (x, y), and define:

d 2 (x, y) = sup z∈X |ψ 1 (x, z) -ψ 1 (y, z)|
Then d 2 is a definable pseudo-metric extending d 1 . In case d 1 is a metric, d 2 is a definable pseudo-metric whose restriction to X is a metric, so by Lemma 3.5 there is a definable metric d 3 extending d 1 .

3.6

We now move to considering the extension problem for partial definable (pseudo-)metrics on typedefinable sets. We first observe this can be reduced to zero sets: Lemma 3.7. Assume X is a type-definable set and d 1 a definable (pseudo-)metric on X. Then there exists a zero set Y ⊇ X such that d 1 extends to a definable (pseudo-)metric d 2 on Y .

Proof. In fact we prove something slightly stronger, namely that if ψ 1 ⊒ d 1 is any definable predicate extending d 1 then there exists a zero set Y ⊇ X such that ψ 1 defines a (pseudo-)metric on Y .

For this, let ψ 2 (x, y, z) = ψ 1 (x, x) ∨ (ψ 1 (x, y) -. ψ 1 (x, z) -. ψ 1 (y, z)). Then ψ 2 is zero on X 3 , and by Lemma 1.5 there is a zero set Y ⊇ X such that ψ 2 is zero on Y 3 .

In case d 1 is a metric we have d 1 (x, y) = 0 =⇒ d(x, y) = 0 on X 2 . By Lemma 1.6 (and Lemma 1.5) there is a zero set Y ′ ⊇ X such that d 1 (x, y) = 0 =⇒ d(x, y) = 0 for x, y ∈ Y ′ . Then ψ 1 defines a metric on the zero set Y ∩ Y ′ ⊇ X.

3.7

Joining Lemma 3.7 with Lemma 3.5, we reduce the extension problems for partial metrics to the extension of pseudo-metrics on zero sets. Unfortunately, we do not know whether it is always true and suspect that in its full generality it may fail. The best approximation we have is: Lemma 3.8. Let X be a zero set, d 1 a definable pseudo-metric on X. Then there exists a decreasing sequence of definable pseudo-metrics d 2,n which converges uniformly to d 1 on X.

Proof. Let X be the zero set of ϕ, and let

ψ 1 (x, y) ⊒ d 1 (x, y). For n < ω let ϕ n (x) = 1 -. 2 n ϕ(x): thus ϕ(x) = 0 =⇒ ϕ n (x) = 1, and ϕ(x) ≥ 2 -n =⇒ ϕ n (x) = 0. Now let: d 2,n (x, y) = sup z ϕ n (z) ∧ ψ 1 (x, z) -ϕ n (z) ∧ ψ 1 (y, z) .
Clearly d 2,n is a definable pseudo-metric for every n and d 2,n ≥ d 2,n+1 . In addition, if x, y ∈ X then choosing z = x we see that d 2,n (x, y) ≥ d 1 (x, y).

Assume towards a contradiction that the pseudo-metrics d 2,n do not converge uniformly to d 1 on X. Then there is some ε > 0 such that for all n < ω there are a n , b n ∈ X and c n such that

|ϕ n (c n ) ∧ ψ 1 (a n , c n ) -ϕ n (c n ) ∧ ψ 1 (b n , c n )| ≥ d 1 (a n , b n ) + ε. This implies in particular that ϕ(c n ) ≤ 2 -n and |ψ 1 (a n , c n ) -ψ 1 (b n , c n )| ≥ d 1 (a n , b n ) + ε. By compactness there are a, b, c ∈ X such that |ψ 1 (a, c) - ψ 1 (b, c)| ≥ d 1 (a, b) + ε,
which is impossible as ψ 1 agrees with d 1 on X and d 1 is a pseudo-metric.

3.8

Question 3.9. Let X be a zero set, d 1 a definable pseudo-metric on X. Can d 1 always be extended to a total definable pseudo-metric? Are there additional assumptions on the theory (e.g., stability or ℵ 0 -stability) under which this is true?

As it turns out, Lemma 3.8 is too weak to be useful for our purposes. Having failed to solve the full metric extension problem, we shall seek to solve weaker version thereof: given a type-definable set X equipped with a definable metric d 1 , we shall look for a total definable metric d 2 which does not necessarily extend d 1 , but which does preserve whatever invariance properties d 1 may have.

For this purpose we shall use a few technical results from [Ben05, Section 2.3]. There we proved that in a Hausdorff cat in which there are not too many ways for two elements to be distinct (technically: the distance cofinality is at most countable), there is a definable metric. For this purpose one first constructs a symmetric definable predicate ϕ(x, y) (a definable function in the terminology of [START_REF]Uncountable dense categoricity in cats[END_REF], and denoted there by h(x, y)) satisfying ϕ(x, y) = 0 ⇐⇒ x = y. Then one needs to replace ϕ with one which also satisfies the triangle inequality.

In the context of an open Hausdorff cat (which is essentially the same thing as a theory in continuous first order logic), one can just define d(x, y) = sup z |ϕ(x, z)ϕ(y, z)|, which is definable metric. In the general case the metric sup z |ϕ(x, z)-ϕ(y, z)| need not be definable, and a more complicated construction is required to extract a definable metric from ϕ directly without recourse to quantification. The same tools apply here.

Fact 3.10. Let g : [0, 1] 2 → [0, 1] be symmetric, non decreasing, and satisfy for all u, w, t ∈ [0, 1]: g(0, t) = t and if g(u, w) < t then there is u < v ≤ 1 such that g(v, w) < t.

Then there is a function f : D → [0, 1], where D = {k2 -n : n < ω, 0 ≤ k ≤ 2 n } denotes the set of all dyadic fractions in [0, 1], such that:

(i) f is strictly increasing.

(ii) f ≤ id D .

(iii) For every t, u ∈ D ∩ (0, 1]:

t + u ≤ 1 =⇒ g(f (t), f (u)) < f (t + u).
Proof. This is [Ben05, Lemma 2.19], with the sole difference being that we require f (t) ≤ t for all t ∈ D rather than only for t = 1 2 n . The only modification in the proof is in the construction of f ( k 2 n ) for odd 3 ≤ k < 2 n . There we have f ( k-1 2 n ) ≤ k-1 2 n < k 2 n by the induction hypothesis, and f ( k-1 2 n ) < min{s ′ , f ( k+1 2 n )} as in the original proof, so we can choose f ( k

2 n ) such that f ( k-1 2 n ) < f ( k 2 n ) < min{s ′ , f ( k+1 2 n ), k 2 n }.

3.10

The following result was implicit in [Ben05, Section 2.3] (modulo the slight improvement above to the requirement on f ): Proposition 3.11. Let ϕ(x, y) be a symmetric and reflexive definable predicate, by which we mean that ϕ(x, y) = ϕ(y, x) and ϕ(x, x) = 0. Then there is a continuous increasing function h :

[0, 1] → [0, 1], satisfying h(0) = 0 and h(x) ≥ x, such that h • ϕ(x, y) is a definable pseudo-metric. If in addition x = y =⇒ ϕ(x, y) > 0 then h • ϕ(x, y) is a definable metric. Proof. Define g : [0, 1] 2 → [0, 1] by: g(t, u) = sup{ϕ(x, y) : ∃z ϕ(x, z) ≤ t ∧ ϕ(y, z) ≤ u}.
As in the Claim following the proof of [Ben05, Lemma 2.19], g satisfies the assumptions of Fact 3.10. Thus there is a function f : D → [0, 1] such that:

(i) f is strictly increasing.

(ii) f ≤ id D .

(iii) For every t, u ∈ D ∩ (0, 1]:

t + u ≤ 1 =⇒ g(f (t), f (u)) < f (t + u)
We define h : [0, 1] → [0, 1] to be a weak inverse of f : h(t) = sup{u ∈ D : f (u) < t}. As f is strictly increasing it follows that h(t) = inf{u ∈ D : f (u) > t}, and that h is continuous and weakly increasing.

In addition, f ≤ id D =⇒ h ≥ id [0,1] . Let ψ(x, y) = h • ϕ(x, y), which is a definable predicate by continuity of h. Clearly ψ is reflexive and symmetric as well, and it is left to show that it satisfies the triangle inequality. Indeed, assume not, that is ψ(x, y) > ψ(x, z) + ψ(y, z) + ε for some x, y, z. As ψ(x, z) + ε/2 > ψ(x, z) = h • ϕ(x, z), there is u ∈ D, u < ψ(x, z) + ε/2, such that f (u) > ϕ(x, z). Similarly there is w < ψ(y, z) + ε/2 in D such that f (w) > ϕ(y, z). As u + w < ψ(x, y) ≤ 1 we have:

ϕ(x, y) ≤ g(ϕ(x, z), ϕ(y, z)) ≤ g(f (u), f (w)) < f (u + w) < f (ψ(x, y)).
In other words we have ϕ(x, y) < (f • h)(ϕ(x, y)), contradicting the definition of h.

We have shown that h • ϕ(x, y) is a pseudo-metric. If ϕ satisfies ϕ(x, y) = 0 =⇒ x = y, so does h • ϕ (as h ≥ id), which is therefore a metric.

3.11

Putting it all together we get: Theorem 3.12. Let X be a type-definable set, d 1 a partial definable (pseudo-)metric on X. Then there exist a total definable (pseudo-)metric d 2 and a continuous increasing function h

: [0, 1] → [0, 1] such that h(0) = 0, h ≥ id and d 2 ⊒ h • d 1 .
Proof. First, by Lemma 3.7 we may assume X is a zero set, defined by ϕ(x) = 0. Let ψ 1 ⊒ d 1 , and define:

ψ 2 (x, y) = (ψ 1 (x, y) ∧ ψ 1 (y, x)) -. ψ 1 (x, x) -. ψ 1 (y, y), ψ 3 (x, y) = d(x, y) ∧ (ϕ(x) ∨ ϕ(y)), ψ 4 (x, y) = ψ 2 ∨ ψ 3 .
Then ψ 2 ⊒ d 1 as well and ψ 3 ↾ X 2 is zero, whereby ψ 4 ⊒ d 1 . In addition ψ 2 , ψ 3 and ψ 4 are all symmetric and reflexive, and we may apply Proposition 3.11 to find h as such that d 2 = h • ψ 4 is a total pseudometric.

Assume now that d 1 is a metric. Then for x = y, if x, y ∈ X then ψ 2 (x, y) = d 1 (x, y) = 0, and otherwise ψ 3 (x, y) = 0, so either way ψ 4 (x, y) = 0. Thus d 2 is a total metric.

3.12 3.2. Existence of invariant metrics. In general type-definable groups need not be invariant. For definable groups this is easily resolved: Proposition 3.13. Let G, • be a definable group. Then G admits a total definable invariant metric (i.e., a total definable metric on the sort of G which is invariant on G).

Proof. For simplicity assume G is definable in the home sort. Since G is a definable set, the predicate d(x, G) is definable, and we may quantify over members of G. Let:

ψ 0 (u, v, x, y) ⊒ d(uxv, uyv) ψ 1 (x, y) = sup u,v∈G ψ 0 (u, v, x, y) d 1 (x, y) = ψ 1 (x, y)↾ x,y∈G
This means that for x, y ∈ G we have: d 1 (x, y) = sup u,v∈G d(uxv, uyv). This is easily verified to define an invariant metric on G, which can be extended to a total definable metric by Proposition 3.6.

3.13

In the case of a type-definable group we only have partial results. First, as before we can reduce any problem to the case of zero sets: Lemma 3.14. Let G be a type-definable group. Then there exists a type-definable supergroup G ′ ≥ G whose domain is a zero set. Moreover, if d 1 is an invariant definable metric on G, and

ψ 1 ⊒ d 1 , we can choose G ′ so that d 2 = ψ 1 ↾ G ′ is an invariant metric on G ′ .
Proof. Using Proposition 1.22 we find a zero set X 0 ⊇ G to which the law of G and the inverse mappings extend to definable mappings • ′ : X 2 0 → X 0 and -1′ : X 0 → X 0 . The satisfaction of the identity (x

• ′ y)• ′ z = x • ′ (y • ′ z) (i.e., d((x • ′ y) • ′ z, x • ′ (y • ′ z)) = 0) in X 0
translates a condition of the form ϕ ass (x, y, z) = 0. By Lemma 1.5 there is a zero set X 1 such that X 0 ⊇ X 1 ⊇ G and such that ϕ ass is zero on X 3 1 . We take care of x • ′ e = x and x • ′ x -1′ = e similarly. We end up with a zero set X 0 ⊇ X 2 ⊇ G on which all the identities above hold. Now X 2 needs not be closed under product and inverse, but that is taken care of by a second application of Proposition 1.22.

3.14

Remark 3.15. This argument would work for any kind of functional structure defined by a set of identities (e.g., rings). Adding Lemma 1.6 we can further extend the argument to structures whose definition involves an implication, such as integral domains. We have already seen an example of that in Lemma 3.7.

Alternatively, given a partial invariant definable metric on G we can extend it to a total definable metric up to some uniform modification which preserves the invariance. Proposition 3.16. Let G be a type-definable group admitting a partial invariant definable metric. Then it also admits a total one. Proof. Just apply Theorem 3.12 to the partial invariant metric.

3.16

In a stable theory we obtain a partial invariant metric via generic translations. We first recall a few facts regarding generic elements and types in stable groups: Definition 3.17. Let G be a type-definable group in a stable theory, say over a parameter set A.

(i) We say that G is connected if it has no proper type-definable subgroups of bounded index (over any parameters).

(ii) Let B ⊇ A. An element g ∈ G is called generic over B if for every h ∈ G: g | ⌣ B h =⇒ gh | ⌣ A B, h.
(This notion is sometimes called dividing-generic and is also useful sense in simple theories. In stable theories it coincides with other notions of genericity.) Proof. See [Ben, Theorem 6.14].

(iii) Let S G (B) = [x ∈ G] ⊆ S x (B),

3.19

Theorem 3.20. Assume G is a connected type-definable group in a stable theory. Then there exists a total metric which is invariant on G.

Proof. Let p(x) be the unique generic type of G. stationary as well. Again let ψ 0 (u, v; x, y) ⊒ d(uxv, uyv).

As (p ⊗ p)(u, v) (the free product of p with itself) is a definable stationary type over the same parameters as G, let ψ 1 (x, y) be its ψ 0 -definition. Thus, if x, y ∈ G and u, v are any independent generic elements over x, y, then ψ 1 (x, y) = d(uxv, uyv). Let d 1 (x, y) = ψ 1 (x, y)↾ G 2 , and we claim it is an invariant metric on G. To verify it is a metric, let x, y, z ∈ G be any three elements. Then choosing u, v to be independent generics over x, y, z we can verify the metric axioms for this triplet. We also get that uz, v are two independent generics over x, y, whereby d 1 (zx, zy) = d(uzxv, uzyv) = d 1 (x, y). Right-invariance is verified similarly.

Apply Proposition 3.16 to conclude.

3.20

Notice that if we knew how to show, as in classical first order logic, that in a stable continuous theory every type-definable group is contained in a definable one, we would obtain an alternative proof for Theorem 3.20 using Proposition 3.13, without the connectedness assumption.

The main theorem (full version)

Theorem 4.1. A type-definable group in an ℵ 0 -stable theory is definable.

Proof. By Proposition 2.2 it will suffice to show that the connected component of G is definable, so we may assume that G is connected. Then by Theorem 3.20 there exists a total definable metric d 1 which is invariant on G. By Lemma 3.3 we assume d 1 is the ambient metric. Now apply Theorem 2.11.

4.1

Notice that in the proof we needed to pass to the connected component since we do not know yet (although it seems plausible) whether a general type-definable group in a stable theory admits an invariant metric. Moreover, the passage from an partial invariant definable metric on the connected component to a total one required allowing a modification to that metric. A posteriori we have: Corollary 4.2. Let G be a type-definable group in an ℵ 0 -stable theory. Then:

(i) G admits an invariant metric.

(ii) Every partial metric on G extends to a total one.

Proof. By the main theorem, G is definable, so just apply Proposition 3.13 and Proposition 3.6.

4.2

5. An application: descending chain conditions Definition 5.1. Let {X α } α<λ be a descending sequence of closed sets in a metric space. We say that the sequence approximately stabilises if for every ε > 0 there exists α ε < λ such that X αε ⊆ B(X β , ε) for all β < λ.

Notice an approximately stabilising sequence of closed sets whose length has uncountable cofinality necessarily stabilises.

Lemma 5.2. Assume {X α } α<λ is a descending sequence of closed subsets of a complete metric space (e.g., type-definable subsets of a continuous structure), and let X = α X α . Then {X α } α<λ approximately stabilises if and only if for all ε > 0 there is α ε such that X αε ⊆ B(X, ε).

Proof. Right to left is immediate, so we prove left to right. In addition, if λ has uncountable cofinality then the sequence stabilises precisely, i.e., X = X α for some (all) big enough α. We are left with the case of a sequence {X n } n<ω .

By assumption, for each m there is n m such that X nm ⊆ B(X n , 2 -m ) for all n, and we may assume that m ≤ n m for all m. Let m 0 be such that 2 -m0 < ε. We claim that X nm 0 +1 ⊆ B(X, ε). Indeed, let x 0 ∈ X nm 0 +1 . Given x k ∈ X n m 0 +k+1 , let x k+1 ∈ X n m 0 +k+2 be such that d(x k , x k+1 ) < 2 -m0-k-1 . Then the sequence {x k } converges to some point x, satisfying d(x, x k ) < 2 -m0-k . Notice that for all n we have x k ∈ X n for k large enough. Thus x ∈ X n for all n, whereby x ∈ X. We conclude that d(x 0 , X) < 2 -m0 < ε, whence X nm 0 +1 ⊆ B(X, ε), as desired.

5.2

Lemma 5.3. Let {X α } α<λ be a descending sequence of definable sets. If the chain approximately stabilises (in any model) then X = X α is a definable set. The converse holds in sufficiently saturated models.

Proof. Assume first the sequence approximately stabilises. By Lemma 5.2 we have X αε ⊆ B(X, ε) for all ε > 0, whereby X ⊆ X α ε/2 ⊆ B(X α ε/2 , ε/2) ⊆ B(X, ε) for all ε > 0. Now apply the criterion for definability in Fact 1.7.(iii) twice. First, since X ε/2 is definable there is a formula ψ ε such that

X ⊆ X α ε/2 ⊆ ā ∈ M n : ψ ε (ā) = 0 ⊆ ā ∈ M n : ψ ε (ā) < 1 ⊆ B(X α ε/2 , ε/2) ⊆ B(X, ε).
A second application shows that X is definable.

Conversely, assume X is definable, and that the equality X = X α holds in a sufficiently saturated model. Then by compactness, for all ε > 0 there is α ε such that {x ∈ X αε } ∪ {d(x, X) ≥ ε} is contradictory, whereby X αε ⊆ B(X, ε).

5.3

Definition 5.4. We say that a class C of sets satisfies the metric descending chain condition (MDCC) if every descending chain in C approximately stabilises.

Theorem 5.5. Let G be a type-definable group in an ℵ 0 -stable structure, G the class of type-definable subgroups of G. Then G satisfies the MDCC.

Proof. Let {G α } α<λ ⊆ G be a descending chain of type-definable groups, and let G ∞ = G α . Then G ∞ is definable by the main theorem. If necessary pass to a sufficiently saturated elementary extension of the ambient model and apply the converse part of Lemma 5.3.

5.5

We conclude with a relatively easy chain condition for arbitrary stable theories (and which has nothing to do with our main theorem).

Theorem 5.6. Let X be a family of uniformly definable sets in a stable theory, meaning that there is a definable predicate ϕ(x, y) such that for every X ∈ X the predicate d(x, X) is an instance ϕ(x, a X ). Then X satisfies the MDCC.

Moreover, if X is the intersection of any descending chain in X then d(x, X) is also definable by an instance of ϕ.

Proof. By Lemma 5.3 it is enough to prove the moreover part. Assume that {X α } α<λ ⊆ X is a descending chain, and let d(x, X α ) = ϕ(x, a α ). The sequence of definable predicates ϕ(x, a α ) is increasing, and by definition of stability (no order property) it must converge uniformly. It follows by an easy compactness argument that there exists a parameter a such that ϕ(x, a) = lim α ϕ(x, a α ) uniformly, and its zero set is necessarily X = α X α . Moreover, by Proposition 1.8, we may further arrange that Σ ψ (a), i.e., that ϕ(x, a) = d(x, X).

5.6

1. 1 .

 1 Definability classes of sets. Definition 1.1.

  ) and b ∈ M m define sup x∈X ϕ(x, b) = sup {ϕ M (ā, b) : ā ∈ X}.

  sup x,ȳ ψ(x, z) -. ψ(ȳ, z) -. d(x, ȳ) z) ∨ d(x, ȳ) -. ψ(x, z) = 0. (D2)It turns out that even though D2 is merely an approximate version of what we wished to express, it is still enough. (Compare with similar conditions given in [BBHU08, Theorem 9.12].)

  the set of extensions of p of maximal RM ε rank. It is compact, and since α ε is maximal it admits a cover by relatively open ε-finite subsets of S n (M) (αε) ε

  namely the set of complete types over B of members of G. A type p ∈ S G (B) is generic if its realisations are. An element g ∈ G is generic over B if and only if it is generic over A and g | ⌣A B. (iv) If g, h ∈ G, g is generic over B and g | ⌣B h then gh and hg are both generic over B. The connected component G 0 is a connected normal subgroup of G, and is type-definable over A as well. (ii) If G is connected the it admits a unique generic type over A, which is in addition stationary. It follows that G admits a unique generic type over every set B ⊇ A, namely p↾ B , the unique non forking extension of p to B.

	(i)
	g | ⌣B h then hg | ⌣A h, B as well. (iii) Proof. See [Ben, Theorem 6.10]. (In fact, this holds in the more general setting of a type-definable group
	in a thick simple cat, see [Ben03, Section 1.3].)	3.18
	Fact 3.19. Let G be a type-definable group with parameters in some set A in a stable theory. Then G
	admits a smallest type-definable subgroup of bounded index G 0 , called the connected component of G. It
	has the following properties:

Fact 3.18. Let G be a type-definable group over a set A in a stable theory, and let B ⊇ A.

(i) Generic elements over B exist.

(ii) An element g is generic over B if and only if g -1 is. It follows that if g is generic over B and

Author supported by Marie Curie research network ModNet, by ANR chaire d'excellence junior THEMODMET (ANR-06-CEXC-007) and by the Institut Universitaire de France.