How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Fine ultrapower seeds and normality
Statement
In ZFC let kappa be regular uncountable, lambda>=kappa a cardinal, and U a fine kappa-complete ultrafilter on P_kappa(lambda). In its collapsed universe ultrapower , let . Then and M satisfies . U is normal if and only if . In the normal case and .
Facts & Assumptions
Given: ZFC. Evaluated the identity seed and its internal size by universe Los, proved both normality directions using Scott equality, and identified the normal seed order type externally and internally.
Fine measures, strong compactness and supercompactness: Fineness gives each point cone; normality makes a coordinate selection constant on a large set.
Countable completeness and transitive collapse: Countable completeness gives a transitive elementary collapse, with the universe Los schema in its dependency.
The Axiom of Choice: ZFC propagates from the collapse and cardinal-size conventions.
Proof
Kappa-completeness and uncountability imply countable completeness, so F2 gives the collapsed ultrapower and its formula-by-formula coordinate equivalence. At every coordinate x, x is a subset of lambda of size below kappa. The equivalence therefore says : M regards s as a subset of j(lambda) of size below j(kappa). As M is transitive, the subset statement also holds externally. For each alpha<lambda, the coordinate set where alpha belongs to x is U-large by F1, so j(alpha) belongs to s. All cardinal and collapse uses retain F3.
Suppose U normal. Any member of s is the collapsed class of a function f which selects f(x) in x on a U-large set S. On S these are ordinals below lambda, so F1 makes some fibre alpha U-large. Scott equality and injectivity of the collapse identify that member with j(alpha). Together with step 1.1 this proves s=j``lambda. Conversely suppose equality. Given f:S to lambda selecting an element of x on a U-large S, extend f by zero outside S. Its collapsed class belongs to s, hence is j(alpha) for some alpha<lambda. Scott equality says the extended f equals alpha on a U-large set. Intersect with S to obtain the required fibre of the original f. Thus U is normal.
At each coordinate, x is a set of ordinals, and its order type is below kappa: it has cardinality |x|<kappa and kappa is an initial ordinal. The formula defining the unique ordinal order type transfers by F2. Thus the collapsed class of x maps to otp(x) is the order type of s computed in M, and is below j(kappa). In the normal case the increasing map j restricted to lambda is an external order isomorphism of lambda with s by step 2.1. The order isomorphism supplied inside M is also an external one, since M is transitive and its graph and domain are sets; uniqueness of ordinal order types therefore makes its value exactly lambda. Hence lambda<j(kappa). This does not replace M's internal size bound by an unsupported external cardinal comparison in the merely fine case.
Depends on
Used by
Dependency tree · two levels
9 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Monk Lemmas 20.16–20.20 pp.440–441 (standard reference, not scraped)