Hrushovski construction

From testwiki
Jump to navigation Jump to search

In model theory, a branch of mathematical logic, the Hrushovski construction generalizes the Fraïssé limit by working with a notion of strong substructure ≤ rather than ⊆. It can be thought of as a kind of "model-theoretic forcing", where a (usually) stable structure is created, called the generic or rich [1] model. The specifics of ≤ determine various properties of the generic, with its geometric properties being of particular interest. It was initially used by Ehud Hrushovski to generate a stable structure with an "exotic" geometry, thereby refuting Zil'ber's Conjecture.

Three conjectures

The initial applications of the Hrushovski construction refuted two conjectures and answered a third question in the negative. Specifically, we have:

  • Lachlan's Conjecture. Any stable ℵ0-categorical theory is totally transcendental.[2]
  • Cherlin's Question. Is there a maximal (with respect to expansions) strongly minimal set?

The construction

Let L be a finite relational language. Fix C a class of finite L-structures which are closed under isomorphisms and substructures. We want to strengthen the notion of substructure; let ≤ be a relation on pairs from C satisfying:

  • A≤B implies A⊆B.
  • A⊆B⊆C and A≤C implies A≤B
  • ∅≤A for all A∈𝐂.
  • A≤B implies A∩C≤B∩C for all C∈𝐂.
  • If f:A→A′ is an isomorphism and A≤B, then f extends to an isomorphism B→B′ for some superset of A′ with A′≤B′.

Definition. An embedding f:A↪D is strong if f(A)≤D.

Definition. The pair (𝐂,≤) has the amalgamation property if A≤B1,B2 then there is a D∈𝐂 so that each Bi embeds strongly into D with the same image for A.

Definition. For infinite D and A∈𝐂, we say A≤D iff A≤X for A⊆X⊆D,X∈𝐂.

Definition. For any A⊆D, the closure of A in D, denoted by clD(A), is the smallest superset of A satisfying cl⁡(A)≤D.

Definition. A countable structure G is (𝐂,≤)-generic if:

  • For A⊆ωG,A∈𝐂.
  • For A≤G, if A≤B then there is a strong embedding of B into G over A.
  • G has finite closures: for every A⊆ωG,clG(A) is finite.

Theorem. If (𝐂,≤) has the amalgamation property, then there is a unique (𝐂,≤)-generic.

The existence proof proceeds in imitation of the existence proof for Fraïssé limits. The uniqueness proof comes from an easy back and forth argument.

References

Template:Reflist

  1. ↑ Slides on Hrushovski construction from Frank Wagner
  2. ↑ E. Hrushovski. A stable ℵ0-categorical pseudoplane. Preprint, 1988
  3. ↑ E. Hrushovski. A new strongly minimal set. Annals of Pure and Applied Logic, 52:147–166, 1993