A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Definable Closure and Algebraic Closure

Research Depth 92 in the knowledge graph I know this Set as goal
10topics build on this
566prerequisites beneath it
See this on the map →
Definability and Applications to Algebraic GeometryStructures and Formal LanguagesDefinable Closure and Algebraic IndependenceStrongly Minimal Sets and Geometric Structure+1 more
definable-closure algebraic-closure closure-operators

Core Idea

The definable closure dcl(A) consists of elements definable from A with parameters. The algebraic closure acl(A) consists of elements satisfying a formula over A with finitely many solutions. In stable theories, dcl(A) ⊆ acl(A), and when dcl(A) is also algebraically closed it forms a submodel. These closures provide structure theory for models of stable theories.

Explainer

From your work on definability, you know that a set S ⊆ Mn is definable over a parameter set A if there is a formula φ(x̄, ā) with ā ∈ A such that S = {x̄ : M ⊨ φ(x̄, ā)}. Now consider what elements are "pinned down" by parameters in A. The definable closure dcl(A) consists of all elements b such that the singleton {b} is A-definable — that is, φ(x, ā) has exactly one solution, namely b. Think of it as the set of elements you can uniquely name using formulas with parameters from A.

The algebraic closure acl(A) relaxes unique definability: b ∈ acl(A) if there exists some formula φ(x, ā) with ā ∈ A such that b satisfies φ and φ has only *finitely many* solutions. The element isn't necessarily uniquely pinned down, but it lives in a finite "orbit" over A. Notice the analogy with field theory: in the field ℝ considered as a structure, √2 is algebraic over ℚ because it satisfies x² − 2 = 0, which has exactly two solutions. Indeed, in algebraically closed fields, model-theoretic acl agrees with the classical algebraic closure from field theory.

The inclusion dcl(A) ⊆ acl(A) is immediate from the definitions: if b is the unique element satisfying φ(x, ā), then φ has finitely many (specifically, one) solution, so b ∈ acl(A). Both operations are closure operators: A ⊆ dcl(A), dcl(dcl(A)) = dcl(A), and similarly for acl. In stable theories, these closures behave especially well — acl(A) is always a model-theoretically small structure carrying the "algebraic content" of A, and independence (non-forking) is intimately tied to the acl operator.

The structural importance of these closures comes into focus when building models. A set A is algebraically closed (in the model-theoretic sense) if acl(A) = A — every element finitely definable from A is already in A. Algebraically closed sets serve as the "good" parameter sets for independence theory, analogous to how algebraically closed fields are the "good" fields in algebraic geometry. When A = dcl(A), A forms a closed substructure that reflects the ambient theory; combining both conditions gives the structural building blocks for understanding models of stable theories.

Practice Questions 5 questions

Prerequisite Chain

Understanding ZeroThe Number ZeroCounting to FiveCounting to 10Counting to 20Counting a Set of Objects Up to 20Cardinality: The Last Number CountedMatching Numerals to QuantitiesSubitizing Small QuantitiesAddition Within 10Number Bonds to 10Addition Within 20Doubles and Near DoublesDoubles Facts Within 10Near Doubles Facts Within 20Mental Math Strategies for AdditionMental Math: Adding and Subtracting TensAddition Within 100Repeated Addition as MultiplicationMultiplication as Equal GroupsMultiplication: ArraysBasic Multiplication Facts (0s, 1s, 2s, 5s, 10s)Multiplication Facts Within 100Division as Equal SharingDivision as Grouping (Measurement Division)Division: Grouping (Repeated Subtraction) ModelDivision: Fair Sharing ModelDivision as Equal SharingDivision as GroupingBasic Division FactsDivision Facts Within 100Multiplication and Division Fact FamiliesRelationship Between Multiplication and DivisionDivision Facts as Inverse of MultiplicationRemainders and Quotients in DivisionDivision Word ProblemsMulti-Step Word ProblemsSolving Multi-Step Word ProblemsMultiplication Word ProblemsDivision Word ProblemsIntroduction to Long DivisionFactors and MultiplesPrime and Composite NumbersEquivalent FractionsRelating Fractions and DecimalsDecimal Place ValueIntegers and the Number LineComparing and Ordering IntegersAbsolute ValueAdding IntegersSubtracting IntegersMultiplying IntegersIntroduction to ExponentsOrder of OperationsInteger Order of OperationsVariable ExpressionsThe Distributive PropertyVariables and Expressions ReviewIntroduction to PolynomialsAdding and Subtracting PolynomialsMultiplying PolynomialsFactorialPermutationsCombinationsCounting Principles: Addition and Multiplication RulesIntroduction to Graph TheoryPropositional Logic FoundationsLogical EquivalencesBoolean AlgebraIntroduction to Propositional LogicIntroduction to Predicate Logic (First-Order Logic)First-Order Logic SyntaxTerms and Atomic Formulas in FOLVariable Binding and ScopeOpen and Closed Formulas in First-Order LogicVariable Substitution and Capture-Avoidance in First-Order LogicQuantifier Instantiation Rules in First-Order Proof SystemsUniversal Quantification: Meaning and ScopeFree Variables and Bound VariablesSubstitution and Instantiation in Predicate LogicTerms and Atomic FormulasFormulas and Well-Formed ExpressionsStructures and InterpretationsModel Interpretation and SatisfactionInterpretation, Truth, and Satisfaction of FormulasLogical Consequence and EntailmentSatisfiability and UnsatisfiabilityConsistency and Inconsistency of TheoriesConsistency and InconsistencyComplete First-Order TheoriesQuantifier Elimination and DecidabilityDefinability and Applications to Algebraic GeometryDefinable Closure and Algebraic Closure

Longest path: 93 steps · 566 total prerequisite topics

Prerequisites (2)

Leads To (3)