Pregeometry (model Theory)

Pregeometry, and in full combinatorial pregeometry, are essentially synonyms for "matroid". They were introduced by Gian-Carlo Rota with the intention of providing a less "ineffably cacophonous" alternative term. Also, the term combinatorial geometry, sometimes abbreviated to geometry, was intended to replace "simple matroid". These terms are now infrequently used in the study of matroids.

It turns out that many fundamental concepts of linear algebra – closure, independence, subspace, basis, dimension – are available in the general framework of pregeometries.

In the branch of mathematical logic called model theory, infinite finitary matroids, there called "pregeometries" (and "geometries" if they are simple matroids), are used in the discussion of independence phenomena. The study of how pregeometries, geometries, and abstract closure operators influence the structure of first-order models is called geometric stability theory.

Motivation

If $V$ is a vector space over some field and $A\subseteq V$, we define $\text(A)$ to be the set of all linear combinations of vectors from $A$, also known as the span of $A$. Then we have $A\subseteq \text(A)$ and $\text(\text(A))=\text(A)$ and $A\subseteq B \Rightarrow \text(A)\subseteq\text(B)$. The Steinitz exchange lemma is equivalent to the statement: if $b\in\text(A\cup\)\smallsetminus\text(A)$, then $c\in\text(A\cup\).$

The linear algebra concepts of independent set, generating set, basis and dimension can all be expressed using the $\text$-operator alone. A pregeometry is an abstraction of this situation: we start with an arbitrary set $S$ and an arbitrary operator $\text$ which assigns to each subset $A$ of $S$ a subset $\text(A)$ of $S$, satisfying the properties above. Then we can define the "linear algebra" concepts also in this more general setting.

This generalized notion of dimension is very useful in model theory, where in certain situation one can argue as follows: two models with the same cardinality must have the same dimension and two models with the same dimension must be isomorphic.

Definitions

Pregeometries and geometries

A combinatorial pregeometry (also known as a finitary matroid) is a pair $(S,\text)$, where $S$ is a set and $\text:\mathcal(S)\to\mathcal(S)$ (called the closure map) satisfies the following axioms. For all $a, b, c\in S$ and $A, B\subseteq S$:

# $\text:(\mathcal(S),\subseteq)\to(\mathcal(S),\subseteq)$ is monotone increasing and dominates $\text$ (''i.e.'' $A\subseteq B$ implies $A\subseteq\text(A)\subseteq\text(B)$) and is idempotent (''i.e.'' $\text(\text(A))=\text(A)$)
# Finite character: For each $a\in\text(A)$ there is some finite $F\subseteq A$ with $a\in\text(F)$.
# Exchange principle: If $b\in\text(A\cup\)\smallsetminus\text(A)$, then $c\in\text(A\cup\)$ (and hence by monotonicity and idempotence in fact $c\in\text(A\cup\)\smallsetminus\text(A)$).
Sets of the form $\text(A)$ for some $A\subseteq S$ are called closed. It is then clear that finite intersections of closed sets are closed and that $\text(A)$ is the smallest closed set containing $A$.

A geometry is a pregeometry in which the closure of singletons are singletons and the closure of the empty set is the empty set.

Independence, bases and dimension

Given sets $A,D\subseteq S$, $A$ is independent over $D$ if $a\notin \text((A\setminus\)\cup D)$ for any $a\in A$. We say that $A$ is independent if it is independent over the empty set.

A set $B \subseteq A$ is a basis for $A$ over $D$ if it is independent over $D$ and $A\subseteq \text(B\cup D)$.

A basis is the same as a maximal independent subset, and using Zorn's lemma one can show that every set has a basis. Since a pregeometry satisfies the Steinitz exchange property all bases are of the same cardinality, hence we may define the dimension of $A$ over $D$, written as $\text_D A$, as the cardinality of any basis of $A$ over $D$. Again, the dimension $\text A$ of $A$ is defined to be the dimesion over the empty set.

The sets $A,B$ are independent over $D$ if $\text_ A' = \dim_D A'$ whenever $A'$ is a finite subset of $A$. Note that this relation is symmetric.

Automorphisms and homogeneous pregeometries

An automorphism of a pregeometry $(S,\text)$ is a bijection $\sigma:S\to S$ such that $\sigma(\text(X))=\text(\sigma (X))$ for any $X\subseteq S$.

A pregeometry $S$ is said to be homogeneous if for any closed $X\subseteq S$ and any two elements $a,b\in S\setminus X$ there is an automorphism of $S$ which maps $a$ to $b$ and fixes $X$ pointwise.

The associated geometry and localizations

Given a pregeometry $(S,\text)$ its associated geometry (sometimes referred in the literature as the canonical geometry) is the geometry $(S',\text')$ where

#$S'=\$, and
#For any $X\subseteq S$, $\text'(\) = \$

Its easy to see that the associated geometry of a homogeneous pregeometry is homogeneous.

Given $A\subseteq S$ the localization of $S$ is the pregeometry $(S,\text_A)$ where $\text_A(X)=\text(X\cup A)$.

Types of pregeometries

The pregeometry $(S,\text)$ is said to be:

* trivial (or degenerate) if $\text(X)=\bigcup\$ for all non-empty $X\subseteq S$.
* modular if any two closed finite dimensional sets $X,Y\subseteq S$ satisfy the equation $\text(X\cup Y) = \text(X) + \text(Y) - \text(X\cap Y)$ (or equivalently that $X$ is independent of $Y$ over $X\cap Y$).
* locally modular if it has a localization at a singleton which is modular.
* (locally) projective if it is non-trivial and (locally) modular.
* locally finite if closures of finite sets are finite.

Triviality, modularity and local modularity pass to the associated geometry and are preserved under localization.

If $S$ is a locally modular homogeneous pregeometry and $a\in S\setminus\text(\varnothing)$ then the localization of $S$ in $b$ is modular.

The geometry $S$ is modular if and only if whenever $a,b\in S$, $A\subseteq S$, $\text\=2$ and $\text_A\ \le 1$ then $(\text\\cap\text(A))\setminus\text(\varnothing)\ne\varnothing$.

Examples

The trivial example

If $S$ is any set we may define $\text(A)=A$ for all $A\subseteq S$. This pregeometry is a trivial, homogeneous, locally finite geometry.

Vector spaces and projective spaces

Let $F$ be a field (a division ring actually suffices) and let $V$ be a vector space over $F$. Then $V$ is a pregeometry where closures of sets are defined to be their span. The closed sets are the linear subspaces of $V$ and the notion of dimension from linear algebra coincides with the pregeometry dimension.

This pregeometry is homogeneous and modular. Vector spaces are considered to be the prototypical example of modularity.

$V$ is locally finite if and only if $F$ is finite.

$V$ is not a geometry, as the closure of any nontrivial vector is a subspace of size at least $2$.

The associated geometry of a $\kappa$-dimensional vector space over $F$ is the $(\kappa-1)$-dimensional projective space over $F$. It is easy to see that this pregeometry is a projective geometry.

Affine spaces

Let $V$ be a $\kappa$-dimensional affine space over a field $F$. Given a set define its closure to be its affine hull (i.e. the smallest affine subspace containing it).

This forms a homogeneous $(\kappa+1)$-dimensional geometry.

An affine space is not modular (for example, if $X$ and $Y$ are parallel lines then the formula in the definition of modularity fails). However, it is easy to check that all localizations are modular.

Field extensions and transcendence degree

Let $L/K$ be a field extension. The set $L$ becomes a pregeometry if we define $\text(A)=\$for $A\subseteq L$. The set $A$ is independent in this pregeometry if and only if it is algebraically independent over $K$. The dimension of $A$ coincides with the transcendence degree $\text(K(A)/K)$.

In model theory, the case of $L$ being algebraically closed and $K$ its prime field is especially important.

While vector spaces are modular and affine spaces are "almost" modular (i.e. everywhere locally modular), algebraically closed fields are examples of the other extremity, not being even locally modular (i.e. none of the localizations is modular).

Strongly minimal sets in model theory

Given a countable first-order language ''L'' and an ''L-'' structure ''M,'' any definable subset ''D'' of ''M'' that is strongly minimal gives rise to a pregeometry on the set ''D''. The closure operator here is given by the algebraic closure in the model-theoretic sense.

A model of a strongly minimal theory is determined up to isomorphism by its dimension as a pregeometry; this fact is used in the proof of Morley's categoricity theorem.

In minimal sets over stable theories the independence relation coincides with the notion of forking independence.

References

* H.H. Crapo and G.-C. Rota (1970), ''On the Foundations of Combinatorial Theory: Combinatorial Geometries''. M.I.T. Press, Cambridge, Mass.
* Pillay, Anand (1996), ''Geometric Stability Theory''. Oxford Logic Guides. Oxford University Press.
* {{Cite web , last=Casanovas , first=Enrique , date=2008-11-11 , title=Pregeometries and minimal types , url=http://www.ub.edu/modeltheory/documentos/pregeometries.pdf

Matroid theory
*
Model theory