##  [Definable Closure](/definable-closure-1) 

 Definition

The definable closure dcl(A) of a set A in a structure M is the set of elements of M that are uniquely specified by some first-order formula with parameters from A; equivalently, b ∈ dcl(A) iff there is a formula φ(x,a) with a from A such that M ⊨ φ(b,a) and M ⊨ ∀x(φ(x,a) → x=b).

 

 

 

 

 

 





## Principle

Principle

Definable closure captures those elements that can be named by a first-order description using A as parameters and that are uniquely determined by that description inside the structure.

 

 

 

 

 





## Demonstration

Demonstration

In an algebraically closed field considered in the language of rings, the definable closure of the prime field is the prime field itself, since elements outside it are not uniquely definable without parameters; in structures with Skolem functions, dcl(A) often coincides with the closure under those functions.

 

 

 

 

## Misapplication

Misapplication

Treating definable closure as identical to algebraic closure or to the set of elements fixed by Aut(M/A): while related, these notions differ—algebraic closure concerns finite solution sets and Aut-fixed sets concern invariance rather than unique definability.

 

 

 

 

 





## Consequence

Consequence

Definable closure gives a concrete, first-order notion of dependence and naming: it yields a pregeometry in many contexts, influences independence relations, and determines which elements are parameter-definable from A.

 

 

 

 

## Reversal

Reversal

The inverse idea is definable independence or elements intentionally not in dcl(A): an element outside dcl(A) cannot be uniquely pinned down by A and remains indeterminate relative to those parameters.

 

 

 

 

 





## Boundary

Boundary

dcl depends on the language and the ambient model: expanding the language or changing the model can enlarge or shrink dcl(A); it only captures unique definability, not finite algebraic dependence unless the language enforces it.

 

 

 

 

 





## Semantic Tension

Semantic Tension

There is tension between definable closure, algebraic closure, and model-theoretic fixed-point sets: each notion measures a different kind of definability or dependence and may coincide only in particular theories or languages.

 

 

 

 

 





## Synthesis

Synthesis

Definable closure is the collection of elements uniquely named by first-order formulas with parameters from A; it formalizes which elements are deterministically specified by A and plays a central role in independence and definability calculus.