Английская Википедия:Fraïssé limit
Шаблон:Short description Шаблон:Multiple issues
In mathematical logic, specifically in the discipline of model theory, the Fraïssé limit (also called the Fraïssé construction or Fraïssé amalgamation) is a method used to construct (infinite) mathematical structures from their (finite) substructures. It is a special example of the more general concept of a direct limit in a category.[1] The technique was developed in the 1950s by its namesake, French logician Roland Fraïssé.[2]
The main point of Fraïssé's construction is to show how one can approximate a (countable) structure by its finitely generated substructures. Given a class <math>\mathbf{K}</math> of finite relational structures, if <math>\mathbf{K}</math> satisfies certain properties (described below), then there exists a unique countable structure <math>\operatorname{Flim}(\mathbf{K})</math>, called the Fraïssé limit of <math>\mathbf{K}</math>, which contains all the elements of <math>\mathbf{K}</math> as substructures.
The general study of Fraïssé limits and related notions is sometimes called Fraïssé theory. This field has seen wide applications to other parts of mathematics, including topological dynamics, functional analysis, and Ramsey theory.[3]
Finitely generated substructures and age
Fix a language <math>\mathcal{L}</math>. By an <math>\mathcal{L}</math>-structure, we mean a logical structure having signature <math>\mathcal{L}</math>.
Given an <math>\mathcal{L}</math>-structure <math>\mathcal{M}</math> with domain <math>M</math>, and a subset <math>A \subseteq M</math>, we use <math>\langle A \rangle^\mathcal{M}</math> to denote the least substructure of <math>\mathcal{M}</math> whose domain contains <math>A</math> (i.e. the closure of <math>A</math> under all the function and constant symbols in <math>\mathcal{L}</math>).
A substructure <math>\mathcal{N}</math> of <math>\mathcal{M}</math> is then said to be finitely generated if <math>\mathcal{N} = \langle A \rangle^\mathcal{M}</math> for some finite subset <math>A \subseteq M</math>.[4] The age of <math>\mathcal{M}</math>, denoted <math>\operatorname{Age}(\mathcal{M})</math>, is the class of all finitely generated substructures of <math>\mathcal{M}</math>.
One can prove that any class <math>\mathbf{K}</math> that is the age of some structure satisfies the following two conditions:
Hereditary property (HP)
- If <math>A \in \mathbf{K}</math> and <math>B</math> is a finitely generated substructure of <math>A</math>, then <math>B</math> is isomorphic to some structure in <math>\mathbf{K}</math>.
Joint embedding property (JEP)
- If <math>A, B \in \mathbf{K}</math>, then there exists <math>C \in \mathbf{K}</math> such that both <math>A</math> and <math>B</math> are embeddable in <math>C</math>.
Fraïssé's theorem
As above, we noted that for any <math>\mathcal{L}</math>-structure <math>\mathcal{M}</math>, <math>\operatorname{Age}(\mathcal{M})</math> satisfies the HP and JEP. Fraïssé proved a sort-of-converse result: when <math>\mathbf{K}</math> is any non-empty, countable set of finitely generated <math>\mathcal{L}</math>-structures that has the above two properties, then it is the age of some countable structure.
Furthermore, suppose that <math>\mathbf{K}</math> happens to satisfy the following additional properties.
- For any structures <math>A, B, C \in \mathbf{K}</math>, such that there exist embeddings <math>f: A \to B</math>, <math>g: A \to C</math>, there exists a structure <math>D \in \mathbf{K}</math> and embeddings <math>f': B \to D</math>, <math>g': C \to D</math> such that <math>f' \circ f = g' \circ g</math> (i.e. they coincide on the image of A in both structures).
Essential countability (EC)
- Up to isomorphism, there are countably many structures in <math>\mathbf{K}</math>.
In that case, we say that K is a Fraïssé class, and there is a unique (up to isomorphism), countable, homogeneous structure <math>\operatorname{Flim}(\mathbf{K})</math> whose age is exactly <math>\mathbf{K}</math>.[5] This structure is called the Fraïssé limit of <math>\mathbf{K}</math>.
Here, homogeneous means that any isomorphism <math>\pi: A \to B</math> between two finitely generated substructures <math>A, B \in \mathbf{K}</math> can be extended to an automorphism of the whole structure.
Examples
The archetypal example is the class <math>\mathbf{FCh}</math> of all finite linear orderings, for which the Fraïssé limit is a dense linear order without endpoints (i.e. no smallest nor largest element). By Cantor's isomorphism theorem, up to isomorphism, this is always equivalent to the structure <math>\langle \mathbb{Q}, < \rangle</math>, i.e. the rational numbers with the usual ordering.
As a non-example, note that neither <math>\langle \mathbb{N}, < \rangle</math> nor <math>\langle \mathbb{Z}, < \rangle</math> are the Fraïssé limit of <math>\mathbf{FCh}</math>. This is because, although both of them are countable and have <math>\mathbf{FCh}</math> as their age, neither one is homogeneous. To see this, consider the substructures <math>\big\langle \{ 1, 3 \}, < \big\rangle</math> and <math>\big\langle \{ 5, 6 \}, < \big\rangle</math>, and the isomorphism <math>1 \mapsto 5,\ 3 \mapsto 6</math> between them. This cannot be extended to an automorphism of <math>\langle \mathbb{N}, < \rangle</math> or <math>\langle \mathbb{Z}, < \rangle</math>, since there is no element to which we could map <math>2</math>, while still preserving the order.
Another example is the class <math>\mathbf{Gph}</math> of all finite graphs, whose Fraïssé limit is the Rado graph.[1]
ω-categoricity
Suppose our class <math>\mathbf{K}</math> under consideration satisfies the additional property of being uniformly locally finite, which means that for every <math>n</math>, there is a uniform bound on the size of an <math>n</math>-generated substructure. This condition is equivalent to the Fraïssé limit of <math>\mathbf{K}</math> being ω-categorical.[6]
For example, the class of finite dimensional vector spaces over a fixed field is always a Fraïssé class, but it is uniformly locally finite only if the field is finite.
See also
References
