Age (Model Theory)¶

The isomorphism-closed class of finitely generated structures that embed into a fixed model, recording exactly its finite or finitely generated local patterns.

Version: v2 · 2026-09-19 · History
Domain-specific #: 1250
Domain group: Formal Sciences
Origin domain: Mathematics
Aliases: Age of a structure

Core Idea¶

In model theory, the age of a structure \(M\), written \(\operatorname{Age}(M)\), is the class of isomorphism types of finitely generated structures that embed into \(M\). Equivalently, it is the isomorphism closure of the finitely generated substructures of \(M\). The language/signature is held fixed, and embeddings preserve the language's relations, functions, and constants. In a purely relational language with no function symbols, a substructure generated by finitely many elements is finite; with functions, finite generation need not imply a finite underlying set.

How would you explain it like I'm…

The Little-Pattern List

Imagine a giant LEGO castle. Make a list of every little build you can find somewhere inside it that starts from just a few bricks. Put each kind of little build on the list only once, no matter how many times it shows up or where. That list is what mathematicians call the castle's "age." It has nothing to do with how old the castle is!

Which Small Pieces Show Up

In math, a structure is a set of things plus rules connecting them, like dots with arrows between some of them. The age of a structure is the collection of all the small pieces you can find inside it, where each piece is built from just a finite number of starting things. Pieces that look exactly alike count as the same kind, and the age doesn't care how many copies there are or where they sit. It answers "what small patterns show up in here?" This "age" has nothing to do with years.

Class of Finitely Generated Substructures

In model theory, the age of a structure M is the class of all finitely generated structures that can be embedded into M, counted up to isomorphism (so identical-shaped copies count once). An embedding is a map that preserves all the relations, functions and constants of the fixed language. If the language has only relations and no functions, a finitely generated substructure is just finite; with functions, it may be infinite. The age records which local patterns occur in M, but not how often, where, or how they fit together globally, and it isn't the same as the set of sentences true in M. Every age is closed under taking isomorphic copies and smaller finitely generated substructures (the hereditary property), and has the joint embedding property: any two members fit together inside a third member.

In model theory, the age of a structure M, Age(M), is the class of isomorphism types of finitely generated structures that embed into M — equivalently, the isomorphism closure of M's finitely generated substructures — with the signature held fixed and embeddings preserving relations, functions and constants. In a purely relational language, finitely generated substructures are finite; with function symbols, finite generation need not yield a finite underlying set. The age captures local structural possibilities while discarding location, multiplicity and global arrangement: it says which finitely generated patterns occur, not how many, where, or which first-order sentences hold in M. Every age is nonempty (under the applicable convention), closed under isomorphism and under finitely generated substructures (the hereditary property, HP), and has the joint embedding property (JEP), since any two finitely generated substructures of M lie within the substructure generated by their union. The recognition invariant is fixed language, finite generation, embedding into a single ambient structure, and identification up to isomorphism. It is distinct from demographic age, historical periods, the finite models of a theory, or arbitrary classes of structures.

Scope of Application¶

Ages organize Fraïssé theory, homogeneous structures, permutation-group/model-theory connections, structural Ramsey theory, and classification by finite configurations. They are used for graphs, orders, metric or enriched structures under adapted frameworks, groups and algebras, and relational expansions. The exact class changes with the language: adding a distinguished relation or constant can alter embeddings and therefore the age even when the underlying set is unchanged.

In classical relational examples, ages convert infinite structures into manageable catalogs of finite objects. The countable random graph has the class of all finite simple graphs as its age.

Clarity¶

The abstraction separates local possibility from global assembly. If a finite graph embeds into the random graph, the age certifies that the pattern occurs; it does not tell how often or in which larger neighborhoods. If two structures have different ages, they necessarily differ in some finitely generated embeddable configuration. If they have the same age, however, they can still differ globally.

Manages Complexity¶

An infinite structure may contain unboundedly many elements and relations, while each age member is controlled by finite generators. Passing to isomorphism types removes irrelevant naming. This compression lets proofs work with finite diagrams, embeddings, amalgams, and extension properties rather than the entire ambient model at once.

Abstract Reasoning¶

From \(A\in\operatorname{Age}(M)\) and a finitely generated substructure \(B\le A\), composition of embeddings gives \(B\in\operatorname{Age}(M)\); this is HP. For \(A,B\in\operatorname{Age}(M)\), choose embedded copies inside \(M\), take the substructure generated by their finite generating tuples, and obtain \(C\in\operatorname{Age}(M)\) into which both embed; this is JEP.

Knowledge Transfer¶

Literal transfer occurs from graphs to orders, relational systems, algebraic structures, and suitable enriched settings because the same roles—language, finite generation, embedding, isomorphism class—remain intact. Proof strategies based on HP/JEP/AP also transfer, although the meaning of generated substructure and amalgam changes with the language.

The broader transferable parent is Representation: an age represents selected local structure of \(M\) by a class of smaller structures with an explicit faithfulness boundary. Classification and Finite-to-Infinite Bridge are related primes.

Relationships to Other Abstractions¶

Current abstraction Age (Model Theory) Domain-specific

Parents (1) — outgoing typed relations

Age (Model Theory) presupposes Representation Prime

Age directly instantiates Representation because it maps an ambient structure to a selected, invariant local profile and explicitly states what is preserved and omitted.

Hierarchy path (1) — routes to 1 parentless root

Age (Model Theory) → presupposes Representation → presupposes Abstraction

Neighborhood in Abstraction Space¶

Age (Model Theory) sits in a sparse region of the domain-specific corpus (64^th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Categories, Sheaves & Homotopy (21 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-25