Mathematics Atlas

How Proof Is Made
Sign In
Text size
100%
Theme
Theorem

Fraisse's Theorem

Logic and Foundations

Fraisse's Theorem, developed in the 1950s by the French logician Roland Fraisse, shows that for a class of finite relational structures satisfying certain closure and amalgamation properties, there exists a unique countable structure, called the Fraisse limit of that class, which contains every structure in the class as a substructure and can be approximated arbitrarily well by those finite substructures. The construction is a special case of a direct limit taken in a category, and the resulting theory of Fraisse limits has found wide application beyond model theory itself, including in topological dynamics, functional analysis, and Ramsey theory.

Facts
Statement
For a Fraisse class K of finite structures, there is a unique (up to isomorphism), countable, homogeneous structure Flim(K) whose age is exactly K. 2
Classification
Statement Form
Uniqueness Theorem 1
Connections

Has Statement Form

Entity-backed identity for the statement-form enum value this theorem already carries, resolved to a mathematics concept by an explicit value-to-entity map (phase 3 bucket conversion, docs\design_entity_backed_browse_buckets_20260928.md). The statement-form fact itself stays on the theorem unchanged.

In Branch

Source Fraisse limit (Wikipedia)
Sources
1. Wikipedia: Fraïssé limit
WikipediaLead section, statement-form reference
Quote, Lead section, statement-form reference
Given a class K } of finite relational structures, if K } satisfies certain properties (described below), then there exists a unique countable structure Flim ⁡ ( K ) (\mathbf {K} )} , called the Fraïssé limit of K } , which contains all the elements of K } as substructures.
View the Source
2. Fraisse limit (Wikipedia)
  • Fraisse's theorem section
    there is a unique (up to isomorphism), countable, homogeneous structure
  • In Branch: Model Theory, Lead sentence
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.