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.
The scale subspace is closed
Statement
Assume AC. The Kojman–Shelah scale subspace is closed in .
Facts & Assumptions
Given: The scale subspace and a point . Write .
consists of Rudin points eventually equal to the terms of a strictly increasing eventual scale; admissible finite modifications preserve membership (Kojman-Shelah scale subspace).
If and many points of are strictly increasing at all coordinates , their pointwise tail supremum agrees there with a point of (Tail suprema land in the scale subspace).
The boxes , , give the local base at , and is a P-space (Clopen boxes and the P-space property).
Limit-ordinal cofinalities are regular cardinals; sets smaller than an ordinal's cofinality are bounded, 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).
Under AC the finite positive alephs are 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).
Specified set-valued rules admit transfinite recursion (Transfinite recursion).
AC is assumed for cofinal enumerations and for fixing a choice from each nonempty intersection used in the recursion (The Axiom of Choice).
Proof
For any , choose indices witnessing F1. If their indices are equal, ; if one index is smaller, scale strictness and the two finite exceptional sets give the corresponding strict eventual inequality. Thus exactly one of , , or holds, since is infinite. Fix with , and let . Set on and elsewhere. Point-coordinates of are positive; outside we have . Hence . By closure and F3 there is . If , the equality coordinates of must lie in the finite exception set, because at such a coordinate . Thus is finite. In the other two cases . But at every coordinate outside , membership in the box gives . Hence that complement is finite, so is cofinite.
Put , and for each finite or cofinite put . Every local box at meets and contains only points at most , so by F3. Step 1.1 partitions into the . There are countably many possible : finite subsets of inject into the natural numbers by (the largest differing exponent exceeds the sum of all smaller powers), and complementation identifies cofinite subsets with finite ones. If avoided every , the countable intersection of their open complements would be an open neighborhood of by F3 and would miss , contradicting . Choose an with . If is cofinite, is nonempty; take a member . Then , and makes this an admissible finite modification, so by F1. It remains to consider finite .
Since , some finite bounds all its coordinate cofinalities strictly below and above . By F4 the possible cofinalities are among . Put . At least one is infinite, since these finitely many sets cover the infinite . Let be the least such index. The union of the for is finite. Choose a natural number at least all members of this union and of the finite ; if the union is empty, use . Consequently every tail coordinate has cofinality at least , and no such coordinate is in . On the infinite set choose increasing cofinal functions . F4 and A1 supply them: enumerate a size- cofinal subset and recursively take increasing bounds, with every proper initial segment bounded because its size is less than the cofinality.
Construct for as follows. At stage , for put , with empty supremum zero. Every previous value is below , because its equality set is and . Since , F4 gives . Define a lower function by setting it to zero on , to on , and to on other tail coordinates. All these inequalities are strict by step 3.1. As , the open box meets by F3. Fix by A1 a choice function for all such nonempty box intersections, a set-indexed family, before applying F6 to the displayed rule. The chosen then satisfies , and at every it is strictly above all earlier values and strictly below . Also on . These verifications inductively justify every stage of the recursion.
Apply F2 to the sequence of step 4.1 with this . It gives agreeing with on the tail . Replace by on the finite prefix , obtaining . It is still a Rudin point: use a finite aleph bound larger than the two uniform bounds for and . Hence F1 gives . On the tail , since every term is at most ; on the prefix equality holds by construction, so . Moreover for every , since the sequence dominates the cofinal there and is bounded by . This infinite set is contained in . Step 1.1 therefore forces to be cofinite. Thus , and implies by F1.
Every point of belongs to , by the cofinite case of step 2.1 or the finite case of step 5.1. Therefore is closed in . QED.
Depends on
- Kojman-Shelah scale subspace
- Tail suprema land in the scale subspace
- Clopen boxes and the P-space property
- The Axiom of Choice
- $\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
- $\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
- Transfinite recursion
Used by
Dependency tree · two levels
40 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.