text:
# Polish Algebras, shy from freedom

## Annotated Content

§0 Introduction

§1 Metric groups and metric models

§2 Semi-metric groups: on automorphism groups of uncountable structures

§3 Compactness of metric algebras

§4 Conclusion

§5 Quite free but not free abelian groups

§6 Beginning of stability theory

## §0 Introduction

Our first motivation was the question: can a countable structure have an automorphism group, which a free uncountable group? This is answered negatively in \[\Sh:744 \].

This was a well known problem in group theory at least in England (David Evans in a meeting in Durham 1987) and we thank Simon Thomas for telling us about it. Independently in descriptive set theory, Howard and Kechris \[\BeKe96 \] ask if there is an uncountable free Polish group, i.e. which is on a complete separable metric space. A related result (before \[\Sh:744 \]) was gotten by Solecki  who proved that the group of automorphisms of a countable structure cannot be an uncountable free abelian group. Having the problem arise independently supported the feeling that it is a natural problem.

The idea of the proof in \[\Sh:744 \] was to prove that such a group has some strong algebraic completeness or compactness, more specifically for any sequence $`d_n:n<\omega `$ of elements of the group converging to the identity many countable sets of equations are solvable. This is parallel in some sense to Hensel lemma for the $`p`$-adics, and seem to me interesting in its own right.

Lecturing in a conference in Rutgers, February 2001, I was asked whether I am really speaking on Polish groups. We can prove this using a more restrictive condition on the set of equations. Parallel theorems, e.g. holds for semi groups and for metric algebras, e.g. with non isolated unit ($`e`$ is a unit means $`\{e\}`$ is a subalgebra). Here we do the general case.

More specifically we prove (see Conclusion ?, ?(1)).

###### \stag{0.1} Theorem

1) There is no Polish group which as a group is free and uncountable.

2) Slightly more generally, assume

Then $`G`$ is not free.

0.1 Thesis: If $`G`$ is a Polish algebra satisfying one of the compactness conditions defined below, then it is in fact large in the sense of lots of sets of equations has a solution.

A reader interested just in this theorem can read just §3.

0.2 Question: What are the restrictions on Aut$`(𝔸)`$ for uncountable structures $`𝔸`$?

We also prove that if $`𝔸`$ is a structure of cardinality $`\mu `$, $`\mu `$ is strong limit of cofinality $`\mathrm{}_0`$ (e.g. $`\mathrm{}_\omega `$) and the automorphism group of $`𝔸`$ is of cardinality $`>\mu `$, then it is far from being free; this does not follow directly from 0.1(2) as the natural metric considered here does not satisfy all the conditions.

In \[\Sh:744 \] this is proved in the special case where $`𝔸={\displaystyle \underset{n}{}}P_n^𝔸`$ satisfying $`|P_n^𝔸|<\mu `$.

$``$

Note: An arbitrary subgroup e.g. of the symmetric group of size $`\mathrm{}_1`$ can consistently be made into an automorphism group by Just, Shelah, Thomas \[\JShT:654 \]. So $`\mathrm{}_\omega `$ is more interesting from this point of view.

Ideas regarding Aut$`(𝔸),𝔸=\mathrm{}_\omega `$: Let the set of elements of $`𝔸`$ be $`\mathrm{}_\omega `$. For $`f,g\text{ Aut}(𝔸)`$ let

$$d(f,g)=sup\{2^n:f\mathrm{}_ng\mathrm{}_n\text{ or }f^1\mathrm{}_ng^1\mathrm{}_n\}.$$

Again a complete metric space and a Polish group. But we need to prove that there is a non-trivial convergent sequence.

This space is not necessarily of density $`\mathrm{}_\omega `$. A way out is to define

$`d_1(f,g)=sup\{2^n:`$ $`(\alpha <\mathrm{}_n){\displaystyle \underset{m}{}}(f(\alpha )<\mathrm{}_ng(\alpha )<\mathrm{}_m`$
$`\text{or }f(\alpha )g(\alpha )\text{ both }<\mathrm{}_n`$
$`\text{or similarly with }g^1,g^1\}.`$
The purpose of introducing $`d_1`$ is to decrease the density. Now “$`d_1(f,g)<2^n`$” is an e.g. relation with $`2^\mathrm{}_n`$ classes (rather than $`(\mathrm{}_\omega )^\mathrm{}_n`$ classes). This is a complete metric space with density $`\mathrm{}_\omega `$. However, there are problems with “$`(d(f_1,g_1),d(f_2,g_2)<2^nd(f_1f_2,g_1g_2)<2^{n+1}`$”.

So we start the proof with $`d_1`$, find a non trivial converging sequence $`f_n:n<\omega `$ in $`d_1`$, prove it converges pointwise, replace $`(\mathrm{}_n:u<\omega )`$ by $`A_n:n<\omega `$ and get a sequence converging in $`d`$.

0.3 Question: Is there a model theory of Polish spaces?

Naturally we would like to develop a parallel to classification theory (see \[\Sh:c \]). A natural test problem is to generalize “Morley theorem = Los conjecture”. But we only have one model so what is the meaning?

Well, we may change the universe. If we deal with abelian groups (or any variety) it is probably more natural to ask when is such (Borel) algebra free.

0.4 Example: If $``$ is adding $`(2^\mathrm{}_0)^+`$-Cohen subsets of $`\omega `$ then

$$()^𝕍\text{ and }()^{𝕍[G]}$$

are both algebraically closed fields of characteristic $`0`$ which are not isomorphic (as they have different cardinalities).

So we restrict ourselves to forcing $`_1_2`$ such that

$$(2^\mathrm{}_0)^{𝕍[_1]}=(2^\mathrm{}_0)^{𝕍[_1]}$$

and compare the Polish models in $`𝕍^_1,𝕍^_2`$. We may restrict our forcing notions to c.c.c. or whatever…

0.5 Example: Under any such interpretation

(Why? Trivially: $`^{𝕍[_2]}`$ is complete in $`𝕍[_2]`$ while $`^{𝕍[_1]}`$ in $`𝕍^{[_2]}`$ is not complete but there are less trivial reasons).

0.6 Conjecture: We have a dychotomy, i.e. either the model is similar to categorical theories, or there are “many complicated models”.

0.7 Thesis: Classification theory for such models resemble more the case of $`𝕃_{\omega _1,\omega }`$ than the first order.

See \[\Sh:h \]; as support for this thesis we prove:

###### \stag{0.9} Theorem

There is an $`F_\sigma `$ abelian group (i.e. a $`F_\sigma `$-definition, in fact an explicit definition) such that $`𝕍\mathrm{`}\mathrm{`}G`$ is a free abelian group” iff $`𝕍2^\mathrm{}_0<\mathrm{}_{736}`$.

Comments: In the context of the previous theorem we cannot do better than $`F_\sigma `$, but we may hope for some other example which is not a group or categoricity is not because of freeness.

0.8 Conclusion: Freeness (of an $`F_\sigma `$-abelian group) can stop at $`\mathrm{}_n`$ (any $`n`$).

A connection with the model theories is that by Hart-Shelah \[\HaSh:323 \] such things can also occur in $`L_{\omega _1,\omega }`$ whereas (by \[\Sh:87a \], \[\Sh:87b \] Theorem) if $`{\displaystyle \underset{n}{}}(2^\mathrm{}_n<2^{\mathrm{}_{n+1}})`$ and $`\psi 𝕃_{\omega _1,\omega }`$, categorical in every $`\mathrm{}_n`$, then $`\psi `$ is categorical in every $`\lambda `$. See more in \[\ShVi:648 \].

The parallels here are still open.

This casts some light on the thesis that non-first order logics are “more distant” from the “so-called” mainstream mathematics.

Returning to stability theory per-se we have the modest:

###### \stag{0.11} Theorem

For “$`\mathrm{}_0`$-stable Borel models” the theorem on the existence of indiscernibles can be generalized.

We may consider another version of the interpretation of “categoricity”. Of course, we can use more liberal than $`𝕃(A_2,r)`$ or restrict the $`A_{\mathrm{}}`$’s further (as in the forcing version).

###### Definition 0.9 Definition

1) We say that $`𝔸`$ is categorical in $`\lambda 2^\mathrm{}_0`$ if: for some real $`r`$: for every $`A_1,A_2\lambda `$ the models $`𝔸^{𝕃[A_1,r]},𝔸^{𝕃[A_2,r]}`$ are isomorphic (in $`𝕍`$).

2) For a class $`𝔎`$ of forcing notions and cardinal $`\lambda `$ such that for at least one $`𝔎,_{}\mathrm{`}\mathrm{`}2^\mathrm{}_0\lambda \mathrm{"}`$, we have in $`𝕍^{}`$: the structure $`𝔸`$ is categorical in $`\lambda `$ in the sense of part (1).

Comparing Definition ?(1) with the forcing version we lose when $`𝕍=𝕃`$, as it says nothing, we gain as (when $`2^\mathrm{}_0>\mathrm{}_1`$) we do not have to go outside the universe. Maybe best is categorical in $`\lambda `$ in $`𝕍^{}`$ for every c.c.c. forcing notion $``$ making $`2^\mathrm{}_0\lambda `$.

Note also that it may be advisale to restrict ourselves to the case $`\lambda `$ is regular as we certainly like to avoid the possibility $`(2^\mathrm{}_0)^{𝕃[A_1,r]}=\lambda <(2^\mathrm{}_0)^{𝕃[A_2,r]}`$ (see on this \[\Sh:g , VII\]).

Of course, any reasonable definition of unstability implies non-categoricity: if we have many types we should have a perfect set of them, hence adding Cohen subsets of $`\omega `$ adds more types realized. If we add $`\eta _i:i<2^\mathrm{}_0`$ Cohen reals for every $`A2^\mathrm{}_0,M^{[\eta _i:iA]}:A2^\mathrm{}_0`$ are non-isomorphic over the countable set of parameters, if we get $`2^{2^\mathrm{}_0}`$ non-isomorphic models, we can forget the parameters and retain our “richness in models”.

Lately Blass asks on definable abelian subgroups of $`^\omega `$, answers are derived for this from \[\Sh:402 \] and §5. We may be more humble than in 0.3.

0.10 Question: Is there model theory for equational theories, stressing free algebras?

The material in §1 - §5 (except some generalizations) was presented in a course in Rutgers, Sept. - Oct 2001 and I thank the audience for their comments. We shall continue elsewhere.

0.11 Notation. 1) Let $`\omega `$ denote the set of natural numbers, and let $`x<\omega `$ mean “$`x`$ is a natural number”.

2) Let $`a,b,c,d`$ denote members of $`G`$ (a group).

3) Let $`\overline{d}`$ denote a finite sequence $`d_n:n<n^{}`$, and similarly in other cases.

4) Let $`k,\mathrm{},m,n,i,j,r,s,t`$ denote natural numbers.

5) Let $`\epsilon ,\zeta ,\xi `$ denote reals $`>0`$.

###### Definition 0.12 Definition

1) A group word is a sequence $`x_1^{r_1}x_2^{r_2},\mathrm{},x_k^{r_k}`$ where the $`x_{\mathrm{}}`$ are variables or elements of a group and $`n_{\mathrm{}}`$ for $`\mathrm{}=1,\mathrm{},k`$.

2) The word is reduced if $`n_{\mathrm{}}0,x_{\mathrm{}}x_{\mathrm{}+1}`$.

3) The length of a word $`w=x_1^{n_1}x_2^{n_2}\mathrm{}x_k^{n_k}`$ is $`{\displaystyle \underset{\mathrm{}=1}{\overset{k}{}}}|n_{\mathrm{}}|`$.

4) A group term $`w(x_1,\mathrm{},x_n)`$ is a word of the form $`x_\mathrm{}_1^{r_1}x_\mathrm{}_2^{r_2}\mathrm{}x_{i_k}^{r_k}`$ with $`i_{\mathrm{}}\{1,\mathrm{},k\},r_{\mathrm{}}`$ (actually $`r_{\mathrm{}}\{1,\mathrm{},1\}`$ suffice). For a group $`G`$ and $`a_1,\mathrm{},a_kG`$, the meaning of $`b=w(a_1,\mathrm{},a_k)G`$ should be clear.

## §1 metric groups and metric models

We first define \[semi\]-metric \[complete\] group, and give a natural major example: automorphism groups. The natural example of semi-metric group is the semi-group of endomorphism of a countable structure.

###### Definition 1.1 Definition

$`(G,𝔡)`$ is called a metric group if:

2) $`(G,𝔡)`$ is a metric semi-group when

3) Saying $`(G,𝔡)`$ is complete, means complete as a metric space.

1.2 Notation: 1) For a metric group $`𝕄`$ the metric is denoted by $`𝔡_𝕄`$ and the unit is denoted by $`e_𝕄`$ and the group by $`G_𝕄`$. When no confusion arises “$`G`$ is a metric group” means $`(G,𝔡_G)`$ is a metric group.

2) Similarly for semi-groups.

Now we define cases closer to automorphism groups, in those cases the proof is very similar to the one in \[\Sh:744 \].

###### Definition 1.3 Definition

1) $`G`$ is a specially metric group

if:

then $`𝔡_G(x_1,x_2)<\xi 𝔡(y_1,y_2)<\xi `$ implies $`𝔡_G(x_1y_1,x_2y_2)<\zeta 𝔡(x_1^1,x_2^1)<\zeta `$; this is a kind of uniform continuity (inside the $`\epsilon `$-neighborhood of $`e_G`$; this is harder if we increase $`\epsilon `$ and/or decrease $`\zeta `$

” $`(\gamma )`$” for arbitrarily small $`\zeta ^+`$ the set $`\{aG:𝔡(a,e_G)<\zeta \}`$ is a subgroup of $`G`$. 2) We say $`\overline{\zeta }=\zeta _n:n<\omega `$ is strongly O.K. for $`G`$ if:

then $`𝔡_G(x_1^{r(1)}y_1^{r(2)},x_2^{r(1)}y_2^{r(2)})<\zeta _n`$. 3) We say $`G`$ is specially+ metric group if in part (1) we have $`(\alpha ),(\beta )`$ and

4) We define similarly for semi groups omitting the operation $`x^1`$ (this means omitting “$`𝔡(x_1^1,x_2^1)<\zeta `$” in clause $`(\beta )`$ of (1), and demanding $`r(1),r(2)=1`$ in clause (d) of part (2).

1.4 Observation. 1) If $`G`$ is a special metric group then there is a sequence $`\overline{\zeta }`$ which is strongly O.K. for $`G`$.

2) We can in clause (d) of 1.3(2) above omit $`r(1),r(2)`$ and conclude only “$`𝔡(x_1y_1,x_2y_2)<\zeta _n`$ and $`𝔡(x_1^1,x_2^1)<\zeta _n`$. This causes just slight changes in the computations of length in the proof or replacing $`\overline{\zeta }`$ by a suitable subsequence.

3) Every specially+ metric group is a specially metric group.

4) Parts (1), (3) holds for semi groups, too.

Proof. Easy.

###### Definition 1.5 Definition

1) Assume $`𝔸`$ is a countable structure with automorphism group $`G=\text{ Aut}(𝔸)`$ and for notational simplicity its set of elements is $`\omega `$, the set of natural numbers (and, of course, it is infinite, otherwise trivial).

We define a metric $`𝔡=𝔡_𝔸=𝔡_𝔸^{\text{aut}}`$ on $`G`$ by

$$𝔡(f,g)=\text{ sup}\{2^n:f(n)g(n)\text{ or }f^1(n)g^1(n)\}.$$

Let Aut$`{}_{𝔸}{}^{}=(\text{Aut}(𝔸),𝔡_𝔸^{\text{aut}})`$, but we may write $`G_𝔸`$ or $`G_𝔸^{\text{aut}}`$.

2) Assume $`𝔸`$ is a countable (infinite) structure, let End$`(𝔸)`$ be the semi-group of endomorphisms of $`𝔸`$; assume for simplicity that its set of elements is $`\omega `$ and let $`𝔡_𝔸^{\text{end}}`$ be the following metric on End$`(𝔸)`$

$$𝔡(f,g)=\text{ sup}\{2^n:f(n)g(n)\}.$$

Let EndA be (End$`(𝔸),𝔡_𝔸^{\text{end}})`$, we may write $`G_𝔸^{\text{end}}`$.

3) If in part (2) we restrict ourselves to monomorphisms, we write Mon$`(𝔸)`$, Mon$`{}_{𝔸}{}^{},𝔡_𝔸^{\text{mon}}`$.

###### \stag{1.5} Claim

: For $`𝔸`$ as above:

1) $`(\text{Aut}_𝔸,𝔡_𝔸^{\text{aut}})`$ is a complete separable specially+ metric group.

2) (End$`(𝔸),𝔡_𝔸^{\text{end}})`$ and (Mono$`(𝔸),𝔡_𝔸^{\text{mono}})`$ are complete separable specially+ metric semi-groups.

Proof. Easy.

We may think of a more general context.

###### Definition 1.6 Definition

1) We say $`𝔞`$ is a metric $`\tau `$-model ($`\tau =\tau _𝔞`$ is a vocabulary, that is a set of function symbols and predicates; in the main case we say $`\tau `$-algebra when $`\tau `$ has no predicates only functions)

if

then $`F^{M(𝔞)}`$ is (an $`n`$-place) continuous function from $`M_𝔞`$ to $`M_𝔞`$ (for $`𝔡_𝔞`$, i.e. by the topology which the metric $`𝔡_G`$ induces, of course)

” $`(d)`$” if $`R\tau _𝔞`$ is an $`n`$-place predicate, then $`R^𝔞=R^{M(𝔞)}`$ is a closed subset of $`M_𝔞^n={}_{}{}^{n}(|M_𝔞|)`$. 2) We say $`𝔞`$ is unitary if some $`e\tau _𝔞`$ is a unit of $`𝔞`$ which means that $`e`$ an individual constant and $`\{e_𝔞\}`$ is closed under $`F^{M(𝔞)}`$ for $`F\tau _G`$ and $`R\tau _Ge,\mathrm{}R^𝔞`$.

3) We say $`𝔞`$ is complete if $`(|M_𝔞|,𝔡_𝔞)`$ is a complete metric space.

4) We replace “unitary” by “specially± unitary” above if we add:

5) We replace unitary by “specially-unitary” if some $`\overline{\zeta }`$ witness it which means:

6) We add the adjective partial if we allow $`F^{M(𝔞)}`$ to be a partial function, so in clause (c) of part (1) means now:

7) We say $`𝔞`$ is specially-unitary if some $`\overline{\zeta }`$ witnesses it which means (a),(b) from part (5) and

## §2 Semi metric groups: on automorphism groups of uncountable structures

It seems natural investigating the automorphism groups of a model $`𝔸`$ say of cardinality, e.g. $`\mathrm{}_\omega `$, intending to put in a framework where we shall be able to prove it is not a free group of cardinality $`>\mathrm{}_\omega `$. Now choose $`\overline{A}=A_n:n<\omega `$ such that, e.g. the universe of $`𝔸`$ is $`\mathrm{}_\omega `$ and $`A_n=\mathrm{}_n`$. For such $`\overline{A}`$ there is a natural metric on Aut$`(𝔸)`$ under which it is a complete metric group, but usually of too big density; there is another natural metric on Aut$`(𝔸)`$ under which it is a complete metric space with density $`\mathrm{}_\omega `$ but multiplication is not continuous and Cauchi sequences may not converge to any point. To get the desired results we use “semi-metric” defined in ?, which combine the two metrics; in other words we weaken the completeness demand; hopefully this will have other applications as well, e.g. also for Borel groups. We also look at some generalizations: replacing Aut$`(𝔸)`$ by other derived structures.

The reader may skip this section if not interested in the results concerning $`\mathrm{}_\omega `$. One way to present what we are doing is

###### Definition 2.1 Definition

1) We say $`G`$ is an indirectly complete metric group if:

then letting $`d_n=c_{2n}^1c_{2n+1}`$ and $`\overline{d}=d_n:n<\omega `$ we have

1A) We say $`G`$ is an indirectly complete metric group and is defined similarly only in $`()`$ we replace “metric” by “complete metric”.

1B) Similarly for add another adjective or several of them.

2) Similarly for semi-groups and for algebras (and models, see Definition 1.6) with one change: in $`()`$ of clause (c) we let $`d_n=c_n`$.

2.2 Discussion: 1) In 2.1(1), $`()`$, clearly $`c=e_G`$. So $`G`$ in Definition 2.1(1) is not necessarily a metric group, i.e. product and inverse are not necessarily continuous. Also note that a metric group which is a complete metric space is not necessarily an indirectly metric group.

2) For groups $`G`$ in 2.1(1), clause (c), we can replace “$`𝔡(c_n,c_{n+1})<1/2^n`$” by $`c_{2n}^1c_{2n+1}:n<\omega `$ converge to $`e_G`$ with no significant difference in the results.

3) There are some other variants which can serve as well: we can just demand “$`\overline{c}`$ is a Cauchi sequence” and/or add “$`\overline{c}`$ converge to $`c^{}`$”, and/or in the conclusion say “some $`\omega `$-subsequence $`\overline{d}^{}`$ of $`\overline{d}`$ converge to some $`d`$”.

4) Similarly in 2.1(2).

###### Definition 2.3 Definition

Assume $`𝔸`$ is a structure.

1) $`\overline{A}`$ is an $`\omega `$-representation of $`𝔸`$ if $`\overline{A}=A_n:n<\omega ,A_nA_{n+1}`$ for $`n<\omega `$ and $`\{A_n:n<\omega \}`$ is the universe of $`𝔸`$.

2) For every $`\omega `$-representation $`\overline{A}`$ of $`𝔸`$ let Aut$`{}_{\overline{A}}{}^{}(𝔸)=\{f\text{ Aut}(𝔸)`$: for every $`n<\omega `$ for some $`m<\omega `$ we have $`(xA_n)(f(x)A_m\&f^1(x)A_m)\}`$.

3) If $`\overline{A}`$ is an $`\omega `$-representation of $`𝔸`$ and $`G=\text{ Aut}(𝔸)`$

then we define $`𝔡=𝔡_{𝔸,\overline{A}}=𝔡_{𝔄,\overline{A}}^{\text{aut}}`$, a metric 111this is proved in ? on $`G`$ by

$`𝔡(f,g)=\text{ sup}\{2^n:`$ $`\text{there is }aA_n\text{ such that}`$
$`\text{for some }(f^{},g^{})\{(f,g),(f^1,g^1)\}`$
one of the following possibilities holds
$`(a)\text{ for some }m<\omega \text{ we have }f^{}(a)A_mg^{}(a)A_m,`$
$`(b)f^{}(a)g^{}(a)\text{ are in }A_n\}.`$
4) If $`\overline{A}`$ is an $`\omega `$-representation of $`𝔸`$ and $`G=\text{ Aut}(𝔸)`$ then we define $`𝔡^{}=𝔡_{𝔸,\overline{A}}^{}`$ a metric on $`G`$ by $`𝔡^{}(f,g)=\text{ sup}\{2^n:fA_n=gA_n`$ and $`f^1A_n=g^1A_n\}`$.

###### \stag{1.9} Claim

Assume $`\overline{A}`$ is an $`\omega `$-representation of an infinite structure $`𝔸`$.

1) $`(\text{Aut}(𝔸),𝔡_{𝔸,\overline{A}})`$ is an indirectly complete metric group with density $`2^\mathrm{}_0+\mathrm{\Sigma }\{2^{|A_n|}:n<\omega \}`$; in fact it is a complete metric space (but in general not a metric group).

2) $`(\text{Aut}(𝔸),𝔡_{𝔸,\overline{A}}^{})`$ is a complete metric group of density $`\mathrm{\Sigma }\{𝔸^{|A_n|}:n<\omega \}`$; so if each $`A_n`$ is finite the density is $`\mathrm{}_0`$.

3) If the universe of $`𝔸`$ is $`\omega `$ and $`A_n=n=\{0,\mathrm{},n1\}`$

then $`\overline{A}=A_n:n<\omega `$ is an $`\omega `$-representation of $`𝔸`$ with each $`A_n`$ finite and $`𝔡_{𝔸,\overline{A}}^{}=𝔡_𝔸^{\text{aut}}`$ from Definition 1.5(1) and under it Aut$`(𝔸)`$ is a complete separable specially metric group.

Proof. 1) Let $`𝔡=𝔡_{𝔸,\overline{A}}`$. First we show that

Together (and there is $`n`$ such that $`n<n(1),n<n(2))`$ this gives $`𝔡(f_1,f_3)2^{\text{Min}\{n(1),n(2)\}}=\text{ Max}\{𝔡(f_1,f_2),𝔡(f_2,f_3)\}`$. So $`()_1`$ holds.\]

We may wonder whether (Aut$`(𝔸),𝔡)`$ is complete, i.e. whether every $`𝔡`$-Cauchi sequence $`f_n:n<\omega `$ in $`G`$, $`𝔡`$-converge to some $`fG`$. Before answering we prove a weaker substitute (in fact, it is the one we shall use for proving the indirect completeness below).

We say that $`f_n:n<\omega `$ weakly converge to $`f`$ if (they are $`G`$, or are just permutations of $`𝔸`$ and) for every $`\alpha 𝔸`$ the sequence $`f_n(a):n<\omega `$ is eventually constant and moreover is eventually equal to $`f(a)`$.

Now we note that:

then it weakly converge, i.e. for every $`a𝔸,f_n(a):n<\omega `$ is eventually constant and $`f_n^1(a):n<\omega `$ is eventually constant so the limit $`f`$ is a well defined permutation of $`𝔸`$, moreover belongs to $`G=\text{ Aut}(𝔸)`$. \[Why? Let $`x𝔸`$ so for some $`n(1)<\omega `$ we have $`xA_{n(1)}`$. As $`f_n:n<\omega `$ is a $`𝔡`$-Cauchi sequence for some $`n(2)<\omega `$ we have $`nn(2)𝔡(f_n,f_{n(2)})<2^{n(1)}`$ hence $`nn(2)_m(f_n(x)A_mf_{n(2)}(x)A_m)`$ by the definition of $`𝔡`$. Let $`m(1)`$ be such that $`f_{n(2)}(x)A_{m(1)}`$, and let $`n(3)n(2)`$ be such that $`nn(3)𝔡(f_n,f_{n(3)})<2^{m(1)}`$ so necessarily, again by the definition of the metric, the sequence $`(f_n(x):n=n(2),n(2)+1,\mathrm{}`$ is constant; and call this value $`f(x)`$. Similarly concerning $`f_n^1(x)`$.\]

Note that the above argument shows that “if $`\overline{f}`$ do $`𝔡`$-converge to $`f`$ then $`\overline{f}`$ weakly converges to some $`f`$”, also it is interesting to note (though not explicitly used)

Very nice, but multiplication 222E.g. let $`𝔸`$ be a trivial structure (i.e. with the empty vocabulary so $`G`$ is the group of permutations of $`𝔸`$) and $`b_nc_nA_{n+1}\backslash A_n`$ and $`a_nA_0`$ be pairwise distinct (for $`n<\omega `$). Let $`h_k`$ exchange $`a_n,c_n`$ if $`n<k`$ and is the identity otherwise. Let $`f`$ interchange $`a_n,b_n`$ if $`n<\omega `$ and is the identity otherwise. Let $`g_k`$ interchange $`b_n,c_n`$ if $`n<k`$ and is the identity otherwise. Now $`g_k:k<\omega `$ is a Cauchi sequence and so has a limit $`g`$, but $`h_k=fg_kf`$ and $`h_k:k<\omega `$ is not a Cauchi sequence as $`𝔡(h_{k_1},h_{k_1})=1`$ if $`k_1<k_2`$ as witnessed by $`a=a_{k_1}`$. is not continuous in general for this metric, $`𝔡`$. We also have (though not actually used)

But we have to prove that (Aut$`(𝔸),𝔡)`$ is an indirectly complete semi-metric group. The only clause left is (c) of Definition 2.1. So assume $`g_nG,𝔡(g_n,g_{n+1})<1/2^n`$, hence by $`()_4+()_6`$ the sequence $`g_n:n<\omega `$ converge to some $`gG`$ by the metric and also weakly converge to $`g`$. Let $`f_n=g_{2n}^1g_{2n+1}`$, easily $`f_n:n<\omega `$ weakly converge to $`e_G=\text{ id}_𝔸`$, let $`f=e_G`$; so it suffices to find a metric $`𝔡^{}`$ such that $`(G,𝔡^{})`$ is a complete specially metric group in which $`f_n:n<\omega `$ converge to $`f`$. We prove this assuming just

Let $`B_n=B_{\overline{f}}^n=\{a𝔸:aA_n`$ and for every $`m(n,\omega )`$ we have $`f_m(a)=f_n(a)\&f_m^1(a)=f_n^1(a)\}`$. Clearly $`\overline{B}=B_{\overline{f}}^n:n<\omega `$ is an increasing $`\omega `$-sequence of subsets of $`𝔸`$ with union (the universe of) $`𝔸`$. Recall that $`𝔡^{}=:𝔡_{𝔸,\overline{B}}^{}`$ was defined by

$$𝔡^{}(f,g)=\text{ inf}\{2^n:fB_ngB_n\text{ or }f^1B_ng^1B_n\}.$$

Now by parts (2),(3)

and obviously

hence

So by $`()_6+()_8`$ we are done.

(E.g. Why “specially” (in part (1) which we are proving)? As for each $`n<\omega ,G_n=\{fG:𝔡^{}(f,e_G)<2^n\}`$ is a subgroup of $`G`$; the other requirements also are just like the proof of ?.)

2),3) Left to the reader. $`\mathrm{}_\mathrm{?}`$

2.4 Discussion We may consider cases like the endomorphism semi group of a structure and the endomorphism ring of an abelian group. The beautiful terms below are as in \[\Sh:61 \].

We may consider deriving from $`𝔸`$ other structures (in addition to the automorphism group, endomorphism and monomorphism semi-group); see also ?.

###### Definition 2.5 Definition

Let $`𝔸`$ be a structure.

1) A term $`\sigma (x_1,\mathrm{},x_n)`$ in the vocabulary of $`M`$ is called $`𝔸`$-beautiful

if for every function symbol $`F`$ of $`\tau _𝔸`$, say $`m`$-place, the equations

$`\sigma (`$ $`F(x_1^1,x_1^1,\mathrm{},x_m^1),F(x_1^2,x_2^2,\mathrm{},x_m^2),\mathrm{},F(x_1^n,x_2^n,\mathrm{},x_m^n))`$
$`=F(\sigma (x_1^1,x_1^2,\mathrm{},x_1^n),\sigma (x_2^1,x_2^2,\mathrm{},x_2^n),\mathrm{},\sigma (x_m^1,x_m^1,\mathrm{},x_m^1))`$
are satisfied by $`𝔸`$.

3) If $`\overline{A}`$ is an $`\omega `$-representation of $`𝔸`$ then we let $`𝔡_{𝔸,\overline{A}}^{\text{end}},𝔡_{𝔸,\overline{A}}^{\text{end}^{}}`$, both two-place functions from End$`(𝔸)`$ to $`^0`$ be defined as follows:

$`𝔡_{𝔸,\overline{A}}^{\text{end}}(f,g)=\text{ sup}\{2^n:(xA_n)(f(x)A_ng(x)A_nf(x)=g(x))`$ and $`(xA_n)(m<\omega )[f(x)A_mg(x)A_m]\}`$,

$`𝔡_{𝔸,\overline{A}}^{\text{end}^{}}(f,g)=\text{ sup}\{2^n:fA_n=gA_n\}`$.

4) End$`{}_{𝔸}{}^{+}=\text{ End}^+(𝔸)`$ is the structure with:

universe End$`(𝔸)`$,

functions:

composition (o), a two-place function

$`e`$, the identity of $`𝔸`$, an individual constant

$`F_{𝔸,\sigma }^{\text{end}}`$, for every $`𝔸`$-beautiful term $`\sigma (x_1,\mathrm{},x_n)`$, an $`n`$-place function, where

$$f=F_{A,\sigma }^{\text{end}}(f_1,\mathrm{},f_n)$$

is defined by

$$f(x)=\sigma (f_1(x),\mathrm{},f_n(x)).$$

5) Aut$`{}_{𝔸}{}^{+}=\text{ Aut}^+(𝔸)`$ (or Mono$`{}_{𝔸}{}^{+}=\text{ Mono}^+(𝔸))`$ is defined similarly restricting ourselves to beautiful terms $`\sigma (x_1,\mathrm{},x_n)`$ which maps AutA to AutA (or MonoA to MonoA).

###### \stag{1.12A} Claim

For any structure $`𝔄`$:

1) For any $`𝔄`$-beautiful term $`\sigma (x_1,\mathrm{},x_n)`$ the function $`F_{𝔄,\sigma }^{\text{end}}`$ is a full function from End$`(𝔸)`$ into End$`(𝔸)`$.

2) End$`{}_{𝔄}{}^{}{}_{}{}^{+}`$ is a full structure (i.e. the functions are full not (strictly) partial).

###### \stag{1.13} Claim

Assume

1) (End$`{}_{𝔸}{}^{},𝔡)`$ is an indirectly complete metric algebra (which is a semi group).

2) (Mono$`{}_{𝔸}{}^{},𝔡\text{ Mono}_𝔸)`$ is an indirectly complete metric algebra which is a semi group.

3) (End$`{}_{𝔸}{}^{},𝔡^{})`$ is an indirectly complete metric algebra.

4) $`(\text{Mono}_𝔸,𝔡^{}\text{Mono}_{𝔄,\overline{A}})`$ is an indirectly completed metric algebra.

5) In parts (3) + (4) the density is $`{\displaystyle \underset{n<\omega }{}}𝔸^{|A_n|}`$ and in parts (1) + (2) the density is $`{\displaystyle \underset{n<\omega }{}}2^{|A_n|}+2^\mathrm{}_0`$.

6) Assume that for every beautiful $`F\tau _𝔄`$, for every $`n`$ large enough the set $`A_n`$ is closed under $`F`$.

Then $`(\text{End}_𝔄^+,𝔡)`$ is an indireclty complete metric algebra and $`(\text{End}_𝔸^+,𝔡^{})`$ is an indirectly complete metric algebra.

Proof. Like ?.

We may wonder:

2.6 Question: Can we have an uncountable Polish algebra $`G`$ (so $`\tau _G`$ is finite or just countable) which is free for some variety?

Of course, if $`\tau _G`$ is empty this holds; obviously we may discard many.

2.7 Example. The answer to 2.6 is yes.

Proof. Note that if $`G`$ is the vector space over a countable field $`F`$ with basis $`x_\eta :\eta {}_{}{}^{\omega }2`$, it is a metric space with countable density, i.e. is Polish, as we can define $`𝔡(x,y)=xy`$ where $`0=0`$ and for $`x=\{q_{\eta ,x}x_\eta :\eta {}_{}{}^{\omega }2\}0`$ (so $`\{\eta {}_{}{}^{\omega }2:q_{\eta ,x}0\}`$ is finite and, of course, $`\eta {}_{}{}^{\omega }2q_{\eta ,x}F)`$ we let $`x`$ be $`2^n`$ where $`n`$ is minimal such that for some $`\nu {}_{}{}^{n}2`$ we have $`0\mathrm{\Sigma }\{q_{n(\eta )}:\nu \eta {}_{}{}^{\omega }2`$ and $`q_{n(\eta )}0\}`$.

Clearly $`G`$ is a metric space; it has density $`\mathrm{}_0+|F|`$, and the addition and substruction are continuous, and it is separable for $`F`$ countable. So, for countable $`F`$, the completion $`\widehat{G}`$ is an (additive) Polish group and vector space. Moreover, if $`F=/p`$ for $`p`$ a prime, $`\widehat{G}`$ is the free group of the appropriate variety. $`\mathrm{}_{2.6}`$

2.8 Remark. Another metric on the same space is: for $`xG`$ let $`n(x)=\text{ Min}\{n`$: if $`q_{\eta ,x}0q_{\nu ,x}0`$ and $`\eta \nu `$ then $`n\mathrm{}g(\eta \nu )\}`$ and let $`𝔡(x,y)`$ be:

Case 1: $`n(x)n(y)`$ or $`(\eta ,\nu {}_{}{}^{\omega }2)[\eta n(x)=\nu n(y)\&q_{\eta ,x}0\&q_{\nu ,y}0\&q_{\eta ,x}q_{\eta ,y}]`$.

Then $`𝔡(x,y)=2`$.

Case 2: Otherwise

$`𝔡(x,y)=\text{ sup}\{2^n:`$ $`nn(x)\text{ and}`$
$`(\eta ,\nu {}_{}{}^{\omega }2)[\eta n(x)=\nu n(y)\&q_{\eta ,x}0\&q_{\nu ,y}0`$
$`\mathrm{}g(\eta \nu )n]\}.`$
Now $`G`$ under $`𝔡`$ is a complete metric space, but it is not a metric group.

$``$

Closely related to semi metric (see Definition 2.1, but not enough for our theorems) is:

###### Definition 2.9 Definition

1) We say $`𝔞=(M,𝔡,𝕌)`$ is a metric-topological algebra

if:

2) We say $`𝔞=(M,𝔡,𝕌)`$ is complete if every $`𝔡`$-Cauchi sequence converge to some point of $`M`$ by the topology $`𝕌`$ though not necessarily by $`𝔡`$.

###### \stag{1.31} Claim

Assume

Then $`(G,𝔡,𝕌)`$ is a complete metric-topological algebra.

Proof. Included in the proof of Claim ?. $`\mathrm{}_\mathrm{?}`$

2.10 Discussion: 1) We can generally use topology instead of metric. What is the gain?

2) Instead of automorphisms we can consider a universal Horn Theory $`T`$ in a vocabulary $`\tau ^+=\tau _T^{}`$ extending $`\tau _𝔸`$, e.g. $`\tau ^+=\tau _𝔄\{F^{}\},F^{}`$ a function symbol with arity $`n^{}`$. So

$$\text{Exp}_T(𝔸)=:\{𝔸^+:𝔸^+\text{ a }\tau ^+\text{-expansion of }𝔄\text{ and is a model of }T\},$$

if e.g. $`\tau ^+\backslash \tau _𝔄=\{F\}`$, we may replace Exp$`{}_{T}{}^{}(A)`$ by $`\{F^{𝔸^+}:𝔸^+\text{ Exp}_T(𝔸)\}`$.

We may define

$`\text{beautiful}(T,𝔸)=\{\overline{\sigma }(\overline{x}):`$ $`\sigma \text{ a }\tau _𝔸\text{-term},\overline{x}=(x_1,\mathrm{},x_k)`$
$`\text{and if }𝔸_{\mathrm{}}^+\text{ Exp}_T(𝔸)\text{ for }\mathrm{}=1,\mathrm{},k\text{ and}`$
$`F\tau ^+\backslash \tau _𝔸\text{ we define the arity}(F)\text{-place function }F_\sigma ^{}`$
$`\text{from }𝔸\text{ to }𝔸\text{ by }F_\sigma ^{}(\overline{a})=\sigma (F^{𝔸_1}(\overline{a}),\mathrm{},F^{𝔸_k}(\overline{a}))`$
$`\text{and let }𝔸^+=(𝔸,F_\sigma ^{})_{F\tau ^+\backslash \tau _𝔸}\text{ then }𝔸^+\text{ is a model of }T\},`$
we can consider more complicated operations. So $`(\text{Exp}_T(𝔸),H_{\overline{\sigma }(\overline{x})})_{\overline{\sigma }(\overline{x})\text{ beautiful}(𝔸,T)}`$ is a generalization of Aut$`(𝔸)`$ where $`H_{\overline{\sigma }(\overline{x})}(𝔸_1^+,\mathrm{},𝔸_k^+)=𝔸^+`$ is defined as above.

## §3 Compactness of metric algebras

Note that below if $`u_n=\{t_n\}=\{n\}`$ we may write $`x_n`$ instead of $`\overline{x}_n,n`$ instead $`tu_n`$ and $`d_n`$ instead of $`\overline{d}_n`$.

###### \stag{s.1} The completeness Lemma

Assume $`𝔞`$ is a Polish algebra $`M=M_𝔞`$ (so with countable vocabulary) such that

then $`\overline{\sigma }_n(\overline{d}_{n+1}^{})\text{Ball}(\overline{d}_n,\zeta _n)`$ which means: $`tu_n\overline{\sigma }_{n,t}(\mathrm{},d_{n+1,s}^{},\mathrm{})_{su_{n+1}}\text{Ball}(d_{n,t},\zeta _n)`$

” $`(f)`$” for every $`n<\omega `$ and a position real $`\epsilon `$ there is $`m>n`$ such that

then the distance between

$`\overline{\sigma }_n(\overline{\sigma }_{n1}(\mathrm{},\overline{\sigma }_{m1}(\overline{d}_m^{}),\mathrm{}),\overline{\sigma }_n(\overline{\sigma }_{n+1}(\mathrm{},\overline{\sigma }_{m1}(\overline{d}_m))\mathrm{})`$ is $`<\epsilon `$.

Then there are $`d_{n,t}^{}M`$ for $`n<\omega ,tu_n`$ which solves the set of equations

$$d_{n,t}^{}=\sigma _{n+1}(d_{n+1,s}^{})_{su_{n+1}}$$

and satisfies

$$d_{n,t}^{}\text{Ball}_G(d_{n+1},\zeta _n).$$

3.1 Remark. 1) In “special” versions we have $`\overline{d}_n=\overline{\sigma }_n(\overline{d}_{n+1})`$ (and in \[\Sh:744 \] we have $`d_n=\sigma _n(d_{n+1}))`$ but here there is no “the true solution which we perturb”.

2) Condition (e) in Lemma ? says that if in large $`n`$ we perturb $`\overline{d}_n`$ with error $`<\zeta _n`$ and compute down by the $`\overline{\sigma }`$’s we still get a reasonable $`\overline{d}_k`$ for every $`k<n`$ but not necessarily a very good one.

Proof. For every $`k`$ we shall define $`c_{n,t}^k:tu_n,n<\omega `$, a sequence of elements of the algebra.

First, if $`nk`$ let $`c_{n,t}^k=d_{n,t}`$. Second, we define $`\overline{c}_n^k=c_{n,t}^k:tu_n`$ by downward induction on $`nk`$. $`n=k`$ by the first case. $`n<k`$ let $`\overline{c}_n^k=\overline{\sigma }_n(\overline{c}_{n+1}^k)`$. Next we show

So, for each $`n`$ and $`tu_n`$ the sequence $`c_{n,t}^k:k<\omega `$ is a Cauchy sequence by $`()_2`$; hence it converges to some $`c_{n,t}M`$. Now

Recall about groups

3.2 Fact: A free group is torsion free and the group is not divisible, in fact, every element $`c`$ has at most one $`n`$-th root for each $`n=1,2,\mathrm{}`$ and has no root for every large enough $`n`$ except when $`c`$ is the unit.

3.3 Fact: Every countable subgroup at a free group $`G`$ is contained in a countable subgroup which is a retract of $`G`$.

We now give a criterion to show non-freeness. We could use $`\overline{x}`$ instead of $`x`$, of course.

###### \stag{s.5} Claim

1)

Then no countable subalgebra of $`M`$ containing $`B`$ is a retract (in the algebraic sense) of $`M`$. Hence $`M`$ is not free for any variety.

2) We can omit $`e_𝔞`$, i.e. omit clause (b) and the last phrase of clause (a) and change clause (e) to

there is a term $`\sigma (x,\overline{y})\mathrm{\Xi }`$ and sequence $`\overline{b}{}_{}{}^{\mathrm{}g(\overline{y})}B`$ and element $`d^{}M_𝔞`$ such that

3.4 Remark. We can similarly phrase sufficient conditions for “$`M_𝔞`$ is unstable in $`\mathrm{}_0`$” \[for quantifier free formulas, see §6\].

Proof. 1) Like the proof of part (2) below except that we add to $`()`$:

2) We rely on ?.

Assume toward contradiction that $`M`$ is a countable reduct of $`M_𝔞`$ which includes $`B`$, so we can choose $`h^{}`$, a homomorphism from $`M_𝔞`$ onto $`M`$ which extends idM. Let $`a_n:n<\omega `$ list $`M`$. Let $`u_n=\{n\}`$. We choose $`\overline{b}_n`$ and $`\sigma _n(x,\overline{y}_n)`$ and $`\zeta _n`$ by induction on $`n`$ such that

then $`\sigma _n(c,\overline{b}_n)\text{ Ball}(e_n,\zeta _n)`$

” $`(\zeta )`$” if $`k<n`$ and $`c^{},c^{\prime \prime }\text{ Ball}_G(e_{n+1},\zeta _{n+1})`$ and we define the terms $`\sigma _{n+1,\mathrm{}}(x)`$ for $`\mathrm{}n+1`$, with parameters by downward induction on $`\mathrm{}`$ as follows $`\sigma _{n+1,n+1}(x)=x,\sigma _{n+1,\mathrm{}}(x)=\sigma _{\mathrm{}}(\sigma _{n+1,\mathrm{}+1}(x),\overline{b}_{\mathrm{}})`$ then the $`𝔡`$-distance between $`\sigma _{n+1,k}(c^{})`$ and $`\sigma _{n+1,k}(c^{\prime \prime })`$ is $`<\zeta _n`$. Let us carry the induction, in stage $`n`$ we choose $`e_n,\zeta _n`$ and $`\sigma _{n1}(x,\overline{b}_{n1})`$ if $`n>0`$.

Case 1: $`n=0`$.

This is straightforward.

Case 2: $`n=k+1`$.

Let $`D`$ be the set of $`\overline{c}=c_m:mk`$ which satisfies

We can prove by induction on $`mk`$ that $`\{c_m:\overline{c}D\}`$ is finite, and let $`A=\{c_k:\overline{c}D\}`$. By clause $`(e)^{}`$ of the assumptions (see ?(2)), there are $`r<\omega ,\sigma =\sigma (x,y_0,\mathrm{},y_{r1})\mathrm{\Xi }`$ and $`\overline{b}{}_{}{}^{r}(M_𝔞)`$ and $`d^{}`$ as there. We let $`\overline{d}_k=\overline{b},\sigma _k=\sigma ,\overline{y}_k=y_0,\mathrm{},y_{r1},e_n=d^{}`$.

Lastly, we should choose $`\zeta _n^+`$. There are several demands but each holds for every small enough $`\zeta >0`$, more exactly one for clause $`(\epsilon )`$ and for each $`m<n`$, one for clause $`(\zeta )`$.

Having carried the induction, clearly ? apply hence there is a solution $`d_n^{}:n<\omega `$, that is $`M_𝔞d_m^{}=\sigma _m(d_{m+1}^{},\overline{b}_m)`$ for $`m<\omega `$. But $`h^{}`$ is a homomorphism from $`M_𝔞`$ into $`M`$ so $`h^{}(d_n^{}):n<\omega `$ satisfies all the equations in $`_k`$ hence by our choice in stage $`n=k+1,h^{}(d_0^{})a_k`$. As this holds for every $`k`$ and $`\{a_k:k<\omega \}`$ list the elements of $`M`$ we are done. $`\mathrm{}_\mathrm{?}`$

3.5 Remark. 1) If we phrase algebraic compactness, it is preserved by taking reducts.

2) In a reasonalbe variant we can replace “$`M`$ countable” by $`M<\text{ cov}`$(meagre); we’ll return to this elsewhere.

3) We can change the demand on $`\mathrm{\Xi }`$: at most one solution in clause (e), $`A`$ a singleton in clause (f).

4) This suffices for groups.

## §4 Conclusions

4.1 Conclusion 1) If $`(G,𝔡)`$ is a complete metric group of density $`<|G|`$, then:

2) It suffices that $`G`$ is an indirectly complete metric group and as a metric space it is of density $`<|G|`$.

3) Instead “density” $`<|G|`$” it is enough to assume that the topology induces by the metric is not discrete.

Proof. 1), 2) Easy. Let $`\mu `$ = density$`(G)`$ and $`y_iG`$ be pairwise distinct for $`i<\mu ^+`$. Without loss of generality $`y_i\{y_j:j<i\}_G`$. So for some increasing sequence $`i_n:n<\omega `$ the sequence $`y_{i,n}:n<\omega `$ is a Cauchi sequence.

For part (1), by completeness it converges say to $`y^{}`$, the convergence is for $`𝔡_G`$. Now $`b_n:n<\omega =:(y^{})^1y_{i_{2n+1}}:n<\omega `$ converges to $`e_G`$, the members are pairwise distinct so without loss of generality$`e`$.

However for part (2) we know that some $`(G,𝔡^{})`$ equal to $`(G,𝔡)`$ as a group but with a different metric; is a complete metric group with an $`\omega `$-sequence of members of $`G\backslash \{e_G\}`$ converging to $`e_G`$.

Let $`\mathrm{\Xi }=\{x^my_1:m<\omega \}`$ and $`B=\{b_n:n<\omega \}`$. Now we shall apply ?. In the assumptions, clauses (a)-(c) are obvious. As for clause (d) we are using: equations of the form $`x^ma^{}=a^{\prime \prime }`$ has at most one solution in $`G`$, see 3.2. We are left with clause (e), so we are given a real $`\zeta >0`$ and a finite set $`AG`$ (in fact, a singleton is enough). We can choose $`bB\backslash A\backslash \{e_G\}`$ of distance $`<\zeta `$ from $`e_G`$. Let $`\sigma (x,y)=xy`$ and $`\overline{b}=b`$ where $`n<\omega `$ is the minimal $`n>1`$ such that $`[aAab^1`$ has no $`n`$-th root\]. This is possible, see Fact 3.2 so $`\sigma (e_M,\overline{b})=b\text{ Ball}_G(e_M,\zeta )`$ as required in subclause $`(\alpha )`$ of clause (e) and $`\sigma (e_M,\overline{b})=bA`$ as required in subclause $`(\beta )`$ of clause (e) so by ? we are done.

3) Choose $`y_n:n<\omega `$ converging to some $`y^{}`$ such that $`y_n:n<\omega \mathrm{^}y^{}`$ is with no repetitions, possible on $`(G,𝔡)`$ is not discrete. Now continue as above. $`\mathrm{}_{4.1}`$

In particular

4.2 Conclusion: There is no free uncountable Polish group.

###### \stag{c.3} Claim

(1) In the proof of Proposition 4.1(b) we do not use all the strength of “$`G`$ is free”. E.g. if $`(G,𝔡)`$ is a complete metric group then $`(a)\neg (b)`$ where:

then there is a countable subgroup $`H`$ of $`G`$ which includes $`X`$ and is a reduct of $`G`$, that is there is a projection from $`G`$ onto $`H`$.

2) The uncountable free abelian group falls under this criterion, in fact, any uncountable strongly $`\mathrm{}_1`$-free abelian group also satisfies this criterion.

3) In part (1) we can weaken (b) to

or just:

Proof. The same as the proof of 4.1.

4.3 Remark. 1) We may consider for a metric space a group rank: the objects being finite approximation to the system of elements we actually use $`\sigma _n(\overline{d}_{n+1},\overline{b}_n):n<\omega `$ in ? (or in ?).

2) The results above confirms the thesis that the compactness conditions say that $`G`$ is “large”, “rich”.

3) Note that we can expand $`M_𝔞`$ by individual constants, equivalently consider terms with parameters.

4) In the applications of ?, we do not actually use $`r>2`$.

5) Concerning semi groups we intend to say it in a continuation.

6) We may consider assumption “some $`h:M_AN`$ is a homomorphisms onto $`N,N`$ countable”, and rephrase the criterion in ?.

7) We may consider just $`N<2^\mathrm{}_0`$, so have to split into two so we get $`{}_{}{}^{\omega }2`$ cases among which at least one “succeeds”.

4.4 Conclusion: 1) Assume $`𝔸`$ is a countable structure. Then Aut$`(𝔸)`$, the group of automorphisms of $`𝔸`$, is not a free uncountable group, in fact it satisfies the conclusions of 4.1, ?.

2) Assume $`𝔸`$ is a structure of cardinality $`\lambda `$ and $`\lambda =\mu =\mathrm{}_\omega `$ or more generally $`\lambda =\mathrm{\Sigma }\{\lambda _n:n<\omega \},2^{\lambda _n}<2^{\lambda _{n+1}},\mu =\mathrm{\Sigma }\{2^{\lambda _n}:n<\omega \}<2^\lambda `$. Then Aut$`(𝔸)`$ cannot be free of cardinality $`>\mu `$, in fact, it satisfies the conclusions of 4.1, ?.

Proof. 1) By ?, Aut$`(𝔸)`$ is a Polish group and apply 4.2.

2) Without loss of generality the universe of $`𝔸`$ is $`\lambda `$, using $`\overline{A}=\lambda _n:n<\omega `$ we know by ?(1) that $`(\text{Aut}(𝔸),𝔡_{𝔸,\overline{A}})`$ is a complete semi-metric group and apply 4.1(2). $`\mathrm{}_{4.4}`$

###### \stag{c.6} Claim

For complete specially metric groups the proof of \[\Sh:744 \] works, similarly for algebras.

## §5 Quite free but not free abelian groups

If uncountable Polish groups are not free, we may look at wider classes: $`F_\sigma `$, Borel analytic, projective $`𝕃[]`$.

5.1 Question: 1) Is the freeness of a reasonably definable abelian group absolute?

2) For which cardinals $`\lambda `$ does $`\lambda `$-freeness imply freeness (or $`\lambda ^+`$-freeness) for nicely definable abelian groups, in particular for $`\lambda =\mathrm{}_\omega `$?

3) Similarly for other varieties (or any case when “free” is definable like universal Horn theory).

This is connected also to \[\Sh:402 \] whose original aim was a question of Marker “are there non-free Whitehead Borel Abelian groups”. But already in \[\Sh:402 \] it seems to me the basic question is to clarify freeness in such groups; that is, question 5.1 above.

Blass asked about definable subgroups of $`^\omega `$ (see question ?): by \[\Sh:402 \] and the construction here we quite resolve this.

Recall that \[\Sh:402 \] analyze $`\mathrm{}_1`$-free abelian groups which are $`\mathrm{\Sigma }_1^1`$ or so. A natural dividing line was suggested; the complicated half was proved to be not Whitehead, and at least for me is an analog to not $`\mathrm{}_0`$-stable. The low half is $`\mathrm{}_2`$-free. So under CH we were done, but what if $`2^\mathrm{}_0>\mathrm{}_1`$? Are they also free? This was left open by \[\Sh:402 \].

We shed some light by giving an example (an $`F_\sigma `$ one) showing that the non-CH case in \[\Sh:402 \] is a real problem. This resolves the original problem: it is consistent that there are non-free Whitehead groups, this is derived in ?. But what about the further question, e.g. 5.1(2)? The examples seem to indicate (at least to me) that the picture in \[\Sh:87a \], \[\Sh:87b \] is the right one here, connecting theories of $`\psi 𝕃_{\omega _1,\omega }`$ with $`\mathrm{\Sigma }_1^1`$-models. Also related are \[\EM2 \], \[\MkSh:366 \] on almost freeness for varieties, and see \[\EM \] on abelian groups. In particular we conjecture “every $`\mathrm{}_\omega `$-free Borel group is free”.

We shall use freely the well known theorem saying

###### Definition 5.2 Definition

For $`k()<\omega `$ we define an abelian group $`G=G_{k()}`$ and is generated by $`\{x_{m,\overline{\eta },\nu }:mk()\text{ and }\nu {}_{}{}^{\omega >}2\text{ and }\overline{\eta }=\eta _{\mathrm{}}:\mathrm{}k(),\mathrm{}m`$ where $`\eta _{\mathrm{}}{}_{}{}^{\omega }2\}\{y_{\overline{\eta },n}:n<\omega `$ and $`\overline{\eta }=\eta _{\mathrm{}}:\mathrm{}k()`$ where $`\eta _{\mathrm{}}{}_{}{}^{\omega }2\}`$ freely except the equations:

(Note that if $`m_1<m_2k()`$ then $`\overline{\eta }_{m_1}\overline{\eta }_{m_2}`$ having different index sets).

Explanation. A canonical example of a non-free group is $`(,+)`$. Other examples are related to it after we divide by something. The $`y`$’s here play that role of providing (hidden) copies of $``$. What about $`x`$’s? For each $`\overline{\eta }\mathrm{\Lambda }`$ we use $`mk()`$ to give $`y_{\overline{\eta },n}:n<\omega ,k()`$ “chances”, “opportunities” to avoid having $`(,+)`$ as a quotient, one for each cardinal $`\mathrm{}_{k()}`$. More specifically, if $`HG`$ is the subgroup which is generated by $`X=\{x_{m,\overline{\eta },\nu }:mm()`$ and $`\eta `$ is a function from $`\{\mathrm{}k():\mathrm{}m\}`$ to $`\omega `$ and $`\nu {}_{}{}^{\omega >}2\}`$, still in $`G/H`$ the $`\{y_{\overline{\eta },n}:n<\omega \}`$ does not generate a copy of $``$, as witnessed by $`\{x_{m(),\overline{\eta }_{m()},\eta _{m()}n}:n<\omega \}`$.

###### \stag{6.1.7} Claim

The abelian group $`G_{k()}`$ is a Borel group, even an $`F_\sigma `$-one that is the set of elements and the graphs of $`+`$ and the function $`xx`$ (i.e. $`\{(x,y,z):G_{k()}\mathrm{`}\mathrm{`}x+y=z\mathrm{"}\}`$ hence also $`\{(x,x):xG_{k()}\}`$) are $`F_\sigma `$-sets; hence Borel.

Proof. Let cd be a one-to-one function from the set of finite sequences of natural numbers onto the set of natural numbers and we define:

We say $`\nu `$ represents $`xG_{k()}`$ as witnessed by $`(z_{\mathrm{}},a_{\mathrm{}},m):\mathrm{}<n`$ when:

Now for $`n<\omega ,\overline{a}=a_{\mathrm{}}:\mathrm{}<n{}_{}{}^{n},i<\omega `$ and $`\overline{\varrho }=\varrho _{\mathrm{}}:\mathrm{}<n{}_{}{}^{n}({}_{}{}^{i}Z)`$ is $`<_{\text{lex}}`$-increasing hence without repetitions (and if $`n=0`$ we let $`i=0`$) we let

$`Z_{\overline{a},\overline{\varrho }}=\{\nu :`$ $`\nu \text{ represent some }xG_{k()}\text{ as witnessed by}`$
$`(z_{\mathrm{}},a_{\mathrm{}}):\mathrm{}<n\text{ and }\text{ cd}(z_{\mathrm{}})=\varrho _{\mathrm{}}\text{ for }\mathrm{}<n\}.`$
Let $`𝒴`$ be the set of such pairs $`(\overline{a},\overline{\rho })`$

\[Why? For any $`i<n`$ clearly $`\{x_{m,\overline{\eta },\nu }:(m,\overline{\eta },\nu )`$ as in Definition 5.2$`\}\{y_{\overline{\eta },i}:\overline{\eta }\mathrm{\Lambda }\}`$ generates freely a subgroup $`G_{k(),i}^{}`$ of $`G_{k()}`$ such that the quotient $`G_{k()}/G_{k(),i}^{}`$ is torsion. The rest should be clear, too.\]

Clearly we are done. $`\mathrm{}_\mathrm{?}`$

As a warm up we note:

###### \stag{6.2} Claim

$`G_{k()}`$ is an $`\mathrm{}_1`$-free abelian group.

Proof. Let $`U{}_{}{}^{\omega }2`$ be countable (and infinite) and define $`G_U^{}`$ like $`G`$ restricting ourselves to $`\eta _{\mathrm{}}U`$; by the Löwenheim-Skolem argument it suffices to prove that $`G_U^{}`$ is a free abelian group. List $`{}_{}{}^{k()+1}U`$ without repetitions as $`\overline{\eta }_t:t<\omega `$, and choose $`s_t<\omega `$ such that $`[r<t\&\overline{\eta }_rk()=\overline{\eta }_tk()\mathrm{}=\{\eta _{t,k()}\mathrm{}:\mathrm{}[s_t,\omega )\}\{\eta _{r,k()}\mathrm{}:\mathrm{}[s_r,\omega )\}]`$. Let

$`Y_1=\{x_{m,\overline{\eta },\nu }:m<k(),\overline{\eta }{}_{}{}^{k()+1\backslash \{m\}}U\text{ and }\nu {}_{}{}^{\omega >}2\}`$

$`Y_2=\{x_{m,\overline{\eta },\nu }:`$ $`m=k(),\overline{\eta }{}_{}{}^{k()}U\text{ and for no }t<\omega \text{ do we have}`$
$`\overline{\eta }=\overline{\eta }_tk()\&\nu \{\eta _{t,k()}\mathrm{}:s_t\mathrm{}<\omega \}\}`$
$`Y_3=\{y_{\overline{\eta }_t,n}:t<\omega \text{ and }n[s_t,\omega )\}`$. Now

\[Why? Let $`G^{}`$ be the subgroup of $`G_U^{}`$ which $`Y_1Y_2Y_3`$ generates. First we prove by induction on $`n<\omega `$ that for $`\overline{\eta }{}_{}{}^{k()}U`$ and $`\nu {}_{}{}^{n}2`$ we have $`x_{k(),\overline{\eta },\nu }G^{}`$. If $`x_{k(),\overline{\eta },\nu }Y_2`$ this is clear; otherwise, by the definition of $`Y_2`$ for some $`\mathrm{}<\omega `$ and $`t<\omega `$ such that $`\mathrm{}s_t`$ we have $`\overline{\eta }=\overline{\eta }_tk(),\nu =\eta _{t,k()}\mathrm{}`$.

Now

Hence by the equation $`_{\overline{\eta },n}`$ in Definition 5.2, clearly $`x_{k(),\overline{\eta },\nu }G^{}`$. So as $`Y_1G^{}G_U^{}`$, all the generators of the form $`x_{m,\overline{\eta },\nu }`$ with each $`\eta _{\mathrm{}}U`$ are in $`G^{}`$. Also we have

Now for each $`t<\omega `$ we prove that all the generators $`y_{\overline{\eta }_t,n}`$ are in $`G^{}`$. If $`ns_t`$ then clearly $`y_{\overline{\eta }_t,n}Y_3G^{}`$. So it suffices to prove this for $`ns_t`$ by downward induction on $`n`$; for $`n=s_t`$ by an earlier sentence, for $`n<s_t`$ by $`_{\overline{\eta },n}`$. The other generators are in this subgroup so we are done.\]

\[Why? Translate the equations.

Alternatively, let $`z_\alpha :\alpha <\alpha ()`$ list the set of generators of $`G_U^{}`$ without repetition such that for some increasing continuous $`\alpha _i:i\omega +\omega `$ we have $`\alpha _0=0,\alpha _{\omega +\omega }=\alpha ()`$ and

Now the proof above shows that:

This clearly suffices.\] $`\mathrm{}_\mathrm{?}`$

Now systematically

###### Definition 5.3 Definition

1) For $`U{}_{}{}^{\omega }2`$ let $`G_U`$ be the subgroup of $`G`$ generated by

$`Y_U=\{y_{\overline{\eta },n}:\overline{\eta }{}_{}{}^{k()+1}(U)`$ and $`n<\omega \}\{x_{m,\overline{\eta },\nu }:mk()`$ and $`\overline{\eta }{}_{}{}^{(k()+1)\backslash \{m\}}(U)`$ and $`\nu {}_{}{}^{\omega >}2\}`$. Let $`G_U^+`$ be the divisible hull of $`G_U`$ and $`G^+=G_{({}_{}{}^{\omega }2)}^+`$.

2) For $`U{}_{}{}^{\omega }2`$ and finite $`u{}_{}{}^{\omega }2`$ let $`G_{U,u}`$ be the subgroup 333note that if $`u=\{\eta \}`$ then $`G_{U,u}=G_U`$ of $`G`$ generated by $`\{G_{U(u\backslash \{\eta \})}:\eta u\}`$; and for $`\overline{\eta }{}_{}{}^{k()}U`$ let $`G_{U,\overline{\eta }}`$ be the subgroup of $`G`$ generated by $`\{G_{U\{\eta _k:k<\mathrm{}g(\overline{\eta })\text{ and }k\mathrm{}\}}:\mathrm{}<\mathrm{}g(\overline{\eta })\}`$.

3) For $`U{}_{}{}^{\omega }2`$ let $`\mathrm{\Xi }_U=\{\text{the equation }_{\overline{\eta },n}:\overline{\eta }{}_{}{}^{k()+1}U`$ and $`n<\omega \}`$. Let $`\mathrm{\Xi }_{U,u}=\{\mathrm{\Xi }_{Uu\backslash \{\beta \}}:\beta u\}`$.

###### \stag{6.4} Claim

0) If $`U_1U_2{}_{}{}^{\omega }2`$

then $`G_{U_1}^+G_{U_2}^+G^+`$.

1) For any $`n()<\omega `$, the abelian group $`G_U^+`$ (which is a vector space over $``$), has the basis $`Y_{U_i}^{n()}:=\{y_{\overline{\eta },n()}:\overline{\eta }{}_{}{}^{k()+1}(U)\}\{x_{m,\overline{\eta },\nu }:mk(),\overline{\eta }{}_{}{}^{(k()+1)\backslash \{m\}}(U)`$ and $`\nu {}_{}{}^{\omega >}2\}`$.

2) For $`U{}_{}{}^{\omega }2`$ the abelian group $`G_U`$ is generated by $`Y_U`$ freely (as an abelian group) except the set $`\mathrm{\Xi }_U`$ of equations.

3) If $`U_m{}_{}{}^{\omega }2`$ for $`m<m()`$ then the subgroup $`G_{U_0}+\mathrm{}+G_{U_{m()1}}`$ of $`G`$ is generated by $`Y_{U_0}Y_{U_1}\mathrm{}Y_{U_{m()1}}`$ freely (as an abelian group) except the equations in $`\mathrm{\Xi }_{U_0}\mathrm{\Xi }_{U_1}\mathrm{}\mathrm{\Xi }_{U_{m()1}}`$ provided that

then for some $`m<m()`$ we have $`\{\eta _0,\mathrm{},\eta _{k()}\}U_m`$. 4) If $`U_{\mathrm{}}=U\backslash U_{\mathrm{}}^{}`$ for $`\mathrm{}<m()k()`$ and $`U_{\mathrm{}}^{}:\mathrm{}<m()`$ are pairwise disjoint then $``$ holds.

5) $`G_{U,u}G_{Uu}`$ if $`U{}_{}{}^{\omega }2`$ and $`u{}_{}{}^{\omega }2\backslash U`$; moreover $`G_{U,u}_{\text{pr}}G_{Uu}_{\text{pr}}G`$.

6) If $`U_\alpha :\alpha <\alpha ()`$ is $``$-increasing continuous then also $`G_{U_\alpha }:\alpha <\alpha ()`$ is $``$-increasing continuous.

7) If $`U_1U_2U{}_{}{}^{\omega }2`$ and $`u{}_{}{}^{\omega }2\backslash U`$ is finite, $`|u|<k()`$ and $`U_2\backslash U_1=\{\eta \}`$ and $`v=u\{\eta \}`$ then $`(G_{U,u}+G_{U_2u})/(G_{U,u}+G_{U_1u})`$ is isomorphic to $`G_{U_1v}/G_{U_1,v}`$.

8) If $`U{}_{}{}^{\omega }2`$ and $`u{}_{}{}^{\omega }2\backslash U`$ has $`k()`$ members then $`(G_{U,u}+G_u)/G_{U,u}`$ is isomorphic to $`G_u/G_{\mathrm{},u}`$.

Proof. 0), 1) Obvious.

2),3),4) Follows.

5) First, $`G_{U,u}G_{Uu}`$ follows by the definition. Second, we deal with proving $`G_{U,u}_{\text{pr}}G_{Uu}`$. So let $`|u|=m()+1`$ and $`\eta _{\mathrm{}}:\mathrm{}m()`$ list $`u`$, necessarily with no repetitions and let $`U_{\mathrm{}}=U(u\backslash \{\eta _{\mathrm{}}\})`$ (so $`G_{U,u}=G_{U_0}+\mathrm{}+G_{U_{m()}})`$ and assume $`zG_{Uu},a\backslash \{0\}`$ and az belongs to $`G_{U_0}+\mathrm{}+G_{U_{m()}}`$ so it has the form $`\mathrm{\Sigma }\{b_ix_{m_i,\overline{\eta }_i,\nu _i}:i<i()\}+\mathrm{\Sigma }\{c_jy_{\overline{\rho }_j,n_j}:j<j()\}`$ with $`b_i,c_j`$ and $`\overline{\eta }_i,\overline{\rho }_j`$ are (finite) sequences of members of $`U_{\mathrm{}(i)},U_{k(j)}`$ respectively and are as required in Definition 5.2 where $`\mathrm{}(i),k(j)<m()`$.

Now similarly as $`zG_{Uu}`$, we can find $`z=\mathrm{\Sigma }\{b_i^{}x_{m_i^{},\overline{\eta }_i^{},\nu _i^{}}:i<i^{}()\}+\mathrm{\Sigma }\{c_j^{}y_{\overline{\rho }_j^{},n_j^{}}:j<j^{}()\}`$.

By the equations in Definition 5.2 without loss of generality for some $`n()`$ we have: $`i<i()n_i=n()`$ and $`i<i^{}()n_i^{}=n()`$. Also without loss of generality in each of the sequences $`(m_i,\overline{\eta }_i,\nu _i):i<i(),\overline{\rho }_j:j<j()`$ is with no repetitions, and also in $`(m_i^{},\eta _i^{},\nu _i^{}):i<i(),\rho _j^{}:j<j()`$ there is no repetition (for $`\rho _j:j<j()`$ and $`\rho _j^{}:j<j^{}()`$ we use $`n_i=n(),n_i^{}=n())`$. Together

Now this equation holds in $`G_{Uu}`$ hence is $`G`$ and even in $`G^+`$. By part (1) and the “no repetitions”, after possible permuting we get $`i()=i^{}(),j()=j^{}(),(m_i,\overline{\eta }_i,\nu _i)=(m_i^{},\overline{\eta }_i^{},\nu _i^{}),b_i=ab_i^{}`$ for $`i<i(),\overline{\rho }_j=\rho _j^{}`$ for $`j<j(),c_j=ac_j^{}`$ for $`j<j()`$. But this proves that $`\{x_{m_i^{},\overline{\eta }_i^{},\nu _i}:i<i^{}()\}\{y_{\overline{\rho }_j^{},n()}:j<j^{}()\}G_{U,u}`$ hence $`zG_{U,u}`$ as required.

Third, the proof of $`G_{Uu}_{\text{pr}}G`$ is similar.

6) Easy.

7) Clearly $`U_1v=U_2u`$ hence $`G_{U_1u}G_{U_1v}=G_{U_2u}`$ hence $`G_{U,u}+G_{U_1u}`$ is a subgroup of $`G_{U,u}+G_{U_2u}`$, so the first quotient makes sense.

Hence by the isomorphism theorem $`(G_{U,u}+G_{U_2u})/(G_{U,u}+G_{U_1u})`$ is isomorphic to $`G_{U_2u}/(G_{U_2u}(G_{U,u}+G_{U_1u}))`$. Now $`G_{U_1,v}G_{U_1v}=G_{U_2u}`$ and $`G_{U_1,v}=\mathrm{\Sigma }\{G_{U_1(v\backslash \{\nu \})}:\nu v\}=\mathrm{\Sigma }\{G_{U_1v\backslash \{\nu \}}:\nu u\}+G_{U_1,(v\backslash \{\eta \})}G_{U,u}+G_{U_1,u}`$. Together $`G_{U_1,v}`$ is included in their intersection, i.e. $`G_{U_2u}(G_{U,u}+G_{U_1,u})`$ include $`G_{U_1,v}`$ and using part (1) both has the same divisible hull inside $`G^+`$. But $`G_{U_1,v}`$ is a pure subgroup of $`G`$ by part (5) hence of $`G_{U_1v}`$. Hence necessarily $`G_{U_1u}(G_{U,u}+G_{U_1,u})=G_{U_1,v}`$, so as $`G_{U_2u}=G_{U_1v}`$ we are done.

8) The proof is similar to the proof of part (7). Note that $`G_{U,u}G_{U,u}+G_u`$ hence the first quotient makes sense. So by an isomorphism theorem $`(G_{U,u}+G_u)/G_{U,u}`$ is isomorphic to $`G_u/(G_{U,u}G_u)`$. Now $`G_{U,u}G_u`$ includes $`G_{\mathrm{},u}`$ and using part (1) both has the same divisible hull inside $`G^+`$. But $`G_{\mathrm{},u}`$ is a pure subgroup of $`G_u`$ by part (5). So necessarily $`G_{U,u}G_u=G_{\mathrm{},u}`$, so $`G_u/(G_{U,u}G_u)=G_u/G_{\mathrm{},u}`$, so we are done. $`\mathrm{}_\mathrm{?}`$

Discussion: For the reader’s convenience we write what the group $`G_{k()}`$ is for the case $`k()=0`$. So, omitting constant indexes and replacing sequences of length one by the unique entry we get that it is generated by $`y_{\eta ,n}`$ (for $`\eta {}_{}{}^{\omega }2,n<\omega `$) and $`x_\nu `$ (for $`\nu {}_{}{}^{\omega >}2`$) freely as an abelian group except the equations $`(n!)y_{\eta ,n+1}=y_{\eta ,n}+x_{\eta n}`$.

Note that if $`K`$ is the countable subgroup generated by $`\{x_\nu :\nu {}_{}{}^{\omega >}2\}`$ then $`G/K`$ is a divisible group of cardinality continuum hence $`G`$ is not free. So $`G`$ is $`\mathrm{}_1`$-free but not free.

Now we have the main proof

###### \stag{6.5} Main Claim

1) The abelian group $`G_{Uu}/G_{U,u}`$ is free

if $`U{}_{}{}^{\omega }2,u{}_{}{}^{\omega }2\backslash U`$ and $`1|u|kk()`$ and $`|U|\mathrm{}_{k()k}`$.

2) If $`U{}_{}{}^{\omega }2`$ and $`|U|\mathrm{}_{k()}`$, then $`G_U`$ is free.

Proof. 1) We prove this by induction on $`|U|`$; without loss of generality$`|u|=k`$ as also $`k^{}=|u|`$ satisfies the requirements.

Case 1: $`U`$ is countable.

So let $`\{\nu _{\mathrm{}}^{}:\mathrm{}<k\}`$ list $`u`$ be with no repetitions, now if $`k=0`$, i.e. $`u=\mathrm{}`$ then $`G_{Uu}=G_U=G_{U,u}`$ so the conclusion is trivial. Hence we assume $`u\mathrm{}`$, and let $`u_{\mathrm{}}:=u\backslash \{\nu _{\mathrm{}}^{}\}`$ for $`\mathrm{}<k`$.

Let $`\overline{\eta }_t:t<t^{}\omega `$ list with no repetitions the set $`\mathrm{\Lambda }_{U,u}:=\{\overline{\eta }{}_{}{}^{k()+1}(Uu)`$: for no $`\mathrm{}<k`$ does $`\overline{\eta }{}_{}{}^{k()+1}(Uu_{\mathrm{}})\}`$. Now comes a crucial point: let $`t<t^{}`$, for each $`\mathrm{}<k`$ for some $`r_{t,\mathrm{}}k()`$ we have $`\eta _{t,r_{t,\mathrm{}}}=\nu _{\mathrm{}}^{}`$ by the definition of $`\mathrm{\Lambda }_{U,u}`$, so $`|\{r_{t,\mathrm{}}:\mathrm{}<k\}|=k<k()+1`$ hence for some $`m_tk()`$ we have $`\mathrm{}<kr_{t,\mathrm{}}m_t`$ so for each $`\mathrm{}<k`$ the sequence $`\overline{\eta }_t(k()+1\backslash \{m_t\})`$ is not from $`\{\rho _s:sk()`$ and $`sm_t:\rho _s^\omega (Uu_{\mathrm{}})`$ for every $`sk()`$ such that $`sm_t\}`$.

For each $`t<t^{}`$ we define $`S(t)=\{mk():\{\eta _{t,s}:sk()\&sm\}`$ is included in $`Uu_{\mathrm{}}`$ for no $`\mathrm{}k\}`$. So $`m_tS(t)\{0,\mathrm{},k()\}`$ and $`mS(t)\overline{\eta }_t\{jk():jm\}(Uu_{\mathrm{}})`$ for every $`\mathrm{}k`$. For $`mk()`$ let $`\overline{\eta }_{t,m}^{}:=\overline{\eta }_t\{jk():jm\}`$ and $`\overline{\eta }_t^{}:=\overline{\eta }_{t,m_t}^{}`$. Now we can choose $`s_t<\omega `$ by induction on $`t`$ such that

Let $`Y^{}=\{x_{m,\overline{\eta },\nu }G_{Uu}:x_{m,\overline{\eta },\nu }G_{Uu_{\mathrm{}}}`$ for $`\mathrm{}<k\}\{y_{\overline{\eta },n}G_{Uu}:y_{\overline{\eta },n}G_{Uu_{\mathrm{}}}`$ for $`\mathrm{}<k\}`$.

Let

$`Y_1=\{x_{m,\overline{\eta },\nu }Y^{}`$: for no $`t<t^{}`$ do we have $`m=m_t\&\overline{\eta }=\overline{\eta }_t^{}\}`$.

$`Y_2=\{x_{m,\overline{\eta },\nu }Y^{}:`$ $`x_{m,\overline{\eta },\nu }Y_1\text{ but for no}`$
$`t<t^{}\text{ do we have }m=m_t\&\overline{\eta }=\overline{\eta }_t^{}\&`$
$`\eta _{t,m_t}s_t\mathrm{}\nu \eta _{t,m_t}\}`$
$`Y_3=\{y_{\overline{\eta },n}:y_{\overline{\eta },n}Y^{}\text{ and }n[s_t,\omega )\text{ for the }t<t^{}\text{ such that }\overline{\eta }=\overline{\eta }_t\}`$. Now the desired conclusion follows from

Proof of $`()_1`$. It suffices to check that all the generators of $`G_{Uu}`$ belong to $`G_{Uu}^{}=:Y_1Y_2Y_3G_{U,u}_G`$.

First consider $`x=x_{m,\overline{\eta },\nu }`$ where $`\eta {}_{}{}^{k()+1}(Uu),m<k()`$ and $`\nu {}_{}{}^{n}2`$ for some $`n<\omega `$. If $`xY^{}`$ then $`xG_{U,u_{\mathrm{}}}`$ for some $`\mathrm{}<k`$ but $`G_{Uu_{\mathrm{}}}G_{U,u}G_{Uu}^{}`$ so we are done, hence assume $`xY^{}`$. If $`xY_1Y_2Y_3`$ we are done so assume $`xY_1Y_2Y_3`$. As $`xY_1`$ for some $`t<t^{}`$ we have $`m=m_t\&\overline{\eta }=\eta _t^{}`$. As $`xY_2`$, clearly for some $`t`$ as above we have $`\eta _{t,m_t}s_t\mathrm{}\nu \eta _{t,m_t}`$. Hence by Definition 5.2 the equation $`_{\overline{\eta }_t,n}`$ from Definition 5.2 holds, now $`y_{\overline{\eta }_t,n},y_{\overline{\eta }_t,n+1}G_{Uu}^{}`$. So in order to deduce from the equation that $`x=x_{m,\overline{\eta },\nu }=x_{m_t,\overline{\eta }_t^{},\eta _{t,m_t}n}`$ belongs to $`G_{Uu}`$, it suffices to show that $`x_{j,\overline{\eta }_{t,j}^{},\eta _{t,j}n}G_{Uu}^{}`$ for each $`jk(),jm_t`$. But each such $`x_{j,\overline{\eta }_{t,j}^{},\eta _{t,j}n}`$ belong to $`G_{Uu}^{}`$ as it belongs to $`Y_1Y_2`$.

\[Why? Otherwise necessarily for some $`r<t^{}`$ we have $`j=m_r,\overline{\eta }_{t,j}^{}=\overline{\eta }_{r,m_r}^{}`$ and $`\eta _{r,m_r}s_r\mathrm{}\eta _tn\eta _{r,m_r}`$ so $`ns_r`$ and as said above $`ns_t`$. Clearly $`rt`$ as $`m_r=jm_t`$, now as $`\overline{\eta }_{t,m_r}^{}=\overline{\eta }_{r,m_r}^{}`$ and $`\overline{\eta }_t\overline{\eta }_r`$ (as $`tr`$) clearly $`\eta _{t,m_r}\eta _{r,m_r}`$. Also $`\neg (r<t)`$ by $`()`$ above applied with $`r,t`$ here standing for $`t_1,t`$ there as $`\eta _{r,m_r}s_r\mathrm{}\eta _{t,j}n\eta _{r,m_r}`$. Lastly for if $`t<r`$, again $`()`$ applied with $`t,r`$ here standing for $`t_1,t`$ there as $`nm_t`$ gives contradiction.\]

So indeed $`xG_{Uu}^{}`$.

Second consider $`y=y_{\overline{\eta },n}G_{Uu}`$, if $`yY^{}`$ then $`yG_{U,u}G_{Uu}^{}`$, so assume $`yY^{}`$. If $`yY_3`$ we are done, so assume $`yY_3`$, so for some $`t,\overline{\eta }=\overline{\eta }_t`$ and $`n<s_t`$. We prove by downward induction on $`ss_t`$ that $`y_{\overline{\eta },s}G_{Uu}^{}`$, this clearly suffices. For $`s=s_t`$ we have $`y_{\overline{\eta },s}Y_3G_{Uu}^{}`$; and if $`y_{\overline{\eta },s+1}G_{Uu}^{}`$ use the equation $`_{\overline{\eta }_t,s}`$ from 5.2, in the equation $`y_{\overline{\eta },s+1}G_{Uu}^{}`$ and the $`x`$’s appearing in the equation belong to $`G_{Uu}^{}`$ by the earlier part of the proof (of $`()_1`$) so necessarily $`y_{\overline{\eta },s}G_{Uu}^{}`$, so we are done.

Proof of $`()_2`$. We rewrite the equations in the new variables recalling that $`G_{Uu}`$ is generated by the relevant variables freely except the equations of $`_{\overline{\eta },n}`$ from Definition 5.2. After rewriting, all the equations disappear.

Case 2: $`U`$ is uncountable.

As $`\mathrm{}_1|U|\mathrm{}_{k()k}`$, necessarily $`k<k()`$.

Let $`U=\{\rho _\alpha :\alpha <\mu \}`$ where $`\mu =|U|`$, list $`U`$ with no repetitions. Now for each $`\alpha |U|`$ let $`U_\alpha :=\{\rho _\beta :\beta <\alpha \},u_\alpha =u\{\rho _\alpha \}`$. Now

Hence it suffices to prove that for each $`\alpha <|U|`$ the group $`(G_{U,u}+G_{U_{\alpha +1}u})/(G_{U,u}+G_{U_\alpha u})`$ is free. But easily

2) If $`k()=0`$ just use ?, so assume $`k()1`$. Now the proof is similar to (but easier than) the proof of case (2) inside the proof of part (1) above.

$`\mathrm{}_\mathrm{?}`$

###### \stag{6.6} Claim

If $`U{}_{}{}^{\omega }2`$ and $`|U|\mathrm{}_{k()+1}`$

then $`G_U`$ is not free.

Proof. Assume toward contradiction that $`G_U`$ is free and let $`\chi `$ be large enough; for notational simplicity assume $`|U|=\mathrm{}_{k()+1}`$. O.K. as a subgroup of a free abelian group is a free abelian group. We choose $`N_{\mathrm{}}`$ by downward induction on $`\mathrm{}k()`$ such that

Let $`G_{\mathrm{}}=G_UN_{\mathrm{}}`$, a subgroup of $`G_U`$. Now

Now

Now for $`\mathrm{}=0`$ choose $`\eta _{\mathrm{}}^{}U_{\mathrm{}}^2`$, possible by $`()_2`$ above. Then for $`\mathrm{}>0,\mathrm{}k()`$ choose $`\eta _{\mathrm{}}^{}U_{0,\mathrm{}}^3`$. This is possible by $`()_3`$. So clearly

Let $`\overline{\eta }^{}=\eta _{\mathrm{}}^{}:\mathrm{}k()`$ and let $`G^{}`$ be the subgroup of $`G_U`$ generated by $`\{x_{m,\overline{\eta },\nu }:mk()`$ and $`\overline{\eta }{}_{}{}^{k()+1\backslash \{m\}}U`$ and $`\nu {}_{}{}^{\omega >}2\}\{y_{\overline{\eta },n}:\overline{\eta }{}_{}{}^{k()+1}U\text{ but }\overline{\eta }\overline{\eta }^{}`$ and $`n<\omega \}`$. Easily $`G_{\mathrm{}}G^{}`$ recalling $`G_{\mathrm{}}=N_{\mathrm{}}G_U`$ hence $`\mathrm{\Sigma }\{G_{\mathrm{}}:\mathrm{}k()\}G^{}`$, but $`y_{\overline{\eta }^{},0}G^{}`$ hence

But for every $`n`$

We can conclude that in $`G_U/\{G_{\mathrm{}}:\mathrm{}k()\}`$, the element $`y_{\overline{\eta }^{},0}+\{G_{\mathrm{}}:\mathrm{}k()\}`$ is not zero (by $`()_5`$) but is divisible by every natural number by $`()_6`$.

This contradicts $`()_0`$ so we are done. $`\mathrm{}_\mathrm{?}`$

5.4 Conclusion. $`G_{k()}`$ is a Borel and even $`F_\sigma `$ abelian group which is $`\mathrm{}_{k()+1}`$-free but if $`2^\mathrm{}_0\mathrm{}_{k()+1}`$ is not free and even not $`\mathrm{}_{k()+2}`$-free.

Proof. $`G_{k()}`$ is Borel and $`F_\sigma `$ by ?, it is $`\mathrm{}_{k()+1}`$-free by ? and if $`2^\mathrm{}_0\mathrm{}_{k()+1}`$ it is not $`\mathrm{}_{k()+2}`$-free by ?. $`\mathrm{}_{5.4}`$

Blass asks

5.5 Question: Suppose (a) + (b) below, does it follow that forcing with $``$ add reals?

Now

5.6 Fact: For just Borel abelian group $`G`$: if CH, then the answer to 5.5 is yes, if not CH then the answer is not for $`=\text{ Levy}(\mathrm{}_1,2^\mathrm{}_0)`$.

Proof. First, assume CH holds and $`G`$ is as in (a) of 5.5; (or just defined absolutely enough such that $`G^𝕍`$ is a subgroup of $`G^𝕍^{}`$ for any forcing notion $``$ and is still not free). Then by \[\Sh:402 \] the group $`G^𝕍`$ is non-free in some strong way such that no forcing not collapsing $`2^\mathrm{}_0`$ to $`\mathrm{}_0`$ can make it free (that is, for some countable $`G_0G^𝕍,G_0^𝕍/G`$ contains the direct sum of $`2^\mathrm{}_0`$ finite rank non-free abelian groups). This is a strong yes answer.

On the other hand, if $`2^\mathrm{}_0>\mathrm{}_1`$ we can find such group: for $`k()1`$, our $`G_{k()}`$ if $`\mathrm{}_1<\mathrm{}_{k()+1}2^\mathrm{}_0`$, see below, is a strong negative answer. So together this gives answers to a question of Blass. $`\mathrm{}_{5.6}`$

###### \stag{6.12} Corollary

1) The group $`G_{k()}`$ is embeddable into $`{}_{}{}^{\omega }`$, even purely.

2) Hence forcing which does not add bounded subsets to $`\mathrm{}_{k()}`$ can make it free (i.e. Levy$`(\mathrm{}_{\mathrm{}},2^\mathrm{}_0)`$ if $`\mathrm{}k()`$ while if our universe satisfies $`2^\mathrm{}_0>\mathrm{}_{k()}`$ it is not free there).

Proof. 1) For every $`n<\omega `$ we define a function $`f_n`$ from $`Y`$ to $`G_{k()}`$ where $`Y`$ is the set of generators of $`G_{k()}`$, i.e.

$`Y=\{y_{\overline{\eta },n+1}:`$ $`n<\omega ,\overline{\eta }{}_{}{}^{k()+1}({}_{}{}^{\omega }2)\}\{x_{m,\overline{\eta }_m,\nu }:mk(),`$
$`\overline{\eta }{}_{}{}^{\{\mathrm{}:\mathrm{}k(),\mathrm{}n\}}({}_{}{}^{\omega }2)\text{ and }\nu {}_{}{}^{\omega >}2\}.`$
First define a function $`h_n`$: for $`\eta {}_{}{}^{\omega }2,g_n(\eta )`$ is a sequence of length $`\mathrm{}g(\eta )`$ and

$`(h_n(\eta ))(\mathrm{})=\{\begin{array}{cc}\eta (\mathrm{})\hfill & \text{ if }\mathrm{}<n\&\mathrm{}<\mathrm{}g(\eta )\hfill \\ 0\hfill & \text{ if }\mathrm{}n\&\mathrm{}<\mathrm{}g(\eta )\hfill \end{array}`$ .

For $`\overline{\eta }=\eta _{\mathrm{}}:\mathrm{}u{}_{}{}^{u}({}_{}{}^{\omega }2)`$ we let $`h_n(\overline{\eta })=f_n(\eta _{\mathrm{}}):\mathrm{}u`$.

Lastly, let

$$f_n(y_{\overline{\eta },n+1})=y_{h_n(\overline{\eta }),n+1}$$

$$f_n(x_{m,\overline{\eta }_m,\nu })=x_{m,h_n(\overline{\eta }_m),h_n(\nu )}.$$

Does $`f_n`$ induce a homomorphism from $`G_{k()}`$ into $`G_{k()}`$? For this it is enough to check that for every one of the relations from Definition 5.2, its $`f_n`$-image is satisfied in $`G_{k()}`$, but this is obvious as it is mapped to another one of the equations in the definition of $`G_{k()}`$: the equation in $`_{\overline{\eta },m}`$ is mapped to the equation in $`_{g_n(\overline{\eta }),m}`$.

So $`f_n`$ extends to an endomorphism $`\widehat{f}_n`$ of $`G_{k()}`$. Easily

Now the range of $`\widehat{f}_n`$ is clearly countable hence free, say is $`\underset{\mathrm{}<\omega }{}z_{n,\mathrm{}}`$. Hence for some homomorphisms $`g_{n,\mathrm{}}`$ from Range$`(f_n)`$ to $``$ for $`\mathrm{}<\omega `$ we have

$`z\text{ Rang}(\widehat{f}_n)`$ $`z=\mathrm{\Sigma }\{g_{n,\mathrm{}}(z)z_{n,\mathrm{}}:\mathrm{}<\omega \}`$
$`\text{where }g_{n,\mathrm{}}(z)=0\text{ for every }\mathrm{}\text{ large enough}`$
Let $`f_{n,\mathrm{}}=g_{n,\mathrm{}}\widehat{f}_n\text{ Hom}(G_{k()},)`$. Those homomorphisms give, by renaming the $`f_{n,\mathrm{}}`$’s, an embedding of $`G_{k()}`$ into $`{}_{}{}^{\omega }`$. Looking at the construction, it is a pure one.

2) By ?. $`\mathrm{}_\mathrm{?}`$

###### \stag{6.16} Claim

Assume MA $`+2^\mathrm{}_0>\mathrm{}_2`$.

If $`k()>2`$

then $`G=G_{k()}`$ is a Whitehead Borel (abelian) group.

Proof. By ? we know that $`G_{k()}`$ is a Borel group. Let $`\eta _\alpha :\alpha <2^\mathrm{}_0`$ list $`{}_{}{}^{\omega }2`$ with no repetitions and $`𝒰_\alpha =\{\beta :\beta <\alpha \}`$.

So $`𝒰_\alpha :\alpha <2^\mathrm{}_0`$ be $``$-increasing continuous with union $`{}_{}{}^{\omega }2`$ such that $`𝒰_0=\mathrm{},|𝒰_\alpha ||\alpha |`$; and let $`H_\alpha :=G_{𝒰_\alpha }`$, see Definition 5.3(1). So $`H_\alpha :\alpha <2^\mathrm{}_0`$ is a $``$-increasing continuous sequence of subgroups of $`G`$ with union $`G`$. For $`\alpha <2^\mathrm{}_0`$, letting $`u_\alpha =\{u_\alpha \}`$ recalling Definition 5.3 we hae $`G_{𝒰_\alpha u_\alpha }=G_{𝒰_{\alpha +1}}=H_{\alpha +1}`$ and $`G_{U_\alpha ,u_\alpha }=G_{𝒰_\alpha }=H_\alpha `$, hence $`H_{\alpha +1}/H_\alpha =G_{𝒰_\alpha u_\alpha }/G_{𝒰_\alpha ,u_\alpha }`$ and by ?(1) the latter group is $`\mathrm{}_2`$-free so $`H_{\alpha +1}/H_\alpha `$ is $`\mathrm{}_2`$-free. As MA holds and $`|H_{\alpha +1}/H_\alpha |<2^\mathrm{}_0`$ and $`H_{\alpha +1}/H_\alpha `$ is $`\mathrm{}_2`$-free we know that it is a Whitehead group.

As $`H_\alpha `$ is $``$-increasing continuous, $`H_0=\{0\}`$ and each $`H_{\alpha +1}/H_\alpha `$ is a Whitehead group, it follows that $`\{H_\alpha :\alpha <2^\mathrm{}_0\}`$ is a Whitehead group, which means that $`G`$ is as required. $`\mathrm{}_\mathrm{?}`$

## §6 Beginning of stability theory

We may consider the dividing line for abelian groups from \[\Sh:402 \] and try to generalize it for any simply defined (e.g. $`\mathrm{\Sigma }_1^1`$ or Borel) model. We deal with having two possibilities, in the high, complicated side we get a parallel of non $`\mathrm{}_0`$-stability; in the low side we have a rank. But even for minimal formulas, the example in §5 shows that we are far from being done, still we may be able to say something on the structure.

We may consider also ranks parallel to the ones for superstable theories. Note that there are two kinds of definability we are considering: the model theoretic one and the set theoretic one. See more in \[\Sh:F562 \].

6.1 Convention. If not said otherwise, $`𝔄`$ will be a structure with countable vocabulary and its set of elements is a set of reals.

###### Definition 6.2 Definition

1) For a structure $`𝔄`$, an $`𝔄`$-formula $`\phi `$ is a formula in the vocabulary of $`𝔄`$ with finitely many free variables, writing $`\phi =\phi (\overline{x})`$ means that $`\overline{x}`$ is a finite sequence of variables with no repetitions including the free variables of $`\phi `$. We did not specify the logic; we may assume it is $`𝕃_{\omega _1,\omega }`$ or even $`𝕃_{\omega _1,\omega }()`$ where $``$ is the quantifier “there are uncountably many”.

2) $`\mathrm{\Delta }`$ denotes a set of such formulas and $`\overline{\phi }`$ a pair $`(\phi _0(\overline{x}),\phi _1(\overline{x}))`$ of formulas so $`\overline{\phi }`$ is a $`\mathrm{\Delta }`$-pair if $`\phi _0,\phi _1\mathrm{\Delta }`$.

3) We say $`\phi `$ (or $`\mathrm{\Delta }`$ or $`\overline{\phi }`$) is $`\mathrm{\Sigma }_1^1`$ (or $`\mathrm{\Sigma }_2^1`$ or $`\mathrm{\Delta }_0^1`$ (= Borel))

if they are so as set theoretic formulas.

###### Definition 6.3 Definition

1) We say $`(𝔄,\mathrm{\Delta })`$ is a $`\mathrm{\Sigma }_1^1`$-candidate

when:

We can replace being $`\mathrm{\Sigma }_1^1`$ by $`\mathrm{\Sigma }_2^1`$, etc., (naturally we need enough absoluteness); if we replace it by $`\mathrm{\Gamma }`$ we write $`\mathrm{\Gamma }`$-candidate. If $`\mathrm{\Gamma }`$ does not appear we mean it is $`\mathrm{\Sigma }_1^1`$ or understood from the content normal.

2) If $`(𝔄,\mathrm{\Delta })`$ is a candidate we say $`𝔄`$ is locally $`(\mathrm{}_0,\mathrm{\Delta })`$-stable (or $`(𝔄,\mathrm{\Delta })`$ is $`\mathrm{}_0`$-stable), but we may omit “locally”; when $`\mathrm{\Delta }`$ is a countable set of $`𝔄`$-formulas and for $`\chi `$ large enough and $`x(\chi )`$, for every countable $`N((\chi ),,<_\chi ^{})`$ to which $`x`$ belongs and $`\overline{a}{}_{}{}^{m}𝔄`$ where $`m<\omega `$ the following weak definability condition on tp$`{}_{\mathrm{\Delta }}{}^{}(\overline{a},N𝔄,𝔄)`$ holds:

3) We say that $`(𝔄,\mathrm{\Delta })`$ is $`\mathrm{}_0`$-unstable (or $`𝔄`$ is $`(\mathrm{}_0,\mathrm{\Delta })`$-unstable) if: there are $`\overline{a}_\eta {}_{}{}^{m}𝔄`$ for $`\eta {}_{}{}^{\omega }2`$ and $`\phi _{\nu ,0}(\overline{x},\overline{y}_\nu )\mathrm{\Delta }`$ and $`\phi _{\nu ,1}(\overline{x},\overline{y}_\nu )\mathrm{\Delta }`$ and $`\overline{b}_\nu {}_{}{}^{\mathrm{}g(\overline{y})}𝔄`$ for $`\nu {}_{}{}^{\omega >}2`$ such that:

There are obvious absoluteness results (for $`\overline{\phi }\mathrm{\Phi }_{(𝔄,\mathrm{\Delta })}^m,(𝔄,\mathrm{\Delta })`$ is $`\mathrm{}_0`$-unstable and stable).

6.4 Observation. 1) If $`\mathrm{\Delta }`$ is closed under negation then in Definition 6.3(2) we have

2) In Definition 6.3(2) we can fix $`x=(𝔄,\mathrm{\Delta })`$ and omit $`<_\chi ^{}`$, at the expense of larger $`\chi `$.

Proof. Straight.

###### \stag{7.4} The End-Extention Indiscernibility existence lemma

Assume $`(𝔄,\mathrm{\Delta })`$ is an $`\mathrm{}_0`$-stable candidate.

1) In Definition 6.3(2), the demand “$`N`$ is countable” can be omitted.

2) Assume $`\mathrm{\Delta }`$ is closed under negation and permuting the variables, $`m<\omega ,\overline{a}_\alpha {}_{}{}^{m}𝔄`$ for $`\alpha <\lambda `$ and $`\mathrm{}_0<\lambda =\text{cf}(\lambda )`$ and $`S\lambda `$ is stationary and $`A𝔄`$ has cardinality $`<\lambda `$.

Then for some stationary $`S^{}S`$ the sequence $`\overline{a}_\alpha :\alpha S^{}`$ is a $`\mathrm{\Delta }`$-end extension indiscernible sequence over $`A`$ in $`𝔄`$ (see Definition ?(4),(5) below).

3) Moreover for any pregiven $`n<\omega `$ we can find stationary $`S^{}S`$ such that $`\overline{a}_\alpha :\alpha S^{}`$ is $`(\mathrm{\Delta },n)`$-end extension indiscernible over $`A`$ in $`𝔄`$.

4) We can find a club $`E`$ of $`\lambda `$ and regressive function $`f_n`$ on $`SE`$ for $`n<\omega `$ such that:

then $`f_{n+1}(\alpha )=f_{n+1}(\beta )f_n(\alpha )=f_n(\beta )`$

” $`(ii)`$” if $`n<\omega `$ and $`\gamma <\lambda `$, then the sequence $`\overline{a}_\alpha :\alpha SE,f_n(\alpha )=\gamma `$ is $`(\mathrm{\Delta },n)`$-end extension indiscernible over $`A`$

” $`(ii)^+`$” moreover, if $`n<\omega `$ and $`\beta ,\gamma <\lambda `$ then $`\overline{a}_\alpha :\alpha SE\backslash \beta \&f_n(\alpha )=\gamma `$ is $`(\mathrm{\Delta },n)`$-end extension indiscernible over $`A\{\overline{a}_\gamma :\gamma <\beta \}`$.

Remark. Similar to \[\Sh:c , III,4.23,pg.120-1\], but before proving we define:

###### Definition 6.5 Definition

1) Let $`(𝔄,\mathrm{\Delta })`$ be a candidate. We say “$`𝔄`$ has $`(\lambda ,\mathrm{\Delta })`$-order” when:

2) We say $`\overline{\phi }(\overline{x},\overline{y})`$ linear orders $`𝕀{}_{}{}^{m(\lambda )}𝔄`$

if for some $`\overline{a}_t:tI`$ we have:

3) For a linear order $`I`$ (e.g. a set of ordinals), we say $`\overline{a}_t:tJ`$ is a $`\mathrm{\Delta }`$-end-extension indiscernible (sequence over $`A`$) if for any $`n<\omega `$ and $`t_0<_J<\mathrm{}<_Jt_{n1}<_Jt`$, the sequences $`\overline{a}_{t_0}\mathrm{^}\mathrm{}\overline{a}_{t_{n2}}\mathrm{^}\overline{a}_{t_{n1}}`$ and $`\overline{a}_{t_0}\mathrm{^}\mathrm{}\mathrm{^}\overline{a}_{t_{n2}}\mathrm{^}\overline{a}_{t_n}`$ realizes the same $`\mathrm{\Delta }`$-type (over $`A`$) in $`𝔄`$.

4) We say that $`\overline{a}_t:tJ`$ is $`(\mathrm{\Delta },n_0,n_1)`$-end-extension indiscernible over $`A`$ in $`𝔄`$ when:

then $`\overline{a}_{r_0}\mathrm{^}\mathrm{}\mathrm{^}\overline{a}_{r_{n_01}}\mathrm{^}\overline{a}_{s_0}\mathrm{^}\mathrm{}\mathrm{^}\overline{a}_{s_{n_11}}`$ and

$`\overline{a}_{r_0}\mathrm{^}\mathrm{}\mathrm{^}\overline{a}_{r_{n_01}}\mathrm{^}\overline{a}_{t_0}\mathrm{^}\mathrm{}\mathrm{^}\overline{a}_{t_{n_11}}`$ realizes the same $`\mathrm{\Delta }`$-type over $`A`$ in $`𝔄`$

” $`(c)`$” if $`J`$ has a last element we allow to decrease $`n_0`$ and/or $`n_1`$. 5) If we omit $`n_0`$ this means for every $`n_0`$, (so “$`\mathrm{\Delta }`$-end extension…” means $`(\mathrm{\Delta },1)`$-end extension.

Proof of ?. 1) Let $`N^{}((\chi ),,<_\chi ^{})`$ be such that $`𝔄,\mathrm{\Delta }N^{}`$. Now for every countable $`NN^{}`$ to which $`(𝔄,\mathrm{\Delta })`$ belongs there is $`𝕔_NN`$ as mentioned in the definition 6.4(2). Hence by normality of the club filter on $`[N^{}]^\mathrm{}_0`$, the family of countable subsets of $`N^{}`$, for some $`𝕔^{}`$ the set $`=\{N:NN^{}`$ is countable and $`𝕔_N=𝕔^{}\}`$ is a stationary subset of $`[N^{}]^\mathrm{}_0`$, so $`𝕔^{}`$ can serve for $`N`$.

2) Let $`N_\alpha :\alpha <\lambda `$ be an increasing continuous sequence of elementary submodels of $`((\chi ),,<_\chi ^{})`$ to which $`𝔄`$ belongs, such that $`N_\alpha <\lambda ,N_\alpha \lambda \lambda `$ and $`\alpha N_\alpha `$ and $`\overline{a}_\alpha :\alpha <\lambda N_0`$ (hence $`\overline{a}_\alpha N_{\alpha +1}`$). For each $`\alpha S`$, applying ?(1) to $`N_\alpha ,\overline{a}_\alpha `$ we get $`𝕔_\alpha N_\alpha `$ as in Definition 6.3(2). So for some $`𝕔^{}`$ and some stationary subsets of $`S^{}S`$ of $`\lambda `$ we have $`\alpha S^{}𝕔_\alpha =𝕔^{}`$. Now $`\mathrm{\Delta }`$-end extension indiscernibility follows.

3) We prove this by induction on $`n`$:

For $`n=0`$ the demand is empty so $`S^{}=S`$ is as required. For $`n=1`$ apply part (2). For $`n+1>1`$ by the induction hypothesis we can find stationary $`S_1S`$ as required in $`_\lambda ^n`$. For each $`\alpha <\lambda `$ we can choose $`\beta _{\alpha ,\mathrm{}}=\beta (\alpha ,\mathrm{})`$ for $`\mathrm{}n`$ such that $`\alpha =\beta _{\alpha ,0}<\beta _{\alpha ,1}<\mathrm{}<\beta _{\alpha ,n}`$ and $`0<\mathrm{}n\beta _{\alpha ,\mathrm{}}S_1`$. Let $`\overline{a}_\alpha ^{}=\overline{a}_{\beta _{\alpha ,0}}\mathrm{^}\mathrm{}\mathrm{^}\overline{a}_{\beta _{\alpha ,n}}`$ so $`\overline{a}_\alpha ^{}{}_{}{}^{m(n+1)}𝔄`$ and apply the induction hypothesis to $`m\times (n+1),S_1,\overline{a}_\alpha ^{}:\alpha <\lambda `$ getting a stationary $`S_2S_1`$ as required in $`_\lambda ^n`$.

We claim that $`S_2`$ is as required. So assume $`\beta \alpha _0^{}<\mathrm{}<\alpha _n^{}<\lambda ,\beta `$ and $`\beta \alpha _0^{\prime \prime }<\mathrm{}<\alpha _n^{\prime \prime }<\lambda `$ and $`\alpha _{\mathrm{}}^{},\alpha _{\mathrm{}}^{\prime \prime }S_2`$. Now

By (i)-(v) the set $`S_2`$ is as required in $`_\lambda ^{n+1}`$.

4) The proofs of parts (2), (3) actually give this. $`\mathrm{}_\mathrm{?}`$

###### \stag{7.7} The order/unstability lemma

Assume that

or $`J`$ is uncountable with density $`\mu <|J|`$.

Then $`(𝔄,\mathrm{\Delta })`$ is $`\mathrm{}_0`$-unstable; even more specifically the demand in Definition 6.3(3) holds with $`\phi _{\nu ,0}=\phi _0,\phi _{\nu ,1}=\phi _1`$.

6.6 Question: What can $`\{\lambda :𝔄`$ has a $`(\mathrm{\Delta },\lambda )`$-order$`\}`$ be?

We first prove a claim from which we can derive the lemma.

###### \stag{7.7A} Claim

Assume

then for some $`B_0,B_1𝒫_\alpha `$ and pair $`(\phi _0(\overline{x},\overline{b}),\phi _1(\overline{x},\overline{b}))\mathrm{\Phi }`$ we have $`\mathrm{}<2\&\overline{a}B_{\mathrm{}}𝔄\phi _{\mathrm{}}(\overline{a},\overline{b})`$

” $`(e)`$” if $`B𝒫_\beta `$ and $`\alpha <\beta <\omega _1`$ and $`F`$ is a function with domain $`B`$ and countable range,

then there is $`B^{}𝒫_\alpha `$ such that $`B^{}B`$ and $`FB^{}`$ is constant

” $`(f)`$” if $`\mathrm{}()=2`$ we then in clause (e), on Rang$`(F)`$ we demand just $`|\text{Rang}(F)|\mathrm{}_1`$. Then $`(𝔄,\mathrm{\Delta })`$ is $`\mathrm{}_0`$-unstable.

Proof of ? from ?.

Let $`\mathrm{\Phi }=\{(\phi _0(\overline{x},\overline{y}),\phi _1(\overline{x},\overline{y})\}`$ and for $`\alpha <\omega _{\mathrm{}()}`$ let

$$𝒫_\alpha =\{𝕀:𝕀{}_{}{}^{m}𝔄\text{ is linearly ordered by }\overline{\phi }\text{ and has cardinality }\mathrm{}_\alpha \}.$$

This should be clear. $`\mathrm{}_\mathrm{?}`$

Proof of ?. For each $`\phi (\overline{x})\mathrm{\Delta }`$ as $`\{\overline{a}{}_{}{}^{\mathrm{}g(\overline{x})}𝔄:𝔄\phi [\overline{a}]\}`$ is a $`\mathrm{\Sigma }_{\mathrm{}()}^1`$-set and let $`\{\overline{a}{}_{}{}^{\mathrm{}g(\overline{x})}𝔄:𝔄\phi ([\overline{a}])\}=\{\overline{a}`$:for some $`\alpha <\omega _{\mathrm{}()}`$ and $`\nu {}_{}{}^{\omega }\omega ,(\overline{a},\nu )_{\phi ,\alpha }\}`$ where for each $`\alpha <\omega _{\mathrm{}()1}`$ we have $`_{\phi ,\alpha }`$ closed subset of $`{}_{}{}^{(\mathrm{}g(\overline{x})+1)}({}_{}{}^{\omega }\omega )`$. We can find $`F_0,F_1`$ such that if $`\phi (\overline{x})\mathrm{\Delta }`$ and $`𝔄\phi (\overline{a})`$ then $`F_\phi ^0(\overline{a})<\omega _{\mathrm{}()1}`$ and $`F_\beta ^1(\overline{a}){}_{}{}^{\omega }\omega `$ witnessing this. For notational simplicity and without loss of generality$`m=1`$. Let $`W=\{w:w{}_{}{}^{\omega >}2`$ is a front hence finite$`\}`$.

For $`wW`$ and $`n<\omega `$ let $`Q_{n,w}`$ be the family of objects $`𝔵=(n,\overline{a},\overline{u},\overline{\nu },\overline{\phi })=(n^𝔵,\mathrm{\Gamma }^𝔵,\mathrm{})`$ such that:

Clearly

then there is $`𝔶_\alpha ^1:\alpha <\omega _{\mathrm{}()}`$ such that $`𝔶_\alpha ^1`$ is an $`\alpha `$-witness for $`𝔵Q_{n,w}`$ and $`F_\rho (\overline{a}^𝔶,\overline{b}_\rho ):\rho w`$ is the same for all $`b_\rho B_\rho ^{𝔶_\alpha },\alpha <\omega _{\mathrm{}()}`$ where $`\mathrm{}g(\overline{a})=n`$

\[why? as $`𝔵_1Q_{n,\omega }`$ we know that for some unbounded $`Y\omega _{\mathrm{}()}`$ for each $`\alpha _1Y`$ there is an $`\alpha `$-witness $`a_{\mathrm{}}^\alpha :\mathrm{}<n\mathrm{^}B_\rho ^\alpha :\rho w`$ as required in $`()_{n,\omega }`$. Let $`\alpha <\omega _1`$ and $`\beta (\alpha )=\text{ Min}(Y\backslash (\alpha +1))`$. Now for each $`\rho w`$ as $`B_\rho ^{\beta (\alpha )}𝒫_{\beta (\alpha )}`$ and the set $`\{F_\rho (a_0^{\beta (\alpha )},\mathrm{},a_{n1}^{\beta (\alpha )},\overline{b}):\overline{b}B_\rho ^\beta \}`$ is countable, by clause (d) of the assumption we can find $`c_\rho ^\alpha `$ such that $`B_\rho ^{\alpha ,}\{bB_\rho ^{\beta (\alpha )}:F_\rho (a_0^{\beta (\alpha )},\mathrm{},a_{n1}^{\beta (\alpha )},b)=c_\rho ^\alpha \}`$ belong to $`𝒫_\alpha `$. As the set $`\{c_\rho ^\alpha :\rho w:\alpha <\omega _{\mathrm{}()}\}`$ is countable, there is a sequence $`c_\rho ^{}:\rho w`$ such that the set $`Y^{}=\{\alpha <\omega _1:c_\rho ^\alpha =c_\rho ^{}`$ for $`\rho \omega \}`$ is uncountable for $`\alpha <\omega _{\mathrm{}()},\gamma _\alpha =\text{ Min}(Y^{}\backslash \alpha )`$ and $`𝔶_\alpha =(a_{\mathrm{}}^{\beta (\gamma _\alpha )}:\mathrm{}<n),B_\rho ^{\beta (\gamma _\alpha ),}:\rho w)`$. Clearly $`𝔶_\alpha :\alpha <\omega _{\mathrm{}()}`$ is as required.\]

” $`()_3`$” if $`𝔵_1Q_{n,w}`$ and $`\rho w`$ and $`u=(w\backslash \{\rho \})\{\rho \mathrm{^}<0>,\rho \mathrm{^}<1>\}`$, then there is $`𝔵_2Q_{n+1,u}`$ such that:

then $`𝔶_\alpha ^{}=(a_{\mathrm{}}:\mathrm{}<n,B_\rho ^{}:\rho w)`$ is an $`\alpha `$-witness for $`𝔵_1`$ where $`B_\rho ^{}`$ is $`B_\rho ^{𝔶_2}`$ if $`\rho uw`$ and $`B_\rho ^{}=B_{\rho \mathrm{^}<0>}^{𝔶_2}B_{\rho \mathrm{^}<1>}^{𝔶_2}`$ if $`\rho =\rho `$.

\[why? similar to the proof of $`()_2`$ using clause (e) of the assumption this time.\] Together it is not hard to prove the non $`\mathrm{}_0`$-unstability (as in \[\Sh:522 \]). . $`\mathrm{}_\mathrm{?}`$

6.7 Remark. 1) This claim can be generalized replacing $`\mathrm{}_0`$ by $`\mu `$, strong limit singular of cofinality $`\mathrm{}_0`$.

$``$

###### Definition 6.8 Definition

1) tp$`{}_{\mathrm{\Delta }}{}^{}(\overline{a},A,𝔄)=\{\phi (\overline{x},\overline{b}):\phi (\overline{x},\overline{y})\mathrm{\Delta }`$ and $`b{}_{}{}^{\mathrm{}g(\overline{y})}(A)`$ and $`𝔄\phi [\overline{a},\overline{b}]\}`$.

2) $`\mathrm{\Phi }_{𝔄,\mathrm{\Delta },A}^{pr,m}=\{(\phi _0(\overline{x},\overline{b}),\phi _1(\overline{x},\overline{b})):\phi _0(\overline{x},\overline{y}),\phi _1(\overline{x},\overline{y})`$ belongs to $`\mathrm{\Delta }`$ and $`\overline{b}{}_{}{}^{\mathrm{}g(\overline{y})}A`$ and $`\overline{x}=x_{\mathrm{}}:\mathrm{}<m`$ and $`𝔄\neg (\overline{x})[\phi _0(\overline{x},\overline{b})\&\phi _1(\overline{x},\overline{b})]\}`$

where $`A𝔄,\mathrm{\Delta }`$ a set of $`𝔄`$-formulas, and so

$`\mathrm{\Phi }_{𝔄,\mathrm{\Delta }}^{pr,m}=\{(\phi _0(\overline{x},\overline{y}),\phi _1(\overline{x},\overline{y})):\phi _0,\phi _1\mathrm{\Delta },𝔄\neg \overline{y}\overline{x}[\phi _0(\overline{x},\overline{y})\&\phi _1(\overline{x},\overline{y})]\}`$.

3) $`𝕊_\mathrm{\Delta }^m(A,𝔄)=\{\text{tp}_\mathrm{\Delta }(\overline{a},A,𝔄):\overline{a}{}_{}{}^{m}𝔄\}`$ where $`A𝔄`$ and $`\mathrm{\Delta }`$ a set of $`𝕃(\tau _𝔄)`$-formulas

###### Definition 6.9 Definition

1) We say $`(𝔄,\mathrm{\Delta })`$ is $`(\mu ,\mathrm{\Delta },\lambda )`$-unstable

if there are $`M𝔄,m<\omega `$ and $`\overline{a}_\alpha :\alpha <\lambda `$ such that:

1A) Let $`𝔄`$ be $`(\mathrm{}_0,\mathrm{\Delta },\text{per})`$-unstable mean that $`(𝔄,\mathrm{\Delta })`$ is $`\mathrm{}_0`$-unstable; here per stands for perfect.

2) We add “weakly” if we weaken clause (b) to

3) We use $`(\mu _0,\mathrm{\Delta },x,)`$ where $``$ is a forcing notion if the example is found in $`𝕍^{}`$ such that usually $`M`$ is in $`𝕍`$ and we add an additional possibility if $`x=\text{ per}^𝕍`$ then $`M𝕍`$ and $`X=({}_{}{}^{\omega }2)^𝕍`$ (here per stands for perfect).

4) We may replace “a forcing notion $``$” by a family $`𝔎`$ of forcing notions (e.g. the family of c.c.c. ones) meaning: for at least one of them.

5) We replace stable by unstable for the negation.

$``$

6.10 Observation: 1) If $`\mathrm{\Delta }`$ is closed under negation, then $`𝔄`$ is weakly $`(\mathrm{}_0,\mathrm{\Delta },\lambda )`$-unstable iff $`𝔄`$ is $`(\mathrm{}_0,\mathrm{\Delta },\lambda )`$-unstable.

###### Definition 6.11 Definition

Let $`(𝔄,\mathrm{\Delta })`$ be a $`\mathrm{\Sigma }_{\mathrm{}()}^1`$-candidate where $`\mathrm{}()\{1,2\}`$. For $`m<\omega `$ and $`B{}_{}{}^{m}𝔄`$ we define rk$`{}_{}{}^{\mathrm{}()}(B)=\text{ rk}^{\mathrm{}()}(B,\mathrm{\Delta },𝔄)`$, an ordinal or infty or $`1`$ by defining for any ordinal $`\alpha `$ when rk$`{}_{}{}^{\mathrm{}()}(B)\alpha `$ by induction on $`\alpha `$.

Case 1: $`\alpha =0`$.

rk$`{}_{}{}^{\mathrm{}()}(B)\alpha `$ iff $`B\mathrm{}`$.

Case 2: $`\alpha `$ limit.

rk$`{}_{}{}^{\mathrm{}()}(B)\alpha `$ iff rk$`{}_{}{}^{\mathrm{}()}(B)\beta `$ for every $`\beta <\alpha `$.

Case 3: $`\alpha =\beta +1`$.

rk$`{}_{}{}^{\mathrm{}()}(B)\alpha `$ iff (a) + (b) holds where

6.12 Observation: Assume $`(𝔄,\mathrm{\Delta })`$ is $`\mathrm{}_{\mathrm{}()}`$-candidate, $`\mathrm{}()\{1,2\}`$.

1) If $`\alpha \beta `$ are ordinals and rk$`{}_{}{}^{\mathrm{}()}(B)\beta `$ then rk$`{}_{}{}^{\mathrm{}()}(B)\alpha `$.

2) rk$`{}_{}{}^{\mathrm{}()}(B)\text{ Ord}\{1,\mathrm{}\}`$ is well defined (for $`B{}_{}{}^{m}𝔄)`$.

3) If $`B_1B_2𝔄`$ then rk$`{}_{}{}^{\mathrm{}()}(B_1)\text{ rk}^{\mathrm{}()}(B_2)`$.

Proof. Trivial.

###### \stag{7.14} Claim

The following are equivalent if $`2^\mathrm{}_0\mathrm{}_{\mathrm{}()},(𝔄,\mathrm{\Delta })`$ is a $`\mathrm{\Sigma }_{\mathrm{}()}^1`$-candidate:

Proof. $`(a)(b)`$.

Let $`𝒫_\alpha =\{B{}_{}{}^{m}𝔄:\text{rk}^{\mathrm{}()}(B)\alpha \}`$ and apply ?. $`(b)(c)`$: Trivial. $`(c)(d)`$:

Let $`A𝔄`$ be countable and $`\{\overline{a}_\alpha :\alpha <\mathrm{}_{\mathrm{}()}\}{}_{}{}^{m}𝔄`$ exemplifies that $`𝔄`$ is $`(\mathrm{}_0,\mathrm{\Delta },\mathrm{}_{\mathrm{}()})`$-unstable.

Without loss of generality

Now let $`𝒫=\{\{\overline{a}_\alpha :\alpha S\}:S\mathrm{}_{\mathrm{}()}`$ is unbounded. Now we can prove by induction on $`\alpha `$ that $`B𝒫\text{ rk}^{\mathrm{}()}(B)\alpha `$. $`\mathrm{}_\mathrm{?}`$ $`(d)(a)`$: Trivial.

###### Definition 6.13 Definition

If $`p`$ is a $`(\mathrm{\Delta }_1,m)`$-type in over $`A`$ in $`𝔄`$ (i.e. a set of formulas $`\phi (\overline{x},\overline{a})`$ with $`\phi (\overline{x},\overline{y})\mathrm{\Delta }_1,\overline{a}A`$), we let

$`\text{rk}^{\mathrm{}()}(p,\mathrm{\Delta },𝔄)=\text{ Min}\{\text{rk}^{\mathrm{}()}{\displaystyle \underset{\mathrm{}<n}{}}\phi _{\mathrm{}}({}_{}{}^{m}𝔄,\overline{b}_{\mathrm{}}),\mathrm{\Delta },𝔄):`$ $`n<\omega `$
$`\text{and }\phi _{\mathrm{}}(\overline{x},\overline{b}_{\mathrm{}})p\text{ for }\mathrm{}<n\}.`$
6.14 Observation 1) If $`pq`$ (or just $`qp`$) are $`(\mathrm{\Delta },m)`$-types in $`𝔄`$ then rk$`{}_{}{}^{\mathrm{}()}(q,\mathrm{\Delta },𝔄)\text{ rk}^{\mathrm{}()}(p,\mathrm{\Delta },A)`$.

2) If $`q`$ is a $`(\mathrm{\Delta },m)`$-type in $`𝔄`$ then for some finite $`pq`$ we have

$$\text{rk}^{\mathrm{}()}(q,\mathrm{\Delta },𝔄)=\text{ rk}^{\mathrm{}()}(p,\mathrm{\Delta },𝔄)$$

hence

$$prq\text{ rk}^{\mathrm{}()}(r,\mathrm{\Delta },𝔄)=\text{ rk}^{\mathrm{}()}(p,\mathrm{\Delta },𝔄).$$

###### \stag{7.17} Claim

1) In ? we can add

Proof. $`\neg (e)\neg (c)`$.

Let $`M((\chi ),,<_\chi ^{})`$ be countable such that $`xM`$ for suitable $`x`$ and $`m<\omega `$. For every $`\overline{a}{}_{}{}^{m}𝔄`$ there is a function $`𝕔_{\overline{a}}M`$ from $`\mathrm{\Phi }_{(𝔄,\mathrm{\Delta })}^m`$ to $`\{0,1\}`$ as in Definition 6.3. So if $`\overline{a}_i{}_{}{}^{m}𝔄`$ for $`i<\omega _{\mathrm{}()}`$ then for some $`i<j<\omega _{\mathrm{}()}`$ we have $`𝕔_{\overline{a}_i}=𝕔_{\overline{a}_j}`$ because $`M`$ is countable. So clearly $`(c)`$ fails $`\overline{\phi }`$. $`(e)(c)`$.

Fix $`((\chi _0),,<_\chi ^{})`$ and let

$`𝒮_0=\{M((\chi _0),,<_\chi ^{}):`$ $`𝔄M\text{ and}`$
$`M=\mathrm{}_{\mathrm{}()1}\text{ and }\omega _{\mathrm{}()1}+1M\}.`$
For $`m<\omega `$ and $`𝕀{}_{}{}^{m}𝔄`$ let $`𝒥_𝕀=𝒥[𝕀]`$ be the family of $`𝒮𝒮_0`$ such that: we can find $`F_x,𝕔_x:x(\chi )`$ (a witness) such that:

Clearly $`𝒥_𝕀`$ is a normal ideal on $`𝒮_0`$. Also if $`m<\omega S_0𝒥[{}_{}{}^{m}𝔄]`$ then increasing $`\chi `$ we get the desired result. Toward contradiction assume that $`m<\omega `$ and $`𝒮𝒥[{}_{}{}^{m}𝔄]`$ and let $`𝒫`$ (i.e. $`𝒫_\alpha =𝒫`$ for $`\alpha <\omega _{\mathrm{}()}`$) be the family of $`𝕀{}_{}{}^{m}𝔄`$ such that $`𝒮_0𝒥_𝕀`$.

We now finish by ? once we prove

If not, for every $`\overline{\phi }(\overline{x},\overline{b})\mathrm{\Phi }_{𝔄,\mathrm{\Delta }}^m`$ there is $`\mathrm{}=𝕔[\overline{\phi }(\overline{x},\overline{b})]<2`$ and $`(F_x^{\overline{\phi }(\overline{x},\overline{b})},𝕔_x^{\overline{\phi }(\overline{x},\overline{b})}):x(\chi )`$ witnessing $`𝒮_0𝕁[𝕀_{\overline{\phi }}^{\mathrm{}}]`$.

Define $`(F_y,𝕔_y)`$ for $`y(\chi )`$ by: if $`y=x,\overline{\phi }(\overline{x},\overline{b})`$ then $`F_y=F_x^{\overline{\phi }(\overline{x},\overline{b})},c_y=𝕔_x^{\overline{\phi }(\overline{x},b)}`$, otherwise $`𝕔`$.

Clearly we can find $`M𝒮_0`$ such that

But $`𝕔`$ does it! So we are done. $`(f)(d)`$.

Like $`(c)(d)`$. $`(c)(f)`$.

Just use $`\mu =\mathrm{}_0`$. $`\mathrm{}_\mathrm{?}`$

###### \stag{7.18} Claim

Assume that $`(𝔄,\mathrm{\Delta })`$ is a $`\mathrm{\Sigma }_{\mathrm{}()}^1`$-candidate, $`\mathrm{}()\{1,2\}`$ and is $`\mu `$-stable.

For some $`\xi <\omega _1`$ we have: if $`\lambda \mu ,m<\omega ,A𝔄,|A|\lambda `$ and $`\overline{a}_\alpha {}_{}{}^{m}𝔄`$ for $`\alpha <\lambda ^{+\xi }`$

then for some $`S\lambda ^{+\xi }`$ of cardinality $`\lambda `$ the sequence $`\overline{a}_\alpha :\alpha S`$ is $`\mathrm{\Delta }`$-indiscernible over $`A`$ in $`𝔄`$.

Remark. See more in \[\Sh:F562 \].

Proof. Assume not. For $`\xi <\omega _1`$ let

$`𝒫_\xi =\{\{\overline{a}_\alpha :\alpha <\lambda ^{+\xi }\}:`$ $`\text{ for some }\lambda \mu ,\text{ for no }S\lambda ^{+\xi }\text{ of cardinality}`$
$`\lambda \text{ is }\overline{a}_\alpha :\alpha S\text{ is }\mathrm{\Delta }\text{-indiscernible over }A\text{ in }𝔄\}.`$
The point is:

Clearly clause (a) is impossible by our present assumptions so let $`E^{},m`$ be as in clause (b). By claim ?(4) there is a club $`E`$ of $`\lambda `$ and $`f_n:n<\omega `$ as there and let $`S_\gamma ^{}=\{\alpha S:f_{m+1}(\alpha )=\gamma \}`$, so $`\alpha >\gamma ,𝒫_{m+1}=\{\gamma :S_\gamma ^{}`$ is stationary. Without loss of generality $`E^{}E`$ and $`\gamma S_{m+1}S_\gamma ^{}=\mathrm{}`$. Without loss of generality $`f_{m+1}`$ is as in claim ? below.

So by $`(b)_m(ii)`$ clearly $`\mathrm{\Gamma }_{m+1}`$ is not a singleton (and it cannot be empty), so we clearly have finished. $`\mathrm{}_\mathrm{?}`$

###### \stag{7.19} Claim

Let $`A,\overline{a}_\alpha :\alpha <\lambda ,E,f_n:n<\omega `$ be as in ?(4).

Then without loss of generality (possibly shrinking $`E`$ and changing the $`f_n`$’s) we can add

then for some formula $`\phi (\overline{x}_0,\mathrm{},\overline{x}_n)`$ with parameters from $`A\{a_\gamma :\gamma <\beta \}`$ such that:

Proof. Easy.

## Glossary

§0 Introduction Theorem ?: No Polish group Thesis 0.1: Polish algebras are large Question 0.2: What can be Aut$`(𝔸),𝔸`$ uncountable Question 0.3: Is there model theory of Polish algebras Example 0.4: Adding many Cohens Example 0.5: The complex field, the real field Conjecture 0.6: There is a dichotomy Thesis 0.7: Classification theory of such structures exists Theorem ?: There is a $`F_\sigma `$ abelian groups with complicated categoricity behaviour Conclusion 0.8: Categoricity can stop at $`\mathrm{}_n`$ Theorem ?: Indiscernibles exist Definition 0.9: Categoricity Categoricity Question 0.10: Is there such a classification theory for equational theories Notation 0.11: Definition 0.12: group words

§1 Metric groups and metric models Definition 1.1: metric group, metric semigroups Notation 1.2: For metric group $`𝕄,𝕕_M`$ is the metric, $`e_𝕄`$ the unit, $`G_𝕄`$ the group Definition 1.3: specially (metric group), specially$`{}_{}{}^{+},\overline{\zeta }`$ is strongly O.K. Observation 1.4: basic properties Definition 1.5: automorphism of countable structures, endomorphism semi group, monomorphism semi group Claim ?: the above are separable metric groups semi groups Definition 1.6: $`𝔞`$ is a metric algebra; unitary, complete; specially(+) unitary; partial

§2 Semi-metric groups: automorphism groups of uncountable structures Definition 2.1: 1) $`G`$ is a complete/special metric group.

2) Similarly for semi-group Discussion 2.2: 1) Note that in 2.1 we do not necessarily have metric groups.

2)-4) Variants. Definition 2.3: The sequence $`\overline{A}`$ is an $`\omega `$-representation of $`𝔸`$, and related metrics Claim ?: when $`𝔸,\overline{A}`$ gives a \[semi\] complete/specially+ metric group of

automorphisms (or semi group of endomorphisms or semi group

of monomorphisms). Discussion 2.4: On variants of ? Definition 2.5: $`𝔸`$-beautiful term and some distance functions depending

on a representation Claim ?: beautiful terms induce operations on endomorphism semi-group Claim ?: how nice is the derived metric algebra from auto/endo/mono

semi-groups Question 2.6: can an uncountable Polish algebra be free for some variety? Observation 2.7: example answering the question Remark 2.8: another metric Definition 2.9: $`𝔞=(M,𝔡,𝕌)`$ is a metric topological algebra Claim ?: sufficient condition for being complete metric topological algebra Discussion 2.10: 1) Replacing metric by a topology.

2) Replacing automorphisms by expansion to models of a universal Horn theory.

§3 Compactness of metric algebras The completeness Lemma ?: give sufficient conditions for solvability of a set of equations in a Polish algebra. Remark 3.1: Explaining ?. Fact 3.2: Recall free group is torsion free with no non-trivial element divisible. Fact 3.3: Recall another consequence of freeness. Claim ?: sufficient conditions for complete metric algebra to be far from free. Remark 3.4: On stable variants on the theorems (e.g. $`M_𝔞<`$ cov(meagre) instead $`M`$ countable). Remark 3.5: On variants.

§4 Conclusions Conclusion 4.1: if $`(G,𝔡)`$ is a complete metric space of density $`<|G|`$ then $`G`$ is similar to free; semi-complete; is enough; not discrete is enough. Conclusion 4.2: There is no free uncountable Polish group. Claim ?: Strengthening the “non-free” replacing free. Remark 4.3: On related ranks; this conclusion confirms the complicatedness thesis. Conclusion 4.4: On Aut$`(𝔸)`$. Claim ?: when the proof of \[\Sh:744 \] works

§5 Quite free but not free abelian groups Question 5.1: 1) Is the “freeness of a (definable) abelian group” absolute?

2),3) Variants. Definition 5.2: of $`G_{k()}`$ Claim ?: $`G_{k()}`$ is $`\mathrm{}_1`$-free Definition 5.3: 1),2) the subgroups $`G_U,G_{U,u}`$.

3) The set of equations $`\xi _{U_1},\mathrm{\Xi }_{U,u}`$ Claim ?: How $`G_U`$ is generated Main Claim ?: 1) $`G_{Uu}/G_{U,u}`$ is free if $`|u|k,|U|\mathrm{}_k`$.

2) $`G_{Uu}/G_{U,u}`$ is free if $`|U|\mathrm{}_{k()|u|}`$ Claim ?: $`G_U`$ is not free if $`|U|\mathrm{}_{k()+1}`$ Claim ?: $`G_{k()}`$ is Borel (even $`F_\sigma `$) abelian group Conclusion 5.4: $`G_{k()}`$ is a Borel and even $`F_\sigma `$ abelian group,

$`>`$  scite$`\{`$6.6A$`\}`$ undefined

$`\mathrm{}_{k()+1}`$-free and if $`2^\mathrm{}_0\mathrm{}_{k()+2}`$,

not $`\mathrm{}_{k()+2}`$-free. Question 5.5: Does appropriate $``$ necessarily add reals Fact 5.6: Information from \[\Sh:402 \]. Corollary ?: 1) $`G_{k()}`$ purely embeddable into $`{}_{}{}^{\omega }`$.

2) Forcing making it free.

§6 Beginning of stability theory Convention 6.1: $`\tau _𝔄`$ countable, members of $`𝔄`$ are reals Definition 6.2: $`𝔄`$-formula, pairs of formulas and set $`\mathrm{\Delta }`$ of pairs Definition 6.3: $`(𝔄,\mathrm{\Delta })`$ a candidate, stability Observation 6.4: Basic facts. Claim ?: From stability to the existence of indiscernibles Definition 6.5: $`𝔄`$ has $`(\lambda ,\mathrm{\Delta })`$-order Claim ?: From order to unstability Question 6.6: What can be $`\{\lambda :𝔄`$ has $`(\mathrm{\Delta },\lambda )`$-order$`\}`$? Claim ?: Sufficient conditions for being unstable (i.e. having a perfect set of

pairwise explicitly contradictory type) Remark 6.7: Replacing $`\mathrm{}`$ by, e.g. $`\mathrm{}_\omega `$ Comment: nonstable is unstable Definition 6.8: tp$`{}_{\mathrm{\Delta }}{}^{}(\overline{a},A,𝔄),\mathrm{\Phi }_{𝔸,\mathrm{\Delta },A}^{pr,m}`$ and $`𝕊_\mathrm{\Delta }^m(A,𝔄)`$ Definition 6.9: $`(𝔸,\mathrm{\Delta })`$ is $`(\mu ,\mathrm{\Delta },\lambda )`$-unstable Observation 6.10: Weakly stable/unstable Definition 6.11: of rk$`(B)`$ Observation 6.12: Properties of rk Claim ?: Equivalences to rank being infinite Definition 6.13: rk in more cases Subclaim 6.14: properties of rk Claim ?: More cases of equivalence in ? Claim ?: Existence of indiscernible Claim ?: helping ?

REFERENCES. \[MkSh 366\]

\[BeKe96\]Howard Becker and Alexander S. Kechris. The descriptive set theory of Polish group actions, volume 232 of London Mathematical Society Lecture Notes Series. Cambridge University Press, Cambridge, 1996.

\[EM2\]Paul C. Eklof and Alan Mekler. Categoricity results for $`L_{\mathrm{},\kappa }`$-free algebras. Annals of Pure and Applied Logic, 37:81–99.

\[EM\]Paul C. Eklof and Alan Mekler. Almost free modules: Set theoretic methods, volume 46 of North–Holland Mathematical Library. North–Holland Publishing Co., Amsterdam, 1990.

\[HaSh 323\]Bradd Hart and Saharon Shelah. Categoricity over $`P`$ for first order $`T`$ or categoricity for $`\varphi \mathrm{L}_{\omega _1\omega }`$ can stop at $`\mathrm{}_k`$ while holding for $`\mathrm{}_0,\mathrm{},\mathrm{}_{k1}`$. Israel Journal of Mathematics, 70:219–235, 1990. math.LO/9201240.

\[JShT 654\]Winfried Just, Saharon Shelah, and Simon Thomas. The automorphism tower problem revisited. Advances in Mathematics, 148:243–265, 1999. math.LO/0003120.

\[MkSh 366\]Alan H. Mekler and Saharon Shelah. Almost free algebras . Israel Journal of Mathematics, 89:237–259, 1995. math.LO/9408213.

\[Sh 52\]Saharon Shelah. A compactness theorem for singular cardinals, free algebras, Whitehead problem and transversals. Israel Journal of Mathematics, 21:319–349, 1975.

\[Sh 61\]Saharon Shelah. Interpreting set theory in the endomorphism semi-group of a free algebra or in a category. Ann. Sci. Univ. Clermont, 13:1–29, 1976. Proceedings of Symposium in Clermont-Ferand, July 1975.

\[Sh 87a\]Saharon Shelah. Classification theory for nonelementary classes, I. The number of uncountable models of $`\psi L_{\omega _1,\omega }`$. Part A. Israel Journal of Mathematics, 46:212–240, 1983.

\[Sh 87b\]Saharon Shelah. Classification theory for nonelementary classes, I. The number of uncountable models of $`\psi L_{\omega _1,\omega }`$. Part B. Israel Journal of Mathematics, 46:241–273, 1983.

\[Sh:c\]Saharon Shelah. Classification theory and the number of nonisomorphic models, volume 92 of Studies in Logic and the Foundations of Mathematics. North-Holland Publishing Co., Amsterdam, xxxiv+705 pp, 1990.

\[Sh:g\]Saharon Shelah. Cardinal Arithmetic, volume 29 of Oxford Logic Guides. Oxford University Press, 1994.

\[Sh 522\]Saharon Shelah. Borel sets with large squares. Fundamenta Mathematicae, 159:1–50, 1999. math.LO/9802134.

\[Sh 402\]Saharon Shelah. Borel Whitehead groups. Mathematica Japonica, 50:121–130, 1999. math.LO/9809198.

\[Sh 744\]Saharon Shelah. A countable structure does not have a free uncountable automorphism group. Bulletin of the London Mathematical Society, 35:1–7, 2003. math.LO/0010305.

\[Sh:h\]Saharon Shelah. Classification theory of non elementary classes, in preparation. ASL, 2005.

\[ShVi 648\]Saharon Shelah and Andrés Villaveces. Categoricity may fail late. Journal of Symbolic Logic, submitted. math.LO/0404258.

\[Sh:F562\]Shelah, Saharon. Continuing 771.