Write and define on tuples realizing the definable equivalence relationThe -classes correspond exactly to the members of , because automorphisms of the monster model carry through all realizations of its type.
There are at most such tuples, so . If the orbit is infinite, recursively choose for in pairwise different -classes. At stage , the typeis finitely satisfiable because there are infinitely many classes, and its parameter set has size less than . Saturation realizes it in . Thus there are at least classes, proving the orbit of a definable set in a monster model identity
Articles by others on the same topic
There are currently no matching articles.