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-measure coordinates avoiding small supports
Statement
In ZFC let be strongly compact and a cardinal. There exist a set , a nonprincipal -complete ultrafilter on , and functions for such that
Consequently, for every finite and every with , the following set belongs to :
The construction takes for a cardinal , with ordinal addition in this bound. It does not require normality of or a cofinality restriction on .
Facts & Assumptions
Given: ZFC, a strongly compact cardinal (regular uncountable by convention), and a cardinal . The asserted measure is an ultrafilter in the ground universe; no real-valued measure extension is asserted.
Strong compactness gives a fine -complete ultrafilter on every for cardinal . (Strong compactness, fine measures and infinitary logic)
consists of the subsets of of size below , and fineness puts each point cone in . (Fine measures, strong compactness and supercompactness)
Completeness applies to every intersection indexed by an ordinal below ; its empty intersection is . (Complete ultrafilters and measurable cardinals)
Ordinal addition is strictly increasing in its right argument and . (Monotonicity of ordinal and : strictly increasing and continuous in the right argument, weakly increasing in the left, with left cancellation, and the identities and )
The Hartogs number is the least ordinal not injecting into a specified set. (Hartogs: an ordinal that does not inject into a given set)
Every well-order has a unique ordinal order type and a unique order isomorphism onto that ordinal. (Every well-order has a unique order type)
Proof
Put and let be its Hartogs number. Then : otherwise inclusion would inject into . Also is an initial ordinal. A bijection from to some , followed by an injection of into supplied by minimality of , would contradict its defining property. Thus is a cardinal above . Set and take a fine -complete ultrafilter by F1. It is nonprincipal: for each there is , since ; its point cone is in and omits , so .
For put and define , using the inherited ordinal order. F4 gives and for . F6 makes each value unique; Separation and Replacement give all functions and their indexed family. Every value is below : the order isomorphism gives it the cardinality of , which is below ; an ordinal at least the initial ordinal cannot have that cardinality. For the empty index every value is zero.
If and , then is exactly the proper initial segment below the element of the well-order . Under the order isomorphism of F6 its order type is therefore an ordinal strictly below the order type of . The point cone at belongs to by fineness, so upward closure gives .
Fix . Intersect the point cones at all . This is a -member by F3, since . For finite this follows from uncountability. For infinite , the new last point can be sent to zero, each natural number shifted to its successor, and each ordinal in fixed; this injects into , so cannot reach the initial ordinal . At an index in this intersection, , because . In fact is an initial segment there. Restricting the order isomorphism of F6 shows . Upward closure proves the second displayed assertion, including and .
For fixed , intersect over . The inherited ordinal order on has order type below , by the same initial-cardinal argument as in step 2.1, so F3 applies without choosing an enumeration. The intersection lies in and is contained in . For finite , intersect these avoidance sets and the finitely many comparison sets from step 3.1 for ordered pairs in . This -member is contained in , proving the conclusion by upward closure. If is empty then ; if is empty its avoidance intersections are ; a singleton requires no pair comparisons. Neither this construction nor its proof uses normality or any restriction on .
Depends on
- Strong compactness, fine measures and infinitary logic
- Fine measures, strong compactness and supercompactness
- Complete ultrafilters and measurable cardinals
- Monotonicity of ordinal $+$ and $\cdot$: strictly increasing and continuous in the right argument, weakly increasing in the left, with left cancellation, and the identities $0 + \beta = \beta$ and $1 \cdot \beta = \beta$
- Hartogs: an ordinal that does not inject into a given set
- Every well-order has a unique order type
Used by
Dependency tree · two levels
23 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
- Bagaria and da Silva (2023), Lemma 2.8 pp.6–7 and support calculation in Theorem 2.10 pp.9–10; strong-compactness specialization (standard reference, not scraped)