Łoś's theorem for ultraproducts
ProvedFamousTheorems.los_theoremŁoś's theorem. Let be nonempty -structures and an ultrafilter on . A first-order sentence holds in the ultraproduct if and only if .
This is the fundamental theorem of ultraproducts. It gives a one-line proof of the compactness theorem, constructs nonstandard models (hyperreals, nonstandard arithmetic), and transfers first-order properties between structures, as in the Ax–Kochen and Ax–Grothendieck theorems.
Formalization note. Mathlib's FirstOrder.Language.Ultraproduct.sentence_realize; (u : Filter α).Product M is the ultraproduct structure.
Preamble
import Mathlib
Formal statement
namespace FamousTheorems
open FirstOrder FirstOrder.Language
theorem los_theorem {α : Type*} {M : α → Type*} {u : Ultrafilter α} {L : Language} [∀ a, L.Structure (M a)]
[∀ a, Nonempty (M a)] (φ : L.Sentence) :
(u : Filter α).Product M ⊨ φ ↔ ∀ᶠ a in (u : Filter α), M a ⊨ φ := by sorry
end FamousTheoremsSource
Listed in Mathlib's curated theorem manifests (docs/1000.yaml); formalized in Mathlib as `FirstOrder.Language.Ultraproduct.sentence_realize`. Proof here reduces to that Mathlib result.