Questions: Strongly Minimal Sets and Geometric Structure

Question 1

A researcher analyzes a first-order structure and discovers a definable set D where a certain formula φ(x, ā) defines an infinite subset of D whose complement in D is also infinite. What does this immediately imply?

• A. D is strongly minimal, because it contains infinite definable subsets
• B. D cannot belong to a strongly minimal structure, because strongly minimal sets allow no definable subset to be both infinite and have infinite complement
• C. D is ω-stable but not strongly minimal — infinite/cofinite is required only for ω-categorical structures
• D. D is algebraically closed in the model-theoretic sense, since it satisfies the exchange principle

Answer: (B)

Strong minimality requires that every definable subset of D is either finite or cofinite (finite complement). A definable subset that is both infinite and has infinite complement violates this condition directly — it is neither finite nor cofinite. The formula φ(x, ā) witnesses a failure of strong minimality. This is the most fundamental test: strong minimality is precisely the absence of any 'medium-sized' definable subsets. A structure can be stable, even ω-stable, without being strongly minimal; strong minimality is a strictly stronger condition.

Question 2

In the theory of algebraically closed fields (ACF), every definable subset of the field in one variable is finite or cofinite. Which algebraic fact guarantees this?

• A. Every polynomial over an algebraically closed field has at least one root, so no finite set can be definable
• B. A polynomial in one variable has only finitely many roots, so any quantifier-free definable set (a Boolean combination of zero sets of polynomials) is finite or cofinite
• C. The Nullstellensatz implies all algebraic varieties are compact, preventing infinite definable sets
• D. Algebraically closed fields have no proper definable subfields, so all definable sets must be cofinite

Answer: (B)

A quantifier-free definable set in one variable over an algebraically closed field is a Boolean combination of sets of the form {x : p(x) = 0} for polynomials p. Each such zero set is finite (a degree-n polynomial has at most n roots). Boolean combinations (unions, intersections, complements) of finite sets remain finite; complements of such combinations are cofinite. Quantifier elimination for ACF (a deep theorem) shows that every definable set in one variable is equivalent to a quantifier-free formula, so all one-variable definable sets are finite or cofinite. This is the algebraic content of ACF's strong minimality.

Question 3

In a strongly minimal structure, the model-theoretic algebraic closure operation acl satisfies the matroid exchange principle, making dimension a well-defined concept analogous to vector space dimension.

• T. True
• F. False

Answer: True

This is the core of the geometric structure that strong minimality provides. Define acl(A) as the set of elements satisfying a formula with finitely many solutions over parameters A. In a strongly minimal structure, this operation satisfies all matroid axioms: monotonicity (A ⊆ acl(A)), idempotence (acl(acl(A)) = acl(A)), finite character, and the exchange principle (if b ∈ acl(Ac) but b ∉ acl(A), then c ∈ acl(Ab)). These axioms are exactly what is needed to define a well-behaved notion of independence and dimension. The resulting pregeometry on the strongly minimal set is the model-theoretic analogue of a vector space over a field.

Question 4

Two models of a strongly minimal theory are typically isomorphic to each other, regardless of their cardinality.

• T. True
• F. False

Answer: False

The correct statement is that two models of a strongly minimal theory with the *same uncountable cardinality* κ are isomorphic — they are both 'κ-dimensional' copies of the pregeometry. Models of different cardinalities need not be isomorphic (a countable model and an uncountable model of ACF₀ are certainly not isomorphic). This property — isomorphism of all models of the same uncountable cardinality — is called uncountable categoricity (or ℵ₁-categoricity at the smallest uncountable cardinal). Morley's theorem establishes that this is equivalent to ω-stability at every uncountable cardinal, but it does not collapse all cardinalities into one isomorphism type.

Question 5

What does it mean for a set to be 'strongly minimal,' and why does this condition give rise to a well-defined notion of geometric dimension?

Model answer: A definable set D is strongly minimal if every definable subset of D (with parameters) is either finite or cofinite — there is no 'middle ground' of infinite, non-cofinite definable subsets. This extreme rigidity means that the only definable subsets are those that are trivially small (finite) or trivially large (almost all of D). Because of this, one can define algebraic closure acl(A) — the set of elements with only finitely many solutions to their defining formula over A — and show it satisfies the matroid exchange principle. The exchange principle is exactly what allows a consistent notion of dimension: the dimension of a tuple over a set is the size of any maximal algebraically independent subset, and this is well-defined and additive. Strong minimality is the condition that makes this geometric abstraction possible.

The connection to geometry is deep: just as linear algebra over a field is controlled by dimension (any two n-dimensional spaces over the same field are isomorphic), strongly minimal structures are controlled by their pregeometric dimension. Vector spaces over a field, algebraically closed fields, and certain other structures are all strongly minimal, and in each case their model theory reduces to a single combinatorial invariant — dimension.