Let and take a formula over . Since is a strongly minimal theory, the set is finite or cofinite. If holds, it cannot be finite because , so it is cofinite. Elementarity of makes cofinite. Its finite complement is algebraic over , so lies in the set. Applying the same argument to gives the reverse implication. Hence is elementary: both elements realize the generic type in a strongly minimal theory over the corresponding domains.
If models have bases of the same dimension of a pregeometry, choose a bijection . Repeated use of the one-point result makes it elementary on every finite subset and hence on . Every model is the algebraic closure of a basis. Extending the map back and forth across algebraic elements produces an isomorphism . Thus models of a strongly minimal theory with the same dimension are isomorphic.
Let . If the saturated model had a basis of cardinality below , then would omit the consistent generic type in a strongly minimal theory over . This contradicts -saturation. A basis is a subset of , so its cardinality is at most . Therefore
Assume , with . Let have size below and let be a complete type. If is algebraic, its realizations lie in . If is nonalgebraic, strong minimality makes it the unique generic type over . The pregeometry exchange property givesso some basis element of lies outside and realizes .
Articles by others on the same topic
There are currently no matching articles.