Łoś's theorem is the transfer principle: a sentence holds in an ultraproduct exactly when it holds on a large set of coordinates. Everything model-theoretic in this stream follows from it.
Engineering · Mathematics10 min readKV-MATH-0251
Learning objectives
Define the ultraproduct and identify the role of maximality.
State Łoś's theorem precisely.
Follow the induction, especially the negation and existential cases.
Construct the canonical elementary embedding into an ultrapower.
Apply Łoś to derive compactness.
Recognise the non-standard models the construction produces.
01Ultraproducts
An ultraproduct is a reduced product over an ultrafilter. Maximality of the filter is the entire difference, and it changes the preservation behaviour completely.
Reduced product
Filter decides some subsets
For a subset S the filter may contain neither S nor its complement. Disjunctions can then fail to transfer, so only Horn sentences are preserved.
Ultraproduct
Ultrafilter decides every subset
Exactly one of S and its complement lies in U. Every disjunction is resolved, and every first-order sentence transfers.
Recall from the Boolean stream that an ultrafilter is a maximal proper filter, characterised by deciding every element. That decisiveness is precisely what the induction in Łoś's theorem needs.
02Łoś's theorem
Key resultŁoś's theorem
For structures Ai indexed by I and an ultrafilter U on I, and for any formula φ and elements of the ultraproduct: ∏Ai/U ⊨ φ[f⃗/U] ⟺ { i ∈ I : Ai ⊨ φ[f⃗(i)] } ∈ U.
In words: a formula holds in the ultraproduct exactly when it holds in 'almost every' factor, where U decides what almost every means. This is a complete transfer principle — not merely for a restricted class of formulas but for all of them.
03The proof
ProcedureŁoś by induction on formula structure
in: formula φ → out: the transfer equivalence for φ
atomic: holds by the definition of θ_U and the relation clause
conjunction: ⟦φ & ψ⟧ = ⟦φ⟧ ∩ ⟦ψ⟧; U is closed under intersection ✓
negation: ⟦¬φ⟧ = I ∖ ⟦φ⟧
U is an ULTRAfilter, so exactly one of ⟦φ⟧, I∖⟦φ⟧ lies in U
hence ⟦¬φ⟧ ∈ U iff ⟦φ⟧ ∉ U — exactly what is needed
existential: if ⟦∃x φ⟧ ∈ U, choose a witness in each such coordinate
(AXIOM OF CHOICE) and let g be the resulting element of the product
then ⟦φ(g)⟧ ⊇ ⟦∃x φ⟧ ∈ U
conversely a witness in the ultraproduct gives witnesses on a large set
universal: rewrite ∀ as ¬∃¬ and apply the previous two cases
Two steps are load-bearing: negation needs maximality of U, and the existential case needs choice to assemble the witness function. Caveat: dropping maximality breaks the negation case, which is exactly why reduced products only preserve Horn sentences.
CautionThe negation case is where ultrafilters are essential
For a non-maximal filter it is possible that neither ⟦φ⟧ nor its complement lies in F, so neither φ nor ¬φ holds in the reduced product though every factor decides. Maximality is not a convenience — the theorem is false without it.
04Ultrapowers and the diagonal embedding
An ultrapower is an ultraproduct of a constant family. It comes with a canonical elementary embedding of the original structure.
d : A → AI/U d(a) := the class of the constant function with value a
By Łoś, A ⊨ φ[a⃗] iff the constant function satisfies φ in the ultrapower, since the agreement set is all of I. So d is an elementary embedding.
Principal U gives nothing
The ultrapower collapses to A itself and d is an isomorphism.
Free U gives a proper extension
For infinite I and free U the ultrapower is strictly larger, and d is a proper elementary embedding.
Consequence: elementary extensions on demand
Every infinite structure has proper elementary extensions, constructed without compactness.
Consequence: non-standard models
The ultrapower of the natural numbers over a free ultrafilter contains elements exceeding every standard natural — an infinite number, in a structure elementarily equivalent to the standard one.
05Applications
Compactness
The clean proof
Index finite subsets of a theory, take a model of each, and form the ultraproduct over an ultrafilter containing the sets of indices above each finite piece. Łoś gives a model of the whole theory.
Non-standard analysis
Infinitesimals
The ultrapower of the reals contains elements smaller than every positive real. Robinson's framework is built on exactly this construction.
Jónsson's lemma
Locating subdirect irreducibles
The P_U operator in the statement is the ultraproduct operator, and the proof constructs an ultrafilter from the congruence analysis.
Keisler–Shelah
Elementary equivalence characterised
Two structures are elementarily equivalent if and only if they have isomorphic ultrapowers — an algebraic characterisation of a logical notion.
Preservation theorems
The standard technique
Most preservation results are proved by constructing ultraproducts with prescribed properties.
Decidability transfer
Feferman–Vaught
The theory of a product reduces to the theories of factors plus the index Boolean algebra, which underlies the Chapter IV decidability results.
06What ultraproducts cost
The construction is powerful and entirely non-constructive.
The dependencies
Ingredient
Requires
Existence of a free ultrafilter
BPI — not provable in ZF
The existential case of Łoś
some choice to select witnesses
Compactness via ultraproducts
BPI, and compactness is equivalent to it
Ultraproducts over principal ultrafilters
nothing — but they give nothing
Ultraproducts of finitely many finite structures
nothing — they collapse
NoteWhy the finite collapse matters
An ultraproduct of finitely many structures is isomorphic to one of them, because the ultrafilter on a finite index set is principal. This is what makes Jónsson's lemma computationally usable for finitely generated varieties: P_U disappears and the conclusion becomes a finite, choice-free statement.
Frequently asked
Is the ultraproduct construction canonical?
No — it depends on the choice of ultrafilter, and different free ultrafilters can give non-isomorphic ultraproducts. Whether all free ultrafilters on the naturals give isomorphic ultrapowers of a fixed structure is independent of ZFC, being related to the continuum hypothesis.
Why does the ultrapower of the naturals have infinite elements?
Take the identity function on I = ω. For each standard n, the set of coordinates where the identity exceeds n is cofinite, hence in any free ultrafilter. So by Łoś the class of the identity exceeds the image of every standard n. It is an element of a structure elementarily equivalent to the naturals, yet larger than all of them.
Does Łoś's theorem hold for infinitary logic?
No. The induction relies on formulas being finite, so that agreement sets can be combined by finite intersection. Infinitary conjunctions would need closure under infinite intersections, which filters do not have. This is one of several places where finiteness of syntax is load-bearing.
Sources and further reading
S. Burris and H. P. Sankappanavar, A Course in Universal Algebra, Millennium Edition (a corrected re-typesetting of Springer GTM 78, 1981).
G. Grätzer, Universal Algebra, 2nd edition, Springer.
R. McKenzie, G. McNulty and W. Taylor, Algebras, Lattices, Varieties, Volume I.
Original KEVOS® explanatory article. Written from the topic map of the cited works; no text is reproduced from them.
Handbook application: from concept to controlled practice
Purpose. This expanded section turns the original page into a practical handbook. It preserves the supplied material and adds a repeatable way to apply, check and review Ultraproducts and Los's Theorem. It does not replace a contract, legislation, a controlled standard, competent engineering judgement or specialist advice.
The operating aim is to turn a compact mathematical statement into a usable chain of definitions, claims, examples and checks. Read the original explanation first, then use the workflow and checks below to convert knowledge into evidence.
Treat Ultraproducts and Los's Theorem as a network of definitions and implications, not as a list of formulas. The working vocabulary on this page—ultraproducts, theorem, łoś's, proof, ultrapowers—should be made explicit before any proof or computation begins. Record the ambient set or structure, the permitted operations and the equality or equivalence relation in use. A compact theorem often changes meaning when the base field, finiteness condition, commutativity assumption or direction of an action changes.
For a proof, write the hypotheses as a checklist and mark the line at which each one is used. For a computation, state the representation of the input, the arithmetic model, the termination condition and the output invariant. For a classification problem, distinguish existence from uniqueness and distinguish an object from its representation. These separations prevent a correct local calculation from being mistaken for the general result.
A useful worked example should be small enough to inspect completely but rich enough to exercise the main mechanism. Compute the result in two ways where practical: symbolically and by substitution, structurally and numerically, or directly and through a normal form. Then include one near-miss example in which a hypothesis fails. The contrast explains why the theorem is shaped as it is and gives the reader a diagnostic pattern for later problems.
Verification is part of the mathematics. Check domains and codomains, substitute proposed solutions, test identity and zero cases, compare dimensions or cardinalities, and confirm that maps respect the required operations. In numerical work, report precision, conditioning and a residual rather than digits alone. In algorithmic work, separate mathematical correctness from implementation complexity and resource limits.
Step-by-step operating method
Fix the setting. State the objects, ambient structure, notation and assumptions before manipulating symbols.
Separate claims. Distinguish definitions, hypotheses, conclusions, equivalent conditions and consequences.
Choose a method. Select proof, construction, calculation or algorithm according to the question actually asked.
Work a small case. Use the smallest non-trivial example to expose the mechanism and test edge behaviour.
Verify independently. Substitute back, check invariants, test boundary cases or use an alternative derivation.
Worked-example protocol
Illustrative method—not a source theorem. Start with a small admissible input and list the definitions it must satisfy. Carry out each transformation on a separate line, citing the property that permits it. Preserve exact values until approximation is necessary. At the end, verify the output against the original definition and one invariant such as dimension, degree, determinant, order, norm or residual. Then alter one hypothesis and observe which step ceases to be valid. This protocol creates a reusable example without inventing a theorem-specific numerical answer.
Stage
Record
Quality check
Input
Objects, domain, notation, assumptions
Every symbol is defined
Method
Permitted operation or cited result at each step
All hypotheses hold
Output
Exact result and representation
Correct type, domain and form
Verification
Substitution, invariant or alternative derivation
Independent agreement
Boundary test
Zero, identity, degenerate or failed hypothesis
Scope is understood
Common failure modes and recovery actions
1. Watch for
Using a theorem without checking every hypothesis.
Recovery: Return to the governing definition or requirement and restate the decision in one sentence.
2. Watch for
Treating a suggestive example as a proof of the general case.
Recovery: Separate evidence from assumption, assign an owner and set a date for validation.
3. Watch for
Changing notation or conventions part-way through an argument.
Recovery: Run a small counterexample, boundary test, pilot or independent check before proceeding.
4. Watch for
Hiding a division-by-zero, convergence, finiteness or commutativity assumption.
Recovery: Record the consequence, decision and rationale, then update the controlled baseline.
5. Watch for
Reporting a computed result without a residual, substitution or structural check.
Recovery: Escalate when the issue affects safety, compliance, acceptance, material value or an agreed tolerance.
Review checklist
Can every symbol be traced to a definition or prior result?
Which hypothesis does each major step use?
Does the method cover zero, identity, degenerate and boundary cases?
Can the conclusion be checked by a second representation or calculation?
Are mandatory requirements distinguished from recommendations and illustrative values?
Are sources, assumptions, units, dates and versions recorded closely enough to reproduce the decision?
Have safety, legal, ethical, stakeholder and operational consequences been considered at the appropriate level?
Is there a named owner and a trigger for review, escalation, change or retirement?
Questions for deeper application
What is the most important distinction a practitioner must preserve when applying Ultraproducts and Los's Theorem?
Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.
Which assumption about ultraproducts would change the result most if it proved false?
Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.
What evidence would allow an independent reviewer to reproduce or challenge the conclusion?
Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.
Which boundary, exception or failure case has not yet been tested?
Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.
What must be handed over, monitored or reviewed after the immediate work is complete?
Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.
Authoritative references and use notes
The sources below were selected as institutional or primary guidance for the broader practice. They support the handbook method; they do not imply that every statement or clause in a source applies to every project. Confirm the current edition, jurisdiction, contract and application before treating any requirement as mandatory.
MIT OpenCourseWare — Algebra I — Massachusetts Institute of Technology. Used for groups, vector spaces, linear transformations and linear groups. Accessed 2026-08-13.
The Stacks Project — table of contents — The Stacks Project. Used for commutative algebra, homological algebra, modules and derived categories. Accessed 2026-08-13.
