Questions: Transcendence Degree and Algebraic Independence
5 questions to test your understanding
Score: 0 / 5
Question 1 Multiple Choice
Two algebraically closed fields of characteristic 0 are given: one has transcendence degree 5 over the rationals, the other has transcendence degree 7. Which statement correctly describes their relationship?
AThey are isomorphic because both are algebraically closed and of characteristic 0
BThey are not isomorphic because two ACFs of the same characteristic are isomorphic if and only if they have the same transcendence degree
CTheir relationship cannot be determined without knowing the specific elements in each field
DThey are isomorphic because transcendence degree only matters for finite fields
The fundamental classification theorem for ACF states that two algebraically closed fields of the same characteristic are isomorphic if and only if they have the same transcendence degree over their prime subfield. Transcendence degree 5 vs. 7 means different dimension — they are non-isomorphic. Having the same characteristic is necessary but not sufficient; equal transcendence degree is the additional condition that determines isomorphism. This is the model-theoretic result in action: transcendence degree is the single numerical isomorphism invariant in strongly minimal theories.
Question 2 Multiple Choice
In stable model theory, what structure does the non-forking independence relation satisfy, and why does this matter for classification theory?
AIt satisfies the axioms of a group, allowing algebraic operations on independent sets
BIt satisfies the axioms of a matroid (abstract linear independence structure), enabling transcendence degree to function as a well-defined dimension invariant
CIt satisfies the axioms of a partial order, enabling comparison of model sizes by containment
DIt satisfies the axioms of a topology, enabling continuity arguments for model extensions
Non-forking independence in stable theories satisfies the matroid axioms: symmetry, transitivity, finite character, and existence of bases. A matroid is precisely an abstract 'linear independence' structure — the same axioms underlying linear independence in vector spaces and algebraic independence in field extensions. Because non-forking is a matroid, transcendence degree (the size of a maximal independent set) is well-defined and finite for each model, making it a valid dimension invariant. This is why stable model theory can classify models by a single cardinal.
Question 3 True / False
Transcendence degree in model theory is defined exactly the same way as in classical field theory — it counts elements not satisfying any polynomial equation over the base.
TTrue
FFalse
Answer: False
The classical field-theoretic transcendence degree is a special case of the model-theoretic concept, not its definition. In model theory, transcendence degree is defined via non-forking independence: an element b is independent from a base A if b does not fork over A — it is 'genuinely new' relative to A, not pinned down by any formula over A with finitely many solutions. In ACF specifically, non-forking coincides with classical algebraic independence, so the two notions agree there. But the model-theoretic definition applies to arbitrary first-order structures, not just fields.
Question 4 True / False
In ACF (algebraically closed fields), the model-theoretic notion of algebraic closure acl(A) agrees with the classical field-theoretic algebraic closure of A.
TTrue
FFalse
Answer: True
In ACF, the definable algebraic closure of a set A — all elements satisfying some formula over A with finitely many solutions — coincides with the field-theoretic algebraic closure of A (elements satisfying a polynomial over A). This is because the definable sets in ACF are exactly those described by polynomial equations and inequalities (quantifier elimination), so definable finiteness corresponds exactly to being a root of a polynomial. This agreement makes ACF the canonical example connecting classical algebra to model theory: the abstract model-theoretic machinery recovers the classical notions exactly.
Question 5 Short Answer
Why does the matroid structure of non-forking independence allow transcendence degree to classify models up to isomorphism in strongly minimal theories?
Think about your answer, then reveal below.
Model answer: In a strongly minimal theory, every model is built by adding independent elements over the base, one at a time. The matroid axioms guarantee that any two maximal independent sets (bases) have the same cardinality — this is the transcendence degree of the model. Two models with the same transcendence degree have bases of the same size. Because the theory is strongly minimal (every definable set is either finite or cofinite), everything in each model is algebraic over its basis. An isomorphism is constructed by mapping bases element-for-element and extending algebraically — the algebraic closure of the basis determines the rest of the model. Two models with different transcendence degrees have different dimensions and cannot be isomorphic.
This mirrors the linear algebra fact that two vector spaces over the same field are isomorphic if and only if they have the same dimension. Strongly minimal theories generalize this: they are precisely the theories where all model-theoretic complexity reduces to a single cardinal (transcendence degree), making them the best-understood class of infinite structures in model theory. ACF is the archetypal example, but the theorem applies to any strongly minimal theory.