o-minimal theory

o-minimal theory

In mathematical logic, and more specifically in model theory, an infinite structure (M,<,...) which is totally ordered by < is called an o-minimal structure if and only if every definable subset X ⊂ M (with parameters taken from M) is a finite union of intervals and points.

O-minimality can be regarded as a weak form of quantifier elimination. A structure M is o-minimal if and only if every formula with one free variable and parameters in M is equivalent to a quantifier-free formula involving only the ordering, also with parameters in M. This is analogous to the minimal structures, which are exactly the analogous property down to equality.

A theory T is an o-minimal theory if every model of T is o-minimal. Pillay can show that the complete theory T of an o-minimal structure is an o-minimal theory. This result is remarkable because the complete theory of a minimal structure need not be a strongly minimal theory, that is, there may be an elementarily equivalent structure which is not minimal.

Contents

Set-theoretic definition

O-minimal structures can be defined without recourse to model theory. Here we define a structure on a nonempty set M in a set-theoretic manner, as a sequence S = (Sn), n = 0,1,2,... such that

  1. Sn is a boolean algebra of subsets of Mn
  2. if A ∈ Sn then M × A and A ×M are in Sn+1
  3. the set {(x1,...,xn) ∈ Mn : x1 = xn} is in Sn
  4. if A ∈ Sn+1 and π : Mn+1 → Mn is the projection map on the first n coordinates, then π(A) ∈ Mn.

If M has a dense linear order without endpoints on it, say <, then a structure S on M is called o-minimal if it satisfies the extra axioms

  1. the set {(x,y) ∈ M2 : x < y} is in S2
  2. the sets in S1 are precisely the finite unions of intervals and points.

The "o" stands for "order", since any o-minimal structure requires an ordering on the underlying set.

Model theoretic definition

O-minimal structures originated in model theory and so have a simpler — but equivalent — definition using the language of model theory. Specifically if L is a language including a binary relation <, and (M,<,...) is an L-structure where < is interpreted to satisfy the axioms of a dense linear order,[1] then (M,<,...) is called an o-minimal structure if for any definable set X ⊆ M there are finitely many intervals I1,...,Ir with endpoints in M ∪ {±∞} and a finite set X0 such that

X=X_0\cup I_1\cup\ldots\cup I_r.

Examples

Examples of o-minimal theories are:

  • RCF, the theory of real closed fields;
  • The complete theory of the real field with a symbol for the exponential function by Wilkie's theorem;
  • The complete theory of the real numbers with restricted analytic functions added (i.e. analytic functions on a neighborhood of [0,1]n, restricted to [0,1]n; note that the unrestricted sine function has infinitely many roots, and so cannot be definable in a o-minimal structure.)
  • Intermediate to the previous two examples is the complete theory of the real numbers with restricted Pfaffian functions added.
  • The complete theory of dense linear orders in the language with just the ordering.

In the first example, the definable sets are the semialgebraic sets. Thus the study of o-minimal structures and theories generalises Real algebraic geometry. A major line of current research is based on discovering expansions of the real ordered field that are o-minimal. Despite the generality of application, one can show a great deal about the geometry of set definable in o-minimal structures. There is a cell decomposition theorem, Whitney and Verdier stratification theorems and a good notion of dimension and Euler characteristic.

See also

Notes

  1. ^ The condition that the interpretation of < be dense is not strictly necessary, but it is known that discrete orders lead to essentially trivial o-minimal structures, see, for example, MR0899083 and MR0943306.

References

External links


Wikimedia Foundation. 2010.

Игры ⚽ Поможем решить контрольную работу

Look at other dictionaries:

  • Strongly minimal theory — In model theory a branch of mathematical logic a minimal structure is an infinite one sorted structure such that every subset of its domain that is definable with parameters is either finite or cofinite. A strongly minimal theory is a complete… …   Wikipedia

  • O-minimal theory — In mathematical logic, and more specifically in model theory, a totally ordered structure ( M , lt;,...) is o minimal if and only if every definable set X sub; M (with parameters) can be realized as a finite union of intervals and points.A theory …   Wikipedia

  • C-minimal theory — In model theory, a branch of mathematical logic, a C minimal theory is a theory that is minimal with respect to a ternary relation C with certain properties. Algebraically closed fields with a (Krull) valuation are perhaps the most important… …   Wikipedia

  • Minimal logic — Minimal logic, or minimal calculus, is a symbolic logic system originally developed by Ingebrigt Johansson. It is a variant of intuitionistic logic that rejects not only the classical law of excluded middle (as intuitionistic logic does), but… …   Wikipedia

  • Minimal groups paradigm — is a term used in social psychology experiments (e.g. Tajfel, 1970) where people are assigned to random groups. Once in these random groups, group members are made aware that they are part of a group. From here a natural phenomenon occurs, where… …   Wikipedia

  • Minimal model (set theory) — In set theory, a minimal model is a minimal standard model of ZFC. Minimal models were introduced by (Shepherdson 1951, 1952, 1953). The existence of a minimal model cannot be proved in ZFC, even assuming that ZFC is consistent, but follows… …   Wikipedia

  • Minimal model (birational geometry) — In algebraic geometry, more specifically in the field of birational geometry, the theory of minimal models is part of the birational classification of algebraic varieties. Its goal is to construct, given a variety satisying certain restrictions,… …   Wikipedia

  • Minimal model program — In algebraic geometry, the minimal model program is part of the birational classification of algebraic varieties. Its goal is to construct a birational model of any complex projective variety which is as simple as possible. The subject has its… …   Wikipedia

  • Minimal Supersymmetric Standard Model — Beyond the Standard Model Standard Model …   Wikipedia

  • Minimal polynomial (linear algebra) — For the minimal polynomial of an algebraic element of a field, see Minimal polynomial (field theory). In linear algebra, the minimal polynomial μA of an n by n matrix A over a field F is the monic polynomial P over F of least degree such that… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”