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

 Definition

Given a structure M and a subset A, the definable closure dcl(A) is the set of all elements of M that are uniquely specified (in M) by some first‑order formula with parameters from A; equivalently, elements fixed by every automorphism of M that fixes A pointwise.

 

 

 

 

 

 





## Principle

Principle

Definable dependence is captured by first‑order definability and uniqueness: an element belongs to dcl(A) exactly when its property can be expressed so that no distinct element satisfies the same defining formula with parameters in A.

 

 

 

 

 





## Demonstration

Demonstration

In an algebraically closed field, the definable closure of the empty set is the prime field (e.g., Q for characteristic 0) because those elements are uniquely definable without parameters; in contrast, algebraic closure contains finitely many conjugates while dcl requires uniqueness.

 

 

 

 

## Misapplication

Misapplication

Confusing definable closure with algebraic closure (acl) or with the syntactic consequence closure; for instance, assuming every algebraic element is in dcl(A) when it may have multiple A‑conjugates and thus lie only in acl(A).

 

 

 

 

 





## Consequence

Consequence

Correct identification of dcl(A) yields control over Aut(M/A), canonical parameters, and the internal definability of objects; it is central to arguments about elimination of imaginaries and about which elements are 'named' by A.

 

 

 

 

## Reversal

Reversal

The reversal contrasts dcl with acl: where dcl requires unique specification, the reversed notion (acl) allows finitely many realizations; moving from dcl to acl weakens uniqueness and admits finite orbits under automorphisms fixing A.

 

 

 

 

 





## Boundary

Boundary

Depends on the language and on first‑order expressibility; dcl may shrink or grow under language expansions and does not automatically account for imaginaries unless one works in M^eq; it excludes elements only definable up to finitely many choices.

 

 

 

 

 





## Semantic Tension

Semantic Tension

Tension arises between definability (syntactic uniqueness) and algebraic notions of dependence: dcl is finer and more rigid than acl, and there is friction when model‑theoretic and algebraic intuitions about 'determined by A' diverge.

 

 

 

 

 





## Synthesis

Synthesis

Definable closure of A consists of those elements of the structure that are uniquely determined by A via first‑order formulas: the set of elements invariant under all automorphisms fixing A, providing a sharp notion of definable dependence.