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.
Elementary hull transfer for bounded cofinality strata
Statement
Assume AC. Let , , and . Given finitely many set parameters, for every sufficiently large regular cardinal there are a set of size , containing those parameters and as elements and containing every ordinal below , and a point such that
In the second case and . For every ordinal function with pointwise, there is with pointwise. If , pointwise, and for every , then pointwise. No assertion that satisfies ZFC is required.
Facts & Assumptions
Given: The displayed hypotheses and finitely many parameters. All function inequalities below are pointwise.
The ambient space has countably infinite coordinate set ; its points have uncountable coordinate cofinalities, and imposes a uniform finite-aleph bound (The ambient Rudin box space).
A set structure in a finite language with at least elements has an elementary substructure of size containing any specified subset of size at most , under AC (Downward Löwenheim–Skolem with parameters).
A nonempty substructure is elementary exactly when every existential instance true in the larger structure with parameters from it has a witness in it (Tarski–Vaught witness test).
Specified set-valued rules recurse along a well-order (Transfinite recursion).
Membership in is equivalent to rank less than (Rank characterizes hierarchy membership).
is transitive and contains exactly the ordinals below (Transitivity and growth of hierarchy stages).
Under AC every finite positive aleph and every successor cardinal is regular ( is regular in ZF; assuming the Axiom of Choice every successor aleph is regular; , so is singular, and under choice it is the least singular infinite cardinal).
Limit-ordinal cofinality is a regular infinite cardinal; a cofinal subset has size at least that cofinality, and a cofinal subset of that size exists (; and ; for a limit ordinal the value is an infinite cardinal with , so it is regular; and every cofinal subset of has cardinality at least , a value that is attained).
Sums and nonzero products of infinite cardinals absorb smaller cardinals (Absorption: for cardinals with infinite and , , and when ).
AC permits simultaneous choices from sets of nonempty witness sets (The Axiom of Choice).
Proof
Put for and . They partition : by F1 and F8 the cofinalities at issue are infinite cardinals greater than , and the cardinals in are precisely . For choose a strictly increasing cofinal function . To obtain this from the cofinal subset of F8, enumerate that subset and recursively choose increasing ordinals above the earlier choices and the next enumerated value; fewer than earlier ordinals are bounded in by F8, and is a limit. A1 fixes the resulting family . Empty requires no choice.
Choose an ordinal above the ranks of all specified parameters, , the finite tuple , and , with an additional of rank room. Fix any regular cardinal ; all these objects belong to by F5. For any of size at most , regularity and bound the at most ranks of its members below ; their supremum plus one is still below the infinite cardinal . Hence by F5. Transitivity F6 makes bounded membership statements absolute: induction on formulas proves this, since a quantifier bounded by ranges over exactly the actual members of , and equality and membership are restrictions of the actual relations. In particular function evaluation, ordinal comparison, ordinal successor, intersections, and unions agree with the actual operations whenever the resulting objects are in . Finite tuples and the ordinal functions used below have ranks bounded by the fixed parameters' ranks plus a finite ordinal, so they too are in . Thus the rest of the construction works for every regular above the single threshold .
The language is finite, and contains , so F2 applies. Choose of size containing the objects of step 1.2 and all ordinals below . At successors choose of size containing . The latter is a subset of by step 1.2 and has size by F9. Fix such hull choices on the set of all size-at-most- subsets of before recursion, using F2 and A1. At a nonzero limit put . Its size is : it contains , and A1 and F9 bound a union of at most size- sets by . It is elementary by F3. Indeed every finite tuple in this union lies in a single stage; an existential instance true in with that tuple has a witness at that elementary stage, hence in the union. There are no function or constant symbols to require further substructure closure. These rules and F4 construct the chain through . Put . Thus , , and .
For and set . Since , F8 gives . The function is in by the rank bounds in step 1.2 and is uniquely defined there from by intersection and union: . Those parameters belong to , so elementarity puts in . Here and below uniqueness in makes its elementary witness the actual object, by the absoluteness established in step 1.2. Every is below and thus in every stage. Evaluation gives , and its successor is there as well. Because is a limit, . Consequently . The chain inclusions also give monotonicity between arbitrary stages.
On put . Its value is below by and F8. The strictly increasing sequence of step 3.1 is cofinal in , so its cofinality is at most . If a cofinal subset had size , choose for each of its members a stage whose value exceeds it. F7 bounds these stages below one ; then bounds that supposedly cofinal subset, a contradiction. Thus the cofinality is exactly . On define . All its coordinate cofinalities now lie in , so by F1 with the strict uniform bound . This also proves on for every , since there is a later, larger value.
Let and . On each nonempty , cofinality of gives a least with . Regularity of uncountable and countability of give . Thus . Every is below and belongs to , including when . On nonempty , cofinality of the gives a least stage with . Similarly choose above all these countably many stages using F7 and F8. Define on and on . If is empty omit the latter parameter; omit parameters for empty as well. The finite tuple of chosen , the fixed finite partition and belong to , and by step 3.1. Unique definition, elementarity, and the rank and absoluteness checks in step 1.2 give . The displayed inequalities and step 4.1 give , so . This proves the strict interpolation even when or all the low strata are empty.
Suppose , , and all its coordinate cofinalities are at most . On immediately . On , equality would give both and , so . Since , evaluation and successor put and in . The limit property of gives , hence . Thus in every coordinate, including zero or successor values of . QED.
Depends on
- The ambient Rudin box space
- Downward Löwenheim–Skolem with parameters
- Tarski–Vaught witness test
- Transfinite recursion
- Rank characterizes hierarchy membership
- Transitivity and growth of hierarchy stages
- $\aleph_0$ is regular in ZF; assuming the Axiom of Choice every successor aleph $\aleph_{\alpha+1}$ is regular; $\operatorname{cf}(\aleph_\omega) = \aleph_0$, so $\aleph_\omega$ is singular, and under choice it is the least singular infinite cardinal
- $\operatorname{cf}(\alpha) \le \alpha$; $\operatorname{cf}(0) = 0$ and $\operatorname{cf}(\alpha + 1) = 1$; for a limit ordinal $\lambda$ the value $\operatorname{cf}(\lambda)$ is an infinite cardinal with $\operatorname{cf}(\operatorname{cf}(\lambda)) = \operatorname{cf}(\lambda)$, so it is regular; and every cofinal subset of $\lambda$ has cardinality at least $\operatorname{cf}(\lambda)$, a value that is attained
- Absorption: for cardinals $\kappa, \lambda$ with $\kappa$ infinite and $\lambda \le \kappa$, $\kappa \oplus \lambda = \kappa$, and $\kappa \otimes \lambda = \kappa$ when $\lambda \ne 0$
- The Axiom of Choice
Used by
Dependency tree · two levels
46 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.