lemmaroutineinferred_dep
Compactness yields a model with rational embedding
Passing finite tests gives a model of with a zero of
nonstandard solution analyzed by the height argument
Lemma·
red:compactness·§2.4 Finite rational tests and compactnessStatement (paper)
If every finite rational test succeeds, there exist an ambient
elementary extension of the many-sorted structure specified in
\S, a
model of , a tuple with
, and an embedding
into its rational sort such that every element of the image satisfies
.
In plain English
If every finite rational test succeeds, then there is an ambient elementary extension -containing structure, a model of , and a tuple with , together with an embedding of into the rational sort whose image consists entirely of elements satisfying .
Why it's here
This is the compactness step that turns the family of finite solvable rational tests into a single nonstandard object: a model of with a zero of sitting inside . The condition is the pole-parity formula, so every element of the image has only even-order poles outside the finite set . Later arguments use this to control valuations and to show that has an integer zero.
Classified routine:
A standard application of the compactness theorem of first-order logic (Gödel–Malcev) to the finite rational tests, packaging finite satisfiability into a nonstandard model inside an elementary extension .
Uses
Used by
Sources
PaperOpen
- Section
- §2.4 Finite rational tests and compactness
- Page
- —
- Label
red:compactness- Line
sections/02-reduction.tex:545
Leannot aligned
Phase 2 aligns this node to a Lean declaration.
Friction
- infoinferred_depcritique: The lemma asserts every image element "satisfies Φ" (02-reduction.tex:551-552), and the proof adds "Φ for each term value" (line 564). Φ is the formula of Proposition par:pole-parity, which constraint (d) cites at line 523.