Nepedia
Back to Discover
Advanced Reader
🔢

Elementary equivalence

math Maturity 7-9 Next article →

In the branch of mathematical logic known as model theory, mathematicians study how different structures relate to one another. Sometimes, two structures might appear to be very different, yet they obey the exact same logical rules. We call these structures elementarily equivalent. This occurs when two structures, M and N, share the same signature, which is a set of symbols used to describe them. If every first-order sentence in that signature is true in M if and only if it is also true in N, the structures are elementarily equivalent. In mathematical notation, we represent this relationship with the symbol M ≡ N.

When we move beyond simple equivalence, we often look at how one structure sits inside another. If a structure N is contained within a larger structure M, we call N a substructure. However, a simple substructure does not always follow all the same rules as the larger one. For N to be an elementary substructure, it must meet a much stricter requirement. Every first-order formula that uses elements from N as parameters must be true in N if and only if it is true in M. When this specific condition is met, we say that M is an elementary extension of N.

To determine if a substructure is truly an elementary substructure, mathematicians use the Tarski–Vaught test. This test provides a necessary and sufficient condition for this relationship. It focuses on whether certain mathematical problems have solutions. If a first-order formula has a solution within the larger structure M, then there must also be a solution within the substructure N. This ensures that the smaller structure is "rich" enough to satisfy the same logical requirements as the larger one. The Tarski–Vaught criterion is a vital tool for constructing these special substructures.

Another way to connect structures is through an elementary embedding. An elementary embedding is a specific type of map, denoted as h: N → M, between two structures of the same signature. For a map to be an elementary embedding, it must preserve the truth of all first-order formulas. Specifically, a formula must be true for a set of elements in N if and only if it is true for their mapped images in M. Every elementary embedding is considered a strong homomorphism. Furthermore, such a map creates an isomorphism between the original structure N and an elementary substructure within M.

The concepts of elementary substructures and extensions were formally introduced by Tarski and Vaught in 1957. Since then, these ideas have become central to model theory. Mathematicians have developed various methods to prove equivalence, such as the Ehrenfeucht–Fraïssé games. These games provide a way to demonstrate that two structures are elementarily equivalent. The study of these relationships has expanded into complex areas of set theory. For instance, elementary embeddings are used to study large cardinals, including the concept of rank-into-rank.

There are several fascinating examples of these principles in action. Consider the language of order, which uses a single binary relation symbol, '<'. The model of real numbers (R) and the model of rational numbers (Q) both use this symbol to represent their usual order. Because both are unbounded dense linear orderings, they are elementarily equivalent. We can confirm this using the Łoś–Vaught test, which shows that the theory of unbounded dense linear orderings is complete. A theory is considered complete if any two of its models are elementarily equivalent.

The Löwenheim–Skolem theorem reveals even more surprising connections between different types of math models. The downward Löwenheim–Skolem theorem states that any infinite first-order structure in an at most countable signature has a countable elementary substructure. Conversely, the upward Löwenheim–Skolem theorem shows that any infinite first-order structure has elementary extensions of arbitrarily large cardinality. This means we can find non-isomorphic models that are still elementarily equivalent. A famous example involves Peano arithmetic, where non-standard models contain objects other than the standard numbers 0, 1, 2, and so on, yet still follow the same first-order rules.

674 words

Where will your curiosity go next?

Keep exploring at your chosen reading level.

More to explore

What is Nepedia?

A free, ad-free encyclopedia for children. Every article is written at five reading levels, so the same page works for a five-year-old and a fifteen-year-old — use the level switcher above to see this one change. No account needed to read.