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 Languages→→Definable 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 Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Introduction to Exponents → Order of Operations → Integer Order of Operations → Variable Expressions → The Distributive Property → Variables and Expressions Review → Introduction to Polynomials → Adding and Subtracting Polynomials → Multiplying Polynomials → Factorial → Permutations → Combinations → Counting Principles: Addition and Multiplication Rules → Introduction to Graph Theory → Propositional Logic Foundations → Logical Equivalences → Boolean Algebra → Introduction to Propositional Logic → Introduction to Predicate Logic (First-Order Logic) → First-Order Logic Syntax → Terms and Atomic Formulas in FOL → Variable Binding and Scope → Open and Closed Formulas in First-Order Logic → Variable Substitution and Capture-Avoidance in First-Order Logic → Quantifier Instantiation Rules in First-Order Proof Systems → Universal Quantification: Meaning and Scope → Free Variables and Bound Variables → Substitution and Instantiation in Predicate Logic → Terms and Atomic Formulas → Formulas and Well-Formed Expressions → Structures and Interpretations → Model Interpretation and Satisfaction → Interpretation, Truth, and Satisfaction of Formulas → Logical Consequence and Entailment → Satisfiability and Unsatisfiability → Consistency and Inconsistency of Theories → Consistency and Inconsistency → Complete First-Order Theories → Quantifier Elimination and Decidability → Definability and Applications to Algebraic Geometry → Definable Closure and Algebraic Closure

Longest path: 93 steps · 566 total prerequisite topics

Prerequisites (2)

Leads To (3)